CSP201909-2小明种苹果（续）

package NO_2;

import java.util.*;
public class CSP20219_2 {
	public static void main(String[] ages) {
		Scanner scanner = new Scanner(System.in);
		int N;
		N = scanner.nextInt();
		
		int[] sum = new int[N + 1];
		int[] temp = new int[N + 1];
		for(int i = 1; i <= N; i++) {
			int ans = scanner.nextInt();
			for(int j = 1; j <= ans; j++) {
				int e = scanner.nextInt();
				if(j != 1 && e > 0) {
					if(sum[i] != e && temp[i] != 1) {
						temp[i] = 1;
					}
					sum[i] = e;
				}
				else {
					sum[i] += e;
				}
			}
		}
		
		int res_t = 0;
		int res = 0;
		for(int i = 1; i<= N; i++) {
			if(temp[i] == 1) {
				res_t++;
				if(N >= 3) {
					if(i + 1 > N) {
						int ss = 1;
						if(temp[ss] == 1 && temp[ss + 1] == 1)
							res++;
					} else if(i + 2 >N){
						if(temp[i + 1] == 1 && temp[1] == 1)
							res++;
					} else {
						if(temp[i + 1] == 1 && temp[i + 2] == 1)
							res++;
					}
				}
			}
		}
		int kk = 0;
		for(int i1 = 1; i1 <= N; i1++) {
			kk += sum[i1];
		}
		
		System.out.print(kk +" " + res_t+" "+ res);
	}
}