Submission #813081

#	Time	Username	Problem	Language	Result	Execution time	Memory
813081		Kerim	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	212 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[]) {
    vector<int> arr(n+2);
    arr[n+1] = l;
    for (int i = 1; i <= n; i++)
        arr[i] = p[i-1];
    ll answer = 0;
    if (k == 1){//subtask1
        for (int i = 1; i <= n; i++)
            answer += 2LL * min(arr[i], l - arr[i]);
    }
    else if(k == n){//subtask2
        answer = l;
        for (int i = 0; i + 1 <= n; i++)
            answer = min(answer, 2LL * (arr[i] + l - arr[i+1]));
    }
    return answer;
}

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