oj.uz

Submission #97151

# Submission time Handle Problem Language Result Execution time Memory
97151 2019-02-14T07:09:18 Z win11905 Bob (COCI14_bob) C++11
0 / 120
 172 ms 18060 KB 
/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author win11905
 */

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define iii tuple<int, int, int>
#define long long long
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const long MOD = 1e9+7, LINF = 1e18 + 1e16;
const int INF = 1e9+1;
const double EPS = 1e-10;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

const int N = 1005;

class bob {
private:
    int n, m;
    int arr[N][N], pref[N][N];
    long ans;
public:
    void solve(istream& cin, ostream& cout) {
        cin >> n >> m;
        for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) {
            cin >> arr[i][j];
            pref[i][j] = 1 + (arr[i][j] == arr[i-1][j] ? pref[i-1][j] : 0);
        }
        for(int i = 1; i <= n; ++i) {
            int cnt = 0;
            stack<pii> stk; // pos, sum;
            for(int j = 1; j <= m; ++j) {
                if(arr[i][j] != arr[i][j-1]) while(!stk.empty()) stk.pop(), cnt = 0;
                int now = pref[i][j];
                while(!stk.empty() && pref[i][stk.top().x] >= pref[i][j]) {
                    int z = stk.top().x; cnt -= stk.top().y;
                    stk.pop(); now += pref[i][j] * (z - (stk.empty() ? 0 : stk.top().x));
                }
                cnt += now, stk.emplace(j, now);
                ans += cnt;
            }
        }
        cout << ans << endl;
    }
};

class Solver {
public:
    void solve(std::istream& in, std::ostream& out) {
        bob *obj = new bob();
        obj->solve(in, out);
    }
};

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    Solver solver;
    std::istream& in(std::cin);
    std::ostream& out(std::cout);
    solver.solve(in, out);
    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 8448 KB Output isn't correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 8268 KB Output isn't correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 8960 KB Output isn't correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 9312 KB Output isn't correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 9592 KB Output isn't correct

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 9436 KB Output isn't correct

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 143 ms 14840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 172 ms 18060 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 171 ms 18056 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 161 ms 17896 KB Output isn't correct
2 Halted 0 ms 0 KB -