Submission #1301825

#	Time	Username	Problem	Language	Result	Execution time	Memory
1301825		nicolo_010	선물상자 (IOI15_boxes)	C++20	10 / 100	1 ms	644 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

ll delivery(int n, int k, int L, int* pos) {
	ll ans=0;
	int l=0, r=n-1;
	int idx=0;
	while (l <= r) {
		ll costl;
		if (idx <= pos[l]) costl = pos[l]-idx;
		else costl = idx+pos[l];
		ll costr;
		if (idx >= pos[r]) costr = idx-pos[r];
		else costr = idx+L-pos[r];
		//cout << l << " " << r << " " << costl << " " << costr << " " << ans << endl;
		if (costl <= costr) {
			idx = pos[l];
			l++;
			ans += costl;
		}
		else {
			idx = pos[r];
			r--;
			ans += costr;
		}
	}
	ans += min(abs(idx), abs(L-idx));
	return ans;
}

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