Submission #1215988

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215988		Robert_junior	Bob (COCI14_bob)	C++20	120 / 120	69 ms	8264 KiB

bob

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define ins insert
#define pb push_back
#define F first
#define S second
const int N = 1e6 + 7, M = 5e5 + 7;
const int mod = 1e9 + 7;
int h[1010][1010], a[1010][1010], R[1010], dp[1010];
void solve(){
    int n, m;
    cin>>n>>m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin>>a[i][j];
        }
    }
    long long ans = 0;
    for(int i = n; i >= 1; i--){
        for(int j = m; j >= 1; j--){
            if(a[i + 1][j] == a[i][j]){
                h[i][j] = (h[i + 1][j] + 1);
            }
            else{
                h[i][j] = 1;
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            int mn = h[i][j];
            int k = j; 
            while(k <= m && a[i][j] == a[i][k]){
                k++;
            }
            k--;
            stack<int>s;
            dp[k + 1] = 0;
            for(int l = k; l >= j; l--){
                while(s.size() && h[i][s.top()] >= h[i][l]) s.pop();
                if(!s.size()) R[l] = k + 1;
                else R[l] = s.top();
                s.push(l);
                dp[l] = dp[R[l]] + (R[l] - l) * h[i][l];
                ans += dp[l];
            }
            j = k;
        }
    }
    cout<<ans<<'\n';
}
signed main(){
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    //cin>>t; 
    for(int i = 1; i <= t; i++){
        //cout<<"Case "<<i<<": ";
        solve();
    }
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12