Submission #624972

#	Time	Username	Problem	Language	Result	Execution time	Memory
624972		pirhosig	Last supper (IOI12_supper)	C++17	0 / 100	722 ms	16156 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>
#define  R(a) for (int i = 0; i < a; ++i)
#define ii pair<int, int>
using namespace std;



void ComputeAdvice(int *C, int N, int K, int M) {
    unordered_map<int, vector<int>> mpa;
    R(N) {
        int a = C[i];
        mpa[a].push_back(i);
    }

    unordered_set<int> val;
    R(K) {
        val.insert(i);
    }

    vector<int> nxt(N, -1);
    priority_queue<ii> que;
    R(K) {
        if (!mpa[i].size()) {
            que.push({INT_MAX, i});
            nxt[i] = INT_MAX;
        }
        else {
            que.push({mpa[i][0], i});
            nxt[i] = mpa[i][0];
        }
    }

    bool init[K] {};
    bool rem[N] {};
    vector<int> last(N, -1);
    R(N) {
        int a = C[i];
        last[a] = i;
        if (!val.count(a)) {
            while (nxt[que.top().second] != que.top().first) {
                que.pop();
            }
            auto b = que.top();
            que.pop();
            int c = b.second;
            if (last[c] == -1) init[c] = true;
            else rem[last[c]] = true;
        }

        auto it = upper_bound(mpa[a].begin(), mpa[a].end(), i);
        if (it == mpa[a].end()) {
            que.push({INT_MAX, a});
            nxt[a] = INT_MAX;
        }
        else {
            que.push({*it, a});
            nxt[a] = *it;
        }
    }

    R(K) {
        if (init[i]) WriteAdvice(1);
        else WriteAdvice(0);
    }
    R(N) {
        if (rem[i]) WriteAdvice(1);
        else WriteAdvice(0);
    }
}

assistant

#include "assistant.h"
#include <bits/stdc++.h>
#define  R(a) for (int i = 0; i < a; ++i)
#define ii pair<int, int>
using namespace std;



void Assist(unsigned char *A, int N, int K, int R) {
    queue<int> rem;
    set<int> val;
    R(K) {
        cerr << "A " << (int)(A[i]) << endl;
    }
    cerr << "N\n";
    R(N) {
        cerr << "A " << (int)(A[K + i]) << endl;
    }

    R(K) {
        val.insert(i);
        if (A[i]) rem.push(i);
    }
    R(N) {
        int a = GetRequest();
        if (!val.count(a)) {
            val.insert(a);
            int b = rem.front();
            PutBack(b);
            val.erase(b);
            rem.pop();
        }
        if (A[K + i]) rem.push(a);
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 35
• Subtask 5: 0 / 39