제출 #764761

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
764761		boyliguanhan	최후의 만찬 (IOI12_supper)	C++17	100 / 100	82 ms	6848 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
#define N 200100
int n, res[N], used[N], nxt[N], last[N];
void ComputeAdvice(int *C, int n, int k, int m) {
	priority_queue<pair<int,int>> q;
	for(int i = 0; i < n; i++)
        last[i] = n, used[i] = -1;
	for(int i = n; i--;)
		nxt[i] = last[C[i]], last[C[i]] = i;
	for(int i = 0; i < k; i++)
		q.push({last[i], used[i] = i});
	for(int i = 0; i < n; i++){
		if(used[C[i]]+1) {
            res[used[C[i]]] = 1;
		} else {
			used[q.top().second] = -1;
            q.pop();
		}
        used[C[i]] = k+i;
		q.push({nxt[i], C[i]});
	}
	for(int i = 0; i < n+k; i++)
        WriteAdvice(res[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> y;
  priority_queue<int, vector<int>, greater<int>> q;
	for(int i=0;i<k;i++){
    if(A[i])
      y.insert(i);
    else
      q.push(i);
  }
	for(int i=k;i<n+k;i++){
		int c = GetRequest();
		if(y.find(c) != y.end()){
			y.erase(c);
		} else {
			PutBack(q.top());
			q.pop();
		}
    if(A[i])
      y.insert(c);
		else
      q.push(c);
	}
}

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