| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 18742 | suhgyuho_william | Last supper (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"
void ComputeAdvice(int *C, int N, int K, int M) {
int i,j;
int t,cnt;
t = cnt = 1;
while(true){
if(t >= N-1) break;
cnt++;
t *= 2;
}
for(i=0; i<N; i++){
t = C[i];
for(j=1; j<=cnt; j++){
WriteAdvice(t%2);
t /= 2;
}
}
}
#include "assistant.h"
#include <stdio.h>
#include <queue>
#include <vector>
#include <stdlib.h>
using namespace std;
int a[100010];
bool check[100010];
#define pp pair<int,int>
priority_queue<pp> q;
int next[100010];
vector<int> color[100010];
void Assist(unsigned char *A, int N, int K, int R) {
int i,j;
int t,cnt;
pp top;
t = cnt = 1;
while(true){
if(t >= N-1) break;
cnt++;
t *= 2;
}
for(i=0; i<N*cnt; i+=cnt){
t = 1;
for(j=0; j<cnt; j++){
a[(i/cnt)+1] += (t*A[i+j]);
t *= 2;
}
}
for(i=1; i<=N; i++){
if(check[a[i]] == false && a[i] < K){
check[a[i]] = true;
q.push(make_pair(i,a[i]));
}
color[a[i]].push_back(i);
}
for(i=0; i<K; i++){
if(check[i]) continue;
check[i] = true;
q.push(make_pair(0,i));
}
for(i=0; i<N; i++){
for(j=0; j<color[i].size()-1; j++){
printf("%d %d\n",color[i][j],color[i][j+1]);
next[color[i][j]] = color[i][j+1];
}
if(color[i].size() != 0){
next[color[i][color[i].size()-1]] = 0;
}
}
for(i=1; i<=N; i++){
t = GetRequest();
if(check[t]) continue;
PutBack(t);
top = q.top();
q.pop();
check[top.second] = false;
check[t] = true;
q.push(make_pair(next[i],t));
}
}