oj.uz

Submission #546695

# Submission time Handle Problem Language Result Execution time Memory
546695 2022-04-08T07:49:21 Z djs100201 Beads and wires (APIO14_beads) C++17
100 / 100
 179 ms 34740 KB 
#include<bits/stdc++.h>
#define double long double
//T.erase(unique(T.begin(),T.end()),T.end());
//written by djs100201
#define all(v) v.begin(),v.end()

using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 100, inf = (ll)1e9 * (ll)1e5 + 7, mod = 1e9 + 7, sqrtN = 320;

ll dy[4] = { -1,0,1,0 }, dx[4] = { 0,1,0,-1 };
ll n, m, k, tc = 1, a, b, c, d, sum, x, y, z, base, ans, q;
ll gcd(ll x, ll y) {
	if (!y)return x;
	return gcd(y, x % y);
}
vector<P>v[n_];
ll dp[n_][2][2];
void dfs(ll x, ll par, ll cost) {
	ll val1 = 0, val2 = -inf;
	ll t1 = -inf, t2 = -inf;
	ll a1 = 0, a2 = -inf;
	ll sum1 = 0, sum2 = -inf;
	priority_queue<ll>pq;
	for (auto nxt : v[x]) {
		if (nxt.first == par)continue;
		dfs(nxt.first, x, nxt.second);
		ll val = max(dp[nxt.first][0][0], dp[nxt.first][1][0]);
		dp[x][0][0] += val;
		dp[x][1][0] += val;
		dp[x][0][1] += val;
		dp[x][1][1] += val;

		ll c1 = dp[nxt.first][0][1] + nxt.second - val;
		ll c2 = dp[nxt.first][0][0] + nxt.second - val;
		pq.push(c2);
		sum1 = max(sum1, t1 + c2);
		sum1 = max(sum1, t2 + c2);
		sum1 = max(sum1, t2 + c1);
		sum1 = max(sum1, max(dp[nxt.first][1][1],dp[nxt.first][0][1]) - val);
		t1 = max(t1, c1);
		t2 = max(t2, c2);
	}
	if (pq.size()) {
		ll val = pq.top();
		dp[x][1][0] += val + cost;
	}
	else dp[x][1][0] = -inf;
	dp[x][0][1] += sum1;
	dp[x][1][1] += t1 + cost;
}
void solve() {
	cin >> n;
	for (int i = 1; i < n; i++) {
		cin >> a >> b >> c;
		v[a].push_back({ b,c });
		v[b].push_back({ a,c });
	}
	dfs(1, 0, -inf);
	cout << max(dp[1][0][0], dp[1][0][1]);
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	//cin >> tc;
	while (tc--)solve();
}

Compilation message

beads.cpp: In function 'void dfs(ll, ll, ll)':
beads.cpp:22:5: warning: unused variable 'val1' [-Wunused-variable]
   22 |  ll val1 = 0, val2 = -inf;
      |     ^~~~
beads.cpp:22:15: warning: unused variable 'val2' [-Wunused-variable]
   22 |  ll val1 = 0, val2 = -inf;
      |               ^~~~
beads.cpp:24:5: warning: unused variable 'a1' [-Wunused-variable]
   24 |  ll a1 = 0, a2 = -inf;
      |     ^~
beads.cpp:24:13: warning: unused variable 'a2' [-Wunused-variable]
   24 |  ll a1 = 0, a2 = -inf;
      |             ^~
beads.cpp:25:15: warning: unused variable 'sum2' [-Wunused-variable]
   25 |  ll sum1 = 0, sum2 = -inf;
      |               ^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5032 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5032 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5024 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5032 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5024 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5428 KB Output is correct
24 Correct 6 ms 5460 KB Output is correct
25 Correct 5 ms 5460 KB Output is correct
26 Correct 8 ms 5972 KB Output is correct
27 Correct 8 ms 6008 KB Output is correct
28 Correct 9 ms 6132 KB Output is correct
29 Correct 7 ms 5972 KB Output is correct
30 Correct 8 ms 5972 KB Output is correct
31 Correct 7 ms 6820 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5032 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5024 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5428 KB Output is correct
24 Correct 6 ms 5460 KB Output is correct
25 Correct 5 ms 5460 KB Output is correct
26 Correct 8 ms 5972 KB Output is correct
27 Correct 8 ms 6008 KB Output is correct
28 Correct 9 ms 6132 KB Output is correct
29 Correct 7 ms 5972 KB Output is correct
30 Correct 8 ms 5972 KB Output is correct
31 Correct 7 ms 6820 KB Output is correct
32 Correct 26 ms 9908 KB Output is correct
33 Correct 32 ms 9916 KB Output is correct
34 Correct 27 ms 9868 KB Output is correct
35 Correct 175 ms 25164 KB Output is correct
36 Correct 179 ms 24964 KB Output is correct
37 Correct 156 ms 25000 KB Output is correct
38 Correct 113 ms 27764 KB Output is correct
39 Correct 121 ms 26284 KB Output is correct
40 Correct 113 ms 26296 KB Output is correct
41 Correct 160 ms 34740 KB Output is correct