oj.uz

Submission #289071

# Submission time Handle Problem Language Result Execution time Memory
289071 2020-09-02T10:24:25 Z _7_7_ Wiring (IOI17_wiring) C++14
100 / 100
 113 ms 9452 KB 
#include "wiring.h"
#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;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2e5 + 11;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

int n, m, prv[N];
ll dp[N], s[N];
vpii V;

ll get (int l, int r) {
	return s[r] - (!l ? 0 : s[l - 1]);
}

ll min_total_length(vi r, vi b) {
	n = sz(r), m = sz(b);
	for (auto x : r)
		V.pb(mp(x, 0));

	for (auto x : b) 
		V.pb(mp(x, 1)); 
	
	
	sort(all(V));


	memset(prv, -1, sizeof(prv));

	for (int i = 0; i < sz(V); ++i) {
		s[i] = (!i ? 0 : s[i - 1]) + V[i].f;
		int j = i;
		while (j + 1 < sz(V) && V[i].s == V[j + 1].s) {
			++j; 
			s[j] = s[j - 1] + V[j].f;
		}

		for (int x = i; x <= j; ++x) {
			dp[x] = INF;

			if (i) {
				dp[x] = dp[x - 1] + V[x].f - V[i - 1].f;
				if (x == i)
					prv[x] = i - 1;
				else
					prv[x] = prv[x - 1] - 1;

				if (prv[x] >= 0 && V[x].s == V[prv[x]].s)
					prv[x] = -1;
					
				if (x == 1)
					cerr << prv[x] << endl;

				if (prv[x] >= 0)
					dp[x] = min(dp[x], (!prv[x] ? 0 : dp[prv[x] - 1]) + get(i, x) - get(prv[x], i - 1));
			}

			if (j + 1 < sz(V))
				dp[x] = min((!x ? 0 : dp[x - 1]) + V[j + 1].f - V[x].f, dp[x]);			
		}
		i = j;
	}

/*	for (int i = 0; i < n + m; ++i)
		cerr << V[i].f << ' ' << V[i].s << endl;

	for (int i = 0; i < n + m; ++i)
		cerr << dp[i] << ' ';*/

	return dp[n + m - 1];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 34 ms 5992 KB Output is correct
4 Correct 33 ms 5872 KB Output is correct
5 Correct 35 ms 5992 KB Output is correct
6 Correct 44 ms 7528 KB Output is correct
7 Correct 44 ms 7528 KB Output is correct
8 Correct 45 ms 7540 KB Output is correct
9 Correct 46 ms 7544 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 59 ms 7528 KB Output is correct
4 Correct 61 ms 9064 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 2 ms 1128 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 1 ms 1152 KB Output is correct
18 Correct 90 ms 9448 KB Output is correct
19 Correct 105 ms 9448 KB Output is correct
20 Correct 62 ms 9448 KB Output is correct
21 Correct 97 ms 9424 KB Output is correct
22 Correct 58 ms 9448 KB Output is correct
23 Correct 76 ms 9448 KB Output is correct
24 Correct 59 ms 9448 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 47 ms 7544 KB Output is correct
3 Correct 55 ms 8808 KB Output is correct
4 Correct 52 ms 8808 KB Output is correct
5 Correct 51 ms 8808 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 1 ms 1152 KB Output is correct
18 Correct 57 ms 8808 KB Output is correct
19 Correct 76 ms 8808 KB Output is correct
20 Correct 51 ms 8808 KB Output is correct
21 Correct 64 ms 8812 KB Output is correct
22 Correct 69 ms 8680 KB Output is correct
23 Correct 41 ms 8748 KB Output is correct
24 Correct 83 ms 8808 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1056 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 1 ms 1152 KB Output is correct
18 Correct 1 ms 1152 KB Output is correct
19 Correct 34 ms 5992 KB Output is correct
20 Correct 33 ms 5872 KB Output is correct
21 Correct 35 ms 5992 KB Output is correct
22 Correct 44 ms 7528 KB Output is correct
23 Correct 44 ms 7528 KB Output is correct
24 Correct 45 ms 7540 KB Output is correct
25 Correct 46 ms 7544 KB Output is correct
26 Correct 1 ms 1152 KB Output is correct
27 Correct 1 ms 1152 KB Output is correct
28 Correct 59 ms 7528 KB Output is correct
29 Correct 61 ms 9064 KB Output is correct
30 Correct 1 ms 1152 KB Output is correct
31 Correct 1 ms 1152 KB Output is correct
32 Correct 1 ms 1152 KB Output is correct
33 Correct 1 ms 1152 KB Output is correct
34 Correct 1 ms 1152 KB Output is correct
35 Correct 1 ms 1152 KB Output is correct
36 Correct 1 ms 1152 KB Output is correct
37 Correct 1 ms 1152 KB Output is correct
38 Correct 2 ms 1128 KB Output is correct
39 Correct 1 ms 1152 KB Output is correct
40 Correct 1 ms 1152 KB Output is correct
41 Correct 1 ms 1152 KB Output is correct
42 Correct 1 ms 1152 KB Output is correct
43 Correct 90 ms 9448 KB Output is correct
44 Correct 105 ms 9448 KB Output is correct
45 Correct 62 ms 9448 KB Output is correct
46 Correct 97 ms 9424 KB Output is correct
47 Correct 58 ms 9448 KB Output is correct
48 Correct 76 ms 9448 KB Output is correct
49 Correct 59 ms 9448 KB Output is correct
50 Correct 1 ms 1152 KB Output is correct
51 Correct 47 ms 7544 KB Output is correct
52 Correct 55 ms 8808 KB Output is correct
53 Correct 52 ms 8808 KB Output is correct
54 Correct 51 ms 8808 KB Output is correct
55 Correct 1 ms 1152 KB Output is correct
56 Correct 1 ms 1152 KB Output is correct
57 Correct 1 ms 1152 KB Output is correct
58 Correct 1 ms 1152 KB Output is correct
59 Correct 1 ms 1152 KB Output is correct
60 Correct 1 ms 1152 KB Output is correct
61 Correct 1 ms 1152 KB Output is correct
62 Correct 1 ms 1152 KB Output is correct
63 Correct 1 ms 1152 KB Output is correct
64 Correct 1 ms 1152 KB Output is correct
65 Correct 1 ms 1152 KB Output is correct
66 Correct 1 ms 1152 KB Output is correct
67 Correct 57 ms 8808 KB Output is correct
68 Correct 76 ms 8808 KB Output is correct
69 Correct 51 ms 8808 KB Output is correct
70 Correct 64 ms 8812 KB Output is correct
71 Correct 69 ms 8680 KB Output is correct
72 Correct 41 ms 8748 KB Output is correct
73 Correct 83 ms 8808 KB Output is correct
74 Correct 99 ms 9448 KB Output is correct
75 Correct 113 ms 9064 KB Output is correct
76 Correct 89 ms 9448 KB Output is correct
77 Correct 50 ms 8900 KB Output is correct
78 Correct 98 ms 8808 KB Output is correct
79 Correct 103 ms 8812 KB Output is correct
80 Correct 43 ms 8808 KB Output is correct
81 Correct 47 ms 8936 KB Output is correct
82 Correct 44 ms 8936 KB Output is correct
83 Correct 57 ms 9064 KB Output is correct
84 Correct 50 ms 9448 KB Output is correct
85 Correct 56 ms 9452 KB Output is correct
86 Correct 49 ms 9444 KB Output is correct
87 Correct 52 ms 9448 KB Output is correct
88 Correct 52 ms 9452 KB Output is correct
89 Correct 50 ms 9448 KB Output is correct
90 Correct 57 ms 9448 KB Output is correct
91 Correct 54 ms 9448 KB Output is correct
92 Correct 51 ms 9448 KB Output is correct
93 Correct 50 ms 9448 KB Output is correct
94 Correct 53 ms 9448 KB Output is correct
95 Correct 54 ms 9452 KB Output is correct
96 Correct 62 ms 9448 KB Output is correct
97 Correct 50 ms 9448 KB Output is correct
98 Correct 55 ms 9448 KB Output is correct
99 Correct 54 ms 9444 KB Output is correct
100 Correct 63 ms 9452 KB Output is correct
101 Correct 51 ms 9448 KB Output is correct
102 Correct 88 ms 9448 KB Output is correct