oj.uz

답안 #18846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18846 2016-02-16T00:53:44 Z suhgyuho_william 최후의 만찬 (IOI12_supper) C++
0 / 100
 67 ms 3944 KB 
#include "advisor.h"
void ComputeAdvice(int *C, int N, int K, int M) {}

#include "assistant.h"
using namespace std;
int bucket[100010];
bool in[100010];
void Assist(unsigned char *A, int N, int K, int R) {
	int i,t,sum;
    for(i=0; i<K; i++){	in[i] = true; bucket[i] = i; }
	for(i=1; i<=N; i++){
		t = GetRequest();
		if(in[t]) continue;
		sum = 0;
		in[bucket[sum]] = false;
		in[t] = true;
		PutBack(bucket[sum]);
		bucket[sum] = t;
	}
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 2796 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 3024 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 44 ms 3452 KB Output isn't correct - not an optimal way
2 Incorrect 43 ms 3784 KB Output isn't correct - not an optimal way
3 Incorrect 45 ms 3800 KB Output isn't correct - not an optimal way
4 Incorrect 48 ms 3800 KB Output isn't correct - not an optimal way
5 Incorrect 58 ms 3868 KB Output isn't correct - not an optimal way
6 Incorrect 67 ms 3940 KB Output isn't correct - not an optimal way
7 Incorrect 50 ms 3944 KB Output isn't correct - not an optimal way
8 Incorrect 49 ms 3944 KB Output isn't correct - not an optimal way
9 Incorrect 44 ms 3944 KB Output isn't correct - not an optimal way
10 Incorrect 47 ms 3944 KB Output isn't correct - not an optimal way