Submission #1266098

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266098		scalifrastico_098	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	324 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
    long long kact=k, y=0, po=k, dist=0, dist1=0; vector<long long> a, b;
    for(long long i=0; i<n; i++){if(p[i]==0) continue; if(p[i]<=l/2){a.push_back(p[i]);} else b.push_back(l-p[i]);}
    sort(a.begin(), a.end()); sort(b.begin(), b.end()); if(a.size()>0)dist=a.size()-1; if(b.size()>0)dist1=b.size()-1;
    for(long long i=dist; i>=0; i-=k)
    {
        y+=(2*a[i]); 
    }
    for(long long i=dist1; i>=0; i-=k)
    {
        y+=(2*(b[i])); 
    }
    return y;
}

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