# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118493 | E869120 | 최후의 만찬 (IOI12_supper) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "assistant.h"
#include <iostream>
#include <queue>
using namespace std;
int LIST[200009], B1[100009], B2[100009], B3[100009];
queue<int>Q; bool used[100009];
void Assist(unsigned char *A, int N, int K, int R) {
for (int i = 0; i < N; i++) B1[i] = A[i];
for (int i = 0; i < N; i++) B2[i] = A[i + N];
for (int i = 0; i < K; i++) B3[i] = A[i + N + N];
for (int i = 0; i < K; i++) used[i] = true;
for (int i = 0; i < K; i++) LIST[i + N] = i;
for (int i = 0; i < K; i++) { if (B3[i] == 0) Q.push(i + N); }
for (int i = 0; i < N; i++) {
LIST[i] = GetRequest();
if (used[LIST[i]] == true) {
// 無視する
}
else {
int pos = -1;
while (!Q.empty()) {
int pos1 = Q.front();
if (used[LIST[pos1]] == true) { pos = pos1; break; }
else Q.pop();
}
PutBack(LIST[pos]);
used[LIST[pos]] = false;
used[LIST[i]] = true;
if (!Q.empty()) Q.pop();
}
if (B2[i] == 0) Q.push(i);
}
}