Submission #1005802

#TimeUsernameProblemLanguageResultExecution timeMemory
1005802GrayGondola (IOI14_gondola)C++17
10 / 100
7 ms2136 KiB
#include<bits/stdc++.h> #include "gondola.h" #define ll long long #define ff first #define ss second #define ln "\n" using namespace std; int valid(int n, int inputSeq[]) { vector<ll> sn(n); ll trunk=-1; for (ll i=0; i<n; i++){ if (inputSeq[i]<=n) { sn[i]=inputSeq[i]; trunk=i; } } if (trunk==-1) return 1; ll init = inputSeq[trunk]-1; for (ll i=trunk-1; i>=0; i--){ sn[i]=(--init+n)%n+1; } init=inputSeq[trunk]-1; for (ll i=trunk+1; i<n; i++){ sn[i]=(++init)%n+1; } for (ll i=0; i<n; i++){ if (inputSeq[i]<=n and inputSeq[i]!=sn[i]) 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...