oj.uz

답안 #18826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18826 2016-02-15T22:32:09 Z ggoh 최후의 만찬 (IOI12_supper) C++
0 / 100
 92 ms 5492 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;
    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;
        }
    }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 608 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 1080 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 57 ms 4196 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 4496 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 4888 KB Output isn't correct - not an optimal way
2 Incorrect 67 ms 5192 KB Output isn't correct - not an optimal way
3 Incorrect 66 ms 5356 KB Output isn't correct - not an optimal way
4 Incorrect 76 ms 5456 KB Output isn't correct - not an optimal way
5 Incorrect 92 ms 5472 KB Output isn't correct - not an optimal way
6 Incorrect 67 ms 5472 KB Output isn't correct - not an optimal way
7 Incorrect 84 ms 5472 KB Output isn't correct - not an optimal way
8 Incorrect 82 ms 5476 KB Output isn't correct - not an optimal way
9 Incorrect 67 ms 5480 KB Output isn't correct - not an optimal way
10 Correct 92 ms 5492 KB Output is correct - 125000 bits used