oj.uz

Submission #167632

# Submission time Handle Problem Language Result Execution time Memory
167632 2019-12-09T07:12:51 Z Eae02 Gondola (IOI14_gondola) C++14
20 / 100
 31 ms 4744 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;

int valid(int n, int inputSeq[]) {
	for (int i = 0; i < n; i++)
		inputSeq[i]--;
	
	unordered_set<int> seen;
	
	int startIdx = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] < n && startIdx == -1) {
			startIdx = i;
		}
		if (seen.count(inputSeq[i]))
			return 0;
		seen.insert(inputSeq[i]);
	}
	if (startIdx == -1) {
		return 1;
	}
	
	seen.clear();
	
	int g = inputSeq[startIdx];
	for (int i = 0; i < n; i++) {
		int idx = (i + startIdx) % n;
		if (inputSeq[idx] < n && inputSeq[idx] != g) {
			return 0;
		}
		g = (g + 1) % n;
	}
	
	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 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 12 ms 2344 KB Output is correct
7 Correct 13 ms 1272 KB Output is correct
8 Correct 22 ms 4128 KB Output is correct
9 Correct 8 ms 1400 KB Output is correct
10 Correct 25 ms 4612 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 12 ms 2344 KB Output is correct
7 Correct 13 ms 1276 KB Output is correct
8 Correct 22 ms 4104 KB Output is correct
9 Correct 8 ms 1400 KB Output is correct
10 Correct 24 ms 4616 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 15 ms 2344 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 31 ms 4744 KB Output is correct

Subtask #4
0 / 5.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 #5
0 / 10.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 #6
0 / 20.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 #7
0 / 5.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 -

Subtask #8
0 / 15.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 #9
0 / 15.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 #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 -