oj.uz

답안 #559279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559279 2022-05-09T14:59:34 Z LastRonin 도로 폐쇄 (APIO21_roads) C++14
22 / 100
 685 ms 66664 KB 
//#include "roads.h"

#include <bits/stdc++.h>

#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 
#define ll long long
#define pii pair<ll, ll>
#define f first
#define s second
#define mp make_pair
#define pinode pair<node*, node*>
#define pb push_back
 
using namespace std;
 
const int N = 3e5 + 10;

mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());



struct node {
	node *l = nullptr, *r = nullptr;
	ll sz = 1, y = 0, sum = 0, x = 0;
	node(ll nx) {
		x = nx;
		sz = 1;
		l = r = nullptr;
		y = bruh();
		sum = nx;
	}
} *rt[N];

void pull(node *a) {
	if(!a)return;
	a->sum = a->x;
	a->sz = 1;
	if(a->l)a->sum += a->l->sum, a->sz += a->l->sz;
	if(a->r)a->sum += a->r->sum, a->sz += a->r->sz;
}

node *mrg(node *a, node *b) {
	if(!a || !b)
		return (a ? a : b);
	if(a->y > b->y) {
		a->r = mrg(a->r, b);
		pull(a);
		return a;
	}
	b->l = mrg(a, b->l);
	pull(b);
	return b;
}

pinode splitSz(node *a, ll F) {
	if(!a) 
		return mp(nullptr, nullptr);
	if((a->l ? a->l->sz : 0) >= F) {
		pinode z = splitSz(a->l, F);
		a->l = z.s;
		pull(a);
		return mp(z.f, a);					
	}
	else {
		ll dlt = F - (a->l ? a->l->sz + 1 : 1);
		pinode z = splitSz(a->r, dlt);
		a->r = z.f;
		pull(a);
		return mp(a, z.s);
	}
}

pinode splitX(node *a, ll x) {
	if(!a) 
		return mp(nullptr, nullptr);
	if(a->x <= x) {
		pinode z = splitX(a->r, x);
		a->r = z.f;
		pull(a);
		return mp(a, z.s);			
	}
	else {
		pinode z = splitX(a->l, x);
		a->l = z.s;
		pull(a);
		return mp(z.f, a);
	}
}


ll get(ll v, ll del) {
	if(del == -1)return 0;
	pinode z = splitSz(rt[v], del);
    ll sum = (z.f ? z.f->sum : 0);
	rt[v] = mrg(z.f, z.s);
	return sum;
}

void insert(ll v, ll zn) {
	pinode z = splitX(rt[v], zn);
	node *u = new node(zn);
	rt[v] = mrg(mrg(z.f, u), z.s);
}

void dele(ll v, ll zn) {
	pinode z = splitX(rt[v], zn - 1);
	pinode z2 = splitSz(z.s, 1);
	rt[v] = mrg(z.f, z2.s);
}


ll dp[N][2];
bool was[N];

vector<int> act;
vector<pii> g[N];
vector<pii> g2[N];
vector<int> st[N];

void solve(ll v, ll p, ll x) {
	ll del = g2[v].size() - x;
	was[v] = 1;
	for(auto u : g[v]) {
		if(u.f != p) {
			solve(u.f, v, x);
		}
	}
	ll sum = 0;
	for(auto u : g[v]) {
		if(u.f != p) {
			sum += dp[u.f][1];
			if(dp[u.f][0] + u.s - dp[u.f][1] < 0)
				sum += dp[u.f][0] + u.s - dp[u.f][1], del--;
			else
				insert(v, dp[u.f][0] + u.s - dp[u.f][1]);		
		}
	}
	dp[v][0] = sum + get(v, del - 1);
	dp[v][1] = sum + get(v, del);	
	for(auto u : g[v]) {
		if(u.f != p) {
		    if(dp[u.f][0] + u.s - dp[u.f][1] >= 0)
				dele(v, dp[u.f][0] + u.s - dp[u.f][1]);
		}
	}
}

vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
	for(int i = 0; i <= n; i++)
		rt[i] = nullptr;	
	vector<ll> answ;
	for(int j = 0; j < n; j++)
		U[j]++, V[j]++;
	for(int i = 1; i < n; i++) {
		g2[U[i - 1]].pb(mp(V[i - 1], W[i - 1]));
		g2[V[i - 1]].pb(mp(U[i - 1], W[i - 1]));
	}
	for(int i = 1; i <= n; i++) {
		st[g2[i].size()].pb(i);
	}
	for(int j = n - 1; j >= 0; j--) {
		for(auto v : st[j]) {
		    act.pb(v);
			for(auto u : g2[v]) {
				if(g2[u.f].size() > j) {
					g[u.f].pb(mp(v, u.s));
					g[v].pb(u);
					dele(u.f, u.s);
				}
				else if(g2[u.f].size() == j) {
					g[v].pb(u);									
				}
				else {
					insert(v, u.s);
				}
		   	}
		}
		ll ans = 0;
		for(auto u : act) {
			if(!was[u]) { 
				solve(u, 0, j);
				ans += dp[u][1];
			}
		}
		answ.pb(ans);
		for(auto u : act)was[u] = 0, dp[u][0] = dp[u][1] = 0;
	}           	
	reverse(answ.begin(), answ.end());
	return answ;
}
/*
int main() {
	speed;	
	ll n;
	vector<ll> a, b, c;
	cin >> n;
	for(int i = 1; i < n; i++) {
		a.pb(0), b.pb(0), c.pb(0);
		cin >> a.back() >> b.back() >> c.back();
	}
	vector<ll> answ = minimum_closure_costs(n, a, b, c);
	ll lst = answ.size() - 1ll;
	for(auto u : answ)
		cout << u << (lst == 0 ? "" : " "), lst--;
	cout << "\n";	
}
*/

Compilation message

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:165:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  165 |     if(g2[u.f].size() > j) {
      |        ~~~~~~~~~~~~~~~^~~
roads.cpp:170:28: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  170 |     else if(g2[u.f].size() == j) {
      |             ~~~~~~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 18 ms 22100 KB Output is correct
3 Correct 17 ms 22120 KB Output is correct
4 Correct 15 ms 22172 KB Output is correct
5 Correct 14 ms 21472 KB Output is correct
6 Correct 12 ms 21460 KB Output is correct
7 Correct 17 ms 21452 KB Output is correct
8 Correct 18 ms 22044 KB Output is correct
9 Correct 24 ms 22156 KB Output is correct
10 Correct 14 ms 21460 KB Output is correct
11 Correct 12 ms 21428 KB Output is correct
12 Correct 244 ms 42312 KB Output is correct
13 Correct 525 ms 55976 KB Output is correct
14 Correct 602 ms 52408 KB Output is correct
15 Correct 685 ms 55856 KB Output is correct
16 Correct 672 ms 56212 KB Output is correct
17 Correct 292 ms 56372 KB Output is correct
18 Correct 11 ms 21332 KB Output is correct
19 Correct 261 ms 52832 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21368 KB Output is correct
2 Correct 103 ms 57112 KB Output is correct
3 Correct 107 ms 60796 KB Output is correct
4 Correct 126 ms 64092 KB Output is correct
5 Correct 123 ms 65304 KB Output is correct
6 Correct 14 ms 22100 KB Output is correct
7 Correct 13 ms 22216 KB Output is correct
8 Correct 14 ms 22124 KB Output is correct
9 Runtime error 36 ms 43424 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 12 ms 21352 KB Output is correct
3 Correct 13 ms 21332 KB Output is correct
4 Correct 13 ms 21420 KB Output is correct
5 Correct 12 ms 21476 KB Output is correct
6 Runtime error 32 ms 43404 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 12 ms 21352 KB Output is correct
3 Correct 13 ms 21332 KB Output is correct
4 Correct 13 ms 21420 KB Output is correct
5 Correct 12 ms 21476 KB Output is correct
6 Runtime error 32 ms 43404 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 59320 KB Output is correct
2 Correct 267 ms 58712 KB Output is correct
3 Correct 329 ms 64064 KB Output is correct
4 Correct 261 ms 60612 KB Output is correct
5 Correct 301 ms 64216 KB Output is correct
6 Correct 308 ms 62216 KB Output is correct
7 Correct 302 ms 64392 KB Output is correct
8 Correct 260 ms 54776 KB Output is correct
9 Correct 253 ms 63184 KB Output is correct
10 Correct 238 ms 62048 KB Output is correct
11 Correct 321 ms 62776 KB Output is correct
12 Correct 267 ms 60476 KB Output is correct
13 Correct 12 ms 21448 KB Output is correct
14 Correct 114 ms 62236 KB Output is correct
15 Correct 119 ms 66664 KB Output is correct
16 Correct 14 ms 22260 KB Output is correct
17 Correct 15 ms 22228 KB Output is correct
18 Correct 16 ms 22276 KB Output is correct
19 Correct 16 ms 22224 KB Output is correct
20 Correct 16 ms 22232 KB Output is correct
21 Correct 251 ms 53520 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 59320 KB Output is correct
2 Correct 267 ms 58712 KB Output is correct
3 Correct 329 ms 64064 KB Output is correct
4 Correct 261 ms 60612 KB Output is correct
5 Correct 301 ms 64216 KB Output is correct
6 Correct 308 ms 62216 KB Output is correct
7 Correct 302 ms 64392 KB Output is correct
8 Correct 260 ms 54776 KB Output is correct
9 Correct 253 ms 63184 KB Output is correct
10 Correct 238 ms 62048 KB Output is correct
11 Correct 321 ms 62776 KB Output is correct
12 Correct 267 ms 60476 KB Output is correct
13 Correct 12 ms 21448 KB Output is correct
14 Correct 114 ms 62236 KB Output is correct
15 Correct 119 ms 66664 KB Output is correct
16 Correct 14 ms 22260 KB Output is correct
17 Correct 15 ms 22228 KB Output is correct
18 Correct 16 ms 22276 KB Output is correct
19 Correct 16 ms 22224 KB Output is correct
20 Correct 16 ms 22232 KB Output is correct
21 Correct 251 ms 53520 KB Output is correct
22 Correct 12 ms 21460 KB Output is correct
23 Correct 13 ms 21444 KB Output is correct
24 Correct 12 ms 21408 KB Output is correct
25 Correct 204 ms 54860 KB Output is correct
26 Correct 212 ms 51332 KB Output is correct
27 Correct 239 ms 60148 KB Output is correct
28 Correct 465 ms 62884 KB Output is correct
29 Correct 345 ms 59748 KB Output is correct
30 Correct 490 ms 59700 KB Output is correct
31 Correct 465 ms 61080 KB Output is correct
32 Correct 260 ms 58372 KB Output is correct
33 Correct 465 ms 55636 KB Output is correct
34 Correct 354 ms 61836 KB Output is correct
35 Correct 291 ms 64864 KB Output is correct
36 Correct 392 ms 60604 KB Output is correct
37 Correct 455 ms 58472 KB Output is correct
38 Correct 73 ms 48072 KB Output is correct
39 Correct 127 ms 65176 KB Output is correct
40 Runtime error 35 ms 44644 KB Execution killed with signal 6
41 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 18 ms 22100 KB Output is correct
3 Correct 17 ms 22120 KB Output is correct
4 Correct 15 ms 22172 KB Output is correct
5 Correct 14 ms 21472 KB Output is correct
6 Correct 12 ms 21460 KB Output is correct
7 Correct 17 ms 21452 KB Output is correct
8 Correct 18 ms 22044 KB Output is correct
9 Correct 24 ms 22156 KB Output is correct
10 Correct 14 ms 21460 KB Output is correct
11 Correct 12 ms 21428 KB Output is correct
12 Correct 244 ms 42312 KB Output is correct
13 Correct 525 ms 55976 KB Output is correct
14 Correct 602 ms 52408 KB Output is correct
15 Correct 685 ms 55856 KB Output is correct
16 Correct 672 ms 56212 KB Output is correct
17 Correct 292 ms 56372 KB Output is correct
18 Correct 11 ms 21332 KB Output is correct
19 Correct 261 ms 52832 KB Output is correct
20 Correct 12 ms 21368 KB Output is correct
21 Correct 103 ms 57112 KB Output is correct
22 Correct 107 ms 60796 KB Output is correct
23 Correct 126 ms 64092 KB Output is correct
24 Correct 123 ms 65304 KB Output is correct
25 Correct 14 ms 22100 KB Output is correct
26 Correct 13 ms 22216 KB Output is correct
27 Correct 14 ms 22124 KB Output is correct
28 Runtime error 36 ms 43424 KB Execution killed with signal 6
29 Halted 0 ms 0 KB -