Submission #976521

# Submission time Handle Problem Language Result Execution time Memory
976521 2024-05-06T16:18:29 Z GrindMachine Wiring (IOI17_wiring) C++17
100 / 100
104 ms 20508 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs;
https://cubelover.tistory.com/8

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "wiring.h"

long long min_total_length(std::vector<int> a, std::vector<int> b) {
	ll n = sz(a), m = sz(b);
	sort(all(a)), sort(all(b));

	vector<array<ll,3>> c;
	
	rep(i,n){
		ll x = a[i];
		auto it = lower_bound(all(b),x);
		ll bef = -inf2, aft = inf2;
		if(it != b.end()) aft = *it;
		if(it != b.begin()) bef = *prev(it);
		ll mn_dis = min(abs(x-bef),abs(x-aft));
		c.pb({x,mn_dis,1}); 		
	}

	rep(i,m){
		ll x = b[i];
		auto it = lower_bound(all(a),x);
		ll bef = -inf2, aft = inf2;
		if(it != a.end()) aft = *it;
		if(it != a.begin()) bef = *prev(it);
		ll mn_dis = min(abs(x-bef),abs(x-aft));
		c.pb({x,mn_dis,2});
	}
	
	sort(all(c));
	ll siz = sz(c);
	c.insert(c.begin(),{0,0});

	vector<ll> p(siz+5), pref(siz+5);
	rep1(i,siz){
		p[i] = p[i-1], pref[i] = pref[i-1];
		if(c[i][2] == 1) p[i]++, pref[i] += c[i][0];
		else p[i]--, pref[i] -= c[i][0];
	}

	vector<ll> dp(siz+5,inf2);
	map<ll,ll> mp;
	dp[0] = 0;
	mp[0] = 0;
	
	rep1(i,siz){
		dp[i] = dp[i-1]+c[i][1];
		if(mp.count(p[i])){
			ll j = mp[p[i]];
			ll diff = pref[i]-pref[j];
			amin(dp[i],dp[j]+abs(diff));
		}

		mp[p[i]] = i;
	}

	return dp[siz]; 
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 432 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 61 ms 17660 KB Output is correct
4 Correct 61 ms 17104 KB Output is correct
5 Correct 59 ms 17332 KB Output is correct
6 Correct 79 ms 19612 KB Output is correct
7 Correct 78 ms 19384 KB Output is correct
8 Correct 79 ms 19388 KB Output is correct
9 Correct 80 ms 19388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 68 ms 13964 KB Output is correct
4 Correct 56 ms 12732 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 71 ms 13236 KB Output is correct
19 Correct 65 ms 13300 KB Output is correct
20 Correct 58 ms 14008 KB Output is correct
21 Correct 61 ms 13248 KB Output is correct
22 Correct 73 ms 14060 KB Output is correct
23 Correct 64 ms 14280 KB Output is correct
24 Correct 60 ms 13600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 80 ms 14532 KB Output is correct
3 Correct 72 ms 12700 KB Output is correct
4 Correct 82 ms 14112 KB Output is correct
5 Correct 65 ms 14088 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 87 ms 15000 KB Output is correct
19 Correct 75 ms 13500 KB Output is correct
20 Correct 69 ms 13216 KB Output is correct
21 Correct 77 ms 14012 KB Output is correct
22 Correct 104 ms 17484 KB Output is correct
23 Correct 81 ms 18108 KB Output is correct
24 Correct 85 ms 17936 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 432 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 61 ms 17660 KB Output is correct
20 Correct 61 ms 17104 KB Output is correct
21 Correct 59 ms 17332 KB Output is correct
22 Correct 79 ms 19612 KB Output is correct
23 Correct 78 ms 19384 KB Output is correct
24 Correct 79 ms 19388 KB Output is correct
25 Correct 80 ms 19388 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 68 ms 13964 KB Output is correct
29 Correct 56 ms 12732 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 71 ms 13236 KB Output is correct
44 Correct 65 ms 13300 KB Output is correct
45 Correct 58 ms 14008 KB Output is correct
46 Correct 61 ms 13248 KB Output is correct
47 Correct 73 ms 14060 KB Output is correct
48 Correct 64 ms 14280 KB Output is correct
49 Correct 60 ms 13600 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 80 ms 14532 KB Output is correct
52 Correct 72 ms 12700 KB Output is correct
53 Correct 82 ms 14112 KB Output is correct
54 Correct 65 ms 14088 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 2 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 87 ms 15000 KB Output is correct
68 Correct 75 ms 13500 KB Output is correct
69 Correct 69 ms 13216 KB Output is correct
70 Correct 77 ms 14012 KB Output is correct
71 Correct 104 ms 17484 KB Output is correct
72 Correct 81 ms 18108 KB Output is correct
73 Correct 85 ms 17936 KB Output is correct
74 Correct 81 ms 19892 KB Output is correct
75 Correct 90 ms 17560 KB Output is correct
76 Correct 88 ms 17596 KB Output is correct
77 Correct 85 ms 16564 KB Output is correct
78 Correct 84 ms 17084 KB Output is correct
79 Correct 85 ms 18116 KB Output is correct
80 Correct 94 ms 17596 KB Output is correct
81 Correct 85 ms 18428 KB Output is correct
82 Correct 87 ms 18384 KB Output is correct
83 Correct 84 ms 18080 KB Output is correct
84 Correct 80 ms 20508 KB Output is correct
85 Correct 90 ms 17852 KB Output is correct
86 Correct 81 ms 17592 KB Output is correct
87 Correct 83 ms 17880 KB Output is correct
88 Correct 86 ms 18604 KB Output is correct
89 Correct 81 ms 17052 KB Output is correct
90 Correct 87 ms 16796 KB Output is correct
91 Correct 81 ms 19660 KB Output is correct
92 Correct 83 ms 18072 KB Output is correct
93 Correct 83 ms 17968 KB Output is correct
94 Correct 92 ms 18868 KB Output is correct
95 Correct 85 ms 17084 KB Output is correct
96 Correct 81 ms 19384 KB Output is correct
97 Correct 85 ms 20088 KB Output is correct
98 Correct 83 ms 18740 KB Output is correct
99 Correct 84 ms 19380 KB Output is correct
100 Correct 83 ms 17336 KB Output is correct
101 Correct 88 ms 18500 KB Output is correct
102 Correct 91 ms 17596 KB Output is correct