Submission

Score: 100

User: Poon

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

Language: cpp

Time: 0.009 second

Submitted On: 2025-10-05 15:24:14

#include <iostream>
using namespace std;

int main() 
{
  int x,y;
  cin>>x>>y;
  int grid[x][y];
  for(int i=0;i<x;i++)
  {
    for(int j=0;j<y;j++)
    {
      cin>>grid[i][j];
    }
  }
  int n;
  cin>>n;
  int a=0,b=0,c=0,d=0;
  int mem1=0,mem2=0;
  for(int k=0;k<n;k++)
  {
    int m,n;
    cin>>m>>n;
    if(m>0&&m<=x&&n>0&&n<=y)
    {
      m--; n--;
      int p=grid[m][n];
      if(p>0)
      {
        a++;
        mem1=1;
      }
      else if(p<0)
      {
        b++;
        mem1=2;
      }
      else
      {
        mem1=0;
      }
      if((p+100000)%2==0)
      {
        c++;
        mem2=1;
      }
      if((p+100000)%2==1)
      {
        d++;
        mem2=2;
      }
    }
    else
    {
      if(mem1==1)
      {
        a++;
      }
      if(mem1==2)
      {
        b++;
      }
      if(mem2==1)
      {
        c++;
      }
      if(mem2==2)
      {
        d++;
      }
    }
  }
  cout<<a<<" "<<b<<" "<<c<<" "<<d;
}