제출 #163800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163800		nvmdava	Strah (COCI18_strah)	C++17	110 / 110	445 ms	35580 KiB

strah

#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 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11