CCF模拟题-2019

2.小明种苹果（续）

#include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 1010
using namespace std;
int n,op,x,m,a[maxn];
long long sum;
bool vis[maxn];
int main(){
    //freopen("Cola.txt","r",stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&m);
        int ansnow;
        scanf("%d",&ansnow);
        a[i]=ansnow;
        for(int j=1;j<m;j++){
            scanf("%d",&x);
            if(x>0){
                if(x!=a[i])vis[i]++;
                a[i]=x;
            }
            else a[i]+=x,ansnow=a[i];
        }
        sum+=a[i];
    }
    printf("%lld ",sum);
    sum=0;
    for(int i=1;i<=n;i++)sum+=vis[i];
    printf("%lld ",sum);
    sum=0;
    for(int i=2;i<=n-1;i++){
        if(vis[i]&&vis[i-1]&&vis[i+1])sum++;
    }
    if(n>=3){
        if(vis[1]&&vis[2]&&vis[n])sum++;
        if(vis[n]&&vis[n-1]&&vis[1])sum++;
    }
    printf("%lld\n",sum);
    return 0;
}