Submission #73252

#TimeUsernameProblemLanguageResultExecution timeMemory
73252TuGSGeReLGondola (IOI14_gondola)C++14
20 / 100
75 ms5612 KiB
#include "gondola.h" #include<bits/stdc++.h> #define ll int #define mp make_pair #define pub push_back #define pob pop_back #define ss second #define ff first #define ext exit(0) using namespace std; ll i,j,z=0,st; vector<ll> v,vc; map<ll,ll>m; int valid(int n, int inputSeq[]) { for(i=0;i<n;i++){ if(m[inputSeq[i]]==1) return 0; m[inputSeq[i]]++; } for(i=0;i<n;i++){ if(inputSeq[i]<n){ st=(i-inputSeq[i]+1+n)%n; for(i=st;i<n;i++) v.pub(inputSeq[i]); for(i=0;i<st;i++) v.pub(inputSeq[i]); for(i=0;i<n;i++){ if(v[i]>n) continue; if(v[i]!=i+1) return 0; } return 1; } } 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...