| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 18845 | suhgyuho_william | 최후의 만찬 (IOI12_supper) | C++98 | 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 <stdio.h>
#include "advisor.h"
#include <queue>
#include <vector>
#include <stdlib.h>
using namespace std;
int ans[100010],tc[100010];
bool check[100010];
#define pp pair<int,pair<int,int> >
priority_queue<pp> q;
int next[100010];
vector<int> paint[100010];
void ComputeAdvice(int *C, int N, int K, int M) {
int i,j;
int t,cnt;
pp top;
for(i=0; i<N; i++) tc[i] = C[i];
for(i=N; i>=1; i--) C[i] = C[i-1];
t = 2; cnt = 1;
while(true){
if(t-1 >= K-1) break;
cnt++;
t *= 2;
}
for(i=1; i<=N; i++){
if(check[C[i]] == false && C[i] < K){
check[C[i]] = true;
q.push(make_pair(i,make_pair(C[i],C[i])));
}
paint[C[i]].push_back(i);
}
for(i=0; i<K; i++){
if(check[i]) continue;
check[i] = true;
q.push(make_pair(999999999,make_pair(i,i)));
}
for(i=0; i<N; i++){
t = paint[i].size();
for(j=0; j<t-1; j++){
next[paint[i][j]] = paint[i][j+1];
}
if(t != 0){
next[paint[i][t-1]] = 999999999;
}
}
for(i=1; i<=N; i++){
t = C[i];
if(check[t]){
ans[i] = 999999999;
continue;
}
top = q.top();
q.pop();
ans[i] = top.second.second;
check[top.second.first] = false;
check[t] = true;
q.push(make_pair(next[i],make_pair(t,top.second.second)));
}
for(i=1; i<=N; i++){
if(ans[i] == 999999999) continue;
t = ans[i];
for(j=1; j<=cnt; j++){
//WriteAdvice(t%2);
t /= 2;
}
}
for(i=0; i<N; i++) C[i] = tc[i];
}
#include "assistant.h"
#include <stdio.h>
#include <queue>
#include <vector>
#include <stdlib.h>
using namespace std;
int a[100010];
int change[100010];
int bucket[100010];
bool in[100010];
void Assist(unsigned char *A, int N, int K, int R) {
int i,j;
int t,cnt;
int sum,rear;
for(i=R; i>=1; i--) A[i] = A[i-1];
t = 2; cnt = 1;
while(true){
if(t-1 >= K-1) break;
cnt++;
t *= 2;
}
for(i=0; i<K; i++){
in[i] = true;
bucket[i] = i;
}
rear = 0;
for(i=0; i<K; i++) bucket[i] = i;
for(i=1; i<=N; i++){
a[i] = GetRequest();
if(in[a[i]]) continue;
t = 1; sum = 0;
/*for(j=rear+1; j<=rear+cnt; j++){
sum += (t*A[j]);
t *= 2;
}*/
sum = 0;
in[bucket[sum]] = false;
in[a[i]] = true;
PutBack(bucket[sum]);
bucket[sum] = a[i];
rear += cnt;
}
}