oj.uz

답안 #781278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781278 2023-07-13T01:52:23 Z GusterGoose27 전선 연결 (IOI17_wiring) C++17
100 / 100
 26 ms 10972 KB 
#include "wiring.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 2e5+5;
const ll inf = 1e18;
ll dp[MAXN][2];
ll pre[MAXN];
int nxt[MAXN]; // next thing of other color
int prv[MAXN]; // previous thing of same color
bool color[MAXN];
int pos[MAXN];
int n;

int _abs(int v) {
	return v < 0 ? -v : v;
}

ll min_total_length(vector<int> r, vector<int> b) {
	n = r.size()+b.size();
	int i = 0;
	int j = 0;
	while (i < r.size() || j < b.size()) {
		if (i == r.size()) {
			color[i+j] = 1;
			pos[i+j] = b[j];
			j++;
			continue;
		}
		if (j == b.size()) {
			color[i+j] = 0;
			pos[i+j] = r[i];
			i++;
			continue;
		}
		if (r[i] < b[j]) {
			color[i+j] = 0;
			pos[i+j] = r[i];
			i++;
			continue;
		}
		color[i+j] = 1;
		pos[i+j] = b[j];
		j++;
	}
	int occ[2];
	occ[0] = n;
	occ[1] = n;
	for (int i = n-1; i >= 0; i--) {
		occ[color[i]] = i;
		nxt[i] = occ[!color[i]];
	}
	bool hot[2];
	hot[0] = hot[1] = 0;
	for (int i = 0; i < n; i++) {
		pre[i] = hot[color[i]] ? pre[i-1] : 0;
		pre[i] += pos[i];
		if (!hot[color[i]]) occ[color[i]] = i;
		prv[i] = occ[color[i]];
		hot[color[i]] = 1;
		hot[!color[i]] = 0;
	}
	dp[n][0] = 0;
	for (int i = n-1; i >= 0; i--) {
		if (nxt[i] == n) {
			dp[i][0] = inf;
			dp[i][1] = pre[n-1]-((color[i-1] == color[i]) ? pre[i-1] : 0)-(ll)pos[prv[i]-1]*(n-i);
			continue;
		}
		int t = nxt[i];
		int cursz = t-i;
		int nxtsz = nxt[t]-t;
		if (cursz == 1) dp[i][0] = dp[t][1];
		else {
				if (cursz <= nxtsz) {
				ll cur_match = pre[2*t-i-2]-pre[t-2]+((color[i-1] == color[i]) ? pre[i-1] : 0);
				dp[i][0] = cur_match+dp[2*t-i-1][1];
			}
			else {
				if (nxtsz == 1) {
					ll match = (ll)pos[t]*(t-i)-pre[t-1]+((color[i-1] == color[i]) ? pre[i-1] : 0);
					dp[i][0] = min(dp[t][0]+match, dp[t+1][0]+match);
				}
				else {
					int num_match = nxtsz-1;
					ll cur_match = pre[t+num_match-1]-pre[t-1]+((color[i-1] == color[i]) ? pre[i-1] : 0)
					+ (ll)pos[t]*(t-i-num_match); // match them all to the leftmost thing
					dp[i][0] = min(dp[nxt[t]-1][0]+cur_match, dp[nxt[t]][0]+cur_match+pos[nxt[t]-1]-pos[t]);
				}
			}
			dp[i][0] = min(dp[i][0], pos[t]-pos[i]+dp[i+1][0]);
		}
		int p = prv[i]-1;
		if (p == -1) continue; // this will never be queried
		dp[i][1] = pos[i]-pos[p]+min(dp[i][0], dp[i+1][0]);
		if (i < t-1) dp[i][1] = min(dp[i][1], pos[i]-pos[p]+dp[i+1][1]);
	}
	return dp[0][0];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:28:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  while (i < r.size() || j < b.size()) {
      |         ~~^~~~~~~~~~
wiring.cpp:28:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  while (i < r.size() || j < b.size()) {
      |                         ~~^~~~~~~~~~
wiring.cpp:29:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   if (i == r.size()) {
      |       ~~^~~~~~~~~~~
wiring.cpp:35:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   if (j == b.size()) {
      |       ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 308 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 20 ms 7372 KB Output is correct
4 Correct 17 ms 7084 KB Output is correct
5 Correct 16 ms 7124 KB Output is correct
6 Correct 22 ms 9352 KB Output is correct
7 Correct 23 ms 9360 KB Output is correct
8 Correct 22 ms 9304 KB Output is correct
9 Correct 23 ms 9288 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 26 ms 9536 KB Output is correct
4 Correct 21 ms 9260 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 312 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 24 ms 9460 KB Output is correct
19 Correct 24 ms 9408 KB Output is correct
20 Correct 22 ms 9404 KB Output is correct
21 Correct 23 ms 9404 KB Output is correct
22 Correct 24 ms 9404 KB Output is correct
23 Correct 24 ms 9468 KB Output is correct
24 Correct 23 ms 9420 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 21 ms 9716 KB Output is correct
3 Correct 19 ms 10300 KB Output is correct
4 Correct 20 ms 10252 KB Output is correct
5 Correct 21 ms 10324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 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 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 19 ms 10300 KB Output is correct
19 Correct 24 ms 10292 KB Output is correct
20 Correct 19 ms 10296 KB Output is correct
21 Correct 20 ms 10304 KB Output is correct
22 Correct 19 ms 10296 KB Output is correct
23 Correct 20 ms 10292 KB Output is correct
24 Correct 19 ms 10300 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 308 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 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 20 ms 7372 KB Output is correct
20 Correct 17 ms 7084 KB Output is correct
21 Correct 16 ms 7124 KB Output is correct
22 Correct 22 ms 9352 KB Output is correct
23 Correct 23 ms 9360 KB Output is correct
24 Correct 22 ms 9304 KB Output is correct
25 Correct 23 ms 9288 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 26 ms 9536 KB Output is correct
29 Correct 21 ms 9260 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 24 ms 9460 KB Output is correct
44 Correct 24 ms 9408 KB Output is correct
45 Correct 22 ms 9404 KB Output is correct
46 Correct 23 ms 9404 KB Output is correct
47 Correct 24 ms 9404 KB Output is correct
48 Correct 24 ms 9468 KB Output is correct
49 Correct 23 ms 9420 KB Output is correct
50 Correct 0 ms 304 KB Output is correct
51 Correct 21 ms 9716 KB Output is correct
52 Correct 19 ms 10300 KB Output is correct
53 Correct 20 ms 10252 KB Output is correct
54 Correct 21 ms 10324 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 284 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 19 ms 10300 KB Output is correct
68 Correct 24 ms 10292 KB Output is correct
69 Correct 19 ms 10296 KB Output is correct
70 Correct 20 ms 10304 KB Output is correct
71 Correct 19 ms 10296 KB Output is correct
72 Correct 20 ms 10292 KB Output is correct
73 Correct 19 ms 10300 KB Output is correct
74 Correct 22 ms 10956 KB Output is correct
75 Correct 20 ms 10692 KB Output is correct
76 Correct 22 ms 10924 KB Output is correct
77 Correct 21 ms 10448 KB Output is correct
78 Correct 19 ms 10436 KB Output is correct
79 Correct 22 ms 10428 KB Output is correct
80 Correct 20 ms 10424 KB Output is correct
81 Correct 20 ms 10424 KB Output is correct
82 Correct 20 ms 10432 KB Output is correct
83 Correct 20 ms 10696 KB Output is correct
84 Correct 22 ms 10972 KB Output is correct
85 Correct 22 ms 10928 KB Output is correct
86 Correct 21 ms 10936 KB Output is correct
87 Correct 22 ms 10936 KB Output is correct
88 Correct 23 ms 10956 KB Output is correct
89 Correct 22 ms 10956 KB Output is correct
90 Correct 23 ms 10956 KB Output is correct
91 Correct 22 ms 10936 KB Output is correct
92 Correct 22 ms 10956 KB Output is correct
93 Correct 22 ms 10956 KB Output is correct
94 Correct 22 ms 10956 KB Output is correct
95 Correct 22 ms 10944 KB Output is correct
96 Correct 21 ms 10940 KB Output is correct
97 Correct 26 ms 10940 KB Output is correct
98 Correct 22 ms 10940 KB Output is correct
99 Correct 21 ms 10936 KB Output is correct
100 Correct 22 ms 10948 KB Output is correct
101 Correct 22 ms 10932 KB Output is correct
102 Correct 22 ms 10964 KB Output is correct