Submission #902774

#TimeUsernameProblemLanguageResultExecution timeMemory
902774Sir_Ahmed_ImranGondola (IOI14_gondola)C++17
20 / 100
11 ms2908 KiB
///~~~LOTA~~~/// #include "gondola.h" #include <bits/stdc++.h> using namespace std; #define nl '\n' #define ff first #define ss second #define ll long long #define append push_back #define pii pair<int,int> #define all(x) (x).begin(),(x).end() #define MAXN 250001 int vis[MAXN]; int valid(int n, int a[]){ for(int i=0;i<n;i++){ if(a[i]>n) continue; vis[a[i]]=1; for(int j=i+1;j<i+n;j++){ if(vis[a[j%n]]) return 0; vis[a[j%n]]=1; if(a[j%n]>n) continue; if(a[j%n]!=1+((a[i]+j-i-1)%n)) return 0; } return 1; } for(int i=0;i<n;i++){ if(vis[a[i]]) return 0; vis[a[i]]=1; } 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...