제출 #308224

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308224		tengiz05	곤돌라 (IOI14_gondola)	C++17	20 / 100	13 ms	1536 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int a[N];
int cnt[N*3];
int valid(int n, int inputSeq[]){
	for(int i=0;i<n;i++)a[i] = inputSeq[i];
	int i;
	for(i=0;i<n;i++)cnt[a[i]]++;
	for(i=0;i<N*3;i++)if(cnt[i] > 1)return 0;
	for(i=0;i<n;i++){
		if(a[i] < n)break;
	}if(i == n)return 1;
	int now = a[i];
	for(int j=0;j<n;j++){
		if(a[i] <= n && a[i] != now)return 0;
		now++;
		if(now > n)now = 1;
		i++;
		i%=n;
	}
	return 1;
}

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

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

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10