oj.uz

Submission #126942

# Submission time Handle Problem Language Result Execution time Memory
126942 2019-07-08T16:31:10 Z anayk Gondola (IOI14_gondola) C++14
10 / 100
 13 ms 780 KB 
#include "gondola.h"

int valid(int n, int inputSeq[])
{
	int cons = -n-1;

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

		if(inputSeq[i] > n)
			continue;

		if(cons < 0)
			cons = inputSeq[i];
		else if(cons != inputSeq[i])
			return 0;
	}

	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{

}

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

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

}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:30:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:37:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 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 376 KB Output is correct
4 Correct 2 ms 388 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 13 ms 780 KB Output is correct
8 Correct 10 ms 760 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 12 ms 760 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -