답안 #1025726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025726 2024-07-17T09:17:35 Z socpite 곤돌라 (IOI14_gondola) C++17
20 / 100
11 ms 1216 KB
#include "gondola.h"

const int maxn = 3e5+5;

bool vis[maxn];

int valid(int n, int inputSeq[])
{
	int dist = -1;
	for(int i = 0; i < n; i++)inputSeq[i]--;
	for(int i = 0; i < n; i++){
		if(vis[inputSeq[i]])return 0;
		vis[inputSeq[i]] = 1;
		if(inputSeq[i] < n){
			int d = (i + n - inputSeq[i])%n;
			if(dist == -1)dist = d;
			else if(dist != d)return 0;
		}
	}
	return 1;
}

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

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

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 7 ms 1112 KB Output is correct
8 Correct 7 ms 952 KB Output is correct
9 Correct 2 ms 480 KB Output is correct
10 Correct 9 ms 1144 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 428 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 5 ms 692 KB Output is correct
7 Correct 6 ms 1216 KB Output is correct
8 Correct 5 ms 1064 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 11 ms 1196 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 6 ms 1112 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -