oj.uz

Submission #60486

# Submission time Handle Problem Language Result Execution time Memory
60486 2018-07-24T09:01:20 Z hamzqq9 Gondola (IOI14_gondola) C++14
10 / 100
 26 ms 2000 KB 
#include "gondola.h"


int valid(int n, int inputSeq[]) {

	int fr[250001]={0};

	int fixed=-1;

	for(int i=0;i<n;i++) {

		if(inputSeq[i]<=n) {

			fixed=i;

			break ;

		}

	}

	if(fixed==-1) return 1;

	int tot=2,big=0;

	int cur=inputSeq[fixed];

	for(int i=fixed;(tot-=(i==fixed));i=(i+1)%n,cur++) {

		if(cur>n) cur-=n;

		if(inputSeq[i]>n) {
		
			fr[inputSeq[i]]++;

			big++;

			continue ;
		
		}

		if(inputSeq[i]!=cur) return 0;

	}

	for(int i=n+1;i<=n+big;i++) {

		if(fr[i]!=1) 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 4 ms 1272 KB Output is correct
2 Correct 3 ms 1384 KB Output is correct
3 Correct 3 ms 1440 KB Output is correct
4 Correct 3 ms 1440 KB Output is correct
5 Correct 3 ms 1440 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1540 KB Output is correct
2 Correct 4 ms 1540 KB Output is correct
3 Correct 4 ms 1548 KB Output is correct
4 Correct 3 ms 1616 KB Output is correct
5 Correct 3 ms 1616 KB Output is correct
6 Correct 8 ms 1644 KB Output is correct
7 Correct 26 ms 1900 KB Output is correct
8 Correct 13 ms 1900 KB Output is correct
9 Correct 6 ms 1900 KB Output is correct
10 Correct 22 ms 1900 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1900 KB Output is correct
2 Correct 4 ms 1900 KB Output is correct
3 Correct 3 ms 1900 KB Output is correct
4 Correct 3 ms 1900 KB Output is correct
5 Correct 4 ms 1900 KB Output is correct
6 Correct 12 ms 1900 KB Output is correct
7 Correct 16 ms 1900 KB Output is correct
8 Correct 22 ms 1900 KB Output is correct
9 Correct 7 ms 1900 KB Output is correct
10 Correct 16 ms 1900 KB Output is correct
11 Correct 4 ms 1900 KB Output is correct
12 Correct 5 ms 1900 KB Output is correct
13 Correct 17 ms 2000 KB Output is correct
14 Incorrect 3 ms 2000 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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