oj.uz

답안 #8889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
8889 2014-09-23T13:43:24 Z ho94949 곤돌라 (IOI14_gondola) C++
10 / 100
 12 ms 2692 KB 
#include <algorithm>
#include <cstring>
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]){
	bool x[250000];
	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[i]) return 0;
		x[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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2688 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 2688 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 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 2688 KB Output is correct
5 Correct 0 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 12 ms 2684 KB Output is correct
8 Correct 12 ms 2692 KB Output is correct
9 Correct 0 ms 2688 KB Output is correct
10 Correct 12 ms 2684 KB Output is correct

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 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 2692 KB Output is correct
6 Correct 0 ms 2684 KB Output is correct
7 Correct 8 ms 2684 KB Output is correct
8 Correct 12 ms 2688 KB Output is correct
9 Correct 4 ms 2684 KB Output is correct
10 Correct 12 ms 2688 KB Output is correct
11 Incorrect 0 ms 2684 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 -