Submission

Score: 100

User: erng

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

Language: cpp

Time: 0.014 second

Submitted On: 2025-10-11 09:22:52

#include <bits/stdc++.h>
using namespace std;

int m,n, mp[305][305], q, x[1005], y[1005], p, k, o, e;
int main()
{
    cin>>m>>n;
    for (int i=1; i<=m; i++)
    {
        for (int j=1; j<=n; j++)
        {
            cin>>mp[i][j];
        }
    }
    cin>>q;
    for (int i=0; i<q; i++)
    {
        cin>>y[i]>>x[i];
        if (y[i]>m || x[i]>n || y[i]<1 || x[i]<1) continue;
        if (mp[y[i]][x[i]]>0) p++;
        if (mp[y[i]][x[i]]<0) k++;
        if (mp[y[i]][x[i]]%2==0) e++;
        else o++;
    }
    cout<<p<<" "<<k<<" "<<e<<" "<<o;
}