oj.uz

Submission #989703

# Submission time Handle Problem Language Result Execution time Memory
989703 2024-05-28T15:45:01 Z LOLOLO Bob (COCI14_bob) C++17
120 / 120
 104 ms 13908 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e3 + 10;
int mat[N][N], h[N], n, m;
ll nxt[N], pr[N];

ll cal(int l, int r) {
    stack <int> st;

    for (int i = l; i <= r; i++) {
        while (sz(st) && h[i] < h[st.top()])
            st.pop();

        pr[i] = sz(st) ? st.top() + 1 : l;
        st.push(i);
    }

    while (sz(st))
        st.pop();

    ll ans = 0;

    for (int i = r; i >= l; i--) {
        while (sz(st) && h[i] <= h[st.top()])
            st.pop();

        nxt[i] = sz(st) ? st.top() - 1 : r;
        ll len = (ll)(nxt[i] - i + 1) * (ll)(i - pr[i] + 1);
        ans += (ll)h[i] * len; 
        st.push(i);
    }

    return ans;
}

ll solve() {
    cin >> n >> m;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> mat[i][j];
        }
    }

    ll tot = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (mat[i][j] == mat[i - 1][j]) {
                h[j]++;
            } else {
                h[j] = 1;
            }
        }

        int pr = 1;
        for (int j = 1; j <= m + 1; j++) {
            if (mat[i][j] != mat[i][pr]) {
                tot += cal(pr, j - 1);
                pr = j;
            }
        }
    }

    return tot;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {
        cout << solve() << '\n';
    }

    return 0;
} 

/*
5 3
2 2 2
2 2 1
1 1 1
2 1 2
1 2 1
*/

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3164 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3416 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3676 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3856 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 10976 KB Output is correct
2 Correct 45 ms 6224 KB Output is correct
3 Correct 45 ms 6364 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 13908 KB Output is correct
2 Correct 52 ms 6372 KB Output is correct
3 Correct 44 ms 6228 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 13852 KB Output is correct
2 Correct 44 ms 6228 KB Output is correct
3 Correct 65 ms 6224 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 13900 KB Output is correct
2 Correct 58 ms 6224 KB Output is correct
3 Correct 47 ms 6224 KB Output is correct