oj.uz

Submission #533586

# Submission time Handle Problem Language Result Execution time Memory
533586 2022-03-06T11:42:58 Z 1bin Road Closures (APIO21_roads) C++14
31 / 100
 2000 ms 55356 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e5 + 5;
set<pair<ll, ll>> adj[NMAX];
int dg[NMAX], vis[NMAX];
ll dp[NMAX][2], S[NMAX];
vector<int> D[NMAX];
set<int> X;
multiset<ll> C[NMAX];

void dfs(int now, int k) {
	vis[now] = 1;
	ll& ret = dp[now][0] = S[now];

	vector<ll> tmp;
	for(auto& p : adj[now]) {
		ll nx = p.first, w = p.second;
		if(vis[nx]) continue;
		dfs(nx, k);
		ret += dp[nx][0] + w;
		ll t = dp[nx][1] - dp[nx][0] - w;
		C[now].emplace(t);
		tmp.emplace_back(t);
	}

	auto it = C[now].begin();
	for(int i = 0; i < k - 1; i++) ret += min(*it++, 0LL);
	dp[now][1] = ret;
	ret += min(*it, 0LL);

	//cout << "Now is : " << now << '\n';
	//for(ll x : C[now]) cout << x << ' ';
	//cout << '\n';
	for(ll t : tmp) C[now].erase(C[now].find(t));
	return;
}

vector<ll> minimum_closure_costs (int N, vector<int> U, vector<int> V, vector<int> W) {
	vector<ll> ans(N, 0);
	for(int i = 0; i < N - 1; i++) {
		adj[U[i]].emplace(V[i], W[i]);
		adj[V[i]].emplace(U[i], W[i]);
		dg[U[i]]++; dg[V[i]]++;
		ans[0] += W[i];
	}
	for(int i = 0; i < N; i++) {
		D[dg[i]].emplace_back(i);
		X.emplace(i);
	}

	for(int k = 1; k < N; k++) {
		// 노드 삭제하기
		//cout << "NOW TURN IS : " << k << '\n';
		for(int x : D[k]) {
			X.erase(x);
			//cout << "erase : " << x << '\n';
			for(auto& p : adj[x]) {
				ll nx = p.first, w = p.second;
				adj[nx].erase({ x, w });
				S[nx] += w; C[nx].emplace(-w);
			}
		}
		 
		// 각 트리에 대해서 탐색
		for(int x : X) if(!vis[x]) {
			dfs(x, k);
			ans[k] += dp[x][0];
		}
		for(int x : X) vis[x] = 0;
	}
	return ans;
}
//
//int main(void) {
//	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//
//	freopen("input.txt", "r", stdin);
//	int N;
//	cin >> N;
//	vector<int> U(N), V(N), W(N);
//	for(int i = 0; i < N - 1; i++) cin >> U[i] >> V[i] >> W[i];
//	vector<ll> ans = minimum_closure_costs(N, U, V, W);
//	for(int i = 0; i < N; i++) cout << ans[i] << ' ';
//	return 0;
//}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11980 KB Output is correct
2 Correct 22 ms 12456 KB Output is correct
3 Correct 25 ms 12492 KB Output is correct
4 Correct 17 ms 12484 KB Output is correct
5 Correct 6 ms 11980 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 11980 KB Output is correct
8 Correct 18 ms 12364 KB Output is correct
9 Correct 21 ms 12476 KB Output is correct
10 Correct 6 ms 11980 KB Output is correct
11 Correct 7 ms 11980 KB Output is correct
12 Execution timed out 2066 ms 24660 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 88 ms 46048 KB Output is correct
3 Correct 106 ms 52400 KB Output is correct
4 Correct 119 ms 55144 KB Output is correct
5 Correct 115 ms 55356 KB Output is correct
6 Correct 7 ms 12676 KB Output is correct
7 Correct 8 ms 12876 KB Output is correct
8 Correct 7 ms 12748 KB Output is correct
9 Correct 7 ms 12040 KB Output is correct
10 Correct 7 ms 12108 KB Output is correct
11 Correct 6 ms 12032 KB Output is correct
12 Correct 76 ms 37468 KB Output is correct
13 Correct 101 ms 54404 KB Output is correct
14 Correct 6 ms 12052 KB Output is correct
15 Correct 90 ms 50188 KB Output is correct
16 Correct 119 ms 54540 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 6 ms 11992 KB Output is correct
3 Correct 6 ms 12012 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12044 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 7 ms 12020 KB Output is correct
9 Correct 8 ms 12012 KB Output is correct
10 Correct 7 ms 12108 KB Output is correct
11 Correct 6 ms 12052 KB Output is correct
12 Correct 6 ms 12088 KB Output is correct
13 Correct 7 ms 12008 KB Output is correct
14 Correct 6 ms 12048 KB Output is correct
15 Correct 8 ms 12052 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 7 ms 12016 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 9 ms 12048 KB Output is correct
21 Correct 6 ms 11980 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 6 ms 11992 KB Output is correct
3 Correct 6 ms 12012 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12044 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 7 ms 12020 KB Output is correct
9 Correct 8 ms 12012 KB Output is correct
10 Correct 7 ms 12108 KB Output is correct
11 Correct 6 ms 12052 KB Output is correct
12 Correct 6 ms 12088 KB Output is correct
13 Correct 7 ms 12008 KB Output is correct
14 Correct 6 ms 12048 KB Output is correct
15 Correct 8 ms 12052 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 7 ms 12016 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 9 ms 12048 KB Output is correct
21 Correct 6 ms 11980 KB Output is correct
22 Correct 7 ms 12044 KB Output is correct
23 Correct 7 ms 12316 KB Output is correct
24 Correct 9 ms 12620 KB Output is correct
25 Correct 9 ms 12444 KB Output is correct
26 Correct 10 ms 12492 KB Output is correct
27 Correct 13 ms 12556 KB Output is correct
28 Correct 11 ms 12424 KB Output is correct
29 Correct 11 ms 12492 KB Output is correct
30 Correct 9 ms 12492 KB Output is correct
31 Correct 10 ms 12492 KB Output is correct
32 Correct 14 ms 12492 KB Output is correct
33 Correct 8 ms 12748 KB Output is correct
34 Correct 8 ms 12876 KB Output is correct
35 Correct 8 ms 12748 KB Output is correct
36 Correct 23 ms 12444 KB Output is correct
37 Correct 25 ms 12444 KB Output is correct
38 Correct 18 ms 12492 KB Output is correct
39 Correct 7 ms 12052 KB Output is correct
40 Correct 6 ms 11980 KB Output is correct
41 Correct 7 ms 11980 KB Output is correct
42 Correct 8 ms 12084 KB Output is correct
43 Correct 8 ms 12108 KB Output is correct
44 Correct 7 ms 12108 KB Output is correct
45 Correct 7 ms 12040 KB Output is correct
46 Correct 9 ms 12048 KB Output is correct
47 Correct 7 ms 12108 KB Output is correct
48 Correct 8 ms 12144 KB Output is correct
49 Correct 7 ms 12108 KB Output is correct
50 Correct 7 ms 11980 KB Output is correct
51 Correct 7 ms 12044 KB Output is correct
52 Correct 7 ms 12048 KB Output is correct
53 Correct 9 ms 12364 KB Output is correct
54 Correct 10 ms 12572 KB Output is correct
55 Correct 11 ms 12532 KB Output is correct
56 Correct 18 ms 12444 KB Output is correct
57 Correct 25 ms 12500 KB Output is correct
58 Correct 7 ms 11980 KB Output is correct
59 Correct 7 ms 12076 KB Output is correct
60 Correct 8 ms 12048 KB Output is correct
61 Correct 9 ms 12008 KB Output is correct
62 Correct 7 ms 12052 KB Output is correct
63 Correct 7 ms 12048 KB Output is correct
64 Correct 9 ms 12572 KB Output is correct
65 Correct 9 ms 12492 KB Output is correct
66 Correct 11 ms 12476 KB Output is correct
67 Correct 13 ms 12540 KB Output is correct
68 Correct 9 ms 12476 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 35808 KB Output is correct
2 Correct 216 ms 35568 KB Output is correct
3 Correct 529 ms 35108 KB Output is correct
4 Correct 225 ms 36644 KB Output is correct
5 Correct 591 ms 35732 KB Output is correct
6 Correct 1883 ms 34352 KB Output is correct
7 Correct 404 ms 36572 KB Output is correct
8 Execution timed out 2087 ms 32220 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 35808 KB Output is correct
2 Correct 216 ms 35568 KB Output is correct
3 Correct 529 ms 35108 KB Output is correct
4 Correct 225 ms 36644 KB Output is correct
5 Correct 591 ms 35732 KB Output is correct
6 Correct 1883 ms 34352 KB Output is correct
7 Correct 404 ms 36572 KB Output is correct
8 Execution timed out 2087 ms 32220 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11980 KB Output is correct
2 Correct 22 ms 12456 KB Output is correct
3 Correct 25 ms 12492 KB Output is correct
4 Correct 17 ms 12484 KB Output is correct
5 Correct 6 ms 11980 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 11980 KB Output is correct
8 Correct 18 ms 12364 KB Output is correct
9 Correct 21 ms 12476 KB Output is correct
10 Correct 6 ms 11980 KB Output is correct
11 Correct 7 ms 11980 KB Output is correct
12 Execution timed out 2066 ms 24660 KB Time limit exceeded
13 Halted 0 ms 0 KB -