답안 #73819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73819 2018-08-29T05:15:30 Z nvmdava 전선 연결 (IOI17_wiring) C++17
100 / 100
115 ms 10284 KB
#include "wiring.h"
#include <bits/stdc++.h>
#define INF 1000000001LL
using namespace std;

struct Node{
	long long x;
	bool col;
	Node(long long _x, bool _col){
		x = _x;
		col = _col;
	}
	bool operator<(const Node& rhs){
		return x < rhs.x;
	}
};

vector<Node> v;
int last[200005][2];
long long ans[200005], s[200005];

inline long long sum(int l, int r, int x){
	if(l == x) return s[r] - s[l - 1] - v[l].x * (r - l + 1);
	return v[r].x * (r - l + 1) - s[r] + s[l - 1];
}
inline long long func(int i, int l, int r){
	return ans[l - 1] + sum(l, r, r) + sum(r + 1, i, r + 1) + (v[r + 1].x - v[r].x) * max(r - l + 1, i - r);
}


inline void find(int i){
	int R = last[i][v[i].col ^ 1];
	int r = R ;
	int l = last[R][v[i].col] + 1;
	int m;
	ans[i] = ans[i - 1] + v[i].x - v[r].x;
	ans[i] = min(ans[i], func(i, l, R));
	if(l == r){
		return;
	}
	while(l + 1!= r){
		m = (l + r) >> 1;
		if(func(i, m, R) < func(i, m + 1, R)) r = m;
		else l = m;
	}
	ans[i] = min(ans[i], func(i, r, R));
}
inline void basic(int i){
	last[i][0] = last[i - 1][0];
	last[i][1] = last[i - 1][1];
	last[i][v[i].col] = i;
	s[i] = s[i - 1] + v[i].x;
}
long long min_total_length(std::vector<int> r, std::vector<int> b) {
	for(auto x : r){
		v.push_back(Node(x, 0));
	}
	for(auto x : b){
		v.push_back(Node(x, 1));
	}
	sort(v.begin(), v.end());
	s[0] = v[0].x;
	int i;
	
	for(i = 1; i > 0; i++){
		if(v[i].col != v[i - 1].col) break;
		basic(i);
	}
	int t = i;
	ans[t - 1] = 40000000000000000;
	for(; i < v.size(); i++){
		if(v[i].col != v[t].col) break;
		basic(i);
		ans[i] = sum(0, t - 1, t - 1) + sum(t, i, t) + (v[t].x - v[t - 1].x) * max(t, i - t + 1);
	}
	for(; i < v.size(); i++){
		basic(i);
		find(i);
	}
	return ans[v.size() - 1];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:71:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(; i < v.size(); i++){
        ~~^~~~~~~~~~
wiring.cpp:76:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(; i < v.size(); i++){
        ~~^~~~~~~~~~
wiring.cpp:23:34: warning: array subscript is below array bounds [-Warray-bounds]
  if(l == x) return s[r] - s[l - 1] - v[l].x * (r - l + 1);
                           ~~~~~~~^
wiring.cpp:24:46: warning: array subscript is below array bounds [-Warray-bounds]
  return v[r].x * (r - l + 1) - s[r] + s[l - 1];
                                       ~~~~~~~^
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 12 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 2 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 3 ms 692 KB Output is correct
12 Correct 3 ms 692 KB Output is correct
13 Correct 2 ms 692 KB Output is correct
14 Correct 2 ms 692 KB Output is correct
15 Correct 3 ms 692 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 692 KB Output is correct
2 Correct 3 ms 692 KB Output is correct
3 Correct 51 ms 7032 KB Output is correct
4 Correct 46 ms 7032 KB Output is correct
5 Correct 48 ms 7416 KB Output is correct
6 Correct 56 ms 9336 KB Output is correct
7 Correct 60 ms 9336 KB Output is correct
8 Correct 63 ms 9356 KB Output is correct
9 Correct 58 ms 9404 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9404 KB Output is correct
2 Correct 3 ms 9404 KB Output is correct
3 Correct 79 ms 10104 KB Output is correct
4 Correct 96 ms 10128 KB Output is correct
5 Correct 2 ms 10128 KB Output is correct
6 Correct 2 ms 10128 KB Output is correct
7 Correct 2 ms 10128 KB Output is correct
8 Correct 3 ms 10128 KB Output is correct
9 Correct 3 ms 10128 KB Output is correct
10 Correct 4 ms 10128 KB Output is correct
11 Correct 2 ms 10128 KB Output is correct
12 Correct 2 ms 10128 KB Output is correct
13 Correct 2 ms 10128 KB Output is correct
14 Correct 3 ms 10128 KB Output is correct
15 Correct 3 ms 10128 KB Output is correct
16 Correct 2 ms 10128 KB Output is correct
17 Correct 3 ms 10128 KB Output is correct
18 Correct 75 ms 10128 KB Output is correct
19 Correct 72 ms 10128 KB Output is correct
20 Correct 85 ms 10128 KB Output is correct
21 Correct 78 ms 10128 KB Output is correct
22 Correct 82 ms 10284 KB Output is correct
23 Correct 90 ms 10284 KB Output is correct
24 Correct 80 ms 10284 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10284 KB Output is correct
2 Correct 77 ms 10284 KB Output is correct
3 Correct 68 ms 10284 KB Output is correct
4 Correct 78 ms 10284 KB Output is correct
5 Correct 67 ms 10284 KB Output is correct
6 Correct 3 ms 10284 KB Output is correct
7 Correct 3 ms 10284 KB Output is correct
8 Correct 3 ms 10284 KB Output is correct
9 Correct 3 ms 10284 KB Output is correct
10 Correct 3 ms 10284 KB Output is correct
11 Correct 2 ms 10284 KB Output is correct
12 Correct 3 ms 10284 KB Output is correct
13 Correct 2 ms 10284 KB Output is correct
14 Correct 3 ms 10284 KB Output is correct
15 Correct 3 ms 10284 KB Output is correct
16 Correct 3 ms 10284 KB Output is correct
17 Correct 2 ms 10284 KB Output is correct
18 Correct 77 ms 10284 KB Output is correct
19 Correct 76 ms 10284 KB Output is correct
20 Correct 84 ms 10284 KB Output is correct
21 Correct 82 ms 10284 KB Output is correct
22 Correct 71 ms 10284 KB Output is correct
23 Correct 66 ms 10284 KB Output is correct
24 Correct 86 ms 10284 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 12 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 2 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 3 ms 692 KB Output is correct
12 Correct 3 ms 692 KB Output is correct
13 Correct 2 ms 692 KB Output is correct
14 Correct 2 ms 692 KB Output is correct
15 Correct 3 ms 692 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 51 ms 7032 KB Output is correct
20 Correct 46 ms 7032 KB Output is correct
21 Correct 48 ms 7416 KB Output is correct
22 Correct 56 ms 9336 KB Output is correct
23 Correct 60 ms 9336 KB Output is correct
24 Correct 63 ms 9356 KB Output is correct
25 Correct 58 ms 9404 KB Output is correct
26 Correct 3 ms 9404 KB Output is correct
27 Correct 3 ms 9404 KB Output is correct
28 Correct 79 ms 10104 KB Output is correct
29 Correct 96 ms 10128 KB Output is correct
30 Correct 2 ms 10128 KB Output is correct
31 Correct 2 ms 10128 KB Output is correct
32 Correct 2 ms 10128 KB Output is correct
33 Correct 3 ms 10128 KB Output is correct
34 Correct 3 ms 10128 KB Output is correct
35 Correct 4 ms 10128 KB Output is correct
36 Correct 2 ms 10128 KB Output is correct
37 Correct 2 ms 10128 KB Output is correct
38 Correct 2 ms 10128 KB Output is correct
39 Correct 3 ms 10128 KB Output is correct
40 Correct 3 ms 10128 KB Output is correct
41 Correct 2 ms 10128 KB Output is correct
42 Correct 3 ms 10128 KB Output is correct
43 Correct 75 ms 10128 KB Output is correct
44 Correct 72 ms 10128 KB Output is correct
45 Correct 85 ms 10128 KB Output is correct
46 Correct 78 ms 10128 KB Output is correct
47 Correct 82 ms 10284 KB Output is correct
48 Correct 90 ms 10284 KB Output is correct
49 Correct 80 ms 10284 KB Output is correct
50 Correct 3 ms 10284 KB Output is correct
51 Correct 77 ms 10284 KB Output is correct
52 Correct 68 ms 10284 KB Output is correct
53 Correct 78 ms 10284 KB Output is correct
54 Correct 67 ms 10284 KB Output is correct
55 Correct 3 ms 10284 KB Output is correct
56 Correct 3 ms 10284 KB Output is correct
57 Correct 3 ms 10284 KB Output is correct
58 Correct 3 ms 10284 KB Output is correct
59 Correct 3 ms 10284 KB Output is correct
60 Correct 2 ms 10284 KB Output is correct
61 Correct 3 ms 10284 KB Output is correct
62 Correct 2 ms 10284 KB Output is correct
63 Correct 3 ms 10284 KB Output is correct
64 Correct 3 ms 10284 KB Output is correct
65 Correct 3 ms 10284 KB Output is correct
66 Correct 2 ms 10284 KB Output is correct
67 Correct 77 ms 10284 KB Output is correct
68 Correct 76 ms 10284 KB Output is correct
69 Correct 84 ms 10284 KB Output is correct
70 Correct 82 ms 10284 KB Output is correct
71 Correct 71 ms 10284 KB Output is correct
72 Correct 66 ms 10284 KB Output is correct
73 Correct 86 ms 10284 KB Output is correct
74 Correct 55 ms 10284 KB Output is correct
75 Correct 79 ms 10284 KB Output is correct
76 Correct 84 ms 10284 KB Output is correct
77 Correct 88 ms 10284 KB Output is correct
78 Correct 78 ms 10284 KB Output is correct
79 Correct 84 ms 10284 KB Output is correct
80 Correct 68 ms 10284 KB Output is correct
81 Correct 81 ms 10284 KB Output is correct
82 Correct 53 ms 10284 KB Output is correct
83 Correct 56 ms 10284 KB Output is correct
84 Correct 64 ms 10284 KB Output is correct
85 Correct 89 ms 10284 KB Output is correct
86 Correct 74 ms 10284 KB Output is correct
87 Correct 76 ms 10284 KB Output is correct
88 Correct 80 ms 10284 KB Output is correct
89 Correct 104 ms 10284 KB Output is correct
90 Correct 88 ms 10284 KB Output is correct
91 Correct 69 ms 10284 KB Output is correct
92 Correct 90 ms 10284 KB Output is correct
93 Correct 76 ms 10284 KB Output is correct
94 Correct 83 ms 10284 KB Output is correct
95 Correct 99 ms 10284 KB Output is correct
96 Correct 67 ms 10284 KB Output is correct
97 Correct 62 ms 10284 KB Output is correct
98 Correct 72 ms 10284 KB Output is correct
99 Correct 74 ms 10284 KB Output is correct
100 Correct 115 ms 10284 KB Output is correct
101 Correct 76 ms 10284 KB Output is correct
102 Correct 98 ms 10284 KB Output is correct