fork download
copy 
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4.  
  5. using namespace std;
  6. using namespace __gnu_pbds;
  7.  
  8. #define fi first
  9. #define se second
  10. #define mp make_pair
  11. #define pb push_back
  12. #define fbo find_by_order
  13. #define ook order_of_key
  14.  
  15. typedef long long ll;
  16. typedef pair<ll,ll> ii;
  17. typedef vector<int> vi;
  18. typedef long double ld; 
  19. typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
  20. typedef set<int>::iterator sit;
  21. typedef map<int,int>::iterator mit;
  22. typedef vector<int>::iterator vit;
  23.  
  24. bool a[2111][2111];
  25.  
  26. int main()
  27. {
  28. 	ios_base::sync_with_stdio(0); cin.tie(0);
  29. 	int n, q; cin >> n >> q;
  30. 	for(int i = 0; i < q; i++)
  31. 	{
  32. 		int x1, y1, x2, y2;
  33. 		cin>>x1>>y1>>x2>>y2;
  34. 		x1--;y1--;x2--;y2--;
  35. 		a[x1][y1]^=1;
  36. 		a[x1][y2+1]^=1;
  37. 		a[x2+1][y1]^=1;
  38. 		a[x2+1][y2+1]^=1;
  39. 	}
  40. 	for(int i = 0; i < n; i++)
  41. 	{
  42. 		for(int j = 1; j <= n; j++)
  43. 		{
  44. 			a[i][j]^=a[i][j-1];
  45. 		}
  46. 	}
  47. 	for(int j = 0; j < n; j++)
  48. 	{
  49. 		for(int i = 1; i <= n; i++)
  50. 		{
  51. 			a[i][j]^=a[i-1][j];
  52. 		}
  53. 	}
  54. 	for(int i = 0; i < n; i++)
  55. 	{
  56. 		for(int j = 0; j < n; j++)
  57. 		{
  58. 			cout << a[i][j];
  59. 		}
  60. 		cout << '\n';
  61. 	}
  62. }
  63.  
Runtime error #stdin #stdout 0s 7816KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/jUdQ9u
language:
C++14 (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!