Submission

Score: 100

User: kf._.exe

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

Language: cpp

Time: 0.005 second

Submitted On: 2025-10-15 12:26:02

#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define dbg(x) cout << #x << " = " << x  << '\n';
#define int long long
#define dd double
#define ld long double

int arr[400][400];
int even,odd,pos,nigga;
int x=-1,y=-1;
void solve(){
     int n,m; cin >> n >>m;
     for(int i = 1;i<=n;++i)
          for(int ii = 1;ii<=m;++ii)
               cin >> arr[i][ii];
     int k;cin >> k;
     int a,b,val;
     

     while(k--){
          cin >> a >> b;
          if( a > n || a < 1 || b > m || b < 1 )  {
               #ifdef ONPC
                cout << " !\n";    dbg(a);dbg(b);
               if(x==1)cout << "even\n";
               if(x==0)cout << "odd\n";
               if(y==1)cout << "pos\n";
               if(y==0)cout << "nigga\n";

               #endif
               if(x==1)++even;
               if(x==0)++odd;
               if(y==1)++pos;
               if(y==0)++nigga;
               continue;
          }
          
          val = arr[a][b];
          if(val%2 == 0 ) ++even,x=1;
          else ++odd,x=0;
          if(val == 0) y = -1;
          if(val > 0) ++pos,y=1;
          else if(val < 0) ++nigga,y=0;
     }

     cout << pos << " " << nigga << " " << even << " " << odd;
     cout << endl;

}

int32_t main(){
       fastio;
           int T = 1;
           //cin >> T
           while(T--) solve();
       return 0;
}