# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433734 | medmdg | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
int main(){
int arr[100000];
int b[7]={2,3,4,9,6,7,1};
ll a=replacement(7,b,arr);
}