Submission #67351

#	Time	Username	Problem	Language	Result	Execution time	Memory
67351		WA_TLE	Last supper (IOI12_supper)	C++14	100 / 100	227 ms	37416 KiB

advisor

#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#define pub push_back
#define pob pop_back
#define mp make_pair
#define sec second
using namespace std;
//#include"grader.cpp"
const int mod=1e9+7;
//void WriteAdvice(unsigned char a) {};
#include"advisor.h"
void ComputeAdvice(int *C, int N, int K, int M) {
	static bool kta[200000]={};
	int i,j;
	priority_queue<pair<int,int>>que;
	//次いる日、入れたときの番号
	vector<vector<int>>need(N);
	for(i=0;i<N;i++){need[i].pub(mod);}
	for(i=N-1;i>=0;i--){need[C[i]].pub(i);}
	static bool tna[100000]={};
	for(i=0;i<K;i++){que.push(mp(need[i].back(),i));tna[i]=1;}
	for(i=0;i<N;i++){
		int use=C[i];
		need[use].pob();
		if(!tna[use]){
			pair<int,int> ksu;
			while(-1){
				ksu=que.top();que.pop();
				int ter;
				if(ksu.sec<K){ter=ksu.sec;}else{ter=C[ksu.sec-K];}
				if(tna[ter]){kta[ksu.sec]=1;tna[ter]=0;break;}
			}
			tna[use]=1;
		}
		que.push(mp(need[use].back(),i+K));
	}
	for(i=0;i<K+N;i++){WriteAdvice(kta[i]);}
}

assistant

#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#define pub push_back
#define pob pop_back
#define mp make_pair
#define sec second
using namespace std;
#include "assistant.h"
void Assist(unsigned char *A, int N, int K, int R) {
	int i;
	deque<int>iran;
	static bool aru[100000]={};
	for(i=0;i<K;i++){if(A[i]){iran.pub(i);}aru[i]=1;}
	for(i=0;i<N;i++) {
		int req=GetRequest();
		if(!aru[req]){PutBack(iran.back());aru[iran.back()]=0;iran.pob();}
		if(A[i+K]){iran.pub(req);}
		aru[req]=1;
	}
}

Compilation message (stderr)

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:16:8: warning: unused variable 'j' [-Wunused-variable]
  int i,j;
        ^

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