oj.uz

Submission #296152

# Submission time Handle Problem Language Result Execution time Memory
296152 2020-09-10T10:55:54 Z RealSuperman1 Shortcut (IOI16_shortcut) C++14
0 / 100
 1 ms 384 KB 
#pragma GCC optimize("Ofast")
 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pll pair<long long, long long>
#define pii pair<int, int>
 
#include "shortcut.h"
 
using namespace std;
 
const ll INF = 1e18;
 
ll case123(int n, vector <int> l1, vector <int> d1, int c1) {
	ll ans = INF, c = 1ll * c1;
	vector <ll> p(n), d(n), l(n);
	for (int i = 0; i < n; i++)
		d[i] = d1[i] * 1ll;
	for (int i = 0; i < n; i++)
		l[i] = l1[i] * 1ll;
	p[0] = 0;
	for (int i = 1; i < n; i++)
		p[i] = p[i - 1] + l[i - 1];
	for (int i = 0; i < n - 1; i++) {
		for (int j = i + 1; j < n; j++) {
			ll maxdist = 0;
			pair<ll, int> mx = {-1, -1};
			int k1 = 0;
			for (int t1 = 0; t1 < n; t1++) {
				if (t1 == k1)
					continue;
				int t, k;
				k = min(t1, k1);
				t = max(t1, k1);
				ll mind;
				mind = p[t] - p[k];
				mind = min(mind, p[max(k, i)] - p[min(k, i)] + c + p[max(t, j)] - p[min(t, j)]);
				maxdist = max(maxdist, mind + d[k] + d[t]);
				mx = max(mx, {mind + d[k] + d[t], t});
			}
//			if (i == 1 && j == 3)
//				cout << mx.fi << " " << mx.se << endl; 
			k1 = mx.se;
			mx = {-1, -1};
			for (int t1 = 0; t1 < n; t1++) {
				if (t1 == k1)
					continue;
				int t, k;
				k = min(t1, k1);
				t = max(t1, k1);
				ll mind;
				mind = p[t] - p[k];
				mind = min(mind, p[max(k, i)] - p[min(k, i)] + c + p[max(t, j)] - p[min(t, j)]);
				maxdist = max(maxdist, mind + d[k] + d[t]);
				mx = max(mx, {mind + d[k] + d[t], t});
			}
			k1 = mx.se;
			mx = {-1, -1};
			for (int t1 = 0; t1 < n; t1++) {
				if (t1 == k1)
					continue;
				int t, k;
				k = min(t1, k1);
				t = max(t1, k1);
				ll mind;
				mind = p[t] - p[k];
				mind = min(mind, p[max(k, i)] - p[min(k, i)] + c + p[max(t, j)] - p[min(t, j)]);
				maxdist = max(maxdist, mind + d[k] + d[t]);
				mx = max(mx, {mind + d[k] + d[t], t});
			}
//			if (i == 1 && j == 3)
//				cout << mx.fi << " " << mx.se << endl;
			ans = min(ans, maxdist);
		}
	}
	return ans;
}
 
ll find_shortcut(int n, vector <int> l, vector <int> d, int c) {
	if (n <= 500)
		return case123(n, l, d, c);
	return 0ll;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 4, 80 is a correct answer
2 Correct 0 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 0 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 0 ms 256 KB n = 2, 3 is a correct answer
7 Correct 0 ms 256 KB n = 3, 29 is a correct answer
8 Correct 0 ms 256 KB n = 2, 3 is a correct answer
9 Correct 1 ms 256 KB n = 2, 3 is a correct answer
10 Correct 0 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 0 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 256 KB n = 10, 7000000000 is a correct answer
20 Incorrect 0 ms 256 KB n = 5, incorrect answer: jury 12 vs contestant 11
21 Halted 0 ms 0 KB -