Submission #640563

#TimeUsernameProblemLanguageResultExecution timeMemory
640563ymmGondola (IOI14_gondola)C++17
20 / 100
34 ms4436 KiB
#include "gondola.h" #include <bits/stdc++.h> #define Loop(x,l,r) for (ll x = (l); x < (r); ++x) #define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x) typedef long long ll; typedef std::pair<int, int> pii; typedef std::pair<ll , ll > pll; using namespace std; int valid(int n, int inputSeq[]) { bool flg = 0; int off; set<int> s; Loop (i,0,n) { if (s.count(inputSeq[i])) return 0; s.insert(inputSeq[i]); if (inputSeq[i] <= n) { if (flg && (inputSeq[i]-1 - i + n) % n != off) return 0; if (!flg) { flg = 1; off = (inputSeq[i]-1 - i + n) % n; } } } 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...