oj.uz

Submission #639151

# Submission time Handle Problem Language Result Execution time Memory
639151 2022-09-08T18:07:27 Z classic Bob (COCI14_bob) C++14
120 / 120
 107 ms 14100 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }
    long long res = 0;
    vector<vector<long long>> col(n, vector<long long>(m));
    for (int i = 0; i < n; i++) {
        vector<tuple<int, int, int, long long>> stk;
        // sum - a[i][j] - col[i][j] - cur
        for (int j = 0; j < m; j++) {
            col[i][j] = 1;
            if (i > 0 && a[i - 1][j] == a[i][j]) {
                col[i][j] += col[i - 1][j];
            }
            int sum = 1;
            while (!stk.empty() && get<1>(stk.back()) == a[i][j] && get<2>(stk.back()) >= col[i][j]) {
                sum += get<0>(stk.back());
                stk.pop_back();
            }
            long long cur = sum * col[i][j];
            if (!stk.empty() && get<1>(stk.back()) == a[i][j]) {
                cur += get<3>(stk.back());
            }
            res += cur;
            stk.emplace_back(sum, a[i][j], col[i][j], cur);
        }
    }
    cout << res;
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 12072 KB Output is correct
2 Correct 60 ms 14064 KB Output is correct
3 Correct 63 ms 13972 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 12064 KB Output is correct
2 Correct 61 ms 14100 KB Output is correct
3 Correct 57 ms 14068 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 12176 KB Output is correct
2 Correct 74 ms 13984 KB Output is correct
3 Correct 60 ms 13972 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 12076 KB Output is correct
2 Correct 59 ms 14072 KB Output is correct
3 Correct 56 ms 13972 KB Output is correct