Submission

Score: 100

User: Trin1506

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

Language: cpp

Time: 0.010 second

Submitted On: 2025-10-13 15:41:25

#include <bits/stdc++.h>
using namespace std;
int main() {
    int r,c;
    cin >> r >> c;
    bool pos=false,neg=false,even=false,odd=false;
    int arr1[r][c];
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            cin >> arr1[i][j];
        }
    }
    int n;
    cin >>n;
    int c1,c2,pos1=0,neg1=0,even1=0,odd1=0;
    for(int i=0;i<n;i++){
        cin >> c1 >> c2;
        if(c1<=0||c2<=0){
            if(pos)pos1++;
            if(neg)neg1++;
            if(even)even1++;
            if(odd)odd1++;
            continue;
        }
        if(c1>r||c2>c){
            if(pos)pos1++;
            if(neg)neg1++;
            if(even)even1++;
            if(odd)odd1++;
            continue;
        }
        pos=false,neg=false,even=false,odd=false;
        if(arr1[c1-1][c2-1]>0){
            pos1++;
             pos = true;
        }
        else if(arr1[c1-1][c2-1]<0){
            neg1++;
            neg=true;
        }
        if(arr1[c1-1][c2-1]%2==0){
            even1++;
            even = true;
        }
        else {
            odd = true;
            odd1++;
        }
    }
    cout << pos1<<" "<<neg1 <<" "<< even1 <<" "<< odd1 ; 
}