Submission #1280184

#TimeUsernameProblemLanguageResultExecution timeMemory
1280184NurislamGondola (IOI14_gondola)C++20
10 / 100
7 ms1344 KiB
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int n, int in[])
{
	vector<int> a;
	for(int i = 0; i < n; i ++ ) if(in[i] < n)a.push_back(in[i]);
	
	int cnt = 0;
	for(int i = 0; i < a.size(); i ++ ) {
		if(a[i] > a[(i+1)%a.size()]) cnt ++ ;
	};
	return (cnt == 1);
}

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

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...