Submission

Score: 100

User: erng

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

Language: cpp

Time: 0.009 second

Submitted On: 2025-10-11 11:03:16

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

int m, n, mp[305][305], q, p, k, x, y, o, e, pp, pk, pe, po;

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>>x>>y;
        if (x>m || y>n || x<1 || y<1)
        {
            p+=pp;
            k+=pk;
            e+=pe;
            o+=po;
            continue;
        }
        pp=0;
        pk=0;
        pe=0;
        po=0;
        if (mp[x][y]>0)
        {
            p++;
            pp=1;
        }
        if (mp[x][y]<0)
        {
            k++;
            pk=1;
        }
        if (mp[x][y]%2==0)
        {
            e++;
            pe=1;
        }
        else
        {
            o++;
            po=1;
        }
    }
    cout<<p<<" "<<k<<" "<<e<<" "<<o;
}