oj.uz

Submission #250888

# Submission time Handle Problem Language Result Execution time Memory
250888 2020-07-19T10:57:24 Z godwind Gondola (IOI14_gondola) C++14
20 / 100
 41 ms 5248 KB 
#include <iostream>
#include <set>
#include "gondola.h"

using namespace std;

int valid(int n, int a[])
{
	set<int> diff;
	for (int i = 0; i < n; ++i) {
		if (a[i] < 1) return 0;
		diff.insert(a[i]);
	}
	if ((int)diff.size() != n) return 0;
	int pos = -1;
	for (int i = 0; i < n; ++i) {
		if (a[i] <= n) {
			pos = i;
			break;
		}
	}
	if (pos == -1) return 1;
	pos = (pos - a[pos] + 1 + n) % n;
	for (int i = 0; i < n; ++i) {
		int need = i + 1;
		int p = (pos + i) % n;
		if (a[p] <= n && a[p] != need) 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

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 2432 KB Output is correct
7 Correct 31 ms 4216 KB Output is correct
8 Correct 23 ms 4344 KB Output is correct
9 Correct 7 ms 1664 KB Output is correct
10 Correct 29 ms 4992 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 16 ms 2432 KB Output is correct
7 Correct 36 ms 4224 KB Output is correct
8 Correct 25 ms 4352 KB Output is correct
9 Correct 7 ms 1664 KB Output is correct
10 Correct 37 ms 4984 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 20 ms 2304 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 41 ms 5248 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 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 1 ms 384 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 1 ms 384 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 1 ms 256 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 1 ms 256 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 1 ms 384 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 0 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -