#include <iostream>
#include <algorithm>
#include "advisor.h"
using namespace std;
long long int maxlen,ans[100005],k,map[100005],in[100005],t[100005],p[100005];
struct node{
long long int road,id;
}now[100005];
struct cmp{
bool operator()(const node &a,const node &b)
{
return a.road<b.road;
}
};
void find(long long int x)
{
for(int i=1;i<=maxlen;i++)
{
char tmp;
if(x%2==0)tmp=0;
else tmp=1;
WriteAdvice(tmp);
//cout<<x%2<<" ";
x/=2;
}
return ;
}
void ComputeAdvice(int *C, int N, int K, int M) {
k=K;
long long int x=1;
while(x<k)
{
x*=2;
maxlen++;
}
for(int i=0;i<N;i++)now[i].road=9999999999999;
for(int i=0;i<N;i++)
{
map[i]=now[C[i]].road;
now[C[i]].road=i;
}
for(int i=0;i<N;i++)p[i]=-1;
for(int i=0;i<K;i++)
{
t[i]=i;
now[i].id=i;
p[i]=i;
push_heap(now,now+i+1,cmp());
}
//for(int i=0;i<K;i++)cout<<now[i].id<<" ";
//cout<<endl;
for(int i=0;i<N;i++)
{
if(p[C[i]]!=-1)
{
now[C[i]].road=map[now[C[i]].road];
continue;
}
else
{
pop_heap(now,now+K,cmp());
p[C[i]]=p[now[K-1].id];
find(p[C[i]]);
p[now[K-1].id]=-1;
now[C[i]].road=map[now[C[i]].road];
now[K-1].id=C[i];
push_heap(now,now+K,cmp());
}
}
}
Compilation message
/tmp/ccUlaOaN.o: In function `main':
assistant_grader.cpp:(.text.startup+0x1ed): undefined reference to `Assist(unsigned char*, int, int, int)'
collect2: error: ld returned 1 exit status
