Submission #415236

#TimeUsernameProblemLanguageResultExecution timeMemory
415236victoriadBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms204 KiB
#include "boxes.h"
#include <vector>
 
using namespace std;
 
int ultimo(int p[],int N,int L){
    int low=0,hi=N-1,r=-1;
    while(low<=hi){
        int m=low+(hi-low);
        if(p[m]<=L/2){
            r=m;
            low=m+1;
        }
        else{
            hi=m-1;
        }
    }
    return r;
}
long long int ans(int r,int K,int N,int p[],int L){
    long long ans=0;
    for(int i=r+1;i<N;i+=K){
        ans+=2*(L-p[i]);
    }
    for(int i=r;i>=0;i-=K){
        ans+=2*p[i];
    }
    return ans;
}
long long delivery(int N, int K, int L, int p[]) {
    int r=ultimo(p,N,L);
    return ans(r,K,N,p,L);
}
#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...