#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;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
608 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
1080 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
58 ms |
3972 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
4304 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
69 ms |
4912 KB |
Output isn't correct - not an optimal way |
2 |
Incorrect |
100 ms |
5232 KB |
Output isn't correct - not an optimal way |
3 |
Incorrect |
70 ms |
5356 KB |
Output isn't correct - not an optimal way |
4 |
Incorrect |
73 ms |
5440 KB |
Output isn't correct - not an optimal way |
5 |
Incorrect |
72 ms |
5440 KB |
Output isn't correct - not an optimal way |
6 |
Incorrect |
76 ms |
5460 KB |
Output isn't correct - not an optimal way |
7 |
Incorrect |
76 ms |
5480 KB |
Output isn't correct - not an optimal way |
8 |
Incorrect |
81 ms |
5480 KB |
Output isn't correct - not an optimal way |
9 |
Incorrect |
75 ms |
5480 KB |
Output isn't correct - not an optimal way |
10 |
Correct |
66 ms |
5480 KB |
Output is correct - 125000 bits used |