oj.uz

Submission #533778

# Submission time Handle Problem Language Result Execution time Memory
533778 2022-03-07T08:12:59 Z 1bin Road Closures (APIO21_roads) C++14
29 / 100
 295 ms 63824 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], C[NMAX], t[NMAX];

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

	vector<ll> tmp;
	ll c = 0;
	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++;
		tmp.emplace_back(t);
	}

	while (t[now].size() && (int) A[now].size() < k - c) {
		auto it = t[now].begin();
		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;
		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';*/

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

	if (!c) {
		//cout << k << ' ' << now << ' ' << ret << '\n';
		//cout << ret << '\n';
		dp[now][1] = ret - *A[now].rbegin();
		return;
	}
	it = C[now].begin();
	int sz = k - 1 - A[now].size();
	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';
	C[now].clear();
	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:43:32: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   43 |  else assert(A[now].size() + c == k);
      |              ~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21324 KB Output is correct
2 Correct 15 ms 21864 KB Output is correct
3 Correct 13 ms 21880 KB Output is correct
4 Correct 14 ms 21832 KB Output is correct
5 Correct 12 ms 21440 KB Output is correct
6 Correct 12 ms 21444 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 14 ms 21988 KB Output is correct
9 Correct 14 ms 21836 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 12 ms 21452 KB Output is correct
12 Correct 109 ms 34748 KB Output is correct
13 Correct 190 ms 43444 KB Output is correct
14 Correct 193 ms 41984 KB Output is correct
15 Correct 205 ms 43952 KB Output is correct
16 Correct 208 ms 44192 KB Output is correct
17 Correct 207 ms 44292 KB Output is correct
18 Correct 12 ms 21340 KB Output is correct
19 Correct 181 ms 41412 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21324 KB Output is correct
2 Correct 114 ms 56884 KB Output is correct
3 Correct 108 ms 60432 KB Output is correct
4 Correct 125 ms 63728 KB Output is correct
5 Correct 123 ms 63824 KB Output is correct
6 Correct 13 ms 22076 KB Output is correct
7 Correct 13 ms 22212 KB Output is correct
8 Correct 13 ms 22216 KB Output is correct
9 Correct 11 ms 21428 KB Output is correct
10 Correct 11 ms 21412 KB Output is correct
11 Correct 12 ms 21512 KB Output is correct
12 Correct 69 ms 46784 KB Output is correct
13 Correct 115 ms 63764 KB Output is correct
14 Correct 12 ms 21404 KB Output is correct
15 Correct 100 ms 59068 KB Output is correct
16 Correct 109 ms 63676 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21324 KB Output is correct
2 Correct 11 ms 21380 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Incorrect 12 ms 21452 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21324 KB Output is correct
2 Correct 11 ms 21380 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Incorrect 12 ms 21452 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 45984 KB Output is correct
2 Correct 225 ms 45596 KB Output is correct
3 Correct 294 ms 45744 KB Output is correct
4 Correct 266 ms 46728 KB Output is correct
5 Correct 295 ms 45748 KB Output is correct
6 Correct 242 ms 44380 KB Output is correct
7 Correct 285 ms 46532 KB Output is correct
8 Correct 183 ms 42168 KB Output is correct
9 Correct 214 ms 51772 KB Output is correct
10 Correct 238 ms 46012 KB Output is correct
11 Correct 260 ms 46272 KB Output is correct
12 Correct 205 ms 44084 KB Output is correct
13 Correct 11 ms 21432 KB Output is correct
14 Correct 99 ms 59576 KB Output is correct
15 Correct 111 ms 63796 KB Output is correct
16 Correct 15 ms 21896 KB Output is correct
17 Correct 14 ms 21964 KB Output is correct
18 Correct 13 ms 21964 KB Output is correct
19 Correct 14 ms 21836 KB Output is correct
20 Correct 14 ms 21836 KB Output is correct
21 Correct 178 ms 41412 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 45984 KB Output is correct
2 Correct 225 ms 45596 KB Output is correct
3 Correct 294 ms 45744 KB Output is correct
4 Correct 266 ms 46728 KB Output is correct
5 Correct 295 ms 45748 KB Output is correct
6 Correct 242 ms 44380 KB Output is correct
7 Correct 285 ms 46532 KB Output is correct
8 Correct 183 ms 42168 KB Output is correct
9 Correct 214 ms 51772 KB Output is correct
10 Correct 238 ms 46012 KB Output is correct
11 Correct 260 ms 46272 KB Output is correct
12 Correct 205 ms 44084 KB Output is correct
13 Correct 11 ms 21432 KB Output is correct
14 Correct 99 ms 59576 KB Output is correct
15 Correct 111 ms 63796 KB Output is correct
16 Correct 15 ms 21896 KB Output is correct
17 Correct 14 ms 21964 KB Output is correct
18 Correct 13 ms 21964 KB Output is correct
19 Correct 14 ms 21836 KB Output is correct
20 Correct 14 ms 21836 KB Output is correct
21 Correct 178 ms 41412 KB Output is correct
22 Correct 14 ms 21324 KB Output is correct
23 Correct 12 ms 21436 KB Output is correct
24 Correct 12 ms 21432 KB Output is correct
25 Incorrect 209 ms 43164 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21324 KB Output is correct
2 Correct 15 ms 21864 KB Output is correct
3 Correct 13 ms 21880 KB Output is correct
4 Correct 14 ms 21832 KB Output is correct
5 Correct 12 ms 21440 KB Output is correct
6 Correct 12 ms 21444 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 14 ms 21988 KB Output is correct
9 Correct 14 ms 21836 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 12 ms 21452 KB Output is correct
12 Correct 109 ms 34748 KB Output is correct
13 Correct 190 ms 43444 KB Output is correct
14 Correct 193 ms 41984 KB Output is correct
15 Correct 205 ms 43952 KB Output is correct
16 Correct 208 ms 44192 KB Output is correct
17 Correct 207 ms 44292 KB Output is correct
18 Correct 12 ms 21340 KB Output is correct
19 Correct 181 ms 41412 KB Output is correct
20 Correct 11 ms 21324 KB Output is correct
21 Correct 114 ms 56884 KB Output is correct
22 Correct 108 ms 60432 KB Output is correct
23 Correct 125 ms 63728 KB Output is correct
24 Correct 123 ms 63824 KB Output is correct
25 Correct 13 ms 22076 KB Output is correct
26 Correct 13 ms 22212 KB Output is correct
27 Correct 13 ms 22216 KB Output is correct
28 Correct 11 ms 21428 KB Output is correct
29 Correct 11 ms 21412 KB Output is correct
30 Correct 12 ms 21512 KB Output is correct
31 Correct 69 ms 46784 KB Output is correct
32 Correct 115 ms 63764 KB Output is correct
33 Correct 12 ms 21404 KB Output is correct
34 Correct 100 ms 59068 KB Output is correct
35 Correct 109 ms 63676 KB Output is correct
36 Correct 12 ms 21324 KB Output is correct
37 Correct 11 ms 21380 KB Output is correct
38 Correct 11 ms 21452 KB Output is correct
39 Correct 12 ms 21452 KB Output is correct
40 Incorrect 12 ms 21452 KB Output isn't correct
41 Halted 0 ms 0 KB -