Submission #577232

#	Time	Username	Problem	Language	Result	Execution time	Memory
577232		WongChun1234	최후의 만찬 (IOI12_supper)	C++14	0 / 100	351 ms	79756 KiB

advisor

#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;
int c[100050],curr[100050];
deque<int> ap[100050];
priority_queue<pair<int,int>> pq;
void ComputeAdvice(int *C, int n, int k, int m) {
	for (int i=0;i<n;i++) c[i]=C[i];
	for (int i=0;i<n;i++) ap[c[i]].push_back(i);
	for (int i=0;i<n;i++) ap[i].push_back(2e9);
	for (int i=0;i<k;i++) curr[i]=i,pq.push({ap[i][0],i});
	for (int i=k;i<n;i++) curr[i]=-1;
	for (int i=0;i<n;i++){
		int choice;
		if (curr[c[i]]!=-1){
			choice=32767;
		}else{
			choice=curr[c[i]]=curr[pq.top().second];
			curr[pq.top().second]=-1;
			pq.pop();
		}
		while (ap[c[i]].front()<=i) ap[c[i]].pop_front();
		pq.push({ap[c[i]].front(),c[i]});
		for (int j=0;j<13;j++) WriteAdvice((choice>>j)&1);
	}
}

assistant

#include "assistant.h"
#include<bits/stdc++.h>

int pos[100050];
void Assist(unsigned char *A, int n, int k, int R) {
	for (int i=0;i<k;i++) pos[i]=i;
	for (int i=k;i<n;i++) pos[i]=-1;
	for (int i=0;i<n;i++){
		int nxt=GetRequest();
		int choice=0;
		for (int j=0;j<13;j++) choice+=A[i*13+j]<<j;
		if (choice==32767){
		}else{
			PutBack(pos[choice]);
			pos[choice]=nxt;
		}
	}
}

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