Submission #419170

#	Time	Username	Problem	Language	Result	Execution time	Memory
419170		arayi	Last supper (IOI12_supper)	C++17	100 / 100	139 ms	33548 KiB

advisor

#include "advisor.h"
#include <iostream>
#include <vector>
#include <queue>
#define MP make_pair
#define fr first
#define sc second
#define ad push_back
using namespace std;
const int N = 1e6 + 30;


int i1 = 0;
int col[N], b[N], c[N];
int ans[N];
vector<int> fp[N];
void ComputeAdvice(int *C, int N, int K, int M)
{
	for (int i = 0; i < N; i++) fp[i].ad(N);
	for (int i = N - 1; i >= 0; i--) fp[C[i]].ad(i);
	priority_queue <pair<int, int> > q;
	for (int i = 1; i <= K; i++) q.push(MP(fp[i - 1].back(), i)), col[i - 1] = i, b[i] = i - 1, c[i] = i - 1;
	i1 = K;
	for (int i = 0; i < N; i++)
	{
		fp[C[i]].pop_back();
		if (col[C[i]])
		{
			q.push(MP(fp[C[i]].back(), col[C[i]]));
			c[col[C[i]]] = i1 + i;
			continue;
		}
		int p = q.top().sc;
		q.pop();
		col[b[p]] = 0, col[C[i]] = p;
		ans[c[p]] = 1, c[p] = i1 + i;
		b[p] = C[i];
		q.push(MP(fp[C[i]].back(), col[C[i]]));
	}
	i1 += N;
	for (int i = 0; i < i1; i++) WriteAdvice(ans[i]);
}

assistant

#include "assistant.h"
#include <iostream>
#include <stack>
#include <vector>
#include <queue>
#define MP make_pair
#define fr first
#define sc second
#define ad push
using namespace std;
const int N1 = 1e6 + 30;

int ii;
int col1[N1], b1[N1];
queue <int> fp1;
void Assist(unsigned char *A, int N, int K, int R) 
{
	for (int i = 1; i <= K; i++)
	{
		col1[i - 1] = i, b1[i] = i - 1;
		if (A[i - 1]) fp1.ad(i);
	}
	ii = K;
	for (int i = 0; i < N; i++)
	{
		int a = GetRequest();
		if (col1[a])
		{
			if (A[ii + i]) fp1.ad(col1[a]);
			continue;
		}
		int p = fp1.front();
		fp1.pop();
		PutBack(b1[p]);
		col1[b1[p]] = 0, col1[a] = p;
		b1[p] = a;
		if (A[ii + i]) fp1.ad(col1[a]);
	}
}

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