제출 #673727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673727		Hacv16	선물상자 (IOI15_boxes)	C++17	0 / 100	1 ms	212 KiB

boxes

#include<bits/stdc++.h>
using namespace std;

const int INF = 0x3f3f3f3f;

typedef long long ll;

ll getDist(ll x, ll y, ll l){
	if(y > x) swap(x, y);
	return min(x - y, l - x + y);
}

ll delivery(int n, int k, int l, int p[]){
	ll ans = 0;

	if(k == 1){
		for(int i = 0; i < n; i++)
			ans += getDist(0, p[i], l);

	}else if(k == n){
		ans = INF;
		ll mn = p[0], mx = p[n - 1];

		ans = min(ans, getDist(0, mx, l) + getDist(mx, mn, l) + getDist(mn, 0, l));
		ans = min(ans, getDist(0, mn, l) + getDist(mn, mx, l) + getDist(mx, 0, l));
	}

	return ans;
}

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