Submission #848398

#	Time	Username	Problem	Language	Result	Execution time	Memory
848398		Charizard2021	Strah (COCI18_strah)	C++17	0 / 110	191 ms	4184 KiB

strah

#include<bits/stdc++.h>
using namespace std;
int x(int k){
    return k * (k + 1)/2;
}
int main(){
    int n, m;
    cin >> n >> m;
    char grid[n][m];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> grid[i][j];
        }
    }
    vector<int> pref(m, 0);
    int ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(grid[i][j] == '.'){
                pref[j]++;
            }
            else{
                pref[j] = 0;
            }
        }
        vector<int> v(m, -1);
        vector<int> v2(m, m);
        stack<int> s;
        for(int j = 0; j < m; j++){
            while(!s.empty() && pref[j] <= pref[s.top()]){
                v[s.top()] = j;
                s.pop();
            }
            s.push(j);
        }
        while(!s.empty()){
            s.pop();
        }
        for(int j = m - 1; j >= 0; j--){
            while(!s.empty() && pref[j] < pref[s.top()]){
                v2[s.top()] = j;
                s.pop();
            }
            s.push(j);
        }
        for(int j = 0; j < m; j++){
            int val = v[j] + 1;
            int val2 = v2[j] - 1;
            int length1 = j - val + 1;
            int length2 = val2 - j + 1;
            ans += (((x(val2 + 1) - x(j)) * length1 - (x(j) - x(val - 1)) * length2) * (x(pref[j])));
        }
    }
    cout << ans << endl;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11