Submission

Score: 0

User: GONGGONG

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

Language: cpp

Time: 0.010 second

Submitted On: 2026-10-08 23:19:20

#include <iostream>
using namespace std;

int main() {
    int x,y;cin>>x>>y;
    int arr[x*y];
    for(int i=0;i<x*y;i++) cin>>arr[i];
    int n;cin>>n;
    int p=0,ne=0,o=0,e=0;
    int pX,pY,apos;
    for(int i=0;i<n;i++){
        cin>>pX>>pY;
        apos=(pX-1)*y+pX-1; 
        if(arr[apos]>0) p++;
        if(arr[apos]<0) ne++;
        if(arr[apos]%2==0) e++;
        else o++;
    }
    cout<<p<<' '<<ne<<' '<<e<<' '<<o;
}