제출 #433738

#제출 시각아이디문제언어결과실행 시간메모리
433738medmdg곤돌라 (IOI14_gondola)C++14
55 / 100
23 ms2564 KiB
#include<bits/stdc++.h> #include "gondola.h" #define ll long long using namespace std; int valid(int n, int inputSeq[]) { int h=1; for(int i=1;i<n;i++){ if(inputSeq[i]!=(inputSeq[i-1]%n+1)) h=0; } return h; } int replacement(int n, int gs[], int rs[]) { vector<pair<ll,ll> > fi(n); fi[0]=make_pair(-1,-1); for(int i=0;i<n;i++){ if(gs[i]<=n){ for(int j=i;j<i+n;j++){ fi[j%n]=make_pair(-gs[j%n],(gs[i]-1+(j-i))%n+1); } break; } } ll pt=0; if(fi[0].second==-1) for(int i=0;i<n;i++){ fi[i]=make_pair(-gs[i],i+1); } sort(fi.begin(),fi.end()); ll ind=n+1; while(fi.size()){ ll k=fi.size()-1; while(ind<=-fi[k].first){ rs[pt]=fi[k].second; fi[k].second=ind; ind++; pt++; } fi.pop_back(); } return pt; } //---------------------- 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...