oj.uz

Submission #20794

# Submission time Handle Problem Language Result Execution time Memory
20794 2017-02-16T04:44:08 Z rose0310 Gondola (IOI14_gondola) C++14
10 / 100
 9 ms 3936 KB 
#include "gondola.h"

int valid(int n, int inputSeq[])
{
	int f=1,min=9999999,mini;
	int v[251515]={};
	for(int i=0;i<n;i++){
		if(min>inputSeq[i]) { min=inputSeq[i]; mini=i;}
		if(v[inputSeq[i]]) {f=0; break;}
		v[inputSeq[i]]=1;
	}
	if(min>n) return f;
	mini=(mini-inputSeq[mini]+1+n)%n;
	inputSeq[mini]=1;
	for(int i=mini;i<mini+n-1;i++){
		if(inputSeq[(i+1)%n]>n) inputSeq[(i+1)%n]=inputSeq[(i%n)]+1;
		if(inputSeq[(i+1)%n]>inputSeq[(i%n)]) continue;
		f=0; break;
	}
	int v2[151515]={};
	for(int i=0;i<n;i++){
		if(v2[inputSeq[i]]) {f=0; break;}
		v2[inputSeq[i]]=1;
	}
	return f;
}

//----------------------

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

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:13:26: warning: 'mini' may be used uninitialized in this function [-Wmaybe-uninitialized]
  mini=(mini-inputSeq[mini]+1+n)%n;
                          ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3932 KB Output is correct
2 Correct 0 ms 3936 KB Output is correct
3 Correct 0 ms 3932 KB Output is correct
4 Correct 0 ms 3932 KB Output is correct
5 Correct 0 ms 3932 KB Output is correct
6 Correct 3 ms 3936 KB Output is correct
7 Correct 9 ms 3932 KB Output is correct
8 Correct 9 ms 3932 KB Output is correct
9 Correct 3 ms 3928 KB Output is correct
10 Correct 6 ms 3936 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3932 KB Output is correct
2 Correct 0 ms 3932 KB Output is correct
3 Correct 0 ms 3936 KB Output is correct
4 Correct 0 ms 3932 KB Output is correct
5 Correct 0 ms 3932 KB Output is correct
6 Correct 6 ms 3932 KB Output is correct
7 Correct 9 ms 3936 KB Output is correct
8 Correct 6 ms 3936 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 3 ms 3928 KB Output is correct
11 Correct 0 ms 3932 KB Output is correct
12 Incorrect 0 ms 3932 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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