oj.uz

답안 #1019502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019502 2024-07-11T01:30:54 Z pcc 곤돌라 (IOI14_gondola) C++17
20 / 100
 28 ms 5236 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int arr[]){
	int cen = -1;
	set<int> st;
	for(int i = 0;i<n;i++){
		if(arr[i]<=n)cen = i;
		if(st.find(arr[i]) != st.end())return false;
		st.insert(arr[i]);
	}
	if(cen == -1)return true;
	int c = arr[cen];
	while(cen<n){
		if(arr[cen] != c&&arr[cen]<=n)return false;
		c++;
		if(c>n)c -= n;
		cen++;
	}
	cen = 0;
	while(cen<n){
		if(arr[cen] != c&&arr[cen]<=n)return false;
		c++;
		if(c>n)c -= n;
		cen++;
	}
	return true;
}

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

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 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 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
6 Correct 9 ms 2140 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 17 ms 3832 KB Output is correct
9 Correct 6 ms 1368 KB Output is correct
10 Correct 22 ms 4676 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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
6 Correct 11 ms 2340 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 19 ms 4028 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 22 ms 4484 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 11 ms 2052 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 28 ms 5236 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -