Submission #73964

#	Time	Username	Problem	Language	Result	Execution time	Memory
73964		sebinkim	Last supper (IOI12_supper)	C++14	0 / 100	27 ms	4352 KiB

advisor

#include "advisor.h"

#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

static int P[101010], K[101010];
static priority_queue <pii> Q;

void ComputeAdvice(int *C, int n, int k, int m)
{
	int i;
	
	for(i=0; i<n; i++) P[i] = n + 1;
	
	for(i=n-1; i>=0; i--){
		K[k + i] = P[C[i]];
		P[C[i]] = i;
	}
	
	for(i=0; i<k; i++){
		K[i] = P[i];
		P[i] = i;
		Q.push(pii(K[i], i));
	}
	
	for(i=0; i<n; i++){
		WriteAdvice(Q.top().second); Q.pop();
		Q.push(pii(K[k + i], k + i));
	}
}

assistant

#include "assistant.h"

#include <bits/stdc++.h>

using namespace std;

static queue <int> Q;
static bool chk[101010];

void Assist(unsigned char *A, int n, int k, int r)
{
	int i, c;
	
	for(i=0; i<k; i++){
		if(A[i]) Q.push(i);
		chk[i] = 1;
	}
	
	for(i=0; i<n; i++){
		c = GetRequest();
		if(!chk[c]){
			chk[Q.front()] = 0;
			PutBack(Q.front());
			Q.pop();
		}
		if(A[k + i]) Q.push(c);
		chk[c] = 1;
	}
}

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