제출 #430164

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430164		Mounir	최후의 만찬 (IOI12_supper)	C++14	0 / 100	2594 ms	12044 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;

const int N_BITS = 13;

void ComputeAdvice(int *C, int N, int K, int M) {
	for (int iVal = 0; iVal < N; ++iVal){
		int val = C[iVal];
		for (int i = 0; i < N_BITS; ++i)
			WriteAdvice((val&(1 << i)) > 0);
	}
}

assistant

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;

const int N_BITS = 13;

void Assist(unsigned char *A, int N, int K, int R) {
	vector<int> C;
	for (int i  = 0; i < R; i += N_BITS){
		int tot = 0;
		for (int bit = 0; bit < N_BITS; ++bit)
			tot += A[i + bit] * (1 << bit);
		C.push_back(tot);
	}

	set<int> presents;
	for (int i = 0; i < K; ++i)
		presents.insert(i);

	for (int iReq = 0; iReq < N; ++iReq){
		int proc = GetRequest();
		if (presents.count(proc) == 0){
			int procUtil = -1, color = -1;
			for (int present : presents){
				int ind = iReq + 1;
				while (ind < N && C[ind] != present)
					++ind;
				if (ind > procUtil){
					procUtil = ind;
					color = present;
				}
			}

			PutBack(color);
			presents.erase(color);
			presents.insert(proc);
		}
	}
}

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