Submission #347159

#TimeUsernameProblemLanguageResultExecution timeMemory
34715979brueGondola (IOI14_gondola)C++14
20 / 100
19 ms2284 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; typedef long long ll; int valid(int n, int arr[]){ vector<int> chk(250001); auto it = min_element(arr, arr+n); rotate(arr, it, arr+n); for(int i=0; i<n; i++){ if(chk[arr[i]]) return 0; chk[arr[i]] = 1; if(arr[i] <= n && i != arr[i]-arr[0]) return 0; } return 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...