답안 #18824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18824 2016-02-15T22:30:24 Z ggoh 최후의 만찬 (IOI12_supper) C++
0 / 100
80 ms 5528 KB
#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+1;
    for(int i=0;i<K;i++)WriteAdvice((L[i]+1?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;
        }
    }
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 868 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 1248 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 62 ms 3932 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 4176 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 4768 KB Output isn't correct - not an optimal way
2 Incorrect 72 ms 5100 KB Output isn't correct - not an optimal way
3 Incorrect 71 ms 5188 KB Output isn't correct - not an optimal way
4 Incorrect 78 ms 5244 KB Output isn't correct - not an optimal way
5 Incorrect 76 ms 5336 KB Output isn't correct - not an optimal way
6 Incorrect 71 ms 5424 KB Output isn't correct - not an optimal way
7 Incorrect 68 ms 5424 KB Output isn't correct - not an optimal way
8 Incorrect 80 ms 5476 KB Output isn't correct - not an optimal way
9 Incorrect 71 ms 5528 KB Output isn't correct - not an optimal way
10 Correct 69 ms 5528 KB Output is correct - 125000 bits used