oj.uz

Submission #711312

# Submission time Handle Problem Language Result Execution time Memory
711312 2023-03-16T14:53:22 Z scottchou Bob (COCI14_bob) C++17
120 / 120
 125 ms 14048 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int const N = 1005;
int a[N][N];
int color[N], cnt[N];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    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++){
        int c = 0;
        vector<pair<int, int> > stk;
        stk.push_back({0, 0});
        for(int j = 1; j <= m; j++){
            if(color[j] == a[i][j]){
                cnt[j]++;
            }else{
                cnt[j] = 1;
                color[j] = a[i][j];
            }
            if(color[j] != c){
                while(stk.size() > 1){
                    int sc = stk.size() - 2;
                    ans += ((j - stk[sc].second - 1) * (j - stk[sc].second  - 2) / 2 + j - stk[sc].second - 1) * (stk.back().first - stk[sc].first);
                    stk.pop_back();
                }
                stk.back().second = j - 1;
                c = color[j];
                stk.push_back({cnt[j], j});
            }else{
                while(stk.back().first >= cnt[j]){
                    if(stk.back().first > cnt[j]){
                        int sc = stk.size() - 2;
                        ans += ((j - stk[sc].second - 1) * (j - stk[sc].second - 2) / 2 + j - stk[sc].second - 1) * (stk.back().first - max(cnt[j], stk[sc].first));
                    }
                    stk.pop_back();
                }
                stk.push_back({cnt[j], j});
            }
        }
        while(stk.size() > 1){
            int sc = stk.size() - 2;
            ans += ((m - stk[sc].second) * (m - stk[sc].second  - 1) / 2 + m - stk[sc].second) * (stk.back().first - stk[sc].first);
            stk.pop_back();
        }
    }
    cout << ans << '\n';
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 10828 KB Output is correct
2 Correct 55 ms 6220 KB Output is correct
3 Correct 54 ms 6148 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 14048 KB Output is correct
2 Correct 89 ms 6116 KB Output is correct
3 Correct 76 ms 6180 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 13792 KB Output is correct
2 Correct 57 ms 6144 KB Output is correct
3 Correct 60 ms 6204 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 13892 KB Output is correct
2 Correct 56 ms 6092 KB Output is correct
3 Correct 54 ms 6172 KB Output is correct