fork(1) download
  1. #include <bits/stdc++.h> // NeOWami
  2. using namespace std;
  3.  
  4. #define ft first
  5. #define sc second
  6. #define int long long
  7. const int N = 1e5 + 5;
  8.  
  9. int n, m, k;
  10. vector<vector<int>> pos, bit;
  11. vector<int> posX;
  12. struct query {
  13. int type, l, r, u, v;
  14. };
  15. query Q[N];
  16.  
  17. inline void fakeUpX(int l) {
  18. // posX push l
  19. }
  20. inline void fakeGetRectX(int l, int u) {
  21. // fakeUpX l
  22. // fakeUpX u
  23. }
  24. inline void compressX() {
  25. posX.push_back(-1);
  26. sort(posX.begin(), posX.end());
  27. posX.erase(unique(posX.begin(), posX.end()), posX.end());
  28. pos.resize(posX.size(), {});
  29. bit.resize(posX.size(), {});
  30. }
  31.  
  32. inline void fakeUp(int u, int v) {
  33. // pos[i] push v
  34. }
  35.  
  36. inline void fakeGet(int u, int v) {
  37. // pos[i] push v
  38. }
  39.  
  40. inline void fakeGetRect(int l, int r, int u, int v) {
  41. fakeGet(u, v);
  42. fakeGet(l - 1, v);
  43. fakeGet(u, r - 1);
  44. fakeGet(l - 1, r - 1);
  45. }
  46.  
  47. inline void compress() {
  48. for (int i = 1; i < pos.size(); i++) {
  49. pos[i].push_back(-1);
  50. sort(pos[i].begin(), pos[i].end());
  51. pos[i].erase(unique(pos[i].begin(), pos[i].end()), pos[i].end());
  52. bit[i].resize(pos[i].size(), 0);
  53. }
  54. }
  55. inline void update(int u, int v, int t) {
  56. }
  57.  
  58. inline int get(int u, int v) {
  59. }
  60. int getRect(int l, int r, int u, int v) {
  61. return get(u, v) - get(l - 1, v) - get(u, r - 1) + get(l - 1, r - 1);
  62. }
  63.  
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Standard output is empty