Submission #363033

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

advisor

#include "advisor.h"
#include <iostream>
using std::cerr;
 
const int LG = 13;
void ComputeAdvice(int *C, int N, int K, int M) {
    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 <iostream>
#include <vector>
#include <cassert>
using std::cerr;
using std::vector;
 
const int maxn = 100025;
const int LG = 13;
 
int C[maxn];
vector<int> last[maxn];
int scaffold[maxn];
bool onScaffold[maxn];
 
void Assist(unsigned char *A, int N, int K, int R) {
    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';
    for (int i = 0; i < K; i++)
        scaffold[i] = i, onScaffold[i] = true;
    for (int i = 0; i < N; i++)
        last[i].push_back(maxn);
    for (int i = N-1; i >= 0; i--)
        last[C[i]].push_back(i);
    for (int i = 0; i < N; i++) {
        int req = GetRequest();
        if (!onScaffold[req]) {
            // for (int i = 0; i < N; i++) last[i] = maxn;
            // for (int j = N-1; j > i; j--)
            //     last[C[j]] = j;
            assert(C[i] == req);
            // assert(last[C[i]].back() == i);
            last[C[i]].pop_back();
            int pos = -1;
            for (int j = 0; j < K; j++)
                if(pos == -1 ||
                        last[scaffold[pos]].back() < last[scaffold[j]].back())
                    pos = j;
            onScaffold[req] = true;
            onScaffold[scaffold[pos]] = false;
            PutBack(scaffold[pos]);
            scaffold[pos] = req;
        }
    }
}

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