小明种苹果续

#include<iostream>
using namespace std;
bool ifdrop[1000] = {false};
int main(){
	int T = 0,D = 0,E = 0,N,m,mi,count,con;
	cin>>N;
	for(int i = 0; i < N; i++){
		cin>>m;
		cin>>count;
		for(int j = 1; j < m; j++){
			cin>>mi;
			if(mi > 0){
				if(mi != count){
					ifdrop[i] = true;
					count = mi;
				}
			}
			else{
				count -= (-mi);
			}
		}
		T +=count;
	}
	D = ifdrop[0] + ifdrop[1];
	con = ifdrop[1]?(1+ifdrop[0]):0;
	if(con + ifdrop[N-1] == 3) E++;
	if(ifdrop[N-1] + ifdrop[N-2] + ifdrop[0] == 3) E++;
	for(int i = 2; i < N; i++){
		if(ifdrop[i]){ 
			D++;
			con++;
			E +=(con>=3);
		}
		else con = 0;
	}
	cout<<T<<" "<<D<<" "<<E;
	return 0;
}