Submission #672146

#	Time	Username	Problem	Language	Result	Execution time	Memory
672146		mseebacher	Gondola (IOI14_gondola)	C++17	10 / 100	28 ms	4492 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
#define MAXI (int)1e5
int valid(int n,int inputSeq[]){
	map<int,bool> m;
	int last = -1;
	for(int i = 0;i<n;i++){
		if(m[inputSeq[i]]){
			return 0;
		}else{
			m.insert({inputSeq[i],1});
			if(last == -1){
				if(inputSeq[i] < n){
					last = inputSeq[i];
				}
				if(inputSeq[i] == n) last = 0;
			}else{
				if(inputSeq[i] != last+1){
					return 0;
				}else{
					if(inputSeq[i] == n){
						last = 0;
					}
					if(inputSeq[i] < n) last = inputSeq[i];
				}
			}
		}
	}
	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: 0 / 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