Submission #710464

#	Time	Username	Problem	Language	Result	Execution time	Memory
710464		mseebacher	Gondola (IOI14_gondola)	C++17	20 / 100	30 ms	4504 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n,int a[]){
	int last = 0;
	int index = -1;
	set<int> in;
	for(int i = 0;i<n;i++){
		if(a[i] <= n){
			if(index >= 0){
				int diffIndex = i-index;
				int diffWert = a[i]-last;
				if(diffWert < 0) diffWert += n;
				if(diffIndex != diffWert) return false;
			}
			index = i;
			last = a[i];
		}
		if(in.find(a[i]) != in.end()) return 0;
		in.insert(a[i]);
	}
	return true;
}
 
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