Submission #160673

#	Time	Username	Problem	Language	Result	Execution time	Memory
160673		GioChkhaidze	곤돌라 (IOI14_gondola)	C++14	25 / 100	15 ms	760 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

bool f[250003];

int valid(int n, int inputSeq[])
{
	int idx=0;
	
	for (int i=0; i<n; i++) 
		if (!f[inputSeq[i]]) f[inputSeq[i]]=1;
			else return 0;
	
	for (int i=0; i<n; i++) {
		if (inputSeq[i]<=n) {
			idx=i;
			break;
		}
	}
	
	int x=inputSeq[idx];
	for (int i=idx+1; ; i++) {
		x++;
		if (x>n) x-=n;
		if (i==n) i-=n;
		if (i==idx) break;
		if (inputSeq[i]<=n && inputSeq[i]!=x) return 0;
	}
		
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int l=0,M=0;
	
	for (int i=0; i<n; i++) {
		f[gondolaSeq[i]]=1;
		M=max(M,gondolaSeq[i]);
	}
	
	for (int i=1; i<=n; i++) 
		if (!f[i]) replacementSeq[l++]=i;
	
	for (int i=n+1; i<=M; i++) 
		if (!f[i]) replacementSeq[l++]=i;
	
   return l;
}

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

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