oj.uz

Submission #99714

# Submission time Handle Problem Language Result Execution time Memory
99714 2019-03-06T08:14:02 Z szawinis Strah (COCI18_strah) C++17
110 / 110
 98 ms 19992 KB 
#include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 2002;

struct block {
    long h, l, r;
    block(long h, long l, long r): h(h), l(l), r(r) {}
};

inline long get_agg1(block tmp) {
    return (tmp.r-tmp.l+1) * tmp.h * (tmp.h + 1) / 2;
}

inline long get_agg2(block tmp) {
    return (tmp.r * (tmp.r + 1) / 2 - tmp.l * (tmp.l - 1) / 2) * (tmp.h * (tmp.h + 1) / 2); // negative
}

int n, m, last[N], up[N][N];
char s[N][N];
long ans;

long brute() {
    long actual = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(s[i][j] == '#') continue;
            int mn = up[i][j];
            long res = 0;
            for(int k = j; k >= 0; k--) {
                mn = min(up[i][k], mn);
                res += (mn * (mn + 1) / 2) * (j-k+1);
            }
            actual += res;
//            cerr << res << ' ';
        }
//        cerr << endl;
    }
    return actual;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> s[i];

    fill(last, last+N, -1);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(s[i][j] == '#') last[j] = i;
            else up[i][j] = i - last[j];
        }
    }

    for(int i = 0; i < n; i++) {
        vector<block> stk;
        long sum1 = 0, sum2 = 0;
        for(int j = 0, last = -1; j < m; j++) {
            if(!up[i][j]) {
                sum1 = 0;
                sum2 = 0;
                while(!stk.empty()) stk.pop_back();
                last = j;
                continue;
            }
            while(!stk.empty() && stk.back().h >= up[i][j]) {
                block tmp = stk.back();
                sum1 -= get_agg1(tmp);
                sum2 += get_agg2(tmp);
                stk.pop_back();
            }
            block tmp = block(up[i][j], (stk.empty() ? last : stk.back().r + 1), j - 1);
            sum1 += get_agg1(tmp);
            sum2 -= get_agg2(tmp);
            stk.push_back(tmp);
            ans += sum1 * j + sum2; // sum2 is already negative
        }
    }
    cout << ans << endl;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 8576 KB Output is correct
2 Correct 64 ms 15148 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 13500 KB Output is correct
2 Correct 97 ms 19336 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 8744 KB Output is correct
2 Correct 68 ms 16168 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12288 KB Output is correct
2 Correct 73 ms 18908 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 19992 KB Output is correct
2 Correct 98 ms 19988 KB Output is correct