Submission #948511

#	Time	Username	Problem	Language	Result	Execution time	Memory
948511		irmuun	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	448 KiB

boxes

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

ll delivery(int N,int K,int L,int pos[]){
    ll ans=0;
    vector<int>l,r;
    for(int i=0;i<N;i++){
        if(pos[i]<L-pos[i]){
            l.pb(pos[i]);
        }
        else{
            r.pb(L-pos[i]);
        }
    }
    for(int i=K-1;i<(int)l.size();i+=K){
        ans+=l[i]*2;
    }
    for(int i=K-1;i<(int)r.size();i+=K){
        ans+=r[i]*2;
    }
    int left=(int)l.size()%K+(int)r.size()%K;
    int need=(left+K-1)/K;
    ans+=(ll)need*L;
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30