Advertisement
Guest User

Rat Attack

a guest
Jan 21st, 2020
125
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.17 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. typedef long long int ll;
  4.  
  5. int main()
  6. {
  7. int t,d,n,i,j,k1,x,y,p,ax1,ax2,ay1,ay2,k2;
  8. cin>>t;
  9. cout<<"a"<<endl;
  10. for(i=1;i<=t;i++)
  11. {
  12. cin>>d;
  13. cin>>n;
  14. int a[1026][1026]={0};
  15. for(j=0;j<n;j++)
  16. {
  17. cin>>x>>y>>p;
  18. ax1=x-d;
  19. ax2=x+d;
  20. ay1=y-d;
  21. ay2=y+d;
  22. if(ax1<0)
  23. ax1=0;
  24. if(ay1<0)
  25. ay1=0;
  26. if(ax2>1024)
  27. ax2=1024;
  28. if(ay2>1024)
  29. ay2=1024;
  30. for(k1=ax1;k1<=ax2;k1++)
  31. {
  32. for(k2=ay1;k2<=ay2;k2++)
  33. {
  34. a[k1][k2]=+p;
  35. }
  36. }
  37. }
  38. int max1=-1,in1,in2;
  39. for(j=0;j<1025;j++)
  40. {
  41. for(k1=0;k1<1025;k1++)
  42. {
  43. if(a[j][k1]>max1)
  44. {
  45. max1=a[j][k1];
  46. in1=j;
  47. in2=k1;
  48. }
  49. }
  50. }
  51. cout<<in1<<" "<<in2<<" "<<max1<<endl;
  52. }
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement