Submission
Status:
PPPPPP-PPP
Subtask/Task Score:
90/100
Score: 90
User: APNICHANAN
Problemset: สำรวจอาเรย์ 2
Language: cpp
Time: 0.006 second
Submitted On: 2025-09-28 00:14:57
#include <stdio.h>
int main()
{
int r, c, k, m0 = 0, l0 = 0, even = 0, odd = 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)
{
x[i] = x[i - 1];
y[i] = y[i - 1];
}
if (n[x[i] - 1][y[i] - 1] > 0)
m0++;
else if (n[x[i] - 1][y[i] - 1] < 0)
l0++;
if (n[x[i] - 1][y[i] - 1] % 2 == 0)
even++;
else
odd++;
}
printf("%d %d %d %d", m0, l0, even, odd);
}