제출 #349910

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349910		tengiz05	Last supper (IOI12_supper)	C++17	0 / 100	103 ms	7944 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
const int NN = 2e5+5;
int n, ans[NN], used[NN], nx[NN], lst[NN];
void ComputeAdvice(int *C, int n, int k, int m) {
	priority_queue<pair<int,int>> q;
	for(int i=0;i<n;i++)lst[C[i]] = n+1, used[i] = -1;
	for(int i=n-1;i>=0;i--){
		nx[C[i]] = lst[C[i]];
		lst[C[i]] = i;
	}
	for(int i=0;i<k;i++){
		q.push({lst[i], i});
		used[i] = i;
	}
	for(int i=0;i<n;i++){
		if(used[C[i]] != -1)ans[used[C[i]]] = 1;
		else {
			while(true){
				int x = q.top().second;q.pop();
				if(used[x] == -1)continue;
				used[x] = -1;
				break;
			}
		}used[C[i]] = k+i;
		q.push({nx[i], C[i]});
	}
	for(int i=0;i<n+k;i++)WriteAdvice(ans[i]);
}

assistant

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int n, int k, int r) {
	set<int> x, y;
	for(int i=0;i<k;i++){
		if(A[i] == 0)x.insert(i);
		else y.insert(i);
	}
	for(int i=k;i<n+k;i++){
		int c = GetRequest();
		if(y.find(c) != y.end()){
			y.erase(c);
		}else {
			PutBack(*x.begin());
			x.erase(x.begin());
		}if(A[i] == 0)x.insert(c);
		else y.insert(c);
	}
}

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