제출 #434184

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434184		bipartite_matching	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	204 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
#define forint(i, N) for (int i = 0; i < (N); i++)

using namespace std;

typedef long long ll;

ll delivery(int n, int k, int l, int p[]) {
	vector<int> dist(n);

	for (int i = 0; i < n; i++) {
		dist[i] = min(p[i], l - p[i]);
	}

	/*for (auto& i : dist) {
		cerr << i << " ";
	}
	cerr << endl;
	*/
	ll ret = 0;

	int pos = 0;

	int a = 0;

	while (pos < n) {
		if (a != 0) {
			ret += (ll)p[pos] - p[pos - 1];
		}
		else {
			ret += (ll)dist[pos];
		}
		a++;
		//cerr << "ja - " << a << endl;
		if (a == k || (pos < n - 1 && 2 * (p[pos + 1] - p[pos]) > dist[pos] + dist[pos + 1]) || pos == n - 1) {
			ret += (ll)dist[pos];
			a = 0;
		}
		//cerr << pos << " - " << ret << endl;
		pos++;
	}
	return ret;

}

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