Submission #104858

#	Time	Username	Problem	Language	Result	Execution time	Memory
104858		figter001	최후의 만찬 (IOI12_supper)	C++17	0 / 100	227 ms	17784 KiB

advisor

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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 1e5 + 50;
const int oo = 1e9;

vector<int> lst[nax];
set<pair<int,int>> st;
bool in[nax],rem[nax];

void ComputeAdvice(int *C, int n, int k, int M) {
	for(int i=0;i<n;i++)
		lst[i].push_back(oo);
	for(int i=n-1;i>=0;i--)
		lst[C[i]].push_back(i);
	for(int i=0;i<k;i++){
		st.insert({-lst[i].back(),i});
		lst[i].pop_back();
		in[i] = 1;
	}
	vector<pair<int,int>> w;

	for(int i=0;i<n;i++){
		if(in[C[i]] == 1){
			w.push_back({1,-1});
			st.erase(--st.end());
			int id = C[i];
			st.insert({-lst[id].back(),id});
			lst[id].pop_back();
		}else{
			w.push_back({0,C[i]});
			int id = st.begin()->second;
			in[id] = 0;
			in[C[i]] = 1;
			if(id < k)
				rem[id] = 1;
			st.erase(st.begin());
			lst[C[i]].pop_back();
			st.insert({-lst[C[i]].back(),C[i]});
		}
	}
	printf("\n");
	for(int i=n-1;i>=0;i--){
		if(w[i].first == 0){
			w[i].second = in[C[i]];
			in[C[i]] = 0;
		}
	}
	for(int i=0;i<k;i++){
		WriteAdvice(rem[i]);
		// cout << rem[i] << ' ';
	}

	for(int i=0;i<n;i++){
		if(w[i].first == 1){
			WriteAdvice(1);
			// cout << 1 << ' ';
		}else{
			WriteAdvice(0);
			WriteAdvice(w[i].second);
			// cout << 0 << ' ' << w[i].second << ' ';
		}
	}
}

assistant

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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 1e5 + 50;
const int oo = 1e9;

void Assist(unsigned char *A, int n, int k, int R) {
	int at = 0;
	vector<int> r;
	for(int i=0;i<k;i++){
		if(A[i] == '1'){
			r.push_back(i);
		}
	}
	at = k;
	for(int i=0;i<n;i++){
    	int req = GetRequest();
    	if(A[at] == '0'){
    		at++;
    		PutBack(r.back());
    		r.pop_back();
    		if(A[at] == '0')
    			r.push_back(req);
    	}
      	at++;
  	}

}

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