oj.uz

답안 #69666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69666 2018-08-21T11:16:36 Z E869120 곤돌라 (IOI14_gondola) C++14
20 / 100
 19 ms 2660 KB 
#include "gondola.h"
#include <vector>
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[])
{
  return -2;
}

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

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1424 KB Output is correct
2 Correct 3 ms 1484 KB Output is correct
3 Correct 4 ms 1484 KB Output is correct
4 Correct 3 ms 1484 KB Output is correct
5 Correct 3 ms 1544 KB Output is correct
6 Correct 10 ms 1560 KB Output is correct
7 Correct 19 ms 1816 KB Output is correct
8 Correct 14 ms 1816 KB Output is correct
9 Correct 7 ms 1816 KB Output is correct
10 Correct 18 ms 1816 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2660 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 2660 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 2660 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 2660 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -