oj.uz

Submission #838044

# Submission time Handle Problem Language Result Execution time Memory
838044 2023-08-26T06:13:47 Z Kerim Wiring (IOI17_wiring) C++17
100 / 100
 47 ms 11812 KB 
#include "wiring.h"
#include "bits/stdc++.h"
#define ff first 
#define ss second
#define ll long long
using namespace std;
const ll B = 1e16;
void make(vector<ll>&v, int sz){
	v.resize(sz);
	for (int i = 0; i < sz; i++) 
		v[i] = B;
}
ll min_total_length(vector<int> r, vector<int> b) {
	vector<pair<int,int> > v;
	vector<vector<int> > d;
	vector<int> sz; 
	for (auto x: r) v.push_back({x, 0});
	for (auto x: b) v.push_back({x, 1});
	sort(v.begin(), v.end());
	for (int i = 0; i < v.size(); i++){
		int j = i;
		vector<int> g{-1};
		while (j < v.size() and v[i].ss == v[j].ss)
			g.push_back(v[j++].ff);
		d.push_back(g);
		sz.push_back(j - i);
		i = j - 1;
	}
	int n = d.size();
	vector<ll> dp, odp;
	vector<ll> pre, suf, suf_k, pref_k;
	make(dp, sz[0]+1);
	dp[0] = 0;
	for (int i = 1; i < n; i++){
		swap(odp, dp);
		make(dp, sz[i]+1);
		dp[0] = odp[sz[i-1]];
		pre.resize(sz[i]+1);
		suf.resize(sz[i-1]+2);
		suf_k.resize(sz[i-1]+2);
		pref_k.resize(sz[i-1]+2);
		for (int j = 1; j <= sz[i]; j++)
			pre[j] = pre[j-1] + d[i][j];
		suf[sz[i-1]+1] = 0;
		suf_k[sz[i-1]+1] = B;
		pref_k[0] = B;
		for (int k = sz[i-1]; k >= 1; k--){
			suf[k] = suf[k+1] + d[i-1][k];
			suf_k[k] = min(suf_k[k+1], min(odp[k-1], odp[k])+d[i-1][sz[i-1]]*1LL*(sz[i-1]-k+1) - suf[k]);
		}
		for (int k = 1; k <= sz[i-1]; k++) 
			pref_k[k] = min(pref_k[k-1], min(odp[k-1], odp[k])+(d[i][1]-d[i-1][sz[i-1]])*1LL*(sz[i-1]-k+1)+d[i-1][sz[i-1]]*1LL*(sz[i-1]-k+1)-suf[k]);
		for (int j = 1; j <= sz[i]; j++){
			int p = sz[i-1]+1-j;
			if (p >= 1)
				dp[j] = pre[j]-j*1LL*d[i][1] + pref_k[p-1];
			dp[j] = min(dp[j], (d[i][1]-d[i-1][sz[i-1]])*1LL*j+pre[j]-j*1LL*d[i][1] + suf_k[max(1, p)]);
		}
	}
	return dp[sz[n-1]];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:20:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for (int i = 0; i < v.size(); i++){
      |                  ~~^~~~~~~~~~
wiring.cpp:23: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]
   23 |   while (j < v.size() and v[i].ss == v[j].ss)
      |          ~~^~~~~~~~~~

Subtask #1
7.0 / 7.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 0 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 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 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 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 7152 KB Output is correct
4 Correct 20 ms 8544 KB Output is correct
5 Correct 20 ms 7768 KB Output is correct
6 Correct 26 ms 10752 KB Output is correct
7 Correct 29 ms 10848 KB Output is correct
8 Correct 27 ms 10784 KB Output is correct
9 Correct 26 ms 10776 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 212 KB Output is correct
3 Correct 45 ms 6844 KB Output is correct
4 Correct 41 ms 6644 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 340 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 44 ms 6880 KB Output is correct
19 Correct 43 ms 6892 KB Output is correct
20 Correct 44 ms 6588 KB Output is correct
21 Correct 43 ms 6884 KB Output is correct
22 Correct 47 ms 6588 KB Output is correct
23 Correct 44 ms 6588 KB Output is correct
24 Correct 45 ms 6644 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 30 ms 5048 KB Output is correct
3 Correct 39 ms 5236 KB Output is correct
4 Correct 33 ms 4380 KB Output is correct
5 Correct 37 ms 5236 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 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 30 ms 6716 KB Output is correct
19 Correct 32 ms 5472 KB Output is correct
20 Correct 31 ms 5672 KB Output is correct
21 Correct 29 ms 6740 KB Output is correct
22 Correct 33 ms 9664 KB Output is correct
23 Correct 27 ms 9260 KB Output is correct
24 Correct 28 ms 9636 KB Output is correct

Subtask #5
45.0 / 45.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 0 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 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 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 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 7152 KB Output is correct
20 Correct 20 ms 8544 KB Output is correct
21 Correct 20 ms 7768 KB Output is correct
22 Correct 26 ms 10752 KB Output is correct
23 Correct 29 ms 10848 KB Output is correct
24 Correct 27 ms 10784 KB Output is correct
25 Correct 26 ms 10776 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 45 ms 6844 KB Output is correct
29 Correct 41 ms 6644 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 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 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 44 ms 6880 KB Output is correct
44 Correct 43 ms 6892 KB Output is correct
45 Correct 44 ms 6588 KB Output is correct
46 Correct 43 ms 6884 KB Output is correct
47 Correct 47 ms 6588 KB Output is correct
48 Correct 44 ms 6588 KB Output is correct
49 Correct 45 ms 6644 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 30 ms 5048 KB Output is correct
52 Correct 39 ms 5236 KB Output is correct
53 Correct 33 ms 4380 KB Output is correct
54 Correct 37 ms 5236 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 0 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 0 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 30 ms 6716 KB Output is correct
68 Correct 32 ms 5472 KB Output is correct
69 Correct 31 ms 5672 KB Output is correct
70 Correct 29 ms 6740 KB Output is correct
71 Correct 33 ms 9664 KB Output is correct
72 Correct 27 ms 9260 KB Output is correct
73 Correct 28 ms 9636 KB Output is correct
74 Correct 28 ms 10044 KB Output is correct
75 Correct 35 ms 8780 KB Output is correct
76 Correct 33 ms 9112 KB Output is correct
77 Correct 32 ms 9652 KB Output is correct
78 Correct 31 ms 9628 KB Output is correct
79 Correct 32 ms 8884 KB Output is correct
80 Correct 28 ms 8436 KB Output is correct
81 Correct 32 ms 9916 KB Output is correct
82 Correct 27 ms 9376 KB Output is correct
83 Correct 27 ms 9880 KB Output is correct
84 Correct 32 ms 10684 KB Output is correct
85 Correct 33 ms 8636 KB Output is correct
86 Correct 29 ms 10396 KB Output is correct
87 Correct 29 ms 9244 KB Output is correct
88 Correct 31 ms 8556 KB Output is correct
89 Correct 29 ms 9760 KB Output is correct
90 Correct 35 ms 10396 KB Output is correct
91 Correct 29 ms 9628 KB Output is correct
92 Correct 32 ms 10776 KB Output is correct
93 Correct 33 ms 9248 KB Output is correct
94 Correct 32 ms 11652 KB Output is correct
95 Correct 33 ms 9348 KB Output is correct
96 Correct 27 ms 9624 KB Output is correct
97 Correct 29 ms 11812 KB Output is correct
98 Correct 30 ms 10892 KB Output is correct
99 Correct 30 ms 10820 KB Output is correct
100 Correct 35 ms 11452 KB Output is correct
101 Correct 35 ms 9880 KB Output is correct
102 Correct 41 ms 9532 KB Output is correct