Submission #384684

#	Time	Username	Problem	Language	Result	Execution time	Memory
384684		AdiZer0	Strah (COCI18_strah)	C++17	110 / 110	358 ms	71276 KiB

strah

#include <bits/stdc++.h>

#define pb push_back
#define whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = (int)2005 + 7;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e18 + 1;
 
int n, m;
char a[N][N];
ll sumW[N][N], sumH[N][N], pref[N];

ll get(ll x) { 
    ll res = (x * (x + 1)) / 2;
    return res;
}

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) { 
        for (int j = 1; j <= m; ++j) { 
            cin >> a[i][j];
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; ++i) { 
        for (int j = 1; j <= m; ++j) { 
            if (a[i][j] == '.') ++pref[j];
            else pref[j] = 0;
        }
        stack<int> st;
        for (int j = 1; j <= m; ++j) { 
            while (!st.empty() && pref[st.top()] >= pref[j]) st.pop();
            int pos = 0;
            if (!st.empty()) pos = st.top();
            int width = j - pos, height = pref[j];
            sumW[i][j] += sumW[i][pos] + sumH[i][pos] * 1ll * width;
            sumH[i][j] += sumH[i][pos] + get(height) * 1ll * width;
            sumW[i][j] += get(width) * 1ll * get(height);
            ans += sumW[i][j];
            st.push(j);
        }
    }
    cout << ans << "\n";
    return 0;
}

• 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