Submission #97154

#	Time	Username	Problem	Language	Result	Execution time	Memory
97154		win11905	Bob (COCI14_bob)	C++11	120 / 120	205 ms	10376 KiB

bob

/**
 * 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, ft = 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, ft = j-1;
                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() ? ft : 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: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12