oj.uz

Submission #218859

# Submission time Handle Problem Language Result Execution time Memory
218859 2020-04-02T21:29:26 Z Kenzo_1114 Gondola (IOI14_gondola) C++17
10 / 100
 18 ms 1536 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100010;

int correct[MAXN];

int valid(int n, int seq[])
{
	int id = 0;
	for(int i = 0; i < n; i++)
		if(seq[i] <= n)
		{	id = i; break;	}

	correct[id] = seq[id];
	for(int i = id + 1; i < n; i++)
	{	
		correct[i] = correct[i - 1] + 1;
		if(correct[i] > n)	correct[i] = 1;
	}

	for(int i = id - 1; i >= 0; i--)
	{
		correct[i] = correct[i + 1] - 1;
		if(correct[i] < 1)	correct[i] = n;
	}

	for(int i = 0; i < n; i++)
		if(seq[i] <= n && correct[i] != seq[i])
			return 0;

	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	return -1;
}

int countReplacement(int n, int inputSeq[])
{
	return -1;
}
/*
int N, SEQ[MAXN];

int main ()
{
	scanf("%d", &N);

	for(int i = 0; i < N; i++)	scanf("%d", &SEQ[i]);

	printf("%d\n", valid(N, SEQ));
}
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 10 ms 768 KB Output is correct
7 Correct 17 ms 1536 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 8 ms 640 KB Output is correct
10 Correct 16 ms 1408 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 18 ms 1536 KB Output is correct
8 Correct 14 ms 1280 KB Output is correct
9 Correct 8 ms 640 KB Output is correct
10 Correct 16 ms 1408 KB Output is correct
11 Incorrect 5 ms 256 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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