제출 #489228

#제출 시각아이디문제언어결과실행 시간메모리
489228ssense선물상자 (IOI15_boxes)C++14
10 / 100
1 ms204 KiB
#include <bits/stdc++.h>
#include "boxes.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int unsigned long long
//#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl

 
long long delivery(int n, int k, int l, int pos[])
{
	ll ans = 0;
	int mx = 0, mn = l;
	for(int i = 0; i < n; i++)
	{
		ans+=min(pos[i], l-pos[i])*2;
		mx = max(mx, pos[i]);
		if(pos[i] != 0)
		{
			mn = min(mn, pos[i]);
		}
	}
	if(k == n)
	{
		if(mn > l/2)
		{
			return (l-mn)*2;
		}
		if(mx < l/2)
		{
			return mx*2;
		}
		return l;
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...