Submission

Score: 100

User: SayRo

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

Language: cpp

Time: 0.011 second

Submitted On: 2026-10-08 10:07:55

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

int main(){
    int n,m,t;
    cin>>n>>m;
    vector<vector<int>> v(n,vector<int>(m));
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>v[i][j];
        }
    }
    cin>>t;
    int p=0,mi=0,o=0,e=0,prev=INT_MAX;
    while(t--){
        int x,y;
        cin>>x>>y;
        if(x<=0||y<=0||x>n||y>m){
            if(prev==INT_MAX) continue;
            prev%2==0?e++:o++;
            if(prev>0) p++;
            else if(prev<0) mi++;
            continue;
        }
        int val=v[x-1][y-1];
        val%2==0?e++:o++;
        if(val>0) p++;
        else if(val<0) mi++;
        prev=val;
    }
    cout<<p<<" "<<mi<<" "<<e<<" "<<o;
}