Submission
Status:
PPPPPPxPPP
Subtask/Task Score:
90/100
Score: 90
User: mameeewin
Problemset: สำรวจอาเรย์ 2
Language: cpp
Time: 0.011 second
Submitted On: 2026-10-13 19:22:59
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long n, m; cin >> n >> m;
vector<vector<long long>> a(n, vector<long long>(m));
for (int i=0; i<n; i++) for (long long j=0; j<m; j++) cin >> a[i][j];
long long k, pos=0, neg=0, ev=0, od=0, ly, lx; cin >> k;
for (long long i=0; i<k; i++){
long long y, x; cin >> y >> x;
if (y>n||y<1||x>m||x<1) y=ly, x=lx;
x--;
y--;
pos+=(a[y][x]>0); neg+=(a[y][x]<0); ev+=(1-abs(a[y][x])%2); od+=(abs(a[y][x])%2);
ly=y+1;
lx=x+1;
}
cout << pos << " " << neg << " " << ev << " " << od;
}