Submission #382460

#	Time	Username	Problem	Language	Result	Execution time	Memory
382460		Trunkty	Gondola (IOI14_gondola)	C++14	20 / 100	11 ms	1388 KiB

gondola

#include <iostream>
#include <algorithm>
#include <vector>
#include "gondola.h"
using namespace std;
 
int valid(int n, int inputSeq[]){
	bool check[250005];
	for(int i=1;i<250005;i++){
		check[i] = false;
	}
	for(int i=0;i<n;i++){
		if(check[inputSeq[i]]){
			return 0;
		}
		check[inputSeq[i]] = true;
	}
	int ind=0;
	for(int i=0;i<n;i++){
		if(inputSeq[i]<=n){
			ind = i-(inputSeq[i]-1);
			if(ind<0){
				ind += n;
			}
			break;
		}
	}
	int now = 1;
	for(int i=ind;i<n;i++){
		if(inputSeq[i]<=n){
			if(inputSeq[i]!=now){
				return 0;
			}
		}
		now++;
	}
	for(int i=0;i<ind;i++){
		if(inputSeq[i]<=n){
			if(inputSeq[i]!=now){
				return 0;
			}
		}
		now++;
	}
	return 1;
}
 
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	return 0;
}
int countReplacement(int n, int inputSeq[]){
	return 0;
}

• 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