oj.uz

Submission #126947

# Submission time Handle Problem Language Result Execution time Memory
126947 2019-07-08T16:46:38 Z anayk Gondola (IOI14_gondola) C++14
20 / 100
 35 ms 4856 KB 
#include <set>

#include "gondola.h"

int valid(int n, int inputSeq[])
{
	int cons = -n-1;
	std::set<int> seq;

	for(int i = 0; i < n; i++)
	{
		seq.insert(inputSeq[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;
	}

	if(seq.size() == n)
		return 1;
	else
		return 0;
}

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

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

}

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

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

}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(seq.size() == n)
     ~~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:38:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:45: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 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 380 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 252 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 15 ms 2424 KB Output is correct
7 Correct 13 ms 1020 KB Output is correct
8 Correct 27 ms 4220 KB Output is correct
9 Correct 9 ms 1528 KB Output is correct
10 Correct 35 ms 4856 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 16 ms 2424 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 28 ms 4344 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 35 ms 4856 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 7 ms 760 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 14 ms 1144 KB Output is correct

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 256 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 376 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 -