Submission #118468

#	Time	Username	Problem	Language	Result	Execution time	Memory
118468		E869120	최후의 만찬 (IOI12_supper)	C++14	43 / 100	292 ms	25152 KiB

advisor

#include "advisor.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
using namespace std;

int E[100009], F[100009]; vector<int>X[100009];
priority_queue<pair<int, int>, vector<pair<int, int>>, less<pair<int, int>>>Q;

void ComputeAdvice(int *C, int N, int K, int M) {
	int BITS = 0; for (int i = 0; i < 19; i++) { if ((1 << i) >= K) { BITS = i; break; } }

	for (int i = 0; i < N; i++) X[C[i]].push_back(i);
	for (int i = 0; i < N; i++) X[i].push_back(N);
	for (int i = 0; i < N; i++) E[i] = -1;
	for (int i = 0; i < K; i++) E[i] = i;
	for (int i = 0; i < N; i++) { Q.push(make_pair(X[i][0], i)); }

	for (int i = 0; i < N; i++) {
		while (true) {
			int pos1 = Q.top().first, pos2 = Q.top().second;
			if (E[pos2] == -1) Q.pop();
			else break;
		}
		if (E[C[i]] != -1) F[i] = -1;
		else {
			int pos1 = Q.top().second;
			F[i] = E[pos1];
			E[pos1] = -1;
			E[C[i]] = F[i];
		}
		int pos1 = lower_bound(X[C[i]].begin(), X[C[i]].end(), i + 1) - X[C[i]].begin();
		Q.push(make_pair(X[C[i]][pos1], C[i]));
	}

	for (int i = 0; i < N; i++) {
		if (F[i] == -1) continue;
		for (int j = 0; j < BITS; j++) {
			WriteAdvice((F[i] / (1 << j)) % 2);
		}
	}
}

assistant

#include "assistant.h"
#include <iostream>
using namespace std;

bool used[100009]; int LIST[100009];

void Assist(unsigned char *A, int N, int K, int R) {
	int BITS = 0; for (int i = 0; i < 19; i++) { if ((1 << i) >= K) { BITS = i; break; } }
	for (int i = 0; i < K; i++) { used[i] = true; LIST[i] = i; }

	int cnts = 0;
	for (int i = 0; i < N; i++) {
		int V = GetRequest();
		if (used[V] == true) continue;
		else {
			int sum = 0;
			for (int j = 0; j < BITS; j++) {
				sum += A[cnts] * (1 << j); cnts++;
			}
			PutBack(LIST[sum]);
			used[V] = true; used[LIST[sum]] = false;
			LIST[sum] = V;
		}
	}
}

Compilation message (stderr)

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:23:8: warning: unused variable 'pos1' [-Wunused-variable]
    int pos1 = Q.top().first, pos2 = Q.top().second;
        ^~~~

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