oj.uz

답안 #38692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38692 2018-01-06T08:33:22 Z 14kg 곤돌라 (IOI14_gondola) C++11
25 / 100
 16 ms 3844 KB 
#include "gondola.h"

int n;
int g_num, valid_w[250001], replace_num[100000];

int valid(int _n, int in[]) {
	bool g_check = false;
	
	n = _n;
	for (int i = 0; i < n; i++) {
		if (g_check) {
			g_num = g_num == n ? 1 : g_num + 1;
		}
		if (valid_w[in[i]]) return 0;
		valid_w[in[i]] = i;

		if (in[i] <= n) {
			if (g_check && g_num != in[i]) return 0;
			else if (!g_check) {
				g_check = true, g_num = in[i];
			}
		}
	}
	return 1;
}

int replacement(int _n, int in[], int out[]) {
	int out_len = 0, w, k = _n + 1;

	valid(_n, in);
	for (int i = 0; i < n; i++) {
		g_num = g_num == n ? 1 : g_num + 1;
		replace_num[i] = g_num;
	}
	for (int i = 0; i < n; i++) {
		w = replace_num[i];
		while (k <= in[i]) {
			if (valid_w[k] && valid_w[k]!=i) out[out_len++] = k++;
			else {
				out[out_len++] = w;
				w = k++;
			}
		}
	} return out_len;
}

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3844 KB Output is correct
2 Correct 0 ms 3844 KB Output is correct
3 Correct 0 ms 3844 KB Output is correct
4 Correct 0 ms 3844 KB Output is correct
5 Correct 0 ms 3844 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3844 KB Output is correct
2 Correct 0 ms 3844 KB Output is correct
3 Correct 0 ms 3844 KB Output is correct
4 Correct 0 ms 3844 KB Output is correct
5 Correct 0 ms 3844 KB Output is correct
6 Correct 3 ms 3844 KB Output is correct
7 Correct 16 ms 3844 KB Output is correct
8 Correct 13 ms 3844 KB Output is correct
9 Correct 3 ms 3844 KB Output is correct
10 Correct 9 ms 3844 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3844 KB Output is correct
2 Correct 0 ms 3844 KB Output is correct
3 Correct 0 ms 3844 KB Output is correct
4 Correct 0 ms 3844 KB Output is correct
5 Correct 0 ms 3844 KB Output is correct
6 Correct 3 ms 3844 KB Output is correct
7 Correct 9 ms 3844 KB Output is correct
8 Correct 6 ms 3844 KB Output is correct
9 Correct 3 ms 3844 KB Output is correct
10 Correct 9 ms 3844 KB Output is correct
11 Correct 0 ms 3844 KB Output is correct
12 Correct 0 ms 3844 KB Output is correct
13 Correct 3 ms 3844 KB Output is correct
14 Correct 0 ms 3844 KB Output is correct
15 Correct 13 ms 3844 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3844 KB Output is correct
2 Correct 0 ms 3844 KB Output is correct
3 Correct 0 ms 3844 KB Output is correct
4 Correct 0 ms 3844 KB Output is correct
5 Correct 0 ms 3844 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3844 KB Output is correct
2 Correct 0 ms 3844 KB Output is correct
3 Correct 0 ms 3844 KB Output is correct
4 Correct 0 ms 3844 KB Output is correct
5 Correct 0 ms 3844 KB Output is correct
6 Correct 0 ms 3844 KB Output is correct
7 Incorrect 0 ms 3844 KB Integer 975 violates the range [1, 974]
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3844 KB Output is correct
2 Correct 0 ms 3844 KB Output is correct
3 Correct 0 ms 3844 KB Output is correct
4 Correct 0 ms 3844 KB Output is correct
5 Correct 0 ms 3844 KB Output is correct
6 Correct 0 ms 3844 KB Output is correct
7 Incorrect 0 ms 3844 KB Integer 975 violates the range [1, 974]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 3844 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 3844 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 3844 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 3844 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -