Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: kf._.exe

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

Language: cpp

Time: 0.006 second

Submitted On: 2025-10-15 00:48:00

#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;
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];
     #ifdef ONPC
          cout << endl;
          for(int i=1;i<=n;++i){
               for(int ii=1;ii<=m;++ii){
                    cout << arr[i][ii] << " ";
               }
               cout << endl;
          }
     #endif

     int k;
     cin >> k;
     int a,b,val;

     while(k--){
          cin >> a >> b;
          if( a > n || a < 1 || b > m || b < 1) 
               continue;
          
          val = arr[a][b];
          if(val%2 == 0 ) ++even;
          else ++odd;

          if(val > 0) ++pos;
          else if(val < 0) ++nigga;
     }

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

}

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