Submission #128099

#	Time	Username	Problem	Language	Result	Execution time	Memory
128099		nxteru	곤돌라 (IOI14_gondola)	C++14	25 / 100	14 ms	1144 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int n,x[100005];
set<int>p;
int valid(int N,int a[]){
	n=N;
	int b=-1,c;
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			if(b!=-1&&(b+i-c)%n+1!=a[i])return 0;
			b=a[i]-1,c=i;
		}else{
			if(p.find(a[i])!=p.end())return 0;
			p.insert(a[i]);
		}
	}
	return 1;
}

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

int replacement(int N, int a[], int r[]){
	n=N;
	if(valid(n,a)==0)return 0;
	int b=0,c=0;
	for(int i=0;i<n;i++)if(a[i]<=n)b=a[i]-1,c=i;
	for(int i=0;i<n;i++){
		x[(c+i)%n]=(b+i)%n+1;
	}
	int d=n+1,k=0;
	for(int i=0;i<n;i++){
		if(a[i]>n){
			while(x[i]<a[i]){
				r[k++]=x[i];
				x[i]=d++;
			}
		}
	}
	return k;
}

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

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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