This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
stk.emplace_back(0, -1, 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;
}
int sum = 1;
while (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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |