oj.uz

Submission #533781

# Submission time Handle Problem Language Result Execution time Memory
533781 2022-03-07T08:27:15 Z 1bin Road Closures (APIO21_roads) C++14
29 / 100
 270 ms 58020 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(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';*/

	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 - 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';
	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 9 ms 16716 KB Output is correct
2 Correct 11 ms 17100 KB Output is correct
3 Correct 12 ms 17280 KB Output is correct
4 Correct 12 ms 17184 KB Output is correct
5 Correct 9 ms 16736 KB Output is correct
6 Correct 11 ms 16716 KB Output is correct
7 Correct 10 ms 16732 KB Output is correct
8 Correct 11 ms 17060 KB Output is correct
9 Correct 12 ms 17140 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 10 ms 16704 KB Output is correct
12 Correct 109 ms 29476 KB Output is correct
13 Correct 208 ms 38004 KB Output is correct
14 Correct 195 ms 36040 KB Output is correct
15 Correct 210 ms 38020 KB Output is correct
16 Correct 233 ms 38464 KB Output is correct
17 Correct 213 ms 38348 KB Output is correct
18 Correct 12 ms 16684 KB Output is correct
19 Correct 179 ms 35976 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16716 KB Output is correct
2 Correct 92 ms 51008 KB Output is correct
3 Correct 102 ms 55416 KB Output is correct
4 Correct 111 ms 57992 KB Output is correct
5 Correct 115 ms 57960 KB Output is correct
6 Correct 10 ms 17388 KB Output is correct
7 Correct 10 ms 17508 KB Output is correct
8 Correct 10 ms 17484 KB Output is correct
9 Correct 9 ms 16812 KB Output is correct
10 Correct 9 ms 16740 KB Output is correct
11 Correct 9 ms 16844 KB Output is correct
12 Correct 66 ms 41416 KB Output is correct
13 Correct 104 ms 58020 KB Output is correct
14 Correct 9 ms 16716 KB Output is correct
15 Correct 104 ms 53984 KB Output is correct
16 Correct 102 ms 57964 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16736 KB Output is correct
2 Correct 9 ms 16760 KB Output is correct
3 Correct 11 ms 16760 KB Output is correct
4 Correct 9 ms 16744 KB Output is correct
5 Incorrect 10 ms 16716 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16736 KB Output is correct
2 Correct 9 ms 16760 KB Output is correct
3 Correct 11 ms 16760 KB Output is correct
4 Correct 9 ms 16744 KB Output is correct
5 Incorrect 10 ms 16716 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 40232 KB Output is correct
2 Correct 219 ms 39868 KB Output is correct
3 Correct 259 ms 39932 KB Output is correct
4 Correct 234 ms 40892 KB Output is correct
5 Correct 261 ms 39968 KB Output is correct
6 Correct 235 ms 38520 KB Output is correct
7 Correct 270 ms 40868 KB Output is correct
8 Correct 197 ms 36512 KB Output is correct
9 Correct 206 ms 45924 KB Output is correct
10 Correct 234 ms 40128 KB Output is correct
11 Correct 269 ms 40088 KB Output is correct
12 Correct 217 ms 38160 KB Output is correct
13 Correct 9 ms 16716 KB Output is correct
14 Correct 96 ms 53752 KB Output is correct
15 Correct 113 ms 57964 KB Output is correct
16 Correct 12 ms 17260 KB Output is correct
17 Correct 12 ms 17264 KB Output is correct
18 Correct 12 ms 17240 KB Output is correct
19 Correct 12 ms 17144 KB Output is correct
20 Correct 11 ms 17228 KB Output is correct
21 Correct 177 ms 35900 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 40232 KB Output is correct
2 Correct 219 ms 39868 KB Output is correct
3 Correct 259 ms 39932 KB Output is correct
4 Correct 234 ms 40892 KB Output is correct
5 Correct 261 ms 39968 KB Output is correct
6 Correct 235 ms 38520 KB Output is correct
7 Correct 270 ms 40868 KB Output is correct
8 Correct 197 ms 36512 KB Output is correct
9 Correct 206 ms 45924 KB Output is correct
10 Correct 234 ms 40128 KB Output is correct
11 Correct 269 ms 40088 KB Output is correct
12 Correct 217 ms 38160 KB Output is correct
13 Correct 9 ms 16716 KB Output is correct
14 Correct 96 ms 53752 KB Output is correct
15 Correct 113 ms 57964 KB Output is correct
16 Correct 12 ms 17260 KB Output is correct
17 Correct 12 ms 17264 KB Output is correct
18 Correct 12 ms 17240 KB Output is correct
19 Correct 12 ms 17144 KB Output is correct
20 Correct 11 ms 17228 KB Output is correct
21 Correct 177 ms 35900 KB Output is correct
22 Correct 9 ms 16656 KB Output is correct
23 Correct 10 ms 16736 KB Output is correct
24 Correct 9 ms 16716 KB Output is correct
25 Incorrect 205 ms 37432 KB Output isn't correct
26 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 17100 KB Output is correct
3 Correct 12 ms 17280 KB Output is correct
4 Correct 12 ms 17184 KB Output is correct
5 Correct 9 ms 16736 KB Output is correct
6 Correct 11 ms 16716 KB Output is correct
7 Correct 10 ms 16732 KB Output is correct
8 Correct 11 ms 17060 KB Output is correct
9 Correct 12 ms 17140 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 10 ms 16704 KB Output is correct
12 Correct 109 ms 29476 KB Output is correct
13 Correct 208 ms 38004 KB Output is correct
14 Correct 195 ms 36040 KB Output is correct
15 Correct 210 ms 38020 KB Output is correct
16 Correct 233 ms 38464 KB Output is correct
17 Correct 213 ms 38348 KB Output is correct
18 Correct 12 ms 16684 KB Output is correct
19 Correct 179 ms 35976 KB Output is correct
20 Correct 10 ms 16716 KB Output is correct
21 Correct 92 ms 51008 KB Output is correct
22 Correct 102 ms 55416 KB Output is correct
23 Correct 111 ms 57992 KB Output is correct
24 Correct 115 ms 57960 KB Output is correct
25 Correct 10 ms 17388 KB Output is correct
26 Correct 10 ms 17508 KB Output is correct
27 Correct 10 ms 17484 KB Output is correct
28 Correct 9 ms 16812 KB Output is correct
29 Correct 9 ms 16740 KB Output is correct
30 Correct 9 ms 16844 KB Output is correct
31 Correct 66 ms 41416 KB Output is correct
32 Correct 104 ms 58020 KB Output is correct
33 Correct 9 ms 16716 KB Output is correct
34 Correct 104 ms 53984 KB Output is correct
35 Correct 102 ms 57964 KB Output is correct
36 Correct 9 ms 16736 KB Output is correct
37 Correct 9 ms 16760 KB Output is correct
38 Correct 11 ms 16760 KB Output is correct
39 Correct 9 ms 16744 KB Output is correct
40 Incorrect 10 ms 16716 KB Output isn't correct
41 Halted 0 ms 0 KB -