# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361920 | benedict0724 | 최후의 만찬 (IOI12_supper) | C++17 | 23 ms | 8960 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 "advisor.h"
#include <deque>
#include <queue>
using namespace std;
deque<int> useWhen[5000];
queue<int> ret;
int shelf[5000];
void ComputeAdvice(int *C, int N, int K, int M) {
int logN = 0;
while(N + 1 <= (1<<logN)) logN++;
for(int i=0;i<K;i++){
shelf[i] = i;
}
for(int i=0;i<N;i++){
useWhen[C[i]].push_back(i);
}
for(int i=0;i<N;i++){
bool flag = false;
for(int j=0;j<K;j++){
if(shelf[j] == C[i]) flag = true;
}
if(!flag){
int m = 0;
for(int j=0;j<K;j++){
while(useWhen[shelf[j]].front() < i) useWhen[shelf[j]].pop_front();
if(useWhen[shelf[m]].front() < useWhen[shelf[j]].front()) m = j;
}
shelf[m] = C[i];
ret.push(C[i]);
}
else{
ret.push((1<<logN) - 1);
}
}
while(!ret.empty()){
int now = ret.front(); ret.pop();
for(int i=0;i<logN;i++){
if((1<<i) & now) WriteAdvice(1);
else WriteAdvice(0);
}
}
}
#include "assistant.h"
void Assist(unsigned char *A, int N, int K, int R) {
int i, logN = 0;
while(N + 1 <= (1<<logN)) logN++;
for (i = 0; i < N; i++) {
int req = GetRequest();
int ans = 0;
for(int j = 0;j<logN;j++){
ans *= 2;
ans += A[i*logN + j] - '0';
}
if(ans != (1<<logN) - 1) PutBack(ans);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |