denis_andrei10

Untitled

Feb 25th, 2020
146
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.47 KB | None | 0 0
  1. #include<iostream>
  2. #include<fstream>
  3. using namespace std;
  4. ifstream fin("betasah.in");
  5. ofstream fout("betasah.out");
  6. int a[1005][1005];
  7. int v[205];
  8. int di[]= {-1, 0, 1, 0, -1, -1, 1, 1};
  9. int dj[]= {0, 1, 0, -1, -1, 1, 1, -1};
  10. int main()
  11. {
  12. int i, j, nexti, nextj, l, n, k, i1, j1, d, c=0, maxim=0, raz=0;
  13. fin>>n>>d>>k;
  14. for(i=0; i<=n+1; i++)
  15. {
  16. a[i][0]=1;
  17. a[n+1][i]=1;
  18. a[i][i+1]=1;
  19. a[i][i+2]=1;
  20. }
  21. for(l=1; l<=d; l++)
  22. {
  23. fin>>i>>j;
  24. v[++raz]=i;
  25. v[++raz]=j;
  26. a[i][j]=3;
  27. }
  28. for(l=1; l<=k; l++)
  29. {
  30. fin>>i>>j;
  31. a[i][j]=1;
  32. }
  33. for(i=1; i<=n; i++)
  34. {
  35. j=1;
  36. c=0;
  37. while(i>j)
  38. {
  39. if(a[i][j]!=1)
  40. c++;
  41. j++;
  42. }
  43. if(a[i][i]!=1)
  44. {
  45. c++;
  46. }
  47. if(c>maxim)
  48. {
  49. maxim=c;
  50. }
  51. }
  52. fout<<maxim;
  53. c=0;
  54. raz=0;
  55. for(l=1; l<=d; l++)
  56. {
  57. cout<<1<<' ';
  58. for(k=0; k<8; k++)
  59. {
  60. cout<<2;
  61. nexti=v[++raz]+di[k];
  62. nextj=v[++raz]+dj[k];
  63. while(a[nexti][nextj]!=1 && a[nexti][nextj]!=3 )
  64. {
  65. c++;
  66. a[nexti][nextj]=1;
  67. nexti+=di[k];
  68. nextj+=dj[k];
  69. }
  70.  
  71. }
  72. }
  73. cout<<c;
  74. return 0;
  75. }
Advertisement
Add Comment
Please, Sign In to add comment