Submission
Status:
PPPPPP-PPP
Subtask/Task Score:
90/100
Score: 90
User: Neozaawwman1
Problemset: สำรวจอาเรย์ 2
Language: cpp
Time: 0.009 second
Submitted On: 2025-10-09 09:35:31
#include <bits/stdc++.h>
using namespace std;
int main(){
int R, C;cin>>R>>C;
int arr[C][R];
for(int i=0; i<R; i++){
for(int j=0; j<C; j++){
cin>>arr[j][i];
}
}
int time, sum_plus=0, sum_minus=0, sum_even=0, sum_odd=0 ;cin>>time;
int xx[time], yy[time];
int last[4];
for(int i=0; i<time; i++){
int x, y;cin>>y>>x;
if(x<=C && x>=1 && y<=R && y>=1){
for(int t=0; t<4; t++){
last[t]=0;
}
if(arr[x-1][y-1]>0){
sum_plus++;
last[0]=1;
}
if(arr[x-1][y-1]<0){
sum_minus++;
last[1]=1;
}
if(arr[x-1][y-1]%2==0){
sum_even++;
last[2]=1;
}
if(arr[x-1][y-1]%2!=0){
sum_odd++;
last[3]=1;
}
}else{
sum_plus+=last[0];
sum_minus+=last[1];
sum_even+=last[2];
sum_odd+=last[3];
}
}
cout<<sum_plus<<" "<<sum_minus<<" "<<sum_even<<" "<<sum_odd;
return 0;
}