oj.uz

Submission #166742

# Submission time Handle Problem Language Result Execution time Memory
166742 2019-12-03T14:52:28 Z alanhpereira Gondola (IOI14_gondola) C++11
20 / 100
 16 ms 2140 KB 
#include "gondola.h"
#define MAX 250050

int used[MAX];

int valid(int n, int inputSeq[]) {
	for (int i = 0; i < MAX; i++)
		used[i] = 0;
	int basePos = -1, base = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			if (basePos == -1) {
				basePos = i;
				base = inputSeq[i];
			}
			else {
				if (inputSeq[i] != (i - basePos + base - 1) % n + 1)
					return 0;
			}
		}
		else {
			if (used[inputSeq[i]]) return 0;
			used[inputSeq[i]] = 1;
		}
	}
	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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1276 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 7 ms 1656 KB Output is correct
7 Correct 14 ms 1912 KB Output is correct
8 Correct 12 ms 1784 KB Output is correct
9 Correct 6 ms 1528 KB Output is correct
10 Correct 13 ms 1912 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 7 ms 1528 KB Output is correct
7 Correct 14 ms 1784 KB Output is correct
8 Correct 12 ms 1656 KB Output is correct
9 Correct 16 ms 1528 KB Output is correct
10 Correct 15 ms 1788 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1400 KB Output is correct
13 Correct 8 ms 1788 KB Output is correct
14 Correct 3 ms 1276 KB Output is correct
15 Correct 15 ms 2140 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 388 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -