Submission #51872

#	Time	Username	Problem	Language	Result	Execution time	Memory
51872		rondojim	Last supper (IOI12_supper)	C++17	20 / 100	556 ms	42872 KiB

advisor

#include "advisor.h"
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
typedef pair<int,int> pi;
 
set<pi> s;
vector<pi> nexts;
int query[100005];
int is_in[100005];
 
int getnxt(int val, int time){
	auto t = upper_bound(nexts.begin(), nexts.end(), pi(val, time));
	if(t->first != val) return 1e9;
	return t->second;
}
 
void ComputeAdvice(int *C, int N, int K, int M) {
	for(int i=0; i<N; i++){
		nexts.push_back(pi(C[i], i));
	}
	sort(nexts.begin(), nexts.end());
	for(int i=0; i<K; i++){
		s.insert(pi(getnxt(i, -1), i));
		is_in[i] = 1;
	}
	for(int i=0; i<N; i++){
		query[i] = N;
		if(is_in[C[i]]){
			if(s.find(pi(i, C[i])) != s.end()) s.erase(pi(i, C[i]));
			s.insert(pi(getnxt(C[i], i), C[i]));	
		}
		else{
			auto t = --s.end();
			query[i] = t->second;
			is_in[t->second] = 0;
			s.erase(t);
			s.insert(pi(getnxt(C[i], i), C[i]));
			is_in[C[i]] = 1;
		}
	}
	for(int i=0; i<N; i++){
		if(N <= 5000){
			for(int j=0; j<13; j++){
				WriteAdvice((query[i] >> j) & 1);
			}
		}
		else{
			for(int j=0; j<17; j++){
				WriteAdvice((query[i] >> j) & 1);
			}
		}
	}
}

assistant

#include "assistant.h"
 
void Assist(unsigned char *A, int N, int K, int R) {
	int p = (N <= 5000 ? 13 : 17);
	for(int i=0; i<R; i+=p){
		int bits = 0;
		for(int j=0; j<p; j++){
			bits |= (A[i + j] << j);
		}
		int req = GetRequest();
		if(bits == N){
			continue;
		}
		else{
			PutBack(bits);
		}
	}
}

Compilation message (stderr)

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:10:7: warning: unused variable 'req' [-Wunused-variable]
   int req = GetRequest();
       ^~~

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