답안 #79117 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
79117	2018-10-11T08:14:53 Z	Plurm	전선 연결 (IOI17_wiring)	C++11	100 / 100	117 ms	97160 KB

wiring

#include "wiring.h"
#include <vector>
#include <algorithm>

using namespace std;
long long min_total_length(vector<int> r, vector<int> b) {
	vector<pair<int,bool> > combined;
	vector<long long> qs;
	for(int x : r){
		combined.emplace_back(x,false);
	}
	for(int x : b){
		combined.emplace_back(x,true);
	}
	sort(combined.begin(),combined.end());
	bool cur = !combined.front().second;
	int clen = -1e9;
	int llen = 0;
	int begin = 0;
	vector<int> lpos;
	lpos.resize(combined.size());
	vector<int> laxis;
	laxis.resize(combined.size());
	for(int i = 0; i < combined.size(); i++){
		if(combined[i].second == cur){
			clen++;
		}else{
			begin = i;
			llen = clen;
			clen = 1;
			cur = !cur;
		}
		lpos[i] = 2*begin-i-1;
		laxis[i] = begin;
		if(lpos[i] < begin-llen){
			lpos[i] = -1;
		}
	}
	qs.push_back((long long)combined.front().first);
	for(int i = 1; i < combined.size(); i++){
		qs.push_back(qs.back() + (long long)combined[i].first);
	}
	vector<long long> dp;
	dp.resize(combined.size());
	dp[0] = 1e18;
	if(combined[0].second){
		auto it = lower_bound(r.begin(),r.end(),combined[0].first);
		if(it != r.begin()) dp[0] = min(dp[0],(long long)combined[0].first - (long long)*(it-1));
		if(it != r.end()) dp[0] = min(dp[0], (long long)*it - (long long)combined[0].first);
	}else{
		auto it = lower_bound(b.begin(),b.end(),combined[0].first);
		if(it != b.begin()) dp[0] = min(dp[0], (long long)combined[0].first - (long long)*(it-1));
		if(it != b.end()) dp[0] = min(dp[0], (long long)*it - (long long)combined[0].first);
	}
	for(int i = 1; i < combined.size(); i++){
		// Case 1: dp[i] = dp[i-1] + abs(pos[i] - pos[j])
		dp[i] = 1e18;
		if(combined[i].second){
			auto it = lower_bound(r.begin(),r.end(),combined[i].first);
			if(it != r.begin())
				dp[i] = min(dp[i],dp[i-1] + (long long)combined[i].first - (long long)*(it-1));
			if(it != r.end())
				dp[i] = min(dp[i],dp[i-1] + (long long)*it - (long long)combined[i].first);
		}else{
			auto it = lower_bound(b.begin(),b.end(),combined[i].first);
			if(it != b.begin())
				dp[i] = min(dp[i],dp[i-1] + (long long)combined[i].first - (long long)*(it-1));
			if(it != b.end())
				dp[i] = min(dp[i],dp[i-1] - (long long)combined[i].first + (long long)*it);
		}
		// Case 2: dp[i] = dp[j] + Distance Differences
		if(lpos[i] == 0){
			dp[i] = min(dp[i],qs[i] - qs[laxis[i]-1] - qs[laxis[i]-1]);
		}else if(lpos[i] != -1){
			dp[i] = min(dp[i],qs[i] - qs[laxis[i]-1] - qs[laxis[i]-1] + qs[lpos[i]-1] + dp[lpos[i]-1]);
		}
	}
	return dp.back();
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:24:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < combined.size(); i++){
                 ~~^~~~~~~~~~~~~~~~~
wiring.cpp:40:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < combined.size(); i++){
                 ~~^~~~~~~~~~~~~~~~~
wiring.cpp:55:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < combined.size(); i++){
                 ~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	500 KB	Output is correct
3	Correct	2 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct
8	Correct	2 ms	508 KB	Output is correct
9	Correct	2 ms	520 KB	Output is correct
10	Correct	2 ms	652 KB	Output is correct
11	Correct	2 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	2 ms	652 KB	Output is correct
16	Correct	2 ms	652 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	652 KB	Output is correct
2	Correct	2 ms	652 KB	Output is correct
3	Correct	41 ms	7152 KB	Output is correct
4	Correct	41 ms	7152 KB	Output is correct
5	Correct	43 ms	7152 KB	Output is correct
6	Correct	56 ms	10476 KB	Output is correct
7	Correct	54 ms	12424 KB	Output is correct
8	Correct	57 ms	14372 KB	Output is correct
9	Correct	54 ms	16480 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	16480 KB	Output is correct
2	Correct	2 ms	16480 KB	Output is correct
3	Correct	79 ms	18300 KB	Output is correct
4	Correct	77 ms	19848 KB	Output is correct
5	Correct	2 ms	19848 KB	Output is correct
6	Correct	2 ms	19848 KB	Output is correct
7	Correct	2 ms	19848 KB	Output is correct
8	Correct	2 ms	19848 KB	Output is correct
9	Correct	2 ms	19848 KB	Output is correct
10	Correct	2 ms	19848 KB	Output is correct
11	Correct	2 ms	19848 KB	Output is correct
12	Correct	2 ms	19848 KB	Output is correct
13	Correct	2 ms	19848 KB	Output is correct
14	Correct	2 ms	19848 KB	Output is correct
15	Correct	2 ms	19848 KB	Output is correct
16	Correct	2 ms	19848 KB	Output is correct
17	Correct	2 ms	19848 KB	Output is correct
18	Correct	81 ms	21988 KB	Output is correct
19	Correct	76 ms	23908 KB	Output is correct
20	Correct	80 ms	25844 KB	Output is correct
21	Correct	77 ms	27784 KB	Output is correct
22	Correct	79 ms	29712 KB	Output is correct
23	Correct	79 ms	31720 KB	Output is correct
24	Correct	77 ms	33608 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	33608 KB	Output is correct
2	Correct	62 ms	33620 KB	Output is correct
3	Correct	68 ms	33620 KB	Output is correct
4	Correct	65 ms	34852 KB	Output is correct
5	Correct	66 ms	36148 KB	Output is correct
6	Correct	2 ms	36148 KB	Output is correct
7	Correct	2 ms	36148 KB	Output is correct
8	Correct	2 ms	36148 KB	Output is correct
9	Correct	2 ms	36148 KB	Output is correct
10	Correct	2 ms	36148 KB	Output is correct
11	Correct	2 ms	36148 KB	Output is correct
12	Correct	2 ms	36148 KB	Output is correct
13	Correct	2 ms	36148 KB	Output is correct
14	Correct	2 ms	36148 KB	Output is correct
15	Correct	2 ms	36148 KB	Output is correct
16	Correct	2 ms	36148 KB	Output is correct
17	Correct	2 ms	36148 KB	Output is correct
18	Correct	80 ms	37472 KB	Output is correct
19	Correct	64 ms	38732 KB	Output is correct
20	Correct	80 ms	39992 KB	Output is correct
21	Correct	70 ms	41272 KB	Output is correct
22	Correct	72 ms	42532 KB	Output is correct
23	Correct	56 ms	43768 KB	Output is correct
24	Correct	71 ms	45044 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	500 KB	Output is correct
3	Correct	2 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	500 KB	Output is correct
8	Correct	2 ms	508 KB	Output is correct
9	Correct	2 ms	520 KB	Output is correct
10	Correct	2 ms	652 KB	Output is correct
11	Correct	2 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	2 ms	652 KB	Output is correct
16	Correct	2 ms	652 KB	Output is correct
17	Correct	2 ms	652 KB	Output is correct
18	Correct	2 ms	652 KB	Output is correct
19	Correct	41 ms	7152 KB	Output is correct
20	Correct	41 ms	7152 KB	Output is correct
21	Correct	43 ms	7152 KB	Output is correct
22	Correct	56 ms	10476 KB	Output is correct
23	Correct	54 ms	12424 KB	Output is correct
24	Correct	57 ms	14372 KB	Output is correct
25	Correct	54 ms	16480 KB	Output is correct
26	Correct	2 ms	16480 KB	Output is correct
27	Correct	2 ms	16480 KB	Output is correct
28	Correct	79 ms	18300 KB	Output is correct
29	Correct	77 ms	19848 KB	Output is correct
30	Correct	2 ms	19848 KB	Output is correct
31	Correct	2 ms	19848 KB	Output is correct
32	Correct	2 ms	19848 KB	Output is correct
33	Correct	2 ms	19848 KB	Output is correct
34	Correct	2 ms	19848 KB	Output is correct
35	Correct	2 ms	19848 KB	Output is correct
36	Correct	2 ms	19848 KB	Output is correct
37	Correct	2 ms	19848 KB	Output is correct
38	Correct	2 ms	19848 KB	Output is correct
39	Correct	2 ms	19848 KB	Output is correct
40	Correct	2 ms	19848 KB	Output is correct
41	Correct	2 ms	19848 KB	Output is correct
42	Correct	2 ms	19848 KB	Output is correct
43	Correct	81 ms	21988 KB	Output is correct
44	Correct	76 ms	23908 KB	Output is correct
45	Correct	80 ms	25844 KB	Output is correct
46	Correct	77 ms	27784 KB	Output is correct
47	Correct	79 ms	29712 KB	Output is correct
48	Correct	79 ms	31720 KB	Output is correct
49	Correct	77 ms	33608 KB	Output is correct
50	Correct	2 ms	33608 KB	Output is correct
51	Correct	62 ms	33620 KB	Output is correct
52	Correct	68 ms	33620 KB	Output is correct
53	Correct	65 ms	34852 KB	Output is correct
54	Correct	66 ms	36148 KB	Output is correct
55	Correct	2 ms	36148 KB	Output is correct
56	Correct	2 ms	36148 KB	Output is correct
57	Correct	2 ms	36148 KB	Output is correct
58	Correct	2 ms	36148 KB	Output is correct
59	Correct	2 ms	36148 KB	Output is correct
60	Correct	2 ms	36148 KB	Output is correct
61	Correct	2 ms	36148 KB	Output is correct
62	Correct	2 ms	36148 KB	Output is correct
63	Correct	2 ms	36148 KB	Output is correct
64	Correct	2 ms	36148 KB	Output is correct
65	Correct	2 ms	36148 KB	Output is correct
66	Correct	2 ms	36148 KB	Output is correct
67	Correct	80 ms	37472 KB	Output is correct
68	Correct	64 ms	38732 KB	Output is correct
69	Correct	80 ms	39992 KB	Output is correct
70	Correct	70 ms	41272 KB	Output is correct
71	Correct	72 ms	42532 KB	Output is correct
72	Correct	56 ms	43768 KB	Output is correct
73	Correct	71 ms	45044 KB	Output is correct
74	Correct	57 ms	46964 KB	Output is correct
75	Correct	65 ms	48496 KB	Output is correct
76	Correct	117 ms	50460 KB	Output is correct
77	Correct	64 ms	51880 KB	Output is correct
78	Correct	60 ms	53160 KB	Output is correct
79	Correct	68 ms	54512 KB	Output is correct
80	Correct	58 ms	55872 KB	Output is correct
81	Correct	87 ms	57316 KB	Output is correct
82	Correct	53 ms	58784 KB	Output is correct
83	Correct	53 ms	60312 KB	Output is correct
84	Correct	56 ms	62288 KB	Output is correct
85	Correct	69 ms	64168 KB	Output is correct
86	Correct	59 ms	66152 KB	Output is correct
87	Correct	60 ms	68100 KB	Output is correct
88	Correct	62 ms	70048 KB	Output is correct
89	Correct	61 ms	71980 KB	Output is correct
90	Correct	68 ms	73912 KB	Output is correct
91	Correct	61 ms	75804 KB	Output is correct
92	Correct	64 ms	77776 KB	Output is correct
93	Correct	59 ms	79748 KB	Output is correct
94	Correct	67 ms	81640 KB	Output is correct
95	Correct	72 ms	83588 KB	Output is correct
96	Correct	56 ms	85536 KB	Output is correct
97	Correct	85 ms	87468 KB	Output is correct
98	Correct	63 ms	89416 KB	Output is correct
99	Correct	61 ms	91348 KB	Output is correct
100	Correct	68 ms	93280 KB	Output is correct
101	Correct	61 ms	95240 KB	Output is correct
102	Correct	77 ms	97160 KB	Output is correct

답안 #79117

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