fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "rectcnt"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 5000 + 5;
  38. int numRow, numCol, numQuery, L[N], R[N], zero[N][N];
  39. char board[N][N];
  40. set<int> ones[N];
  41. ll curRect;
  42.  
  43. void init(void) {
  44.     cin >> numRow >> numQuery;
  45.     numCol = numRow;
  46.     FOR(i, 1, numRow) FOR(j, 1, numCol) cin >> board[i][j];
  47.     FOR(i, 1, numRow) {
  48.         ones[i].insert(0);
  49.         ones[i].insert(numCol + 1);
  50.         FOR(j, 1, numCol) if (board[i][j] == '1')
  51.             ones[i].insert(j);
  52.     }
  53. }
  54.  
  55. void process(void) {
  56.     FOR(i, 1, numRow) FOR(j, 1, numCol)
  57.         zero[i][j] = (board[i][j] == '0' ? 0 : zero[i - 1][j] + 1);
  58.     FOR(i, 1, numRow)
  59.  
  60.     cout << curRect << '\n';
  61.  
  62.     auto count_rect_contain = [&](int x, int y) {
  63.         FOR(i, 1, numRow) {
  64.             auto it1 = ones[i].lower_bound(y);
  65.             auto it2 = it1;
  66.             it1--;
  67.             L[i] = *it1 + 1;
  68.             R[i] = *it2 - 1;
  69.         }
  70.  
  71.         int leftIndex = 1, rightIndex = numRow;
  72.         FORR(i, x, 1) if (L[i] > y || R[i] < y) {
  73.             leftIndex = i + 1;
  74.             break;
  75.         }
  76.  
  77.         FOR(i, x, numRow) if (L[i] > y || R[i] < y) {
  78.             rightIndex = i - 1;
  79.             break;
  80.         }
  81.  
  82.         ll ans = 0;
  83.         FOR(i1, leftIndex, rightIndex) {
  84.             int minR = inf, maxL = 0;
  85.             FOR(i2, i1, rightIndex) {
  86.                 minimize(minR, R[i2]);
  87.                 maximize(maxL, L[i2]);
  88.                 if (i1 <= x && i2 >= x) ans += (y - maxL + 1) * (minR - y + 1);
  89.             }
  90.         }
  91.         return ans;
  92.     };
  93.  
  94.     while(numQuery--) {
  95.         int x, y;
  96.         cin >> x >> y;
  97.         if (board[x][y] == '0') {
  98.             curRect -= count_rect_contain(x, y);
  99.             board[x][y] = '1';
  100.             ones[x].insert(y);
  101.         } else {
  102.             ones[x].erase(y);
  103.             board[x][y] = '0';
  104.             curRect += count_rect_contain(x, y);
  105.         }
  106.         cout << curRect << '\n';
  107.         cerr << curRect << '\n';
  108.     }
  109. }
  110.  
  111. int main() {
  112.     ios_base::sync_with_stdio(0);
  113.     cin.tie(0); cout.tie(0);
  114.     if (fopen(task".inp", "r")) {
  115.         freopen(task".inp", "r", stdin);
  116.         freopen(task".out", "w", stdout);
  117.     }
  118.     int tc = 1;
  119. //    cin >> tc;
  120.     while(tc--) {
  121.         init();
  122.         process();
  123.     }
  124.     return 0;
  125. }
  126.  
  127.  
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/mTYVfr
language:
C++14 (gcc 8.3)
created:
7 days 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!