Submission

Score: 0

User: APNICHANAN

Problemset: สำรวจอาเรย์ 2

Language: c

Time: 0.006 second

Submitted On: 2025-09-28 00:03:46

#include <stdio.h>
int main()
{
    int r, c, k, m0 = 0, l0 = 0, even = 0, odd = 0, add = 0, minus = 0, e = 0, o = 0;
    scanf("%d %d", &r, &c);
    int n[r][c];
    for (int i = 0; i < r; i++)
    {
        for (int j = 0; j < c; j++)
        {
            scanf("%d", &n[i][j]);
        }
    }
    scanf("%d", &k);
    int x[k], y[k];
    for (int i = 0; i < k; i++)
    {
        scanf("%d %d", &x[i], &y[i]);
        if (x[i] > r || y[i] > c || x[i] < 1 || y[i] < 1)
        {
            if (add >= 1)
                m0++;
            else if (minus >= 1)
                l0++;
            else if (e >= 1)
                even++;
            else if (o >= 1)
                odd++;
            continue;
        }

        add = 0, minus = 0, e = 0, o = 0;
        if (n[x[i] - 1][y[i] - 1] > 0)
        {
            m0++;
            add++;
        }
        else if (n[x[i] - 1][y[i] - 1] < 0)
        {
            l0++;
            minus++;
        }
        if (n[x[i] - 1][y[i] - 1] / 2 * 2 == n[x[i] - 1][y[i] - 1])
        {
            even++;
            e++;
        }
        else
        {
            odd++;
            o++;
        }
    }
    printf("%d %d %d %d", m0, l0, even, odd);
}