Submission #1147624

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147624		ChuanChen	Gondola (IOI14_gondola)	C++20	20 / 100	6 ms	644 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
	vector<bool> marc(250'500, false);
	int u = -1;
	for(int i = 0; i < n; i++){
		if(marc[inputSeq[i]]) return 0;
		marc[inputSeq[i]] = true;
	}

	for(int i = 0; i < n; i++) if(inputSeq[i] <= n){
		u = i;
		break;
	}
	if(u == -1) return 1;
	
	int dif = (inputSeq[u]-u+n)%n;
	for(int i = 0; i < n; i++) if(inputSeq[i] <= n){
		if((inputSeq[i]-i+n)%n != dif) return 0;
	}
	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