Submission #484726

#TimeUsernameProblemLanguageResultExecution timeMemory
484726imachugBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms204 KiB
#include "boxes.h"

#include <bits/stdc++.h>

using namespace std;


long long delivery(int n, int k, int l, int p[]) {
	if(k == 1) {
		long long ans = 0;
		for(int i = 0; i < n; i++) {
			ans += min(p[i] * 2, (l - p[i]) * 2);
		}
		return ans;
	}

	if(k == n) {
		return min({p[n - 1] * 2, (l - p[0]) * 2, l});
	}

	return 0;
}
#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...