제출 #639143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
639143		classic	Bob (COCI14_bob)	C++14	0 / 120	109 ms	12188 KiB

bob

#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<long long, long long, long long, long long>> stk;
        stk.emplace_back(0, 0, 0, 0);
        // sum - a[i][j] - col[i][j] - cur
        for (int j = 0; j < m; j++) {
            if (i > 0 && a[i - 1][j] == a[i][j]) {
                col[i][j] = col[i - 1][j] + 1;
            } else {
                col[i][j] = 1;
            }
            long long 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 (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: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12