CCFCSP 201909-2 小明种苹果（续）

#include<iostream>
using namespace std;

int a[1001][1002];
int num[1001];
int is_change[1001];

int main(){
	int N;
	cin>>N;
	for(int i = 0 ; i < N ; i++){
		cin>>a[i][0];
		for(int j = 1 ; j <= a[i][0] ; j++)
			cin>>a[i][j];
	}
	for(int i = 0 ; i < N ; i++){
		num[i] = a[i][1];
		for(int j = 2 ; j <= a[i][0] ; j++){
			if(a[i][j] <= 0)	num[i] += a[i][j];
			else{
				if(num[i] != a[i][j]){
					num[i] = a[i][j];
					is_change[i] = 1;
				}
			}
		}
	}
	
	int sum = 0;
	int is_change_num = 0;
	int group_num = 0;
	for(int i = 0 ; i < N ; i++){
		sum += num[i];
		if(is_change[i] == 1)	is_change_num++;
		if(i == 0 && is_change[i] && is_change[N-1] && is_change[i+1])	group_num++;
		else if(i == N-1 && is_change[i] && is_change[i-1] && is_change[0])	group_num++;
		else if(i != 0 && i != N-1 &&is_change[i] && is_change[i-1] && is_change[i+1])	group_num++;
	}
	cout<<sum<<' '<<is_change_num<<' '<<group_num<<endl;
	return 0;
}

/*
4
4 74 -7 -12 -5
5 73 -8 -6 59 -4
5 76 -5 -10 60 -2
5 80 -6 -15 59 0
*/