Submission #1195673

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195673		madamadam3	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

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

using namespace std;

typedef long long ll;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()

using vi = vector<int>;

// probably binary search?

int n, k, l;
vi p;
vi nxt, prev;

int dist(int p1, int p2) {
    if (p1 <= p2) return p2 - p1;
    else {
        return (l - p1) + p2; 
    }
}

ll delivery(int N, int K, int L, int P[]) {
    n = N, k = K, l = L;
    FOR(i, 0, n) p.pb(P[i]);

    return min(*max_element(all(p)) + dist(*max_element(all(p)), 0), l - *min_element(all(p)) + dist(*min_element(all(p)), 0));
}

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