제출 #1029410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029410		XJP12	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	448 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll delivery(int n, int k, int L, int positions[]){
	ll l=(ll)L;
	if(k==1){
		ll ans=0;
		for(int i=0; i<n; i++){
			ans+=min(positions[i],L-positions[i])*2;
		}
		return ans;
	}
	if(k==n){
		vi pos;
		set<ll> z;
		for(int i=0; i<n; i++){
			int size=(int)z.size();
			z.insert(positions[i]);
			if((int)z.size()!=size){
				pos.push_back(positions[i]);
			}
		}
		int x = (int)(lower_bound(pos.begin(), pos.end(), l/2) - pos.begin());
		int y = (int)(upper_bound(pos.begin(), pos.end(), l/2) - pos.begin());
		x--;
		long long ans=0;
		ans+=pos[x]*2;
		ans+=(n-pos[y])*2;
		ans=min(l, ans);
		return ans;
	}
	return 0;
}

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