oj.uz

Submission #533802

# Submission time Handle Problem Language Result Execution time Memory
533802 2022-03-07T10:12:26 Z 1bin Road Closures (APIO21_roads) C++14
31 / 100
 2000 ms 59380 KB 
#include <bits/stdc++.h>
#include <cassert>

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> A[NMAX], t[NMAX];

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

	ll c = 0;
	multiset<ll> C;
	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++;
		C.emplace(t);
	}

	while((int)A[now].size() < k - c) {
		auto it = t[now].begin();
		assert(*it <= 0);
		A[now].emplace(*it); S[now] += *it;
		t[now].erase(it);
	}
	while(A[now].size() && (int)A[now].size() > k - c) {
		auto it = --A[now].end(); S[now] -= *it;
		assert(*it <= 0);
		t[now].emplace(*it);
		A[now].erase(it);
	}
	if(c >= k) assert(A[now].size() == 0);
	else assert(A[now].size() + c == k);

	ret += S[now];
	/*cout << "now is : " << now << ' ' << ret << '\n';
	for (ll x : A[now]) cout << x << ' ';
	cout << '\n';
	for (ll x : C[now]) cout << x << ' ';
	cout << '\n';*/

	auto it = t[now].begin();
	for(int i = 0; i < c && it != t[now].end(); i++) C.emplace(*it++);

	//if(!c) {
	//	//cout << k << ' ' << now << ' ' << ret << '\n';
	//	//cout << ret << '\n';
	//	dp[now][1] = ret - *A[now].rbegin();
	//	return;
	//}
	for(ll x : A[now]) {
		C.emplace(x); ret -= x;
	}
	it = C.begin();
	int sz = k - 1;
	while(sz--) ret += min(*it++, 0LL);
	dp[now][1] = ret;
	ret += min(*it, 0LL);

	//cout << ret << '\n';
	//cout << "Now is : " << now << '\n';
	//for(ll x : C[now]) cout << x << ' ';
	//cout << '\n';
	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; t[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;
}


/*
5
0 1 1
0 2 4
0 3 3
2 4 2
*/

/*
4
0 1 5
0 3 5
0 2 10
*/

/*
5
0 1 5
1 2 6
2 3 1
3 4 8
*/

/*
5
0 1 1
0 2 2
0 3 3
0 4 4
*/

//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;
//}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from roads.cpp:2:
roads.cpp: In function 'void dfs(int, int)':
roads.cpp:45:32: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   45 |  else assert(A[now].size() + c == k);
      |              ~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16716 KB Output is correct
2 Correct 209 ms 17228 KB Output is correct
3 Correct 236 ms 17188 KB Output is correct
4 Correct 231 ms 17188 KB Output is correct
5 Correct 10 ms 16716 KB Output is correct
6 Correct 11 ms 16716 KB Output is correct
7 Correct 11 ms 16716 KB Output is correct
8 Correct 153 ms 17136 KB Output is correct
9 Correct 242 ms 17196 KB Output is correct
10 Correct 10 ms 16716 KB Output is correct
11 Correct 11 ms 16716 KB Output is correct
12 Execution timed out 2076 ms 29388 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16716 KB Output is correct
2 Correct 92 ms 52152 KB Output is correct
3 Correct 104 ms 56620 KB Output is correct
4 Correct 108 ms 59380 KB Output is correct
5 Correct 110 ms 59356 KB Output is correct
6 Correct 10 ms 17484 KB Output is correct
7 Correct 13 ms 17484 KB Output is correct
8 Correct 10 ms 17484 KB Output is correct
9 Correct 9 ms 16716 KB Output is correct
10 Correct 8 ms 16716 KB Output is correct
11 Correct 8 ms 16716 KB Output is correct
12 Correct 65 ms 42284 KB Output is correct
13 Correct 106 ms 59372 KB Output is correct
14 Correct 8 ms 16680 KB Output is correct
15 Correct 93 ms 55068 KB Output is correct
16 Correct 109 ms 59368 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16684 KB Output is correct
2 Correct 10 ms 16752 KB Output is correct
3 Correct 10 ms 16716 KB Output is correct
4 Correct 8 ms 16716 KB Output is correct
5 Correct 11 ms 16716 KB Output is correct
6 Correct 10 ms 16716 KB Output is correct
7 Correct 9 ms 16736 KB Output is correct
8 Correct 8 ms 16716 KB Output is correct
9 Correct 8 ms 16716 KB Output is correct
10 Correct 8 ms 16716 KB Output is correct
11 Correct 8 ms 16844 KB Output is correct
12 Correct 9 ms 16744 KB Output is correct
13 Correct 9 ms 16716 KB Output is correct
14 Correct 10 ms 16736 KB Output is correct
15 Correct 10 ms 16808 KB Output is correct
16 Correct 9 ms 16716 KB Output is correct
17 Correct 9 ms 16716 KB Output is correct
18 Correct 8 ms 16716 KB Output is correct
19 Correct 9 ms 16716 KB Output is correct
20 Correct 11 ms 16720 KB Output is correct
21 Correct 8 ms 16736 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16684 KB Output is correct
2 Correct 10 ms 16752 KB Output is correct
3 Correct 10 ms 16716 KB Output is correct
4 Correct 8 ms 16716 KB Output is correct
5 Correct 11 ms 16716 KB Output is correct
6 Correct 10 ms 16716 KB Output is correct
7 Correct 9 ms 16736 KB Output is correct
8 Correct 8 ms 16716 KB Output is correct
9 Correct 8 ms 16716 KB Output is correct
10 Correct 8 ms 16716 KB Output is correct
11 Correct 8 ms 16844 KB Output is correct
12 Correct 9 ms 16744 KB Output is correct
13 Correct 9 ms 16716 KB Output is correct
14 Correct 10 ms 16736 KB Output is correct
15 Correct 10 ms 16808 KB Output is correct
16 Correct 9 ms 16716 KB Output is correct
17 Correct 9 ms 16716 KB Output is correct
18 Correct 8 ms 16716 KB Output is correct
19 Correct 9 ms 16716 KB Output is correct
20 Correct 11 ms 16720 KB Output is correct
21 Correct 8 ms 16736 KB Output is correct
22 Correct 8 ms 16672 KB Output is correct
23 Correct 10 ms 17008 KB Output is correct
24 Correct 10 ms 17228 KB Output is correct
25 Correct 11 ms 17136 KB Output is correct
26 Correct 12 ms 17168 KB Output is correct
27 Correct 37 ms 17248 KB Output is correct
28 Correct 38 ms 17236 KB Output is correct
29 Correct 11 ms 17176 KB Output is correct
30 Correct 14 ms 17228 KB Output is correct
31 Correct 14 ms 17228 KB Output is correct
32 Correct 73 ms 17196 KB Output is correct
33 Correct 10 ms 17408 KB Output is correct
34 Correct 10 ms 17612 KB Output is correct
35 Correct 14 ms 17520 KB Output is correct
36 Correct 193 ms 17220 KB Output is correct
37 Correct 263 ms 17236 KB Output is correct
38 Correct 236 ms 17228 KB Output is correct
39 Correct 9 ms 16764 KB Output is correct
40 Correct 9 ms 16700 KB Output is correct
41 Correct 10 ms 16712 KB Output is correct
42 Correct 9 ms 16716 KB Output is correct
43 Correct 9 ms 16716 KB Output is correct
44 Correct 9 ms 16716 KB Output is correct
45 Correct 9 ms 16716 KB Output is correct
46 Correct 9 ms 16716 KB Output is correct
47 Correct 9 ms 16828 KB Output is correct
48 Correct 10 ms 16716 KB Output is correct
49 Correct 9 ms 16844 KB Output is correct
50 Correct 10 ms 16716 KB Output is correct
51 Correct 10 ms 16716 KB Output is correct
52 Correct 11 ms 16740 KB Output is correct
53 Correct 11 ms 17084 KB Output is correct
54 Correct 11 ms 17268 KB Output is correct
55 Correct 39 ms 17140 KB Output is correct
56 Correct 152 ms 17136 KB Output is correct
57 Correct 253 ms 17216 KB Output is correct
58 Correct 9 ms 16716 KB Output is correct
59 Correct 9 ms 16784 KB Output is correct
60 Correct 9 ms 16736 KB Output is correct
61 Correct 10 ms 16716 KB Output is correct
62 Correct 11 ms 16716 KB Output is correct
63 Correct 9 ms 16724 KB Output is correct
64 Correct 12 ms 17280 KB Output is correct
65 Correct 11 ms 17264 KB Output is correct
66 Correct 14 ms 17168 KB Output is correct
67 Correct 73 ms 17260 KB Output is correct
68 Correct 14 ms 17168 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 40472 KB Output is correct
2 Correct 216 ms 39612 KB Output is correct
3 Correct 1827 ms 39920 KB Output is correct
4 Correct 243 ms 40720 KB Output is correct
5 Correct 1798 ms 39788 KB Output is correct
6 Execution timed out 2088 ms 38500 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 40472 KB Output is correct
2 Correct 216 ms 39612 KB Output is correct
3 Correct 1827 ms 39920 KB Output is correct
4 Correct 243 ms 40720 KB Output is correct
5 Correct 1798 ms 39788 KB Output is correct
6 Execution timed out 2088 ms 38500 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16716 KB Output is correct
2 Correct 209 ms 17228 KB Output is correct
3 Correct 236 ms 17188 KB Output is correct
4 Correct 231 ms 17188 KB Output is correct
5 Correct 10 ms 16716 KB Output is correct
6 Correct 11 ms 16716 KB Output is correct
7 Correct 11 ms 16716 KB Output is correct
8 Correct 153 ms 17136 KB Output is correct
9 Correct 242 ms 17196 KB Output is correct
10 Correct 10 ms 16716 KB Output is correct
11 Correct 11 ms 16716 KB Output is correct
12 Execution timed out 2076 ms 29388 KB Time limit exceeded
13 Halted 0 ms 0 KB -