답안 #69676 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69676	2018-08-21T11:32:26 Z	E869120	곤돌라 (IOI14_gondola)	C++14	25 / 100	19 ms	1920 KB

gondola

#include "gondola.h"
#include <vector>
#include <algorithm>
using namespace std;

int valid(int n, int inputSeq[]) {
	vector<int>vec(250009, 0);
	for (int i = 0; i < n; i++) vec[inputSeq[i]]++;
	for (int i = 0; i <= 250000; i++) { if (vec[i] >= 2) return 0; }

	for (int i = 0; i < n; i++) { if (inputSeq[i] > n) inputSeq[i] = -1; }
	int v = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] != -1) {
			int z = (inputSeq[i] - i + n) % n;
			if (v == -1) v = z;
			else if (v != z) return 0;
		}
	}
	return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	vector<int>vec(250009, -1);
	int r = -1, maxn = 0;
	for (int i = 0; i < n; i++) {
		maxn = max(maxn, gondolaSeq[i]); vec[gondolaSeq[i]] = i;
		if (gondolaSeq[i] > n) continue;
		if (r == -1) r = (gondolaSeq[i] - i + n) % n;
	}
	if (r == -1) {
		int cnt = 0;
		for (int i = 1; i <= maxn; i++) { if (vec[i] == -1) { replacementSeq[cnt] = i; cnt++; } }
	}
	else {
		vector<int>vec2(n, 0); for (int i = 0; i < n; i++) vec2[i] = gondolaSeq[i];
		for (int i = 0; i < n; i++) { gondolaSeq[i] = (r + i) % n; if (gondolaSeq[i] == 0) gondolaSeq[i] = n; }

		int cnt = 0;
		for (int i = n + 1; i <= maxn; i++) {
			if (vec[i] == -1) {
				while (gondolaSeq[cnt] == vec2[cnt]) cnt++;
				replacementSeq[i - n - 1] = gondolaSeq[cnt];
				gondolaSeq[cnt] = i;
			}
			else {
				replacementSeq[i - n - 1] = gondolaSeq[vec[i]];
				gondolaSeq[vec[i]] = i;
			}
		}
	}
	return maxn - n;
}

//----------------------

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1508 KB	Output is correct
2	Correct	2 ms	1508 KB	Output is correct
3	Correct	4 ms	1508 KB	Output is correct
4	Correct	3 ms	1508 KB	Output is correct
5	Correct	4 ms	1508 KB	Output is correct
6	Correct	9 ms	1636 KB	Output is correct
7	Correct	19 ms	1892 KB	Output is correct
8	Correct	16 ms	1892 KB	Output is correct
9	Correct	6 ms	1892 KB	Output is correct
10	Correct	14 ms	1892 KB	Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1920 KB	Output is correct
2	Correct	3 ms	1920 KB	Output is correct
3	Correct	3 ms	1920 KB	Output is correct
4	Correct	3 ms	1920 KB	Output is correct
5	Correct	3 ms	1920 KB	Output is correct
6	Correct	3 ms	1920 KB	Output is correct
7	Correct	3 ms	1920 KB	Output is correct
8	Incorrect	4 ms	1920 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1920 KB	Output is correct
2	Correct	4 ms	1920 KB	Output is correct
3	Correct	3 ms	1920 KB	Output is correct
4	Correct	4 ms	1920 KB	Output is correct
5	Correct	2 ms	1920 KB	Output is correct
6	Correct	2 ms	1920 KB	Output is correct
7	Correct	3 ms	1920 KB	Output is correct
8	Incorrect	4 ms	1920 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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

답안 #69676

Compilation message