Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream fin("piesesah.in");
- ofstream fout("piesesah.out");
- int n,r,m,t,a[1003][1003],i1[1000003],j1[1000003],i,j,b[1003][1003];
- char x[1000003];
- int main()
- {fin>>n>>m>>t;
- for(r=1;r<=m;r++)
- {fin>>x[r]>>i1[r]>>j1[r];
- a[i1[r]][j1[r]]=2;
- }
- for(r=1;r<=m;r++)
- {
- if(x[r]=='p'){if(a[i1[r]-1][j1[r]-1]!=2)a[i1[r]-1][j1[r]-1]=1;
- if(a[i1[r]-1][j1[r]+1]!=2)a[i1[r]-1][j1[r]+1]=1;
- if(a[i1[r]+1][j1[r]-1]!=2)a[i1[r]+1][j1[r]-1]=1;
- if(a[i1[r]+1][j1[r]+1]!=2)a[i1[r]+1][j1[r]+1]=1;
- }
- if(x[r]=='r'){if(a[i1[r]-1][j1[r]-1]!=2)a[i1[r]-1][j1[r]-1]=1;
- if(a[i1[r]-1][j1[r]+1]!=2)a[i1[r]-1][j1[r]+1]=1;
- if(a[i1[r]+1][j1[r]-1]!=2)a[i1[r]+1][j1[r]-1]=1;
- if(a[i1[r]+1][j1[r]+1]!=2)a[i1[r]+1][j1[r]+1]=1;
- if(a[i1[r]][j1[r]-1]!=2)a[i1[r]][j1[r]-1]=1;
- if(a[i1[r]-1][j1[r]]!=2)a[i1[r]-1][j1[r]]=1;
- if(a[i1[r]+1][j1[r]]!=2)a[i1[r]+1][j1[r]]=1;
- if(a[i1[r]][j1[r]+1]!=2)a[i1[r]][j1[r]+1]=1;
- }
- if(x[r]=='q'){for(i=i1[r]+1;i<=n;i++)
- {if(a[i][j1[r]]!=2)a[i][j1[r]]=1;
- else i=n+1;
- }
- for(i=i1[r]-1;i>=1;i--)
- {if(a[i][j1[r]]!=2)a[i][j1[r]]=1;
- else i=0;
- }
- for(i=j1[r]+1;i<=n;i++)
- {if(a[i1[r]][i]!=2)a[i1[r]][i]=1;
- else i=n+1;
- }
- for(i=j1[r]-1;i>=1;i--)
- {if(a[i1[r]][i]!=2)a[i1[r]][i]=1;
- else i=0;
- }
- j=j1[r];
- for(i=i1[r]+1;i<=n&&j<=n;i++)
- {j++;
- if(a[i][j]!=2)a[i][j]=1;
- else i=n+1;
- }
- j=j1[r];
- for(i=i1[r]-1;i>=1&&j<=n;i--)
- {j++;
- if(a[i][j]!=2)a[i][j]=1;
- else i=0;
- }
- j=j1[r];
- for(i=i1[r]+1;i<=n&&j>=1;i++)
- {j--;
- if(a[i][j]!=2)a[i][j]=1;
- else i=n+1;
- }
- j=j1[r];
- for(i=i1[r]-1;i>=1&&j>=1;i--)
- {j--;
- if(a[i][j]!=2)a[i][j]=1;
- else i=0;
- }
- }
- if(x[r]=='n'){j=j1[r];
- for(i=i1[r]+1;i<=n&&j<=n;i++)
- {j++;
- if(a[i][j]!=2)a[i][j]=1;
- else i=n+1;
- }
- j=j1[r];
- for(i=i1[r]-1;i>=1&&j<=n;i--)
- {j++;
- if(a[i][j]!=2)a[i][j]=1;
- else i=0;
- }
- j=j1[r];
- for(i=i1[r]+1;i<=n&&j>=1;i++)
- {j--;
- if(a[i][j]!=2)a[i][j]=1;
- else i=n+1;
- }
- j=j1[r];
- for(i=i1[r]-1;i>=1&&j>=1;i--)
- {j--;
- if(a[i][j]!=2)a[i][j]=1;
- else i=0;
- }
- }
- if(x[r]=='t'){for(i=i1[r]+1;i<=n;i++)
- {if(a[i][j1[r]]!=2)a[i][j1[r]]=1;
- else i=n+1;
- }
- for(i=i1[r]-1;i>=1;i--)
- {if(a[i][j1[r]]!=2)a[i][j1[r]]=1;
- else i=0;
- }
- for(i=j1[r]+1;i<=n;i++)
- {if(a[i1[r]][i]!=2)a[i1[r]][i]=1;
- else i=n+1;
- }
- for(i=j1[r]-1;i>=1;i--)
- {if(a[i1[r]][i]!=2)a[i1[r]][i]=1;
- else i=0;
- }
- }
- if(x[r]=='c'){i=i1[r];j=j1[r];
- if((i+2<=n)&&(a[i+2][j+1]!=2))a[i+2][j+1]=1;
- if((i+2<=n)&&(a[i+2][j-1]!=2))a[i+2][j-1]=1;
- if((i-2>=1)&&(a[i-2][j+1]!=2))a[i-2][j+1]=1;
- if((i-2>=1)&&(a[i-2][j-1]!=2))a[i-2][j-1]=1;
- if((j+2<=n)&&(a[i+1][j+2]!=2))a[i+1][j+2]=1;
- if((j+2<=n)&&(a[i-1][j+2]!=2))a[i-1][j+2]=1;
- if((j-2>=1)&&(a[i+1][j-2]!=2))a[i+1][j-2]=1;
- if((j-2>=1)&&(a[i-1][j-2]!=2))a[i-1][j-2]=1;
- }
- }
- for(i=1;i<=t;i++)
- {fin>>i1[i]>>j1[i];
- fout<<a[i1[i]][j1[i]]<<"\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement