답안 #55489 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55489	2018-07-07T17:31:13 Z	minkank	전선 연결 (IOI17_wiring)	C++17	100 / 100	108 ms	92580 KB

wiring

#include <bits/stdc++.h>
#include "wiring.h"

using namespace std;

typedef pair<int, int> ii;
#define x first
#define y second

void upd(long long &x, long long y) {
	x = min(x, y);
}

long long min_total_length(vector<int> r, vector<int> b) {
	vector<ii> all;
	for(int i = 0; i < r.size(); ++i)
		all.push_back(ii(r[i], 0));
	for(int i = 0; i < b.size(); ++i)
		all.push_back(ii(b[i], 1));
	sort(all.begin(), all.end());
	vector<long long> sum;
	for(int i = 0; i < all.size(); ++i) {
		sum.push_back(all[i].x);
		if(i) sum[i] += sum[i - 1];
	}
	vector<int> sz; 
	vector<vector<long long> > f;
	for(int i = 0; i < all.size(); ++i) {
		sz.push_back(1);
		while(i + 1 < all.size() && all[i].y == all[i + 1].y) {
			i++;
			sz[sz.size() - 1]++;
		}
		f.push_back(vector<long long>(sz.back() + 5, 1e18));
	}
	f.push_back(vector<long long>(1, 1e18));
	f[0][0] = 0;
	int cur = 0;
	for(int i = 0; i < sz.size(); ++i) {
		for(int j = 0; j < sz[i]; ++j) {
			if(cur - j - 1 >= 0) {
				upd(f[i][j + 1], f[i][j] + all[cur].x - all[cur - j - 1].x);
			}
			if(i != sz.size() - 1) {
				upd(f[i][j + 1], f[i][j] + all[cur - j + sz[i]].x - all[cur].x);
				if(sz[i] - j <= sz[i + 1]) {
					long long sumL = sum[cur - j + sz[i] - 1];
					if(cur) sumL -= sum[cur - 1];
					long long sumR = sum[cur - j + sz[i] + sz[i] - j - 1];
					sumR -= sum[cur - j + sz[i] - 1];
					upd(f[i + 1][sz[i] - j], f[i][j] + sumR - sumL);
				}
			}
			cur++;
		}
		upd(f[i + 1][0], f[i][sz[i]]);
	}
	return f[sz.size()][0];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:16:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < r.size(); ++i)
                 ~~^~~~~~~~~~
wiring.cpp:18:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < b.size(); ++i)
                 ~~^~~~~~~~~~
wiring.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < all.size(); ++i) {
                 ~~^~~~~~~~~~~~
wiring.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < all.size(); ++i) {
                 ~~^~~~~~~~~~~~
wiring.cpp:30:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i + 1 < all.size() && all[i].y == all[i + 1].y) {
         ~~~~~~^~~~~~~~~~~~
wiring.cpp:39:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < sz.size(); ++i) {
                 ~~^~~~~~~~~~~
wiring.cpp:44:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(i != sz.size() - 1) {
       ~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	488 KB	Output is correct
7	Correct	3 ms	488 KB	Output is correct
8	Correct	3 ms	652 KB	Output is correct
9	Correct	2 ms	652 KB	Output is correct
10	Correct	2 ms	652 KB	Output is correct
11	Correct	3 ms	652 KB	Output is correct
12	Correct	2 ms	652 KB	Output is correct
13	Correct	2 ms	652 KB	Output is correct
14	Correct	2 ms	652 KB	Output is correct
15	Correct	3 ms	652 KB	Output is correct
16	Correct	3 ms	748 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	748 KB	Output is correct
2	Correct	3 ms	748 KB	Output is correct
3	Correct	36 ms	5996 KB	Output is correct
4	Correct	52 ms	7460 KB	Output is correct
5	Correct	52 ms	9000 KB	Output is correct
6	Correct	74 ms	11820 KB	Output is correct
7	Correct	47 ms	13724 KB	Output is correct
8	Correct	50 ms	15620 KB	Output is correct
9	Correct	48 ms	17624 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	17624 KB	Output is correct
2	Correct	2 ms	17624 KB	Output is correct
3	Correct	71 ms	22028 KB	Output is correct
4	Correct	83 ms	22528 KB	Output is correct
5	Correct	0 ms	22528 KB	Output is correct
6	Correct	2 ms	22528 KB	Output is correct
7	Correct	2 ms	22528 KB	Output is correct
8	Correct	3 ms	22528 KB	Output is correct
9	Correct	2 ms	22528 KB	Output is correct
10	Correct	3 ms	22528 KB	Output is correct
11	Correct	2 ms	22528 KB	Output is correct
12	Correct	3 ms	22528 KB	Output is correct
13	Correct	2 ms	22528 KB	Output is correct
14	Correct	2 ms	22528 KB	Output is correct
15	Correct	2 ms	22528 KB	Output is correct
16	Correct	3 ms	22528 KB	Output is correct
17	Correct	3 ms	22528 KB	Output is correct
18	Correct	96 ms	25692 KB	Output is correct
19	Correct	98 ms	27644 KB	Output is correct
20	Correct	83 ms	28476 KB	Output is correct
21	Correct	84 ms	31532 KB	Output is correct
22	Correct	83 ms	32796 KB	Output is correct
23	Correct	73 ms	34756 KB	Output is correct
24	Correct	75 ms	36688 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	36688 KB	Output is correct
2	Correct	52 ms	36688 KB	Output is correct
3	Correct	73 ms	36688 KB	Output is correct
4	Correct	67 ms	36688 KB	Output is correct
5	Correct	71 ms	36688 KB	Output is correct
6	Correct	3 ms	36688 KB	Output is correct
7	Correct	2 ms	36688 KB	Output is correct
8	Correct	2 ms	36688 KB	Output is correct
9	Correct	2 ms	36688 KB	Output is correct
10	Correct	3 ms	36688 KB	Output is correct
11	Correct	2 ms	36688 KB	Output is correct
12	Correct	3 ms	36688 KB	Output is correct
13	Correct	2 ms	36688 KB	Output is correct
14	Correct	3 ms	36688 KB	Output is correct
15	Correct	2 ms	36688 KB	Output is correct
16	Correct	2 ms	36688 KB	Output is correct
17	Correct	2 ms	36688 KB	Output is correct
18	Correct	70 ms	36688 KB	Output is correct
19	Correct	66 ms	36688 KB	Output is correct
20	Correct	51 ms	36688 KB	Output is correct
21	Correct	62 ms	36688 KB	Output is correct
22	Correct	65 ms	38052 KB	Output is correct
23	Correct	60 ms	39072 KB	Output is correct
24	Correct	57 ms	40456 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	488 KB	Output is correct
7	Correct	3 ms	488 KB	Output is correct
8	Correct	3 ms	652 KB	Output is correct
9	Correct	2 ms	652 KB	Output is correct
10	Correct	2 ms	652 KB	Output is correct
11	Correct	3 ms	652 KB	Output is correct
12	Correct	2 ms	652 KB	Output is correct
13	Correct	2 ms	652 KB	Output is correct
14	Correct	2 ms	652 KB	Output is correct
15	Correct	3 ms	652 KB	Output is correct
16	Correct	3 ms	748 KB	Output is correct
17	Correct	2 ms	748 KB	Output is correct
18	Correct	3 ms	748 KB	Output is correct
19	Correct	36 ms	5996 KB	Output is correct
20	Correct	52 ms	7460 KB	Output is correct
21	Correct	52 ms	9000 KB	Output is correct
22	Correct	74 ms	11820 KB	Output is correct
23	Correct	47 ms	13724 KB	Output is correct
24	Correct	50 ms	15620 KB	Output is correct
25	Correct	48 ms	17624 KB	Output is correct
26	Correct	2 ms	17624 KB	Output is correct
27	Correct	2 ms	17624 KB	Output is correct
28	Correct	71 ms	22028 KB	Output is correct
29	Correct	83 ms	22528 KB	Output is correct
30	Correct	0 ms	22528 KB	Output is correct
31	Correct	2 ms	22528 KB	Output is correct
32	Correct	2 ms	22528 KB	Output is correct
33	Correct	3 ms	22528 KB	Output is correct
34	Correct	2 ms	22528 KB	Output is correct
35	Correct	3 ms	22528 KB	Output is correct
36	Correct	2 ms	22528 KB	Output is correct
37	Correct	3 ms	22528 KB	Output is correct
38	Correct	2 ms	22528 KB	Output is correct
39	Correct	2 ms	22528 KB	Output is correct
40	Correct	2 ms	22528 KB	Output is correct
41	Correct	3 ms	22528 KB	Output is correct
42	Correct	3 ms	22528 KB	Output is correct
43	Correct	96 ms	25692 KB	Output is correct
44	Correct	98 ms	27644 KB	Output is correct
45	Correct	83 ms	28476 KB	Output is correct
46	Correct	84 ms	31532 KB	Output is correct
47	Correct	83 ms	32796 KB	Output is correct
48	Correct	73 ms	34756 KB	Output is correct
49	Correct	75 ms	36688 KB	Output is correct
50	Correct	2 ms	36688 KB	Output is correct
51	Correct	52 ms	36688 KB	Output is correct
52	Correct	73 ms	36688 KB	Output is correct
53	Correct	67 ms	36688 KB	Output is correct
54	Correct	71 ms	36688 KB	Output is correct
55	Correct	3 ms	36688 KB	Output is correct
56	Correct	2 ms	36688 KB	Output is correct
57	Correct	2 ms	36688 KB	Output is correct
58	Correct	2 ms	36688 KB	Output is correct
59	Correct	3 ms	36688 KB	Output is correct
60	Correct	2 ms	36688 KB	Output is correct
61	Correct	3 ms	36688 KB	Output is correct
62	Correct	2 ms	36688 KB	Output is correct
63	Correct	3 ms	36688 KB	Output is correct
64	Correct	2 ms	36688 KB	Output is correct
65	Correct	2 ms	36688 KB	Output is correct
66	Correct	2 ms	36688 KB	Output is correct
67	Correct	70 ms	36688 KB	Output is correct
68	Correct	66 ms	36688 KB	Output is correct
69	Correct	51 ms	36688 KB	Output is correct
70	Correct	62 ms	36688 KB	Output is correct
71	Correct	65 ms	38052 KB	Output is correct
72	Correct	60 ms	39072 KB	Output is correct
73	Correct	57 ms	40456 KB	Output is correct
74	Correct	66 ms	42376 KB	Output is correct
75	Correct	67 ms	43912 KB	Output is correct
76	Correct	71 ms	45868 KB	Output is correct
77	Correct	80 ms	47300 KB	Output is correct
78	Correct	69 ms	48560 KB	Output is correct
79	Correct	74 ms	49948 KB	Output is correct
80	Correct	50 ms	51296 KB	Output is correct
81	Correct	60 ms	52772 KB	Output is correct
82	Correct	61 ms	54212 KB	Output is correct
83	Correct	55 ms	55736 KB	Output is correct
84	Correct	72 ms	57692 KB	Output is correct
85	Correct	107 ms	59676 KB	Output is correct
86	Correct	69 ms	61592 KB	Output is correct
87	Correct	80 ms	63500 KB	Output is correct
88	Correct	108 ms	65456 KB	Output is correct
89	Correct	68 ms	67388 KB	Output is correct
90	Correct	79 ms	69412 KB	Output is correct
91	Correct	53 ms	71220 KB	Output is correct
92	Correct	62 ms	73120 KB	Output is correct
93	Correct	67 ms	75140 KB	Output is correct
94	Correct	66 ms	77036 KB	Output is correct
95	Correct	65 ms	79008 KB	Output is correct
96	Correct	55 ms	80948 KB	Output is correct
97	Correct	53 ms	82876 KB	Output is correct
98	Correct	54 ms	84824 KB	Output is correct
99	Correct	54 ms	86760 KB	Output is correct
100	Correct	59 ms	88656 KB	Output is correct
101	Correct	56 ms	90752 KB	Output is correct
102	Correct	62 ms	92580 KB	Output is correct

답안 #55489

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 13.0 / 13.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 45.0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
13.0 / 13.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
45.0 / 45.0