Submission #1265730

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265730		scalifrastico_098	선물상자 (IOI15_boxes)	C++20	20 / 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;  vector<int> a; set<int> s; int t=0; a.push_back(0); a.push_back(l); s.insert(0); s.insert(l);
    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()); t=a.size();
    for(int i=0; i<t-1; i++)
    {
        y=min(2*(l-(a[i+1]-a[i])), y);
    }
    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: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30