oj.uz

Submission #439811

# Submission time Handle Problem Language Result Execution time Memory
439811 2021-06-30T20:22:39 Z CSQ31 Road Closures (APIO21_roads) C++17
31 / 100
 2000 ms 53800 KB 
#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 2e5+5;
vector<vector<pii>> g1(MAXN),g2(MAXN); //g1 is original graph,g2 is subgraph after we deleted nodes with degree<=k
vector<int>par(MAXN),szz(MAXN,1),act(MAXN); //act means whether a node is active / has degree>k
vector<ll>ans;
VII dp(2,vector<ll>(MAXN,0));
int find(int x){
	if(x == par[x])return x;
	else return par[x] = find(par[x]);
}
void unite(int a,int b){
	a = find(a);
	b = find(b);
	if(a==b)return;
	if(szz[a] > szz[b])swap(a,b);
	par[a] = b;
	szz[b]+=szz[a];
}
vector<multiset<ll>>s(MAXN);
ll query(int i,int c){
	ll res = 0;
	for(int x:s[i]){
		if(c<=0)break;
		res+=x;
		c--;
	}
	return res;
}
void dfs(int v,int u,ll w,int k){
	int need = sz(g1[v])-k;
	ll cur = 0;
	vector<ll>choice;
	for(auto x:g2[v]){
		if(x.fi != u){
			dfs(x.fi,v,x.se,k);
			if(dp[1][x.fi] <= dp[0][x.fi]){ //we will take this edge anyways
				cur+=dp[1][x.fi];
				need--;
			}else{
				cur+=dp[0][x.fi];
				choice.pb(dp[1][x.fi]-dp[0][x.fi]);
			}
		}
	}
	dp[0][v] = dp[1][v] = INF;
	sort(all(choice));
	if(need<=0)dp[0][v] = cur;
	if(need-1<=0)dp[1][v] = w+cur;
	if(sz(s[v]) >= need)dp[0][v] = cur + query(v,need);
	if(sz(s[v]) >= need-1)dp[1][v] = cur + w + query(v,need-1); //take extra edges only from inactive
	ll tmp = cur+w;
	for(int i=0;i<min(sz(choice),need);i++){
		cur+=choice[i];
		int take = need-i-1;
		if(sz(s[v])>=take)dp[0][v] = min(dp[0][v],cur + query(v,take));
	}
	need--;
	for(int i=0;i<min(sz(choice),need);i++){
		tmp+=choice[i];
		int take = need-i-1;
		if(sz(s[v])>=take)dp[1][v] = min(dp[1][v],tmp + query(v,take));
	}
}

vector<ll> minimum_closure_costs(int n, vector<int> u,vector<int>v,vector<int>w){
	ans.resize(n);
	for(int i=0;i<n-1;i++){
		g1[u[i]].pb({v[i],w[i]});
		g1[v[i]].pb({u[i],w[i]});
	}
	for(int i=0;i<n;i++){
		for(auto x:g1[i])s[i].insert(x.se);
	}
	vector<int>c(n);
	for(int i=0;i<n;i++){c[i] = i;par[i] = i;}
	sort(all(c),[&](int x,int y){return sz(g1[x]) > sz(g1[y]);});
	//sort vertex by degree and we sweep
	int ptr = -1;
	vector<int>vis(n);
	for(int i=n-1;i>=0;i--){
		while(ptr+1<n && sz(g1[c[ptr+1]]) > i){
			ptr++;
			int d = c[ptr];
			act[d] = 1;
			for(auto x:g1[d]){
				if(act[x.fi]){
					s[x.fi].erase(s[x.fi].find(x.se)); //these edges become active now,remove them from segtree
					s[d].erase(s[d].find(x.se));
					g2[x.fi].pb({d,x.se});
					g2[d].pb({x.fi,x.se}); 
					unite(x.fi,d);
				}
			}
		}
		vector<int>meet;
		for(int j=0;j<=ptr;j++){
			int a = find(c[j]);
			if(vis[a])continue;
			else{
				dfs(a,-1,0,i);
				meet.pb(a);
				vis[a] = 1;
				ans[i]+=dp[0][a];
			}
		}
		for(int x:meet)vis[x] = 0;
		
	}
	return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 24496 KB Output is correct
2 Correct 53 ms 24908 KB Output is correct
3 Correct 57 ms 24908 KB Output is correct
4 Correct 37 ms 24852 KB Output is correct
5 Correct 16 ms 24496 KB Output is correct
6 Correct 15 ms 24544 KB Output is correct
7 Correct 16 ms 24624 KB Output is correct
8 Correct 39 ms 24872 KB Output is correct
9 Correct 50 ms 24920 KB Output is correct
10 Correct 15 ms 24496 KB Output is correct
11 Correct 14 ms 24496 KB Output is correct
12 Execution timed out 2085 ms 34828 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24496 KB Output is correct
2 Correct 119 ms 48856 KB Output is correct
3 Correct 132 ms 51912 KB Output is correct
4 Correct 133 ms 53772 KB Output is correct
5 Correct 131 ms 53772 KB Output is correct
6 Correct 16 ms 25080 KB Output is correct
7 Correct 20 ms 25136 KB Output is correct
8 Correct 17 ms 25120 KB Output is correct
9 Correct 13 ms 24528 KB Output is correct
10 Correct 14 ms 24540 KB Output is correct
11 Correct 18 ms 24528 KB Output is correct
12 Correct 79 ms 42168 KB Output is correct
13 Correct 133 ms 53780 KB Output is correct
14 Correct 15 ms 24548 KB Output is correct
15 Correct 119 ms 50980 KB Output is correct
16 Correct 125 ms 53800 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24496 KB Output is correct
2 Correct 16 ms 24548 KB Output is correct
3 Correct 15 ms 24460 KB Output is correct
4 Correct 15 ms 24548 KB Output is correct
5 Correct 15 ms 24624 KB Output is correct
6 Correct 14 ms 24556 KB Output is correct
7 Correct 15 ms 24496 KB Output is correct
8 Correct 15 ms 24496 KB Output is correct
9 Correct 16 ms 24624 KB Output is correct
10 Correct 14 ms 24624 KB Output is correct
11 Correct 14 ms 24624 KB Output is correct
12 Correct 17 ms 24624 KB Output is correct
13 Correct 13 ms 24616 KB Output is correct
14 Correct 18 ms 24560 KB Output is correct
15 Correct 15 ms 24588 KB Output is correct
16 Correct 15 ms 24496 KB Output is correct
17 Correct 15 ms 24620 KB Output is correct
18 Correct 15 ms 24496 KB Output is correct
19 Correct 15 ms 24564 KB Output is correct
20 Correct 16 ms 24584 KB Output is correct
21 Correct 16 ms 24532 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24496 KB Output is correct
2 Correct 16 ms 24548 KB Output is correct
3 Correct 15 ms 24460 KB Output is correct
4 Correct 15 ms 24548 KB Output is correct
5 Correct 15 ms 24624 KB Output is correct
6 Correct 14 ms 24556 KB Output is correct
7 Correct 15 ms 24496 KB Output is correct
8 Correct 15 ms 24496 KB Output is correct
9 Correct 16 ms 24624 KB Output is correct
10 Correct 14 ms 24624 KB Output is correct
11 Correct 14 ms 24624 KB Output is correct
12 Correct 17 ms 24624 KB Output is correct
13 Correct 13 ms 24616 KB Output is correct
14 Correct 18 ms 24560 KB Output is correct
15 Correct 15 ms 24588 KB Output is correct
16 Correct 15 ms 24496 KB Output is correct
17 Correct 15 ms 24620 KB Output is correct
18 Correct 15 ms 24496 KB Output is correct
19 Correct 15 ms 24564 KB Output is correct
20 Correct 16 ms 24584 KB Output is correct
21 Correct 16 ms 24532 KB Output is correct
22 Correct 15 ms 24532 KB Output is correct
23 Correct 22 ms 24752 KB Output is correct
24 Correct 21 ms 24872 KB Output is correct
25 Correct 16 ms 24908 KB Output is correct
26 Correct 17 ms 24964 KB Output is correct
27 Correct 23 ms 24888 KB Output is correct
28 Correct 22 ms 24880 KB Output is correct
29 Correct 19 ms 24880 KB Output is correct
30 Correct 17 ms 25008 KB Output is correct
31 Correct 18 ms 24940 KB Output is correct
32 Correct 27 ms 24880 KB Output is correct
33 Correct 21 ms 25136 KB Output is correct
34 Correct 16 ms 25172 KB Output is correct
35 Correct 19 ms 25136 KB Output is correct
36 Correct 52 ms 24868 KB Output is correct
37 Correct 56 ms 24964 KB Output is correct
38 Correct 37 ms 25064 KB Output is correct
39 Correct 15 ms 24496 KB Output is correct
40 Correct 15 ms 24536 KB Output is correct
41 Correct 14 ms 24584 KB Output is correct
42 Correct 15 ms 24584 KB Output is correct
43 Correct 15 ms 24580 KB Output is correct
44 Correct 16 ms 24624 KB Output is correct
45 Correct 14 ms 24624 KB Output is correct
46 Correct 15 ms 24528 KB Output is correct
47 Correct 14 ms 24544 KB Output is correct
48 Correct 16 ms 24556 KB Output is correct
49 Correct 16 ms 24616 KB Output is correct
50 Correct 15 ms 24732 KB Output is correct
51 Correct 16 ms 24568 KB Output is correct
52 Correct 14 ms 24496 KB Output is correct
53 Correct 16 ms 24804 KB Output is correct
54 Correct 16 ms 25008 KB Output is correct
55 Correct 23 ms 24880 KB Output is correct
56 Correct 45 ms 24888 KB Output is correct
57 Correct 49 ms 24940 KB Output is correct
58 Correct 15 ms 24496 KB Output is correct
59 Correct 15 ms 24592 KB Output is correct
60 Correct 14 ms 24620 KB Output is correct
61 Correct 16 ms 24624 KB Output is correct
62 Correct 14 ms 24624 KB Output is correct
63 Correct 15 ms 24496 KB Output is correct
64 Correct 18 ms 24888 KB Output is correct
65 Correct 16 ms 24880 KB Output is correct
66 Correct 20 ms 25008 KB Output is correct
67 Correct 23 ms 24948 KB Output is correct
68 Correct 19 ms 24976 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 42280 KB Output is correct
2 Correct 308 ms 41960 KB Output is correct
3 Correct 388 ms 43288 KB Output is correct
4 Correct 347 ms 42900 KB Output is correct
5 Correct 346 ms 43304 KB Output is correct
6 Correct 1341 ms 42900 KB Output is correct
7 Correct 384 ms 42920 KB Output is correct
8 Execution timed out 2084 ms 40364 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 42280 KB Output is correct
2 Correct 308 ms 41960 KB Output is correct
3 Correct 388 ms 43288 KB Output is correct
4 Correct 347 ms 42900 KB Output is correct
5 Correct 346 ms 43304 KB Output is correct
6 Correct 1341 ms 42900 KB Output is correct
7 Correct 384 ms 42920 KB Output is correct
8 Execution timed out 2084 ms 40364 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 24496 KB Output is correct
2 Correct 53 ms 24908 KB Output is correct
3 Correct 57 ms 24908 KB Output is correct
4 Correct 37 ms 24852 KB Output is correct
5 Correct 16 ms 24496 KB Output is correct
6 Correct 15 ms 24544 KB Output is correct
7 Correct 16 ms 24624 KB Output is correct
8 Correct 39 ms 24872 KB Output is correct
9 Correct 50 ms 24920 KB Output is correct
10 Correct 15 ms 24496 KB Output is correct
11 Correct 14 ms 24496 KB Output is correct
12 Execution timed out 2085 ms 34828 KB Time limit exceeded
13 Halted 0 ms 0 KB -