Submission #236758

#	Time	Username	Problem	Language	Result	Execution time	Memory
236758		VEGAnn	Vođe (COCI17_vode)	C++14	72 / 120	3110 ms	524292 KiB

vode

#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define ft first
#define sd second
using namespace std;
typedef long long ll;
const int N = 5010;
const int oo = int(2e9);
const ll OO = 1e18;
const int md = int(1e9) + 7;
set<short> st[N];
set<short>::iterator ite;
short mem[N][N], fen[N][N], net[N], tp[N], n, m, k;

void upd(int id, int ps){
    for (; ps < m; ps = (ps | (ps + 1)))
        fen[id][ps]++;
}

int sum(int id, int ps){
    int res = 0;
    for (; ps >= 0; ps = (ps & (ps + 1)) - 1)
        res += fen[id][ps];
    return res;
}

int get(int ps, int vl){
    if (mem[ps][vl] > 0) return mem[ps][vl] - 1;

    if (vl == m - 1) {
        mem[ps][vl] = 1;
        return 0;
    }

    int res = 0;

    int rt = min(vl + k, m - 1);

    while (1){
        ite = st[net[ps]].upper_bound(rt);

        if (ite == st[net[ps]].begin()) break;

        int nw = *prev(ite);

        if (nw <= vl) break;

        mem[net[ps]][nw] = get(net[ps], nw) + 1;

        if (mem[net[ps]][nw] == 2)
            upd(net[ps], nw);

        st[net[ps]].erase(nw);
    }

    if (tp[net[ps]] == tp[ps]){
        if (sum(net[ps], rt) - sum(net[ps], vl) > 0)
            res = 1;
    } else {
        if (sum(net[ps], rt) - sum(net[ps], vl) < rt - vl)
            res = 1;
    }

    mem[ps][vl] = res + 1;

    return res;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n >> m >> k;

    k = min(m, k);

    for (int i = 0; i < n; i++) {
        cin >> tp[i];
        net[i] = (i + 1) % n;

        for (int j = 1; j <= m; j++)
            st[i].insert(j);
    }

    for (int i = 0; i < n; i++){
        int ans = 0;

        ans = get(i, 0);

        cout << (tp[i] ^ ans ^ 1) << " ";
    }

    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: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12