oj.uz

Submission #163800

# Submission time Handle Problem Language Result Execution time Memory
163800 2019-11-15T12:04:12 Z nvmdava Strah (COCI18_strah) C++17
110 / 110
 445 ms 35580 KB 
#include <bits/stdc++.h>
using namespace std;
 
int h[2005][2005];
 
int ans[2005][2005];
 
int main(){
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0);
 
   int n, m;
   char c;
   cin>>n>>m;
   for(int i = 1; i <= n; i++){
      vector<pair<int, int> > v;
      v.push_back({0, 0});
      for(int j = 1; j <= m; j++){
         h[i][j] = h[i - 1][j] + 1;
         cin>>c;
         if(c == '#') h[i][j] = 0;
         while(!v.empty() && v.back().second >= h[i][j]) v.pop_back();
 
         v.push_back({j, h[i][j]});
 
         for(int l = v.size() - 2; l >= 0; l--){
            ans[v[l + 1].second][j - v[l].first]++;
            ans[v[l].second][j - v[l].first]--;
         }
      }
   }
   for(int i = n; i > 0; i--){
      for(int j = m; j > 0; j--){
         ans[i][j] += ans[i + 1][j] + ans[i][j + 1] - ans[i + 1][j + 1];
      }
   }
   long long res = 0;
   for(int i = 1; i <= n; i++){
      for(int j = 1; j <= m; j++){
        	res += 1LL * i * j * ans[i][j];
      }
   }
   cout<<res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 400 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3448 KB Output is correct
2 Correct 10 ms 3448 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3448 KB Output is correct
2 Correct 10 ms 3448 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3448 KB Output is correct
2 Correct 11 ms 3448 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 13432 KB Output is correct
2 Correct 178 ms 26488 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 21692 KB Output is correct
2 Correct 264 ms 34448 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 13776 KB Output is correct
2 Correct 192 ms 28124 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 17016 KB Output is correct
2 Correct 294 ms 32736 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 33424 KB Output is correct
2 Correct 244 ms 35580 KB Output is correct