Submission #399814

#TimeUsernameProblemLanguageResultExecution timeMemory
399814Jasiekstrz곤돌라 (IOI14_gondola)C++17
20 / 100
47 ms5116 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; void rot(int n,int inputSeq[]) { int gmn=0; for(int i=0;i<n;i++) { if(inputSeq[i]<inputSeq[gmn]) gmn=i; } rotate(inputSeq,inputSeq+gmn,inputSeq+n); return; } int valid(int n,int inputSeq[]) { set<int> vis; for(int i=0;i<n;i++) { if(vis.find(inputSeq[i])!=vis.end()) return 0; vis.insert(inputSeq[i]); } rot(n,inputSeq); for(int i=0;i<n;i++) { if(inputSeq[i]<=n && inputSeq[i]!=inputSeq[0]+i) return 0; } return 1; } //---------------------- int replacement(int n,int gondolaSeq[],int replacementSeq[]) { return 0; } //---------------------- int countReplacement(int n,int inputSeq[]) { return 0; }
#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...