oj.uz

답안 #903898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
903898 2024-01-11T13:37:20 Z math_rabbit_1028 전선 연결 (IOI17_wiring) C++14
100 / 100
 43 ms 8952 KB 
#include <bits/stdc++.h>
#include "wiring.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

vector<pii> arr;
vector<ll> sum;
vector<ll> dp;
ll min_total_length(vector<int> R, vector<int> B) {
	arr.push_back({0, 0});
	for (int i = 0; i < R.size(); i++) arr.push_back({R[i], 0});
	for (int i = 0; i < B.size(); i++) arr.push_back({B[i], 1});
	sort(arr.begin() + 1, arr.end());
	dp = vector<ll>(arr.size(), 1e18);
	sum = vector<ll>(arr.size(), 0);
	for (int i = 1; i < sum.size(); i++) sum[i] = sum[i - 1] + arr[i].first;

	dp[0] = 0;
	int a, b, last, i = 1;
	while (arr[i].second == arr[i+1].second) i++;
	b = i;
	//for (int j = 1; j <= i; j++) dp[j] = dp[j-1] + arr[b+1].first - arr[j].first;
	for (i++; i < arr.size(); i++) {
		if (arr[i].second != arr[i-1].second) {
			a = b;
			b = 0;
			last = arr[i-1].first;
			for (int j = i-a; j < i; j++) {
				dp[j] = min(dp[j], dp[j-1] + arr[i].first - arr[j].first);
			}
		}
		b++;
		if (b <= a) {
			dp[i] = min(dp[i], dp[i-1] + arr[i].first - last);
			dp[i] = min(dp[i], dp[i-2*b] + (sum[i] - sum[i-b]) - (sum[i-b] - sum[i-2*b]));
		}
		else {
			dp[i] = min(dp[i], dp[i-1] + arr[i].first - last);
		}
	}

	return dp[arr.size()-1];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:12:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for (int i = 0; i < R.size(); i++) arr.push_back({R[i], 0});
      |                  ~~^~~~~~~~~~
wiring.cpp:13:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for (int i = 0; i < B.size(); i++) arr.push_back({B[i], 1});
      |                  ~~^~~~~~~~~~
wiring.cpp:17:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (int i = 1; i < sum.size(); i++) sum[i] = sum[i - 1] + arr[i].first;
      |                  ~~^~~~~~~~~~~~
wiring.cpp:24:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for (i++; i < arr.size(); i++) {
      |            ~~^~~~~~~~~~~~
wiring.cpp:39:48: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   39 |    dp[i] = min(dp[i], dp[i-1] + arr[i].first - last);
      |                                                ^~~~
wiring.cpp:34:3: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |   if (b <= a) {
      |   ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 444 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 18 ms 5080 KB Output is correct
4 Correct 18 ms 5080 KB Output is correct
5 Correct 24 ms 5300 KB Output is correct
6 Correct 35 ms 6660 KB Output is correct
7 Correct 24 ms 6616 KB Output is correct
8 Correct 27 ms 6616 KB Output is correct
9 Correct 25 ms 6616 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 36 ms 6780 KB Output is correct
4 Correct 39 ms 8448 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 34 ms 8644 KB Output is correct
19 Correct 35 ms 8600 KB Output is correct
20 Correct 40 ms 8696 KB Output is correct
21 Correct 42 ms 8620 KB Output is correct
22 Correct 35 ms 8624 KB Output is correct
23 Correct 40 ms 8592 KB Output is correct
24 Correct 36 ms 8648 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 30 ms 6604 KB Output is correct
3 Correct 42 ms 7872 KB Output is correct
4 Correct 34 ms 7884 KB Output is correct
5 Correct 37 ms 7872 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 30 ms 7880 KB Output is correct
19 Correct 32 ms 7972 KB Output is correct
20 Correct 31 ms 8024 KB Output is correct
21 Correct 32 ms 7844 KB Output is correct
22 Correct 30 ms 7876 KB Output is correct
23 Correct 25 ms 7884 KB Output is correct
24 Correct 28 ms 7856 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 444 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 0 ms 360 KB Output is correct
19 Correct 18 ms 5080 KB Output is correct
20 Correct 18 ms 5080 KB Output is correct
21 Correct 24 ms 5300 KB Output is correct
22 Correct 35 ms 6660 KB Output is correct
23 Correct 24 ms 6616 KB Output is correct
24 Correct 27 ms 6616 KB Output is correct
25 Correct 25 ms 6616 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 36 ms 6780 KB Output is correct
29 Correct 39 ms 8448 KB Output is correct
30 Correct 1 ms 432 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 34 ms 8644 KB Output is correct
44 Correct 35 ms 8600 KB Output is correct
45 Correct 40 ms 8696 KB Output is correct
46 Correct 42 ms 8620 KB Output is correct
47 Correct 35 ms 8624 KB Output is correct
48 Correct 40 ms 8592 KB Output is correct
49 Correct 36 ms 8648 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 30 ms 6604 KB Output is correct
52 Correct 42 ms 7872 KB Output is correct
53 Correct 34 ms 7884 KB Output is correct
54 Correct 37 ms 7872 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 436 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 436 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 30 ms 7880 KB Output is correct
68 Correct 32 ms 7972 KB Output is correct
69 Correct 31 ms 8024 KB Output is correct
70 Correct 32 ms 7844 KB Output is correct
71 Correct 30 ms 7876 KB Output is correct
72 Correct 25 ms 7884 KB Output is correct
73 Correct 28 ms 7856 KB Output is correct
74 Correct 26 ms 8644 KB Output is correct
75 Correct 33 ms 8360 KB Output is correct
76 Correct 34 ms 8740 KB Output is correct
77 Correct 39 ms 8384 KB Output is correct
78 Correct 29 ms 8128 KB Output is correct
79 Correct 32 ms 8108 KB Output is correct
80 Correct 26 ms 7984 KB Output is correct
81 Correct 29 ms 8188 KB Output is correct
82 Correct 27 ms 8128 KB Output is correct
83 Correct 25 ms 8384 KB Output is correct
84 Correct 25 ms 8612 KB Output is correct
85 Correct 34 ms 8644 KB Output is correct
86 Correct 27 ms 8652 KB Output is correct
87 Correct 28 ms 8644 KB Output is correct
88 Correct 29 ms 8748 KB Output is correct
89 Correct 29 ms 8652 KB Output is correct
90 Correct 34 ms 8644 KB Output is correct
91 Correct 28 ms 8952 KB Output is correct
92 Correct 31 ms 8700 KB Output is correct
93 Correct 30 ms 8716 KB Output is correct
94 Correct 30 ms 8616 KB Output is correct
95 Correct 31 ms 8900 KB Output is correct
96 Correct 30 ms 8644 KB Output is correct
97 Correct 28 ms 8648 KB Output is correct
98 Correct 34 ms 8540 KB Output is correct
99 Correct 43 ms 8760 KB Output is correct
100 Correct 33 ms 8740 KB Output is correct
101 Correct 31 ms 8700 KB Output is correct
102 Correct 33 ms 8620 KB Output is correct