Submission #363022

#	Time	Username	Problem	Language	Result	Execution time	Memory
363022		2qbingxuan	Last supper (IOI12_supper)	C++14	0 / 100	476 ms	20556 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
    const int LG = __lg(N) + 1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < LG; j++) {
            WriteAdvice(C[i] >> j & 1);
        }
    }
    // cerr << "C = ";
    // for (int i = 0; i < N; i++)
    //     cerr << C[i] << ' ';
    // cerr << '\n';
}

assistant

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 100025;

int C[maxn];
vector<int> last[maxn];
int scaffold[maxn];
bool onScaffold[maxn];

void Assist(unsigned char *A, int N, int K, int R) {
    const int LG = __lg(N) + 1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < LG; j++) {
            C[i] |= A[i*LG + j] * (1<<j);
        }
    }
    // cerr << "C = ";
    // for (int i = 0; i < N; i++)
    //     cerr << C[i] << ' ';
    // cerr << '\n';
    
    auto getLast = [](int i) {
        return last[i].empty()
            ? maxn
            : last[i].back();
    };

    for (int i = N-1; i >= 0; i--)
        last[C[i]].push_back(i);
    set<pair<int,int>, greater<>> st; // last, j
    for (int i = 0; i < K; i++) {
        scaffold[i] = i;
        onScaffold[i] = true;
        st.insert({ getLast(i), i });
    }


    for (int i = 0; i < N; i++) {
        int req = GetRequest();
        if (!onScaffold[req]) {
            int pos = st.begin() -> second;
            st.erase(st.begin());
            last[req].pop_back();
            st.insert({ getLast(req), pos });
            PutBack(scaffold[pos]);
            onScaffold[scaffold[pos]] = false;
            onScaffold[req] = true;
            scaffold[pos] = req;
        }
    }
}

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