fork download
  1. /* Authors: Vu Hoang Bach from Phuoc Hoa Secondary School */
  2. /* Enjoy TheFatRat's music while reading my code. Link: https://w...content-available-to-author-only...e.com/watch?v=GCx9FU59FJc&t=669s */
  3.  
  4. //#pragma GCC optimize("O3", "unroll-loops")
  5. //#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
  6.  
  7. #include <bits/stdc++.h>
  8. #define ldb long double
  9. //#define double ldb
  10. #define db double
  11. #define name "test"
  12. #define unomap unordered_map
  13. #define unoset unordered_set
  14. #define endl '\n'
  15. #define str string
  16. #define strstr stringstream
  17. #define sz(a) a.size()
  18. #define ll long long
  19. //#define int ll
  20. #define pii pair <int, int>
  21. #define pll pair <ll, ll>
  22. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  23. #define ull unsigned ll
  24. #define fir first
  25. #define sec second
  26. #define idc cin.ignore()
  27. #define lb lower_bound
  28. #define ub upper_bound
  29. #define all(s) s.begin(), s.end()
  30. #define rev reverse
  31. #define sigma ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  32. #define skibidi int main
  33. #define rizz signed main
  34. #define gcd __gcd
  35. #define found(a, mp) mp.find(a) != mp.end()
  36. #define game_over exit(0);
  37. #define stfu return 0;
  38. #define stop break;
  39. #define odd(n) n & 1
  40. #define pushb push_back
  41. #define popb pop_back
  42. #define pushf push_front
  43. #define popf pop_front
  44. #define even(n) !odd(n)
  45. #define mul2x(a, x) a << x
  46. #define div2x(a, x) a >> x
  47. #define no_check continue;
  48. #define lcm(a, b) a / __gcd(a, b) * b
  49. #define log_base(x, base) log(x) / log(base)
  50. #define debug clog << "No errors!"; game_over;
  51. #define forw(i, a, b) for (int i = a; i <= b; ++i)
  52. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  53. #define fors(i, a, b) for (int i = a; i >= b; --i)
  54. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  55. #define meme memset
  56. #define pqueue priority_queue
  57. #define want_digit(x) cout << fixed << setprecision(x);
  58. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  59. using namespace std;
  60. const int MOD = 1e9 + 7; // 998244353
  61. const int inf = 1e9;
  62. const ll INF = 1e18;
  63. const int N = 1e4;
  64.  
  65. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  66. ll random(const ll &L, const ll &R)
  67. {
  68. return uniform_int_distribution<ll> (L, R) (rng);
  69. }
  70.  
  71. void stack_clear(stack <int> &st)
  72. {
  73. while (!st.empty()) st.pop();
  74. }
  75.  
  76. stack <int> st;
  77. char x;
  78. int n, m, a[N + 5][N + 5], h[N + 5][N + 5];
  79. ll l[N + 5], r[N + 5], res;
  80. void cook()
  81. {
  82. cin >> n >> m;
  83. forw (i, 1, n) forw (j, 1, m)
  84. {
  85. cin >> x;
  86. a[i][j] = x - '0';
  87. h[i][j] = (a[i][j] ? h[i - 1][j] + 1 : 0);
  88. }
  89.  
  90. forw (i, 1, n)
  91. {
  92. stack_clear(st);
  93. h[i][0] = h[i][m + 1] = -1;
  94. st.push(0);
  95. forw (j, 1, m)
  96. {
  97. while (h[i][st.top()] >= h[i][j]) st.pop();
  98. l[j] = st.top() + 1;
  99. st.push(j);
  100. }
  101.  
  102. stack_clear(st);
  103. st.push(m + 1);
  104. fors (j, m, 1)
  105. {
  106. while (h[i][st.top()] >= h[i][j]) st.pop();
  107. r[j] = st.top() - 1;
  108. st.push(j);
  109.  
  110. if (a[i][j])
  111. res += l[j] * r[j];
  112. }
  113. }
  114.  
  115. cout << res << endl;
  116. }
  117.  
  118. skibidi()
  119. //rizz()
  120. {
  121. srand(time(NULL));
  122. sigma;
  123. /*
  124.   if (fopen(name".INP", "r"))
  125.   {
  126.   freopen(name".INP", "r", stdin);
  127.   freopen(name".OUT", "w", stdout);
  128.   }
  129.   */
  130. int numTest = 1;
  131. // cin >> numTest;
  132. while (numTest--)
  133. {
  134. cook();
  135. }
  136. stfu;
  137. }
  138.  
Success #stdin #stdout 0.01s 5500KB
stdin
4 3
111
101
111
001
stdout
41