oj.uz

Submission #8890

# Submission time Handle Problem Language Result Execution time Memory
8890 2014-09-23T13:44:06 Z ho94949 Gondola (IOI14_gondola) C++
20 / 100
 12 ms 2692 KB 
#include <algorithm>
#include <cstring>
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]){
	bool x[250010];
	memset(x,sizeof(x),0);
	int firstoffset=-1;
	for(int i=0;i<n;i++){
		if(inputSeq[i]<=n){
			if(firstoffset==-1)
				firstoffset=(inputSeq[i]-i+n)%n;
			else	
				if(firstoffset!=(inputSeq[i]-i+n)%n)
					return 0;
		}
		if(x[inputSeq[i]]) return 0;
		x[inputSeq[i]]=true;
	}
	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 0 ms 2684 KB Output is correct
2 Correct 0 ms 2688 KB Output is correct
3 Correct 0 ms 2688 KB Output is correct
4 Correct 0 ms 2684 KB Output is correct
5 Correct 0 ms 2684 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2688 KB Output is correct
2 Correct 0 ms 2684 KB Output is correct
3 Correct 0 ms 2684 KB Output is correct
4 Correct 0 ms 2684 KB Output is correct
5 Correct 0 ms 2684 KB Output is correct
6 Correct 4 ms 2692 KB Output is correct
7 Correct 12 ms 2688 KB Output is correct
8 Correct 4 ms 2684 KB Output is correct
9 Correct 4 ms 2684 KB Output is correct
10 Correct 12 ms 2688 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2684 KB Output is correct
2 Correct 0 ms 2688 KB Output is correct
3 Correct 0 ms 2684 KB Output is correct
4 Correct 0 ms 2692 KB Output is correct
5 Correct 0 ms 2688 KB Output is correct
6 Correct 4 ms 2684 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 12 ms 2688 KB Output is correct
9 Correct 0 ms 2688 KB Output is correct
10 Correct 12 ms 2688 KB Output is correct
11 Correct 0 ms 2688 KB Output is correct
12 Correct 0 ms 2692 KB Output is correct
13 Correct 4 ms 2684 KB Output is correct
14 Correct 0 ms 2688 KB Output is correct
15 Correct 12 ms 2688 KB Output is correct

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2568 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -