Submission #789920

# Submission time Handle Problem Language Result Execution time Memory
789920 2023-07-22T07:20:41 Z ymm Wiring (IOI17_wiring) C++17
100 / 100
50 ms 11440 KB
#include "wiring.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (long long x = (l); x < (r); ++x)
typedef long long ll;
typedef std::pair<ll,ll> pll;
using namespace std;

const int N = 300010;
ll dp[N], dp2[N];
ll ps[N], ps1[N];

long long min_total_length(std::vector<int> r, std::vector<int> b)
{
	vector<pll> vec;
	for (int x : r)
		vec.push_back({x, -1});
	for (int x : b)
		vec.push_back({x, 1});
	sort(vec.begin(), vec.end());
	int lstB = -1;
	int lstR = -1;
	Loop (i,0,vec.size()) {
		ps[i+1] = ps[i] + vec[i].first;
		ps1[i+1] = ps1[i] + vec[i].second;
	}
	Loop (i,0,vec.size()) {
		auto [x, y] = vec[i];
		int lstC;
		if (y == -1) {
			lstR = i;
			lstC = lstB;
		} else {
			lstB = i;
			lstC = lstR;
		}
		if (lstC == -1) {
			dp[i+1] = 1e17;
			continue;
		}
		dp[i+1] = dp[i] + x - vec[lstC].first;
		int cnt = i - lstC;
		if (cnt == 1) {
			int cnt2 = 0;
			for (int j = i-1; j >= 0 && vec[j].second != vec[i].second; --j) {
				++cnt2;
				ll dard = x * (i-j) - abs(ps[i] - ps[j]) + dp[j];
				ll marg = x * (i-j) - abs(ps[i] - ps[j]) + dp[j+1];
				dp2[j] = min(dard, marg);
			}
			for (int j = i-cnt2; j < i-1; ++j)
				dp2[j+1] = min(dp2[j+1], dp2[j]);
		}
		if (i+1 - 2*cnt >= 0 && abs(ps1[i-cnt+1] - ps1[i-2*cnt+1]) == cnt) {
			ll dard = (ps[i+1] - ps[lstC+1]) - vec[lstC+1].first * cnt;
			dard += dp2[i - 2*cnt + 1];
			dp[i+1] = min(dp[i+1], dard);
		}
	}
	return dp[vec.size()];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:3:47: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (long long x = (l); x < (r); ++x)
      |                                               ^
wiring.cpp:22:2: note: in expansion of macro 'Loop'
   22 |  Loop (i,0,vec.size()) {
      |  ^~~~
wiring.cpp:3:47: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (long long x = (l); x < (r); ++x)
      |                                               ^
wiring.cpp:26:2: note: in expansion of macro 'Loop'
   26 |  Loop (i,0,vec.size()) {
      |  ^~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 21 ms 8180 KB Output is correct
4 Correct 20 ms 8180 KB Output is correct
5 Correct 26 ms 7864 KB Output is correct
6 Correct 26 ms 10544 KB Output is correct
7 Correct 26 ms 10556 KB Output is correct
8 Correct 26 ms 10556 KB Output is correct
9 Correct 26 ms 10620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 39 ms 11312 KB Output is correct
4 Correct 40 ms 11388 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 50 ms 11312 KB Output is correct
19 Correct 39 ms 11252 KB Output is correct
20 Correct 49 ms 11284 KB Output is correct
21 Correct 37 ms 11280 KB Output is correct
22 Correct 43 ms 11300 KB Output is correct
23 Correct 38 ms 11344 KB Output is correct
24 Correct 37 ms 11288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 34 ms 11292 KB Output is correct
3 Correct 36 ms 11284 KB Output is correct
4 Correct 35 ms 11284 KB Output is correct
5 Correct 35 ms 11328 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 31 ms 11192 KB Output is correct
19 Correct 33 ms 11316 KB Output is correct
20 Correct 32 ms 11320 KB Output is correct
21 Correct 30 ms 11284 KB Output is correct
22 Correct 33 ms 11184 KB Output is correct
23 Correct 28 ms 11064 KB Output is correct
24 Correct 28 ms 11192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 21 ms 8180 KB Output is correct
20 Correct 20 ms 8180 KB Output is correct
21 Correct 26 ms 7864 KB Output is correct
22 Correct 26 ms 10544 KB Output is correct
23 Correct 26 ms 10556 KB Output is correct
24 Correct 26 ms 10556 KB Output is correct
25 Correct 26 ms 10620 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 39 ms 11312 KB Output is correct
29 Correct 40 ms 11388 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 50 ms 11312 KB Output is correct
44 Correct 39 ms 11252 KB Output is correct
45 Correct 49 ms 11284 KB Output is correct
46 Correct 37 ms 11280 KB Output is correct
47 Correct 43 ms 11300 KB Output is correct
48 Correct 38 ms 11344 KB Output is correct
49 Correct 37 ms 11288 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 34 ms 11292 KB Output is correct
52 Correct 36 ms 11284 KB Output is correct
53 Correct 35 ms 11284 KB Output is correct
54 Correct 35 ms 11328 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 31 ms 11192 KB Output is correct
68 Correct 33 ms 11316 KB Output is correct
69 Correct 32 ms 11320 KB Output is correct
70 Correct 30 ms 11284 KB Output is correct
71 Correct 33 ms 11184 KB Output is correct
72 Correct 28 ms 11064 KB Output is correct
73 Correct 28 ms 11192 KB Output is correct
74 Correct 28 ms 11324 KB Output is correct
75 Correct 34 ms 11312 KB Output is correct
76 Correct 33 ms 11320 KB Output is correct
77 Correct 32 ms 11284 KB Output is correct
78 Correct 31 ms 11316 KB Output is correct
79 Correct 38 ms 11320 KB Output is correct
80 Correct 28 ms 11324 KB Output is correct
81 Correct 30 ms 11320 KB Output is correct
82 Correct 27 ms 11316 KB Output is correct
83 Correct 28 ms 10800 KB Output is correct
84 Correct 26 ms 10932 KB Output is correct
85 Correct 39 ms 11308 KB Output is correct
86 Correct 28 ms 11108 KB Output is correct
87 Correct 30 ms 11048 KB Output is correct
88 Correct 31 ms 11308 KB Output is correct
89 Correct 29 ms 11304 KB Output is correct
90 Correct 35 ms 11284 KB Output is correct
91 Correct 29 ms 11440 KB Output is correct
92 Correct 31 ms 11308 KB Output is correct
93 Correct 29 ms 11320 KB Output is correct
94 Correct 31 ms 11280 KB Output is correct
95 Correct 33 ms 11292 KB Output is correct
96 Correct 28 ms 11060 KB Output is correct
97 Correct 28 ms 11328 KB Output is correct
98 Correct 35 ms 11284 KB Output is correct
99 Correct 30 ms 11192 KB Output is correct
100 Correct 34 ms 11316 KB Output is correct
101 Correct 30 ms 11320 KB Output is correct
102 Correct 34 ms 11320 KB Output is correct