2019-09 csp认证 第二题

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int vis[10000]={0};//改为题目要求数据量+5
int tree[10000];//也改

int main(){
    int n,m;
    scanf("%d",&n);
    for(int i=1;i<=n;++i){
        scanf("%d",&m);
        scanf("%d",&tree[i]);
        for(int j=0;j<m-1;++j){
            int x;
            scanf("%d",&x);
            if(x<=0) tree[i] += x;
            else{
                if(tree[i]!=x) vis[i] = 1;
                tree[i] = x;
            }
        }
    }
    long long ans = 0,ans1 = 0,ans2=0;
    for(int i=1;i<=n;++i){
        ans+=tree[i];
        if(vis[i]) ans1++;
        if(vis[i]&&vis[i+1]&&vis[i+2]&&(i+2<=n)) ans2++;
        
    }
    if(n!=3){
        if(vis[1]&&vis[2]&&vis[n]) ans2++;
        if(vis[1]&&vis[n]&&vis[n-1]) ans2++;
    }
    
    printf("%d %d %d\n",ans,ans1,ans2);
    return 0;
}