Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- using namespace std;
- ifstream fin("betasah.in");
- ofstream fout("betasah.out");
- int a[1005][1005];
- int v[205];
- int di[]= {-1, 0, 1, 0, -1, -1, 1, 1};
- int dj[]= {0, 1, 0, -1, -1, 1, 1, -1};
- int main()
- {
- int i, j, nexti, nextj, l, n, k, i1, j1, d, c=0, maxim=0, raz=0;
- fin>>n>>d>>k;
- for(i=0; i<=n+1; i++)
- {
- a[i][0]=1;
- a[n+1][i]=1;
- a[i][i+1]=1;
- a[i][i+2]=1;
- }
- for(l=1; l<=d; l++)
- {
- fin>>i>>j;
- v[++raz]=i;
- v[++raz]=j;
- a[i][j]=3;
- }
- for(l=1; l<=k; l++)
- {
- fin>>i>>j;
- a[i][j]=1;
- }
- for(i=1; i<=n; i++)
- {
- j=1;
- c=0;
- while(i>j)
- {
- if(a[i][j]!=1)
- c++;
- j++;
- }
- if(a[i][i]!=1)
- {
- c++;
- }
- if(c>maxim)
- {
- maxim=c;
- }
- }
- fout<<maxim;
- c=0;
- raz=0;
- for(l=1; l<=d; l++)
- {
- cout<<1<<' ';
- for(k=0; k<8; k++)
- {
- cout<<2;
- nexti=v[++raz]+di[k];
- nextj=v[++raz]+dj[k];
- while(a[nexti][nextj]!=1 && a[nexti][nextj]!=3 )
- {
- c++;
- a[nexti][nextj]=1;
- nexti+=di[k];
- nextj+=dj[k];
- }
- }
- }
- cout<<c;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment