Submission #813074

#	Time	Username	Problem	Language	Result	Execution time	Memory
813074		Kerim	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	300 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"

using namespace std;

#define ll long long
long long delivery(int n, int k, int l, int p[]) {
    ll answer = LONG_MAX;
    if (k == 1){//subtask1
        for (int i = 0; i < n; i++)
            answer += 2LL * min(p[i], l - p[i]);
    }
    else if(k == n){//subtask2
        answer = l;
        for (int i = 0; i + 1 < n; i++)
            answer = min(answer, 2LL * (p[i] + l - p[i+1]));
    }
    return answer;
}

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