ccf 201909-2 小明種蘋果（續）

 

#include<bits/stdc++.h>
using namespace std;

bool vis[20005]; //第i棵樹是否掉過蘋果 
int main()
{
	long n, ans_sum = 0, ans_has = 0, ans_con = 0;
	
	cin >> n;
	
	for(int i = 1; i <= n; i++)
	{
		int start, m, x;
		bool flag = true;
		cin >> m >> start;
		for(int j = 2; j <= m; j++)
		{
			cin >> x;
			if(x > 0)
			{
				if(start != x)
				{
					vis[i] = vis[i+n] = true;//複製一份成環 
					if(flag) 
						ans_has++, flag = false;
				}
					
				start = x;
			}
			else
				start += x;
		}
		
		ans_sum += start;
		
	}
	
	for(int i = 1; i <= n; i++)
			if(vis[i] && vis[i+1] && vis[i+2])
				ans_con++;
				
	cout << ans_sum << ' ' << ans_has << ' ' << ans_con << 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


5
4 10 0 9 0
4 10 -2 7 0
2 10 0
4 10 -3 5 0
4 10 -1 8 0
*/

好久沒敲代碼了，寫個這個題都找了半天bug