Submission #1325897

#TimeUsernameProblemLanguageResultExecution timeMemory
1325897crispxxGondola (IOI14_gondola)C++20
20 / 100
31 ms4640 KiB
#include "gondola.h"

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int valid(int n, int s[]) {
	set<int> st(s, s + n);
	
	if( (int)st.size() != n ) return false;
	
	st.clear();
	
	for(int i = 0; i < n; i++) {
		s[i]--;
		
		if(s[i] < n) {
			st.emplace((i - s[i] + n) % n);
		}
	}
	
	return (int)st.size() <= 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...