oj.uz

Submission #43055

# Submission time Handle Problem Language Result Execution time Memory
43055 2018-03-08T13:58:27 Z MatheusLealV Wiring (IOI17_wiring) C++14
100 / 100
 100 ms 16476 KB 
#include <bits/stdc++.h>
#include "wiring.h"
#define inf 2000000000000000000LL
#define N 200005
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;

typedef long long ll;

int n, m, group, grupo[N], head[N], last[N];

ll dp[N], sum[N];

pii v[N];

vector<int> split[N];

vector< pair<int, int> > all;

inline ll soma(int a, int b)
{
	return sum[max(a, b)] - sum[min(a, b) - 1];
}

inline ll custo(int i, int j)
{
	ll Bn = v[last[grupo[i]]].f, R1 = v[head[grupo[j]]].f;

	ll tam_1 = last[ grupo[i] ] - i + 1, tam_2 = j - head[ grupo[j] ] + 1;

	ll sum_1 = soma( i, last[grupo[i]] ), sum_2 = soma( head[grupo[j]], j);

	return tam_1*Bn - tam_2*R1 - sum_1 + sum_2 + max(tam_1, tam_2)*abs(Bn - R1);
}

inline ll get(int i, int j)
{
	return min(dp[j], dp[j - 1]) + custo(min(i, j), max(i, j));
}

ll min_total_length(vector<int> e, vector<int> d)
{
	n = e.size(), m = d.size();

	for(int i = 0, x; i < e.size(); i++) all.push_back(make_pair(e[i], 0));

	for(int i = 0, x; i < d.size(); i++) all.push_back(make_pair(d[i], 1));

	sort(all.begin(), all.end());

	int ini = 0;

	for(int i = 0; i < all.size(); i++)
	{
		if( (i < n + m - 1 && all[i].s != all[i + 1].s) || i == n + m - 1)
		{
			group ++;

			for(int j = ini; j <= i; j++) grupo[j + 1] = group, split[group].push_back(all[j].f);

			last[group] = i + 1;

			head[group] = ini + 1;

			ini = i + 1;
		}
	}

	for(int i = 0; i < all.size(); i++) v[i + 1] = all[i], dp[i + 1] = inf;

	for(int i = 1; i <= n + m; i++) sum[i] = sum[i - 1] + v[i].f;

	int ptr = 1;

	for(int i = 1; i <= n + m; i++)
	{
		if(grupo[i] == 1) continue;

		if(grupo[i] == 2)
		{
			dp[i] = custo(1, i);

			continue;
		}

		if(v[i].s == v[i - 1].s)
		{
			dp[i] = get(i, ptr);

			while(ptr > 1 && get(i, ptr - 1) <= dp[i] && ptr - 1>= max(1, head[ grupo[i] - 1 ])) dp[i] = get(i, ptr - 1), ptr --;
		}

		else
		{
			ptr = last[grupo[i] - 1];

			dp[i] = get(i, ptr);

			while(ptr > 1 && get(i, ptr - 1) <= dp[i] && ptr - 1>= max(1, head[ grupo[i] - 1 ])) dp[i] = get(i, ptr - 1), ptr --;
		}
	}

	return dp[n + m];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:47:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0, x; i < e.size(); i++) all.push_back(make_pair(e[i], 0));
                      ^
wiring.cpp:47:17: warning: unused variable 'x' [-Wunused-variable]
  for(int i = 0, x; i < e.size(); i++) all.push_back(make_pair(e[i], 0));
                 ^
wiring.cpp:49:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0, x; i < d.size(); i++) all.push_back(make_pair(d[i], 1));
                      ^
wiring.cpp:49:17: warning: unused variable 'x' [-Wunused-variable]
  for(int i = 0, x; i < d.size(); i++) all.push_back(make_pair(d[i], 1));
                 ^
wiring.cpp:55:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < all.size(); i++)
                   ^
wiring.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < all.size(); i++) v[i + 1] = all[i], dp[i + 1] = inf;
                   ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5088 KB Output is correct
3 Correct 5 ms 5160 KB Output is correct
4 Correct 5 ms 5176 KB Output is correct
5 Correct 5 ms 5360 KB Output is correct
6 Correct 6 ms 5360 KB Output is correct
7 Correct 6 ms 5360 KB Output is correct
8 Correct 6 ms 5360 KB Output is correct
9 Correct 5 ms 5360 KB Output is correct
10 Correct 5 ms 5360 KB Output is correct
11 Correct 6 ms 5468 KB Output is correct
12 Correct 5 ms 5468 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5468 KB Output is correct
15 Correct 6 ms 5468 KB Output is correct
16 Correct 6 ms 5468 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5468 KB Output is correct
2 Correct 5 ms 5468 KB Output is correct
3 Correct 55 ms 12636 KB Output is correct
4 Correct 42 ms 12636 KB Output is correct
5 Correct 45 ms 12892 KB Output is correct
6 Correct 56 ms 15196 KB Output is correct
7 Correct 56 ms 15196 KB Output is correct
8 Correct 53 ms 15196 KB Output is correct
9 Correct 56 ms 15196 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15196 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 90 ms 16396 KB Output is correct
4 Correct 77 ms 16396 KB Output is correct
5 Correct 6 ms 16396 KB Output is correct
6 Correct 6 ms 16396 KB Output is correct
7 Correct 5 ms 16396 KB Output is correct
8 Correct 6 ms 16396 KB Output is correct
9 Correct 5 ms 16396 KB Output is correct
10 Correct 6 ms 16396 KB Output is correct
11 Correct 6 ms 16396 KB Output is correct
12 Correct 5 ms 16396 KB Output is correct
13 Correct 5 ms 16396 KB Output is correct
14 Correct 5 ms 16396 KB Output is correct
15 Correct 5 ms 16396 KB Output is correct
16 Correct 6 ms 16396 KB Output is correct
17 Correct 5 ms 16396 KB Output is correct
18 Correct 83 ms 16476 KB Output is correct
19 Correct 87 ms 16476 KB Output is correct
20 Correct 89 ms 16476 KB Output is correct
21 Correct 100 ms 16476 KB Output is correct
22 Correct 90 ms 16476 KB Output is correct
23 Correct 93 ms 16476 KB Output is correct
24 Correct 81 ms 16476 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 66 ms 16476 KB Output is correct
3 Correct 70 ms 16476 KB Output is correct
4 Correct 69 ms 16476 KB Output is correct
5 Correct 69 ms 16476 KB Output is correct
6 Correct 5 ms 16476 KB Output is correct
7 Correct 5 ms 16476 KB Output is correct
8 Correct 5 ms 16476 KB Output is correct
9 Correct 5 ms 16476 KB Output is correct
10 Correct 5 ms 16476 KB Output is correct
11 Correct 5 ms 16476 KB Output is correct
12 Correct 5 ms 16476 KB Output is correct
13 Correct 5 ms 16476 KB Output is correct
14 Correct 5 ms 16476 KB Output is correct
15 Correct 5 ms 16476 KB Output is correct
16 Correct 5 ms 16476 KB Output is correct
17 Correct 5 ms 16476 KB Output is correct
18 Correct 62 ms 16476 KB Output is correct
19 Correct 63 ms 16476 KB Output is correct
20 Correct 62 ms 16476 KB Output is correct
21 Correct 63 ms 16476 KB Output is correct
22 Correct 58 ms 16476 KB Output is correct
23 Correct 52 ms 16476 KB Output is correct
24 Correct 53 ms 16476 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5088 KB Output is correct
3 Correct 5 ms 5160 KB Output is correct
4 Correct 5 ms 5176 KB Output is correct
5 Correct 5 ms 5360 KB Output is correct
6 Correct 6 ms 5360 KB Output is correct
7 Correct 6 ms 5360 KB Output is correct
8 Correct 6 ms 5360 KB Output is correct
9 Correct 5 ms 5360 KB Output is correct
10 Correct 5 ms 5360 KB Output is correct
11 Correct 6 ms 5468 KB Output is correct
12 Correct 5 ms 5468 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5468 KB Output is correct
15 Correct 6 ms 5468 KB Output is correct
16 Correct 6 ms 5468 KB Output is correct
17 Correct 5 ms 5468 KB Output is correct
18 Correct 5 ms 5468 KB Output is correct
19 Correct 55 ms 12636 KB Output is correct
20 Correct 42 ms 12636 KB Output is correct
21 Correct 45 ms 12892 KB Output is correct
22 Correct 56 ms 15196 KB Output is correct
23 Correct 56 ms 15196 KB Output is correct
24 Correct 53 ms 15196 KB Output is correct
25 Correct 56 ms 15196 KB Output is correct
26 Correct 5 ms 15196 KB Output is correct
27 Correct 5 ms 15196 KB Output is correct
28 Correct 90 ms 16396 KB Output is correct
29 Correct 77 ms 16396 KB Output is correct
30 Correct 6 ms 16396 KB Output is correct
31 Correct 6 ms 16396 KB Output is correct
32 Correct 5 ms 16396 KB Output is correct
33 Correct 6 ms 16396 KB Output is correct
34 Correct 5 ms 16396 KB Output is correct
35 Correct 6 ms 16396 KB Output is correct
36 Correct 6 ms 16396 KB Output is correct
37 Correct 5 ms 16396 KB Output is correct
38 Correct 5 ms 16396 KB Output is correct
39 Correct 5 ms 16396 KB Output is correct
40 Correct 5 ms 16396 KB Output is correct
41 Correct 6 ms 16396 KB Output is correct
42 Correct 5 ms 16396 KB Output is correct
43 Correct 83 ms 16476 KB Output is correct
44 Correct 87 ms 16476 KB Output is correct
45 Correct 89 ms 16476 KB Output is correct
46 Correct 100 ms 16476 KB Output is correct
47 Correct 90 ms 16476 KB Output is correct
48 Correct 93 ms 16476 KB Output is correct
49 Correct 81 ms 16476 KB Output is correct
50 Correct 5 ms 16476 KB Output is correct
51 Correct 66 ms 16476 KB Output is correct
52 Correct 70 ms 16476 KB Output is correct
53 Correct 69 ms 16476 KB Output is correct
54 Correct 69 ms 16476 KB Output is correct
55 Correct 5 ms 16476 KB Output is correct
56 Correct 5 ms 16476 KB Output is correct
57 Correct 5 ms 16476 KB Output is correct
58 Correct 5 ms 16476 KB Output is correct
59 Correct 5 ms 16476 KB Output is correct
60 Correct 5 ms 16476 KB Output is correct
61 Correct 5 ms 16476 KB Output is correct
62 Correct 5 ms 16476 KB Output is correct
63 Correct 5 ms 16476 KB Output is correct
64 Correct 5 ms 16476 KB Output is correct
65 Correct 5 ms 16476 KB Output is correct
66 Correct 5 ms 16476 KB Output is correct
67 Correct 62 ms 16476 KB Output is correct
68 Correct 63 ms 16476 KB Output is correct
69 Correct 62 ms 16476 KB Output is correct
70 Correct 63 ms 16476 KB Output is correct
71 Correct 58 ms 16476 KB Output is correct
72 Correct 52 ms 16476 KB Output is correct
73 Correct 53 ms 16476 KB Output is correct
74 Correct 56 ms 16476 KB Output is correct
75 Correct 65 ms 16476 KB Output is correct
76 Correct 64 ms 16476 KB Output is correct
77 Correct 60 ms 16476 KB Output is correct
78 Correct 60 ms 16476 KB Output is correct
79 Correct 68 ms 16476 KB Output is correct
80 Correct 68 ms 16476 KB Output is correct
81 Correct 58 ms 16476 KB Output is correct
82 Correct 54 ms 16476 KB Output is correct
83 Correct 51 ms 16476 KB Output is correct
84 Correct 58 ms 16476 KB Output is correct
85 Correct 67 ms 16476 KB Output is correct
86 Correct 64 ms 16476 KB Output is correct
87 Correct 72 ms 16476 KB Output is correct
88 Correct 75 ms 16476 KB Output is correct
89 Correct 63 ms 16476 KB Output is correct
90 Correct 77 ms 16476 KB Output is correct
91 Correct 59 ms 16476 KB Output is correct
92 Correct 63 ms 16476 KB Output is correct
93 Correct 62 ms 16476 KB Output is correct
94 Correct 62 ms 16476 KB Output is correct
95 Correct 66 ms 16476 KB Output is correct
96 Correct 58 ms 16476 KB Output is correct
97 Correct 57 ms 16476 KB Output is correct
98 Correct 62 ms 16476 KB Output is correct
99 Correct 62 ms 16476 KB Output is correct
100 Correct 67 ms 16476 KB Output is correct
101 Correct 63 ms 16476 KB Output is correct
102 Correct 71 ms 16476 KB Output is correct