oj.uz

Submission #644062

# Submission time Handle Problem Language Result Execution time Memory
644062 2022-09-23T17:26:55 Z BackNoob Bob (COCI14_bob) C++14
120 / 120
 115 ms 8412 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 1027;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
int a[mxN][mxN];
int h[mxN][mxN];
int lef[mxN];
int ans[mxN];
 
void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= m; j++) cin >> a[i][j];

    for(int i = n; i >= 1; i--)
    for(int j = 1; j <= m; j++) {
        if(a[i][j] == a[i + 1][j]) h[i][j] = h[i + 1][j] + 1;
        else h[i][j] = 1;
    }

    ll res = 0;
    for(int i = 1; i <= n; i++) {
        stack<int> s;
        for(int j = 1; j <= m; j++) {
            while(sz(s) && h[i][s.top()] >= h[i][j]) s.pop();
            if(sz(s) == 0) lef[j] = 0;
            else lef[j] = s.top();
            s.push(j);
        }

        for(int j = 1; j <= m; j++) {
            int k = j;
            while(k <= m && a[i][k] == a[i][j]) ++ k;
            for(int hh = j; hh < k; hh++) {
                maximize(lef[hh], j - 1);
                ans[hh] = 1LL * (hh - lef[hh]) * h[i][hh];
                if(a[i][lef[hh]] == a[i][hh]) ans[hh] += ans[lef[hh]];
                res += ans[hh];
            }

            j = k - 1;
        }

        // for(int j = 1; j <= m; j++) {
        //     ans[j] = 1LL * (j - lef[j]) * h[i][j];
        //     if(a[i][lef[j]] == a[i][j]) ans[j] += ans[lef[j]];
        //     res += ans[j];

        // }
    }
    cout << res;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 8240 KB Output is correct
2 Correct 55 ms 8360 KB Output is correct
3 Correct 52 ms 8268 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 8356 KB Output is correct
2 Correct 62 ms 8272 KB Output is correct
3 Correct 54 ms 8412 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 8284 KB Output is correct
2 Correct 55 ms 8268 KB Output is correct
3 Correct 56 ms 8272 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 8360 KB Output is correct
2 Correct 54 ms 8300 KB Output is correct
3 Correct 56 ms 8292 KB Output is correct