Submission #219580

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
219580	2020-04-05T16:02:59 Z	mode149256	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	877 ms	294012 KB

boxes

/*input

*/
#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}


long long delivery(int N, int K, int L, int p[]) {
	vl pos(N);
	for (int i = 0; i < N; ++i)
		pos[i] = p[i];

	sort(pos.begin(), pos.end());
	vl isKaires(N);
	vl isDesines(N);

	// isKaires[0] = 0;
	// isDesines[N] = 0;

	auto disK = [&](int i) {
		return pos[i] + min(pos[i], L - pos[i]);
	};

	auto disD = [&](int i) {
		return L - pos[i] + min(pos[i], L - pos[i]);
	};

	{
		for (int i = 0; i < N; ++i)
			isKaires[i] = (i - K < 0 ? 0 : isKaires[i - K]) + disK(i);

		for (int i = N - 1; i >= 0; i--)
			isDesines[i] = (i + K >= N ? 0 : isDesines[i + K]) + disD(i);
	}

	// print(pos      , "position:  ");
	// print(isKaires , "isKaires:  ");
	// print(isDesines, "isDesines: ");

	ll ats = 1e17;
	for (int i = -1; i < N; ++i)
	{
		ats = min(ats, (i >= 0 ? isKaires[i] : 0) + (i + 1 < N ? isDesines[i + 1] : 0));
		// if (i) ats = min(ats, isKaires[i - 1] + isDesines[N - i]);
	}

	// printf("%lld\n", ats);
	return ats;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	304 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	128 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	304 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	128 KB	Output is correct
22	Correct	5 ms	256 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	512 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	304 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	128 KB	Output is correct
22	Correct	5 ms	256 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	512 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	89 ms	37368 KB	Output is correct
34	Correct	50 ms	29688 KB	Output is correct
35	Correct	53 ms	30200 KB	Output is correct
36	Correct	85 ms	37500 KB	Output is correct
37	Correct	83 ms	37624 KB	Output is correct
38	Correct	85 ms	37500 KB	Output is correct
39	Correct	84 ms	35984 KB	Output is correct
40	Correct	58 ms	31352 KB	Output is correct
41	Correct	90 ms	37496 KB	Output is correct
42	Correct	60 ms	31736 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	304 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	128 KB	Output is correct
22	Correct	5 ms	256 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	512 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	89 ms	37368 KB	Output is correct
34	Correct	50 ms	29688 KB	Output is correct
35	Correct	53 ms	30200 KB	Output is correct
36	Correct	85 ms	37500 KB	Output is correct
37	Correct	83 ms	37624 KB	Output is correct
38	Correct	85 ms	37500 KB	Output is correct
39	Correct	84 ms	35984 KB	Output is correct
40	Correct	58 ms	31352 KB	Output is correct
41	Correct	90 ms	37496 KB	Output is correct
42	Correct	60 ms	31736 KB	Output is correct
43	Correct	877 ms	290296 KB	Output is correct
44	Correct	458 ms	277496 KB	Output is correct
45	Correct	495 ms	278648 KB	Output is correct
46	Correct	796 ms	290040 KB	Output is correct
47	Correct	801 ms	289724 KB	Output is correct
48	Correct	798 ms	289764 KB	Output is correct
49	Correct	828 ms	287480 KB	Output is correct
50	Correct	538 ms	292984 KB	Output is correct
51	Correct	861 ms	289400 KB	Output is correct
52	Correct	563 ms	294012 KB	Output is correct

Submission #219580

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 30.0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
30.0 / 30.0