CSP历年第二题代码

201909-2

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>

int m[1005] = { 0 }, a[1005][1005] = { 0 };

int main() {
    int n;
    int t = 0, d = 0, e = 0;
    int num[1005] = { 0 };
    int drop[1005] = { 0 };//记录是否掉落
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &m[i]);
        for (int j = 1; j <= m[i]; j++)
            scanf("%d", &a[i][j]);
    }
    for (int i = 1; i <= n; i++)
    {
        num[i] = a[i][1];//初始个数
        for (int j = 2; j <= m[i]; j++)
        {
            if (a[i][j] <= 0)
                num[i] -= abs(a[i][j]);
            else
            {
                if (num[i] != a[i][j])
                    drop[i] = 1;
                num[i] = a[i][j];
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        t += num[i];
        if (drop[i])
            d++;
    }
    for (int i = 1; i <= n - 2; i++)
        if (drop[i] && drop[i + 1] && drop[i + 2])
            e++;
    if (drop[n - 1] && drop[n] && drop[1])
        e++;
    if (drop[n] && drop[1] && drop[2])
        e++;
    printf("%d %d %d", t, d, e);
    return 0;
}