Submission #18827

#TimeUsernameProblemLanguageResultExecution timeMemory
18827ggohLast supper (IOI12_supper)C++98
0 / 100
98 ms5600 KiB
#include "advisor.h"
void ComputeAdvice(int *C, int N, int K, int M)
{
    int L[100002];
    for(int i=0;i<N;i++)L[i]=-1;
    for(int i=0;i<N;i++)L[C[i]]=i;
    for(int i=0;i<K;i++)WriteAdvice((L[i]>=0?0:1));
    for(int i=0;i<N;i++)WriteAdvice((L[C[i]]!=i?0:1));
}
#include "assistant.h"
int sz,del,G[100002],T[100002],c[100002],p,S[100002];
void Assist(unsigned char *A, int N, int K, int R)
{
    for(int i=0;i<N;i++)G[i]=-1;
    for(int i=0;i<K;i++)
    {
        S[i]=G[i]=i;
        c[i]=A[i];
        if(c[i])T[sz++]=i;
    }
    for(int i=0;i<N;i++)
    {
        p=GetRequest();
        if(G[p]!=-1)
        {
            if(A[K+i])c[G[p]]=1,T[sz++]=G[p];
        }
        else
        {
            del=(sz?T[--sz]:0);
            PutBack(S[del]);
            G[S[del]]=-1;
            S[del]=p;
            c[del]=A[K+i];
            G[p]=del;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...