oj.uz

Submission #533806

# Submission time Handle Problem Language Result Execution time Memory
533806 2022-03-07T10:20:40 Z 1bin Road Closures (APIO21_roads) C++14
12 / 100
 249 ms 58044 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;
	}
	it = C.begin();
	int sz = k - A[now].size();
	while(sz--) ret += min(*it++, 0LL);
	ll mn = min(*--it, 0LL);
	if(A[now].size()) mn = min(mn, *--A[now].end());
	dp[now][1] = ret - mn;

	//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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16716 KB Output is correct
2 Correct 11 ms 17180 KB Output is correct
3 Correct 13 ms 17148 KB Output is correct
4 Correct 11 ms 17208 KB Output is correct
5 Correct 9 ms 16716 KB Output is correct
6 Correct 10 ms 16716 KB Output is correct
7 Correct 10 ms 16716 KB Output is correct
8 Correct 10 ms 17112 KB Output is correct
9 Correct 11 ms 17100 KB Output is correct
10 Correct 10 ms 16716 KB Output is correct
11 Correct 11 ms 16716 KB Output is correct
12 Correct 104 ms 29432 KB Output is correct
13 Correct 191 ms 37856 KB Output is correct
14 Correct 180 ms 35788 KB Output is correct
15 Correct 222 ms 38192 KB Output is correct
16 Correct 202 ms 38240 KB Output is correct
17 Correct 195 ms 38256 KB Output is correct
18 Correct 11 ms 16716 KB Output is correct
19 Correct 217 ms 35772 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16652 KB Output is correct
2 Correct 91 ms 51004 KB Output is correct
3 Correct 109 ms 55200 KB Output is correct
4 Correct 112 ms 58000 KB Output is correct
5 Correct 110 ms 58044 KB Output is correct
6 Correct 9 ms 17456 KB Output is correct
7 Correct 10 ms 17484 KB Output is correct
8 Correct 10 ms 17484 KB Output is correct
9 Correct 8 ms 16812 KB Output is correct
10 Correct 8 ms 16808 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 68 ms 41380 KB Output is correct
13 Correct 115 ms 57880 KB Output is correct
14 Correct 8 ms 16656 KB Output is correct
15 Correct 97 ms 53744 KB Output is correct
16 Correct 101 ms 57820 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16716 KB Output is correct
2 Correct 7 ms 16716 KB Output is correct
3 Correct 10 ms 16716 KB Output is correct
4 Incorrect 10 ms 16716 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16716 KB Output is correct
2 Correct 7 ms 16716 KB Output is correct
3 Correct 10 ms 16716 KB Output is correct
4 Incorrect 10 ms 16716 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 249 ms 40092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 249 ms 40092 KB Output isn't correct
2 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 11 ms 17180 KB Output is correct
3 Correct 13 ms 17148 KB Output is correct
4 Correct 11 ms 17208 KB Output is correct
5 Correct 9 ms 16716 KB Output is correct
6 Correct 10 ms 16716 KB Output is correct
7 Correct 10 ms 16716 KB Output is correct
8 Correct 10 ms 17112 KB Output is correct
9 Correct 11 ms 17100 KB Output is correct
10 Correct 10 ms 16716 KB Output is correct
11 Correct 11 ms 16716 KB Output is correct
12 Correct 104 ms 29432 KB Output is correct
13 Correct 191 ms 37856 KB Output is correct
14 Correct 180 ms 35788 KB Output is correct
15 Correct 222 ms 38192 KB Output is correct
16 Correct 202 ms 38240 KB Output is correct
17 Correct 195 ms 38256 KB Output is correct
18 Correct 11 ms 16716 KB Output is correct
19 Correct 217 ms 35772 KB Output is correct
20 Correct 10 ms 16652 KB Output is correct
21 Correct 91 ms 51004 KB Output is correct
22 Correct 109 ms 55200 KB Output is correct
23 Correct 112 ms 58000 KB Output is correct
24 Correct 110 ms 58044 KB Output is correct
25 Correct 9 ms 17456 KB Output is correct
26 Correct 10 ms 17484 KB Output is correct
27 Correct 10 ms 17484 KB Output is correct
28 Correct 8 ms 16812 KB Output is correct
29 Correct 8 ms 16808 KB Output is correct
30 Correct 9 ms 16724 KB Output is correct
31 Correct 68 ms 41380 KB Output is correct
32 Correct 115 ms 57880 KB Output is correct
33 Correct 8 ms 16656 KB Output is correct
34 Correct 97 ms 53744 KB Output is correct
35 Correct 101 ms 57820 KB Output is correct
36 Correct 10 ms 16716 KB Output is correct
37 Correct 7 ms 16716 KB Output is correct
38 Correct 10 ms 16716 KB Output is correct
39 Incorrect 10 ms 16716 KB Output isn't correct
40 Halted 0 ms 0 KB -