oj.uz

답안 #834804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834804 2023-08-22T20:02:40 Z PanosPask 전선 연결 (IOI17_wiring) C++14
100 / 100
 38 ms 16100 KB 
#include "wiring.h"
#include <math.h>
#include <iostream>

#define pb push_back

using namespace std;

typedef long long ll;

const ll INF = 1e18;

struct Group {
	int cnt;
	vector<int> positions;
	int first;
	int last;

	// Prefix sums to first, suffix sums to last
	vector<ll> pref;

	Group (void) {;}

	void precalc_group(void) {
		first = positions.front();
		last = positions.back();

		cnt = positions.size();

		pref.resize(positions.size() + 1);

		pref[0] = 0;
		for (int i = 0; i < positions.size(); i++)
			pref[i + 1] = pref[i] + positions[i];
	}

	ll get_total(int l, int r)
	{
		// Returns the sum of positions in the range [l..r)
		return pref[r] - pref[l];
	}

	int size(void) {
		return cnt;
	}
};

int N, M;

// dp[i][j] : We have paired up everything in groups i - 1 and back, and the first j ones in group i
// When processing dp[i][j], we will never touch dp[i - 1] and before again
vector<vector<ll>> dp;

// Group size for each group
vector<Group> groups;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	N = r.size();
	M = b.size();

	int cur = -1;
	int r_p = 0, b_p = 0;

	while (r_p < r.size() || b_p < b.size()) {
		int add = 0;
		if (r_p == r.size()) {
			add = 1;
		}
		else if (b_p == b.size()) {
			add = 0;
		}
		else {
			if (r[r_p] < b[b_p])
				add = 0;
			else
				add = 1;
		}

		if (cur != add) {
			// Create new group
			if (cur != -1) {
				groups.back().precalc_group();
			}

			groups.pb(Group());
			cur = add;
		}

		if (add == 0) {
			groups.back().positions.pb(r[r_p]);
			r_p++;
		}
		else {
			groups.back().positions.pb(b[b_p]);
			b_p++;
		}
	}
	groups.back().precalc_group();

	dp.resize(groups.size());
	dp[0].assign(groups[0].cnt + 1, INF);
	dp[0][0] = 0;

	for (int g = 0; g < groups.size() - 1; g++) {
		dp[g + 1].assign(groups[g + 1].size() + 1, INF);

		for (int j = 0; j < groups[g].size(); j++) {
			// The first element to be paired is in position j
			// Pair it with the leftmost element of the next group

			dp[g][j + 1] = min(dp[g][j + 1], dp[g][j] + abs(groups[g].positions[j] - groups[g + 1].first));
		}

		for (int j = 0; j <= min(groups[g].size(), groups[g + 1].size()); j++) {
			// Connect the last j from group g with the first j from group g + 1
			// Assume all previous sockets in group g are connected

			// Number of connected sockets in group g
			int v = groups[g].size() - j;

			ll connection_cost = groups[g + 1].get_total(0, j) - groups[g].get_total(groups[g].size() - j, groups[g].size());

			dp[g + 1][j] = min(dp[g + 1][j], dp[g][v] + connection_cost);
		}

		for (int j = 0; j < groups[g + 1].size(); j++) {
			// In dp[g + 1][j], the next element to be paired is j
			// Pair this with the rightmost element of this group

			dp[g + 1][j + 1] = min(dp[g + 1][j + 1], dp[g + 1][j] + abs(groups[g + 1].positions[j] - groups[g].last));
		}
	}

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

Compilation message

wiring.cpp: In member function 'void Group::precalc_group()':
wiring.cpp:33:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   for (int i = 0; i < positions.size(); i++)
      |                   ~~^~~~~~~~~~~~~~~~~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:64:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  while (r_p < r.size() || b_p < b.size()) {
      |         ~~~~^~~~~~~~~~
wiring.cpp:64:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  while (r_p < r.size() || b_p < b.size()) {
      |                           ~~~~^~~~~~~~~~
wiring.cpp:66:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   if (r_p == r.size()) {
      |       ~~~~^~~~~~~~~~~
wiring.cpp:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   else if (b_p == b.size()) {
      |            ~~~~^~~~~~~~~~~
wiring.cpp:104:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Group>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |  for (int g = 0; g < groups.size() - 1; g++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~
wiring.cpp:13:8: warning: '<anonymous>.Group::cnt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   13 | struct Group {
      |        ^~~~~
wiring.cpp:13:8: warning: '<anonymous>.Group::first' may be used uninitialized in this function [-Wmaybe-uninitialized]
wiring.cpp:13:8: warning: '<anonymous>.Group::last' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 15 ms 6092 KB Output is correct
4 Correct 15 ms 6092 KB Output is correct
5 Correct 15 ms 5960 KB Output is correct
6 Correct 24 ms 7852 KB Output is correct
7 Correct 19 ms 7752 KB Output is correct
8 Correct 19 ms 7760 KB Output is correct
9 Correct 19 ms 7752 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 35 ms 16056 KB Output is correct
4 Correct 28 ms 12064 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 34 ms 16056 KB Output is correct
19 Correct 35 ms 16100 KB Output is correct
20 Correct 29 ms 12344 KB Output is correct
21 Correct 34 ms 16056 KB Output is correct
22 Correct 33 ms 14904 KB Output is correct
23 Correct 37 ms 14904 KB Output is correct
24 Correct 38 ms 14872 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 17 ms 7072 KB Output is correct
3 Correct 25 ms 9788 KB Output is correct
4 Correct 23 ms 7336 KB Output is correct
5 Correct 24 ms 9840 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 17 ms 7124 KB Output is correct
19 Correct 24 ms 7208 KB Output is correct
20 Correct 22 ms 7380 KB Output is correct
21 Correct 17 ms 7124 KB Output is correct
22 Correct 20 ms 7240 KB Output is correct
23 Correct 19 ms 7208 KB Output is correct
24 Correct 17 ms 7120 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 15 ms 6092 KB Output is correct
20 Correct 15 ms 6092 KB Output is correct
21 Correct 15 ms 5960 KB Output is correct
22 Correct 24 ms 7852 KB Output is correct
23 Correct 19 ms 7752 KB Output is correct
24 Correct 19 ms 7760 KB Output is correct
25 Correct 19 ms 7752 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 35 ms 16056 KB Output is correct
29 Correct 28 ms 12064 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 34 ms 16056 KB Output is correct
44 Correct 35 ms 16100 KB Output is correct
45 Correct 29 ms 12344 KB Output is correct
46 Correct 34 ms 16056 KB Output is correct
47 Correct 33 ms 14904 KB Output is correct
48 Correct 37 ms 14904 KB Output is correct
49 Correct 38 ms 14872 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 17 ms 7072 KB Output is correct
52 Correct 25 ms 9788 KB Output is correct
53 Correct 23 ms 7336 KB Output is correct
54 Correct 24 ms 9840 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 17 ms 7124 KB Output is correct
68 Correct 24 ms 7208 KB Output is correct
69 Correct 22 ms 7380 KB Output is correct
70 Correct 17 ms 7124 KB Output is correct
71 Correct 20 ms 7240 KB Output is correct
72 Correct 19 ms 7208 KB Output is correct
73 Correct 17 ms 7120 KB Output is correct
74 Correct 19 ms 7752 KB Output is correct
75 Correct 18 ms 7448 KB Output is correct
76 Correct 19 ms 7748 KB Output is correct
77 Correct 18 ms 7240 KB Output is correct
78 Correct 17 ms 7236 KB Output is correct
79 Correct 24 ms 7148 KB Output is correct
80 Correct 17 ms 7244 KB Output is correct
81 Correct 17 ms 7308 KB Output is correct
82 Correct 17 ms 7244 KB Output is correct
83 Correct 18 ms 7460 KB Output is correct
84 Correct 19 ms 8000 KB Output is correct
85 Correct 20 ms 7792 KB Output is correct
86 Correct 19 ms 7988 KB Output is correct
87 Correct 20 ms 7748 KB Output is correct
88 Correct 20 ms 7756 KB Output is correct
89 Correct 20 ms 7756 KB Output is correct
90 Correct 19 ms 7732 KB Output is correct
91 Correct 19 ms 7756 KB Output is correct
92 Correct 20 ms 7684 KB Output is correct
93 Correct 19 ms 7716 KB Output is correct
94 Correct 22 ms 7760 KB Output is correct
95 Correct 19 ms 7840 KB Output is correct
96 Correct 19 ms 7748 KB Output is correct
97 Correct 20 ms 7716 KB Output is correct
98 Correct 19 ms 7760 KB Output is correct
99 Correct 20 ms 7752 KB Output is correct
100 Correct 19 ms 7660 KB Output is correct
101 Correct 19 ms 7728 KB Output is correct
102 Correct 20 ms 7756 KB Output is correct