oj.uz

Submission #877981

# Submission time Handle Problem Language Result Execution time Memory
877981 2023-11-24T00:42:42 Z noiaint Strah (COCI18_strah) C++17
110 / 110
 145 ms 20068 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 2e3 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int m, n;
int a[N][N];
int h[N];
int l[N], r[N];
long long ans = 0;

void process() {
    cin >> m >> n;
    for (int i = 1; i <= m; ++i)
        for (int j = 1; j <= n; ++j) {
            char c;
            cin >> c;
            a[i][j] = c == '.';
        }

    for (int i = 1; i <= m; ++i) {
        for (int j = 1; j <= n; ++j) if (a[i][j] == 1) h[j] += 1; else h[j] = 0;
        stack<int> st;
        for (int j = 1; j <= n; ++j) {
            while (st.size() && h[st.top()] >= h[j]) st.pop();
            l[j] = st.size() ? st.top() : 0;
            st.push(j);
        }
        st = stack<int> {};
        for (int j = n; j >= 1; --j) {
            while (st.size() && h[st.top()] > h[j]) st.pop();
            r[j] = st.size() ? st.top() : n + 1;
            st.push(j);
        }

        auto sum = [&] (int x) {
            return x * (x + 1) / 2;
        };

        for (int j = 1; j <= n; ++j) {
            int lenl = j - l[j], lenr = r[j] - j;
            long long cur = 1LL * lenl * sum(lenr) + 1LL * lenr * sum(lenl) - 1LL * lenl * lenr;
            ans += 1LL * cur * sum(h[j]);
        }
    }

    cout << ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    int tc = 1;
    // cin >> tc;
    
    while (tc--) {
        process();
    }

    return 0;
}

/*

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 476 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4700 KB Output is correct
2 Correct 4 ms 4576 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4700 KB Output is correct
2 Correct 5 ms 4700 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 9844 KB Output is correct
2 Correct 83 ms 15072 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 15188 KB Output is correct
2 Correct 127 ms 19260 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 10332 KB Output is correct
2 Correct 91 ms 17648 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14940 KB Output is correct
2 Correct 82 ms 18012 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 20068 KB Output is correct
2 Correct 145 ms 20052 KB Output is correct