oj.uz

Submission #922594

# Submission time Handle Problem Language Result Execution time Memory
922594 2024-02-05T17:39:39 Z tvladm2009 Wiring (IOI17_wiring) C++17
100 / 100
 79 ms 15820 KB 
#include "wiring.h"
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double;
const string FILENAME = "input";

ll min_total_length(vector<int> r, vector<int> b) {
	vector<int> pos[2];
	pos[0] = r;
	pos[1] = b;
	vector<pair<int, int>> v;
	for (auto x: r) {
		v.pb(mp(x, 0));
	}
	for (auto x: b) {
		v.pb(mp(x, 1));
	}
	sort(all(v));
	vector<ll> dp(sz(v), 1e18);
	map<int, int> mem;
	mem[0] = -1;
	int pr = 0;
	vector<ll> sum[2];
	sum[0].resize(sz(v));
	sum[1].resize(sz(v));
	for (int i = 0; i < sz(v); i++) {
		if (i > 0) {
			sum[0][i] = sum[0][i - 1];
			sum[1][i] = sum[1][i - 1];
		}
		sum[v[i].second][i] += v[i].first;
		if (v[i].second == 1) {
			pr++;
		} else {
			pr--;
		}
		int op = v[i].second ^ 1;
		int ind = lower_bound(all(pos[op]), v[i].first) - pos[op].begin();
		ll close = 1e18;
		for (int d : {ind, ind - 1}) {
			if (0 <= d && d < sz(pos[op])) {
				chkmin(close, (ll)abs(pos[op][d] - v[i].first));
			}
		}
		dp[i] = (i == 0 ? 0 : dp[i - 1]) + close;
		if (mem.count(pr)) {
			int l = mem[pr] + 1;
			ll offset = sum[v[i].second][i] - ((l - 1 >= 0) ? sum[v[i].second][l - 1] : 0);
			offset -= sum[1 - v[i].second][i] - ((l - 1 >= 0) ? sum[1 - v[i].second][l - 1] : 0);
			chkmin(dp[i], offset + ((l - 1 >= 0) ? dp[l - 1] : 0));
		}
		mem[pr] = i;
	}
	return dp.back();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 58 ms 13032 KB Output is correct
4 Correct 62 ms 13416 KB Output is correct
5 Correct 51 ms 12848 KB Output is correct
6 Correct 73 ms 15540 KB Output is correct
7 Correct 70 ms 15556 KB Output is correct
8 Correct 69 ms 15556 KB Output is correct
9 Correct 77 ms 15820 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 62 ms 10948 KB Output is correct
4 Correct 50 ms 10692 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 416 KB Output is correct
18 Correct 63 ms 10944 KB Output is correct
19 Correct 59 ms 10948 KB Output is correct
20 Correct 51 ms 10900 KB Output is correct
21 Correct 61 ms 11020 KB Output is correct
22 Correct 57 ms 11032 KB Output is correct
23 Correct 61 ms 10948 KB Output is correct
24 Correct 60 ms 11204 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 69 ms 11716 KB Output is correct
3 Correct 59 ms 10432 KB Output is correct
4 Correct 64 ms 10692 KB Output is correct
5 Correct 59 ms 10444 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 69 ms 11952 KB Output is correct
19 Correct 59 ms 11076 KB Output is correct
20 Correct 62 ms 10688 KB Output is correct
21 Correct 60 ms 11460 KB Output is correct
22 Correct 73 ms 14020 KB Output is correct
23 Correct 71 ms 14528 KB Output is correct
24 Correct 64 ms 13476 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 432 KB Output is correct
19 Correct 58 ms 13032 KB Output is correct
20 Correct 62 ms 13416 KB Output is correct
21 Correct 51 ms 12848 KB Output is correct
22 Correct 73 ms 15540 KB Output is correct
23 Correct 70 ms 15556 KB Output is correct
24 Correct 69 ms 15556 KB Output is correct
25 Correct 77 ms 15820 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 62 ms 10948 KB Output is correct
29 Correct 50 ms 10692 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 0 ms 436 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 416 KB Output is correct
43 Correct 63 ms 10944 KB Output is correct
44 Correct 59 ms 10948 KB Output is correct
45 Correct 51 ms 10900 KB Output is correct
46 Correct 61 ms 11020 KB Output is correct
47 Correct 57 ms 11032 KB Output is correct
48 Correct 61 ms 10948 KB Output is correct
49 Correct 60 ms 11204 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 69 ms 11716 KB Output is correct
52 Correct 59 ms 10432 KB Output is correct
53 Correct 64 ms 10692 KB Output is correct
54 Correct 59 ms 10444 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 360 KB Output is correct
67 Correct 69 ms 11952 KB Output is correct
68 Correct 59 ms 11076 KB Output is correct
69 Correct 62 ms 10688 KB Output is correct
70 Correct 60 ms 11460 KB Output is correct
71 Correct 73 ms 14020 KB Output is correct
72 Correct 71 ms 14528 KB Output is correct
73 Correct 64 ms 13476 KB Output is correct
74 Correct 68 ms 15044 KB Output is correct
75 Correct 75 ms 13980 KB Output is correct
76 Correct 74 ms 14276 KB Output is correct
77 Correct 66 ms 13252 KB Output is correct
78 Correct 73 ms 13512 KB Output is correct
79 Correct 70 ms 13368 KB Output is correct
80 Correct 65 ms 14180 KB Output is correct
81 Correct 71 ms 14680 KB Output is correct
82 Correct 71 ms 14804 KB Output is correct
83 Correct 70 ms 14516 KB Output is correct
84 Correct 71 ms 15480 KB Output is correct
85 Correct 75 ms 14360 KB Output is correct
86 Correct 65 ms 14276 KB Output is correct
87 Correct 69 ms 14272 KB Output is correct
88 Correct 68 ms 13764 KB Output is correct
89 Correct 66 ms 13828 KB Output is correct
90 Correct 71 ms 13732 KB Output is correct
91 Correct 69 ms 15040 KB Output is correct
92 Correct 69 ms 14020 KB Output is correct
93 Correct 68 ms 14276 KB Output is correct
94 Correct 68 ms 14536 KB Output is correct
95 Correct 67 ms 13508 KB Output is correct
96 Correct 69 ms 14496 KB Output is correct
97 Correct 68 ms 15300 KB Output is correct
98 Correct 69 ms 15040 KB Output is correct
99 Correct 69 ms 15024 KB Output is correct
100 Correct 71 ms 14016 KB Output is correct
101 Correct 70 ms 14788 KB Output is correct
102 Correct 79 ms 14348 KB Output is correct