Submission #679141

#	Time	Username	Problem	Language	Result	Execution time	Memory
679141		mseebacher	Gondola (IOI14_gondola)	C++17	0 / 100	1 ms	308 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
 
 
int valid(int n,int in[]){
	map<int,bool> m;
	m.insert({in[0],1});
	for(int i = 1;i<n;i++){
		if(in[i-1]+1 == in[i] || in[i] > n) continue;
		if(in[i-1] == n && in[i] == 1) continue;
		if(!m[in[i]]){
			m.insert({in[i],1});
			continue;
		}
		return false;
	}
	return true;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{ return 0;}
 
int countReplacement(int n, int inputSeq[])
{return 0;}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 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