Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- using namespace std;
- int grid[1005][1005];
- int dx[]={0,1,-1,0};
- int dy[]={1,0,0,-1};
- int cnt;
- int check(int x, int y){
- int count2=0;
- for(int k=0;k<4;k++){
- int nx=x+dx[k], ny=y+dy[k];
- if(nx>=0 && ny>=0 && grid[nx][ny]){
- count2++;
- }
- }
- return count2;
- }
- int main(){
- int n;cin>>n;
- for(int i=0;i<n;i++){
- int x,y;cin>>x>>y;
- if(check(x,y)==3)cnt++;
- grid[x][y]=1;
- for(int k=0;k<4;k++){
- int nx=x+dx[k],ny=y+dy[k];
- if(nx>=0 && ny>=0 && grid[nx][ny] && check(nx,ny)==3){
- cnt++;
- }
- if(nx>=0 && ny>=0 && grid[nx][ny] && check(nx,ny)==4){
- cnt--;
- }
- }
- cout<<cnt<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement