Submission #164981

#TimeUsernameProblemLanguageResultExecution timeMemory
164981kostia244Gondola (IOI14_gondola)C++17
10 / 100
17 ms2288 KiB
#include "gondola.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<int>;
int valid(int n, int a[])
{
	vi v;
	int x = n+1;
	for(int i = 0; i < n; i++) {
		if(a[i]<=n)
			v.pb(a[i]), x = min(x, a[i]);
	}
	if(v.size()<3) return 1;
	int i = 0;
	while(v[i] != x) v.pb(v[i++]);
	return is_sorted(v.begin()+i, v.end());
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...