oj.uz

Submission #798016

# Submission time Handle Problem Language Result Execution time Memory
798016 2023-07-30T09:24:05 Z LittleCube Wiring (IOI17_wiring) C++17
100 / 100
 51 ms 12960 KB 
#include "wiring.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

ll cost(ll x, ll y)
{
	return abs(x - y);
}

vector<ll> trans(vector<ll> l, vector<ll> ldp, vector<ll> r)
{
	// cerr << ' ';
	// for (ll i : l)
	// 	cerr << i << ' ';
	// cerr << "->";
	// for (ll i : r)
	// 	cerr << ' ' << i;
	// cerr << '\n';

	// for (ll i : ldp)
	// 	cerr << i << ' ';
	// cerr << '\n';

	int n = l.size(), m = r.size();
	ll small = r[0], large = l.back();
	vector<ll> rdp(m + 1, 1e18);
	reverse(ldp.begin(), ldp.end());
	reverse(l.begin(), l.end());
	l.insert(l.begin(), 0);
	r.insert(r.begin(), 0);
	{
		ll sum = 0;
		for (auto &i : l)
			i = (sum += i);
	}
	{
		ll sum = 0;
		for (auto &i : r)
			i = (sum += i);
	}
	{
		vector<ll> tmp(max(m, n) + 1, 1e18);
		for (int i = 0; i <= n; i++)
			tmp[i] = -l[i] + large * i + ldp[i];
		ll pref = 1e18;
		for (int j = 0; j <= m; j++)
		{
			pref = min(pref, tmp[j]);
			rdp[j] = min(rdp[j], r[j] - large * j + pref);
		}
	}
	{
		vector<ll> tmp(max(m, n) + 1, 1e18);
		for (int i = 0; i <= n; i++)
			tmp[i] = small * i - l[i] + ldp[i];
		ll suf = 1e18;
		for (int j = n; j > m; j--)
			suf = min(suf, tmp[j]);
		for (int j = m; j >= 0; j--)
		{
			suf = min(suf, tmp[j]);
			rdp[j] = min(rdp[j], r[j] - small * j + suf);
		}
	}
	// for (ll i : rdp)
	// 	cerr << i << ' ';
	// cerr << '\n';
	return rdp;
}

long long min_total_length(vector<int> r, vector<int> b)
{
	if (r[0] > b[0])
		r.swap(b);
	vector<pii> l;
	for (auto i : r)
		l.emplace_back(pii(i, 1));
	for (auto i : b)
		l.emplace_back(pii(i, 2));
	sort(l.begin(), l.end());
	vector<ll> pre, pdp;
	pdp.emplace_back(0);
	int last = 1, i = 0;
	while (i < l.size() && l[i].S == last)
	{
		pre.emplace_back(l[i].F);
		pdp.emplace_back(1e18);
		i++;
	}
	while (i < l.size())
	{
		last ^= 3;
		vector<ll> cur;
		while (i < l.size() && l[i].S == last)
		{
			cur.emplace_back(l[i].F);
			i++;
		}
		pdp = trans(pre, pdp, cur);
		pre = cur;
	}
	return pdp.back();
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:88:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |  while (i < l.size() && l[i].S == last)
      |         ~~^~~~~~~~~~
wiring.cpp:94:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |  while (i < l.size())
      |         ~~^~~~~~~~~~
wiring.cpp:98:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   while (i < l.size() && l[i].S == last)
      |          ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 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 1 ms 212 KB Output is correct
11 Correct 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 21 ms 9412 KB Output is correct
4 Correct 21 ms 10448 KB Output is correct
5 Correct 25 ms 9992 KB Output is correct
6 Correct 27 ms 12944 KB Output is correct
7 Correct 28 ms 12952 KB Output is correct
8 Correct 27 ms 12944 KB Output is correct
9 Correct 27 ms 12960 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 284 KB Output is correct
3 Correct 49 ms 4032 KB Output is correct
4 Correct 51 ms 4040 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 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 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 48 ms 4040 KB Output is correct
19 Correct 48 ms 4024 KB Output is correct
20 Correct 47 ms 4048 KB Output is correct
21 Correct 47 ms 4032 KB Output is correct
22 Correct 47 ms 3948 KB Output is correct
23 Correct 47 ms 4040 KB Output is correct
24 Correct 47 ms 4016 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 4320 KB Output is correct
3 Correct 39 ms 5280 KB Output is correct
4 Correct 34 ms 5288 KB Output is correct
5 Correct 39 ms 5292 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 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 42 ms 8664 KB Output is correct
19 Correct 32 ms 5320 KB Output is correct
20 Correct 30 ms 5292 KB Output is correct
21 Correct 30 ms 6392 KB Output is correct
22 Correct 32 ms 10016 KB Output is correct
23 Correct 27 ms 10524 KB Output is correct
24 Correct 32 ms 9896 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 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 1 ms 212 KB Output is correct
11 Correct 1 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 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 21 ms 9412 KB Output is correct
20 Correct 21 ms 10448 KB Output is correct
21 Correct 25 ms 9992 KB Output is correct
22 Correct 27 ms 12944 KB Output is correct
23 Correct 28 ms 12952 KB Output is correct
24 Correct 27 ms 12944 KB Output is correct
25 Correct 27 ms 12960 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 284 KB Output is correct
28 Correct 49 ms 4032 KB Output is correct
29 Correct 51 ms 4040 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 0 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 0 ms 212 KB Output is correct
40 Correct 0 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 48 ms 4040 KB Output is correct
44 Correct 48 ms 4024 KB Output is correct
45 Correct 47 ms 4048 KB Output is correct
46 Correct 47 ms 4032 KB Output is correct
47 Correct 47 ms 3948 KB Output is correct
48 Correct 47 ms 4040 KB Output is correct
49 Correct 47 ms 4016 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 31 ms 4320 KB Output is correct
52 Correct 39 ms 5280 KB Output is correct
53 Correct 34 ms 5288 KB Output is correct
54 Correct 39 ms 5292 KB Output is correct
55 Correct 0 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 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 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 0 ms 212 KB Output is correct
67 Correct 42 ms 8664 KB Output is correct
68 Correct 32 ms 5320 KB Output is correct
69 Correct 30 ms 5292 KB Output is correct
70 Correct 30 ms 6392 KB Output is correct
71 Correct 32 ms 10016 KB Output is correct
72 Correct 27 ms 10524 KB Output is correct
73 Correct 32 ms 9896 KB Output is correct
74 Correct 41 ms 11164 KB Output is correct
75 Correct 34 ms 8708 KB Output is correct
76 Correct 43 ms 9080 KB Output is correct
77 Correct 33 ms 10012 KB Output is correct
78 Correct 28 ms 9408 KB Output is correct
79 Correct 35 ms 8876 KB Output is correct
80 Correct 28 ms 9628 KB Output is correct
81 Correct 32 ms 9692 KB Output is correct
82 Correct 29 ms 10656 KB Output is correct
83 Correct 27 ms 10144 KB Output is correct
84 Correct 28 ms 11544 KB Output is correct
85 Correct 38 ms 8976 KB Output is correct
86 Correct 29 ms 10912 KB Output is correct
87 Correct 28 ms 10400 KB Output is correct
88 Correct 32 ms 9628 KB Output is correct
89 Correct 31 ms 10268 KB Output is correct
90 Correct 36 ms 9812 KB Output is correct
91 Correct 40 ms 10908 KB Output is correct
92 Correct 37 ms 9628 KB Output is correct
93 Correct 29 ms 10372 KB Output is correct
94 Correct 39 ms 10272 KB Output is correct
95 Correct 33 ms 9456 KB Output is correct
96 Correct 30 ms 11416 KB Output is correct
97 Correct 29 ms 12316 KB Output is correct
98 Correct 30 ms 11068 KB Output is correct
99 Correct 32 ms 11036 KB Output is correct
100 Correct 33 ms 10216 KB Output is correct
101 Correct 31 ms 11164 KB Output is correct
102 Correct 35 ms 9276 KB Output is correct