oj.uz

Submission #789951

# Submission time Handle Problem Language Result Execution time Memory
789951 2023-07-22T08:07:53 Z fatemetmhr Wiring (IOI17_wiring) C++17
100 / 100
 42 ms 8752 KB 
//  ~ Be Name Khoda ~  //

#include "wiring.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;

ll dp[2][maxn5], pre[maxn5], suf[maxn5], cost[maxn5];
vector <pair<ll, int>> av;	


void build(int ty, int n, ll dis){
	pre[0] = dp[ty][0];
	for(int i = 1; i <= n; i++)
		pre[i] = min(pre[i - 1], dp[ty][i] - dis * i);
	suf[n] = dp[ty][n];
	for(int i = n - 1; i >= 0; i--)
		suf[i] = min(suf[i + 1], dp[ty][i]);
	/*
	cout << "in " << ty << ' ' << n << ' ' << dis << endl;
	for(int i = 0; i <= n; i++)
		cout << i << ' ' << pre[i] << ' ' << suf[i] << ' ' << dp[ty][i] << endl;
	*/
}


ll get_min(int x, int n, ll dis){
	ll ans = pre[min(x, n)];
	if(n >= x)
		ans = min(ans, suf[x] - dis * x);
	//cout << "getting min of " << x << ' ' << n << ' ' << dis << ' ' << ans << endl;
	return ans;
}


long long min_total_length(std::vector<int> r, std::vector<int> b){
	for(int i = 0; i < r.size(); i++)
		av.pb({r[i], 0});
	for(int i = 0; i < b.size(); i++)
		av.pb({b[i], 1});
	sort(all(av));
	int last = 0, n = 0;
	for(int i = 0; i < av.size(); i++){
		if(av[i].se == av[last].se)
			continue;
		//cout << "ok " << i << ' ' << last << ' ' << n << endl;
		if(n == 0){
			n = i - last;
			for(int j = 0; j < n; j++)
				dp[av[last].se][j] = inf;
			for(int j = last; j < i; j++)
				dp[av[last].se][n] += av[i].fi - av[j].fi;
			build(av[last].se, n, av[i].fi - av[i - 1].fi);
			last = i;
			continue;
		}
		int m = i - last;
		ll cur = 0;
		fill(cost, cost + m + 4, 0);
		for(int j = last; j <= i; j++){
			cost[m - (j - last)] = cur;
			cur += av[j].fi - av[last - 1].fi;
		}
		//cout << cost[0] << endl;
		for(int j = 0; j < m; j++)
			dp[av[last].se][j] = get_min(m - j, n, av[last].fi - av[last - 1].fi) + cost[j];
		dp[av[last].se][m] = dp[av[last].se ^ 1][0] + cost[m];
		cur = 0;
		for(int j = i - 1; j >= last; j--){
			cur += av[i].fi - av[j].fi;
			dp[av[last].se][m - (j - last)] += cur;	
		}
		build(av[last].se, m, av[i].fi - av[i - 1].fi);
		n = m;
		last = i;
	}
	int i = av.size();
	int m = i - last;
	ll cur = 0;
	for(int j = last; j <= i; j++){
		cost[m - (j - last)] = cur;
		if(j < i)
			cur += av[j].fi - av[last - 1].fi;
	}
	for(int j = 0; j < 1; j++)
		dp[av[last].se][j] = get_min(m - j, n, av[last].fi - av[last - 1].fi) + cost[j];
	return dp[av[last].se][0];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:55:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for(int i = 0; i < r.size(); i++)
      |                 ~~^~~~~~~~~~
wiring.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i = 0; i < b.size(); i++)
      |                 ~~^~~~~~~~~~
wiring.cpp:61:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(int i = 0; i < av.size(); i++){
      |                 ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 20 ms 6748 KB Output is correct
4 Correct 19 ms 6720 KB Output is correct
5 Correct 20 ms 5872 KB Output is correct
6 Correct 25 ms 8240 KB Output is correct
7 Correct 24 ms 8248 KB Output is correct
8 Correct 24 ms 8216 KB Output is correct
9 Correct 24 ms 8236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 37 ms 6128 KB Output is correct
4 Correct 36 ms 6080 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 35 ms 6076 KB Output is correct
19 Correct 35 ms 6036 KB Output is correct
20 Correct 36 ms 6084 KB Output is correct
21 Correct 35 ms 6084 KB Output is correct
22 Correct 35 ms 6080 KB Output is correct
23 Correct 35 ms 6080 KB Output is correct
24 Correct 42 ms 6084 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 6084 KB Output is correct
3 Correct 33 ms 6068 KB Output is correct
4 Correct 33 ms 6076 KB Output is correct
5 Correct 33 ms 6084 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 30 ms 6688 KB Output is correct
19 Correct 31 ms 6084 KB Output is correct
20 Correct 30 ms 6076 KB Output is correct
21 Correct 28 ms 6076 KB Output is correct
22 Correct 31 ms 8116 KB Output is correct
23 Correct 26 ms 8176 KB Output is correct
24 Correct 26 ms 7872 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 20 ms 6748 KB Output is correct
20 Correct 19 ms 6720 KB Output is correct
21 Correct 20 ms 5872 KB Output is correct
22 Correct 25 ms 8240 KB Output is correct
23 Correct 24 ms 8248 KB Output is correct
24 Correct 24 ms 8216 KB Output is correct
25 Correct 24 ms 8236 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 37 ms 6128 KB Output is correct
29 Correct 36 ms 6080 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 35 ms 6076 KB Output is correct
44 Correct 35 ms 6036 KB Output is correct
45 Correct 36 ms 6084 KB Output is correct
46 Correct 35 ms 6084 KB Output is correct
47 Correct 35 ms 6080 KB Output is correct
48 Correct 35 ms 6080 KB Output is correct
49 Correct 42 ms 6084 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 31 ms 6084 KB Output is correct
52 Correct 33 ms 6068 KB Output is correct
53 Correct 33 ms 6076 KB Output is correct
54 Correct 33 ms 6084 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 0 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 340 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 30 ms 6688 KB Output is correct
68 Correct 31 ms 6084 KB Output is correct
69 Correct 30 ms 6076 KB Output is correct
70 Correct 28 ms 6076 KB Output is correct
71 Correct 31 ms 8116 KB Output is correct
72 Correct 26 ms 8176 KB Output is correct
73 Correct 26 ms 7872 KB Output is correct
74 Correct 26 ms 8404 KB Output is correct
75 Correct 32 ms 6956 KB Output is correct
76 Correct 31 ms 7336 KB Output is correct
77 Correct 38 ms 7460 KB Output is correct
78 Correct 29 ms 7736 KB Output is correct
79 Correct 31 ms 7472 KB Output is correct
80 Correct 26 ms 7480 KB Output is correct
81 Correct 33 ms 8588 KB Output is correct
82 Correct 26 ms 8228 KB Output is correct
83 Correct 25 ms 7784 KB Output is correct
84 Correct 25 ms 8204 KB Output is correct
85 Correct 32 ms 6944 KB Output is correct
86 Correct 27 ms 7856 KB Output is correct
87 Correct 29 ms 7744 KB Output is correct
88 Correct 29 ms 7196 KB Output is correct
89 Correct 29 ms 7488 KB Output is correct
90 Correct 33 ms 7344 KB Output is correct
91 Correct 27 ms 7968 KB Output is correct
92 Correct 29 ms 7604 KB Output is correct
93 Correct 27 ms 7736 KB Output is correct
94 Correct 30 ms 8108 KB Output is correct
95 Correct 31 ms 7232 KB Output is correct
96 Correct 26 ms 7992 KB Output is correct
97 Correct 28 ms 8752 KB Output is correct
98 Correct 29 ms 8376 KB Output is correct
99 Correct 29 ms 8384 KB Output is correct
100 Correct 32 ms 7736 KB Output is correct
101 Correct 29 ms 8364 KB Output is correct
102 Correct 33 ms 7576 KB Output is correct