Submission #382791

#	Time	Username	Problem	Language	Result	Execution time	Memory
382791		alireza_kaviani	Last supper (IOI12_supper)	C++11	0 / 100	159 ms	15948 KiB

advisor

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

using namespace std;

typedef pair<int, int> pii;

#define X			first
#define Y			second

const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;

int mark[MAXN] , res[MAXN];
vector<int> vec[MAXN];
set<pii , greater<pii>> st;

void ComputeAdvice(int *C, int N, int K, int M) {
	for(int i = 0 ; i < N ; i++)	vec[i].push_back(MAXN);
	for(int i = N - 1 ; i >= 0 ; i--){
		vec[C[i]].push_back(i);
	}
	for(int i = 0 ; i < K ; i++){
		st.insert({vec[i].back() , i});
	}
	for(int i = 0 ; i < N ; i++){
		auto it = st.lower_bound({i , MOD});
		if(it != st.end() && (*it).X == i){
			res[(*it).Y] = 1;
			st.erase(it);
			vec[C[i]].pop_back();
			st.insert({vec[C[i]].back() , i + K});
		}
		else{
			vec[C[i]].pop_back();
			st.insert({vec[C[i]].back() , i + K});
			st.erase(st.begin());
		}
	}
	for(int i = 0 ; i < N + K ; i++)	WriteAdvice(res[i]);
}

assistant

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

using namespace std;

set<int> st0 , st1;

void Assist(unsigned char *A, int N, int K, int R) {
	for(int i = 0 ; i < K ; i++){
		if(A[i] == 0)	st0.insert(i);
		else	st1.insert(i);
	}
	for(int i = 0 ; i < N ; i++){
		int cur = GetRequest();
		st0.erase(cur);
		st1.erase(cur);
		if(A[i + K] == 0)	st0.insert(cur);
		if(A[i + K] == 1)	st1.insert(cur);
		if(st0.size() + st1.size() == K)	continue;
		PutBack((*st0.begin()));
//		cout << i << ' ' << (*st0.begin()) << endl;
		st0.erase(st0.begin());
	}
}

Compilation message (stderr)

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:19:30: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |   if(st0.size() + st1.size() == K) continue;
      |      ~~~~~~~~~~~~~~~~~~~~~~~~^~~~

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