# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381835 | thecodingwizard | Last supper (IOI12_supper) | C++11 | 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 <bits/stdc++.h>
#include "assistant.h"
using namespace std;
#define f first
#define s second
void Assist(unsigned char *A, int N, int K, int R) {
map<int, int> useLeft;
int idx = 0;
map<int, int> pos;
map<int, int> revPos;
queue<int> toRemove;
for (int i = 0; i < K; i++) {
int ct = 0;
while (A[idx] != 0) {
ct++;
idx++;
}
idx++;
useLeft[i] = ct;
cout << i << " will be used " << ct << " times " << endl;
if (ct == 0) toRemove.push(i);
pos[i] = i;
revPos[i] = i;
}
for (int i = 0; i < N; i++) {
int req = GetRequest();
if (pos.count(req)) {
useLeft[pos[req]]--;
if (useLeft[pos[req]] == 0) {
toRemove.push(pos[req]);
}
} else {
int remove = toRemove.front(); toRemove.pop();
PutBack(revPos[remove]);
pos.erase(revPos[remove]);
revPos[remove] = req;
pos[req] = remove;
int ct = 0;
if (idx == R) {
ct = 10000000;
} else {
while (A[idx] != 0) {
ct++;
idx++;
}
idx++;
}
useLeft[remove] = ct;
if (ct == 0) {
toRemove.push(remove);
}
}
}
}