oj.uz

답안 #941342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941342 2024-03-08T15:21:31 Z pan 전선 연결 (IOI17_wiring) C++17
100 / 100
 236 ms 34536 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, srb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> piii;
typedef pair<pi, pi> pii;

ll const INF = 1e15;
struct node{

    int s, e, m; 
    ll val;
    ll lazy; 
    node *l, *r; 
	node (int S, int E)
	{ 
       s = S, e = E, m = (s+e)/2;
       val = 0; 
       lazy = 0; 
       l=r=nullptr;
 
    }
    void create()
    {
		if(s != e && l==nullptr)
		   { 
			   l = new node(s, m); 
			   r = new node(m+1, e); 
		   }
    }
 
	void propogate()
	{
       if (lazy==0) return; 
       create();
       val+=lazy; 
       if (s != e){ 
           l->lazy+=lazy;
           r->lazy+=lazy;
       }
       lazy=0; 
    }
	void update(int S, int E, ll V)
	{ 
	   propogate();
       if(s==S && e==E) lazy += V; 
       else{ 
           create();
           if(E <= m) l->update(S, E, V); 
           else if (m < S) r->update(S, E, V); 
           else l->update(S, m, V),r->update(m+1, E, V);
           l->propogate(),r->propogate();
		   val = min(l->val, r->val);
          
       }
    }
	ll query(int S, int E)
	{

       propogate(); 
       if(s == S && e == E) return val;
       create();
       if(E <= m) return l->query(S, E); 
       else if(S >= m+1) return r->query(S, E); 
       else return min(l->query(S, m), r->query(m+1, E)); 
   }

} *root;
 



long long min_total_length(std::vector<int> r, std::vector<int> b)
{
	ll n= r.size();
	ll m = b.size();
	root = new node(0, n+m);
	ll dp[n+m+5];
	// merge red and blue into consecutive range
	vector<pi> c;
	for (ll i=0; i<n; ++i) c.pb(mp(r[i], 0));
	for (ll i=0; i<m; ++i) c.pb(mp(b[i], 1));
	sort(c.begin(), c.end());
	
	// deal with (painful) base case 
	ll i = 0;
	while (c[i].s==c[0].s) i++;
	ll ps = 0;
	for (ll j=i-1; j>=1; --j)
	{
		ps+=c[i].f - c[j].f;
		root->update(j, j, INF);
		dp[j] = INF;
	}
	ps+= c[i].f - c[0].f;
	dp[0] = 0;
	root->update(0, 0, ps);
	dp[i] = ps; 
	ll l1 = i, l2 = 0, cur = 1;
	// transition
	while (++i<n+m)
	{
		if (c[i].s==c[l1].s) // segment continue
		{
			cur++;
			root->update(l2, l1-1, c[i].f);
			if (l2<=l1-cur) root->update(l2, l1-cur, -c[l1].f);
			root->update(max(l2, l1-cur+1), l1-1, -c[l1-1].f);
			dp[i] = root->query(l2, l1-1);
			 
		}
		else // new segment
		{
			l2 = l1;
			l1= i;
			cur = 1;
			ll ps = 0;
			for (ll j=l1-1; j>=l2; --j)
			{
				ps += c[l1].f - c[j].f;
				root->update(j, j, min(dp[j], dp[j-1])+ps);
			}
			dp[i] = root->query(l2, l1-1);
		}
	}
	return dp[n+m-1];

}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 1 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 70 ms 19712 KB Output is correct
4 Correct 71 ms 20408 KB Output is correct
5 Correct 69 ms 12744 KB Output is correct
6 Correct 114 ms 21432 KB Output is correct
7 Correct 101 ms 21052 KB Output is correct
8 Correct 131 ms 20924 KB Output is correct
9 Correct 115 ms 21124 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 134 ms 33576 KB Output is correct
4 Correct 189 ms 33924 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 134 ms 33548 KB Output is correct
19 Correct 142 ms 34248 KB Output is correct
20 Correct 153 ms 33872 KB Output is correct
21 Correct 133 ms 33464 KB Output is correct
22 Correct 138 ms 33980 KB Output is correct
23 Correct 164 ms 33480 KB Output is correct
24 Correct 136 ms 33464 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 196 ms 32416 KB Output is correct
3 Correct 150 ms 32664 KB Output is correct
4 Correct 186 ms 31928 KB Output is correct
5 Correct 157 ms 32796 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 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 0 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 182 ms 30392 KB Output is correct
19 Correct 200 ms 33172 KB Output is correct
20 Correct 222 ms 32952 KB Output is correct
21 Correct 208 ms 32672 KB Output is correct
22 Correct 151 ms 31100 KB Output is correct
23 Correct 128 ms 28860 KB Output is correct
24 Correct 162 ms 29368 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 1 ms 348 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 70 ms 19712 KB Output is correct
20 Correct 71 ms 20408 KB Output is correct
21 Correct 69 ms 12744 KB Output is correct
22 Correct 114 ms 21432 KB Output is correct
23 Correct 101 ms 21052 KB Output is correct
24 Correct 131 ms 20924 KB Output is correct
25 Correct 115 ms 21124 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 134 ms 33576 KB Output is correct
29 Correct 189 ms 33924 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 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 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 134 ms 33548 KB Output is correct
44 Correct 142 ms 34248 KB Output is correct
45 Correct 153 ms 33872 KB Output is correct
46 Correct 133 ms 33464 KB Output is correct
47 Correct 138 ms 33980 KB Output is correct
48 Correct 164 ms 33480 KB Output is correct
49 Correct 136 ms 33464 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 196 ms 32416 KB Output is correct
52 Correct 150 ms 32664 KB Output is correct
53 Correct 186 ms 31928 KB Output is correct
54 Correct 157 ms 32796 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 440 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 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 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 182 ms 30392 KB Output is correct
68 Correct 200 ms 33172 KB Output is correct
69 Correct 222 ms 32952 KB Output is correct
70 Correct 208 ms 32672 KB Output is correct
71 Correct 151 ms 31100 KB Output is correct
72 Correct 128 ms 28860 KB Output is correct
73 Correct 162 ms 29368 KB Output is correct
74 Correct 148 ms 34044 KB Output is correct
75 Correct 163 ms 33896 KB Output is correct
76 Correct 160 ms 33468 KB Output is correct
77 Correct 236 ms 33540 KB Output is correct
78 Correct 189 ms 32848 KB Output is correct
79 Correct 227 ms 32696 KB Output is correct
80 Correct 188 ms 33212 KB Output is correct
81 Correct 129 ms 32896 KB Output is correct
82 Correct 149 ms 32960 KB Output is correct
83 Correct 140 ms 25532 KB Output is correct
84 Correct 150 ms 27292 KB Output is correct
85 Correct 192 ms 34536 KB Output is correct
86 Correct 194 ms 30136 KB Output is correct
87 Correct 169 ms 29284 KB Output is correct
88 Correct 171 ms 33860 KB Output is correct
89 Correct 166 ms 33468 KB Output is correct
90 Correct 197 ms 33244 KB Output is correct
91 Correct 134 ms 33616 KB Output is correct
92 Correct 187 ms 33464 KB Output is correct
93 Correct 165 ms 33960 KB Output is correct
94 Correct 183 ms 32724 KB Output is correct
95 Correct 194 ms 33468 KB Output is correct
96 Correct 143 ms 29624 KB Output is correct
97 Correct 134 ms 33208 KB Output is correct
98 Correct 149 ms 32040 KB Output is correct
99 Correct 148 ms 32760 KB Output is correct
100 Correct 212 ms 34036 KB Output is correct
101 Correct 142 ms 33468 KB Output is correct
102 Correct 155 ms 33468 KB Output is correct