Submission #1363961

#	Time	Username	Problem	Language	Result	Execution time	Memory
1363961		stanirina	Gondola (IOI14_gondola)	C++20	20 / 100	7 ms	1604 KiB

gondola

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

using namespace std;

//int gondolaSequence[100001];
//int replacementSequence[250001];

int valid(int n, int inputSeq[])
{
	vector<int> cnt(250000);
	for(int i=0;i<n;i++)cnt[inputSeq[i]-1]++;
	bool ok=true;
	for(int i=0;i<250000;i++){
		if (cnt[i]>=2)ok=false;
	}
	int prvi=-1;
	for(int i=0;i<250000;i++){
		if(cnt[i]==1){
			prvi=i;
			break;
		}
	}
	if(prvi<n){
		int id=-1;
		for(int i=0;i<n;i++)if(inputSeq[i]-1==prvi)id=i;
		for(int i=0;i<n;i++){
			if(inputSeq[id]-1<n){
				if(inputSeq[id]-1!=prvi)ok=false;
			}
			id++;
			prvi++;
			id%=n;
			prvi%=n;
		}
	}
	
	if(ok)return 1;
	return 0;
}

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