Submission

Score: 0

User: Bunkoblong

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

Language: cpp

Time: 0.000 second

Submitted On: 2025-09-29 12:48:44

#include<iostream>
using namespace std;
int main() {
    int R,C;
    cin>>R>>C;
    
    int grid[305][305];
    
    for (int i=1;i<=R;i++){
       for (int j=1;j<=C;j++){
           cin>>grid[i][j];
       } 
    }
    int K;
    cin>>K;
    
    int countEven=0;
    int countOdd=0;
    int countPositive=0;
    int countNegative=0;

for(int k=1;k<=K;k++){
        int r,c;
        cin>>r>>c;
    
        
        if(r>=1&&r<=R&&c>=1&&c<=C){
            
            if(grid[r][c]%2==0){
               countEven++;
            } 
            else if(grid[r][c]%2!=0){
                countOdd++;

            }
        
            if(grid[r][c]>0){
                countPositive++;

            }
            else if(grid[r][c]<0){
                countNegative++;
            }
        }
    }
        cout<<countPositive" "<<countNegative" "<<countEven" "<<countOdd<<"\n";
    
}