Submission #1265704

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265704		scalifrastico_098	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	0 ms	328 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 m=0; int y=l, u=INT_MAX;  vector<int> a; a.reserve(n); a.push_back(0);  set<int> s; 
    for(int i=0;i<n; i++){int uo=s.size();s.insert(p[i]); if(s.size()!=uo) a.push_back(p[i]);} sort(a.begin(), a.end());  
    for(int i=0; i<n; i++)
    {
        y=min(min(2*(l-(a[i]-a[i+1])), y), 2*(a[i]+(l-a[i])));
    }
    for(long long i=0; i<n; i++)
    {
        m+=2*(min(p[i], l-p[i]));
    }
    if(k==1) return m; return y;
}

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