Submission

Score: 100

User: peilin

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

Language: c

Time: 0.005 second

Submitted On: 2025-10-12 23:26:41

#include <stdio.h>

int main() {
    int n, m, i, j;
    int positive = 0, negative = 0, even = 0, odd = 0;
    scanf("%d %d", &n, &m);
    int arr[305][305];
    for (i = 0; i < n; i++)
        for (j = 0; j < m; j++)
            scanf("%d", &arr[i][j]);

    int k;
    scanf("%d", &k);
    int x = 0, y = 0, should = 0, last_x = 0, last_y = 0;
    for (i = 0; i < k; i++) {
        scanf("%d %d", &x, &y);
        if ((x < 1 || x > n || y < 1 || y > m) && should == 0)
            continue;
        should = 1;
        if (x < 1 || x > n || y < 1 || y > m) {
            x = last_x;
            y = last_y;
        }
        int val = arr[x-1][y-1];
        if (val > 0) positive++;
        if (val < 0) negative++;
        if (val % 2 == 0) even++;
        if (val % 2 == 1 || val % 2 == -1) odd++;
        last_x = x;
        last_y = y;
    }
    printf("%d %d %d %d\n", positive, negative, even, odd);
    return 0;
}