小模拟,easy。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e3+10;
ll a[N],Sum=0;bool b[N]={0};
int main(){
ll n,m,d=0,l3=0,j=0;cin>>n;
for(int j=0;j<n;j++){
ll sum=0;cin>>m>>sum;bool f=0;
for(ll i=0;i<m-1;i++){
cin>>a[i];
if(a[i]<0)sum+=a[i];
else if(a[i]>0){
if(sum>a[i])f=1;//是否掉落
sum=a[i];
}
}
if(f==1){//避免多次统计,去重
d+=1;
b[j]=1;
}
Sum+=sum;
}
b[n]=b[0],b[n+1]=b[1];
for(int i=0;i<n;i++){
//cout<<b[i]<<" ";
if(b[i]&&b[i+1]&&b[i+2])l3++;//连续
}
cout<<Sum<<" "<<d<<" "<<l3;
return 0;
}