제출 #361581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
361581		MetB	Last supper (IOI12_supper)	C++14	100 / 100	183 ms	13200 KiB

advisor

#include <iostream>
#include <vector>
#include <set>
#include <cassert>
#include "advisor.h"

using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
	vector<vector<int>> last(N);
	vector<int> ans(N), ans_k(K);
	vector<int> request(N, -1);
	vector<int> ptr(N), st(N);
	set<pair<int, int>> s;

	for (int i = 0; i < N; i++) {
		last[C[i]].push_back(i);
	}

	for (int i = 0; i < N; i++) {
		last[i].push_back(N);
	}

	for (int i = 0; i < K; i++) {
		s.insert({last[i][0], i});
		st[i] = 1;
	}

	for (int i = 0; i < N; i++) {
		/*for (auto a : s) {
			cout << a.first << ' ' << a.second << endl;
		}
		cout << "----\n";*/

		request[C[i]] = i;
		if (!st[C[i]]) {
			int x = s.rbegin()->second;
			s.erase({last[x][ptr[x]], x});
			st[x] = 0;
			if (request[x] != -1) ans[request[x]] = 1;
			else ans_k[x] = 1;
			while(last[C[i]][ptr[C[i]]] <= i) ptr[C[i]]++;
			s.insert({last[C[i]][ptr[C[i]]], C[i]});
		} else {
			s.erase({last[C[i]][ptr[C[i]]], C[i]});
			while(last[C[i]][ptr[C[i]]] <= i) ptr[C[i]]++;
			s.insert({last[C[i]][ptr[C[i]]], C[i]});
		}
		st[C[i]] = 1;
	}

	for (int i = 0; i < K; i++) {
		WriteAdvice(ans_k[i]);
	}

	for (int i = 0; i < N; i++) {
		WriteAdvice(ans[i]);
	}
}

assistant

#include <iostream>
#include <vector>
#include "assistant.h"

using namespace std;

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

	A += K;

	for (int i = 0; i < N; i++) {
		int x = GetRequest();
		if (!st[x]) {
			st[bottom_shelf.back()] = 0;
			PutBack(bottom_shelf.back());
			bottom_shelf.pop_back();
		}
		st[x] = 1;
		if (A[i]) bottom_shelf.push_back(x);
	}

}

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