Submission #698598

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
698598	2023-02-14T02:47:38 Z	vjudge1	Beads and wires (APIO14_beads)	C++17	100 / 100	310 ms	43208 KB

beads

/* ...... */

#include <bits/stdc++.h>
using namespace std;

#define inl inline
typedef long long ll;
// typedef unsigned long long ull;
// typedef __int128 lll;
// typedef long double llf;
typedef pair <int, int> pint;
#define fst first
#define scd second
#define all(p) begin (p), end (p)
#define empb emplace_back

constexpr int N = 2e5 + 10, INF = 0x3f3f3f3f;
int n, x, y, z, f[N][2], ans;
vector <pint> e[N];
multiset <int> tp[N];

void dfs (int x, int fr) {
	static int tmp;
	for (const auto [y, z] : e[x]) {
		if (y == fr) continue; else dfs (y, x);
		f[x][0] += tmp = max (f[y][0], f[y][1] + z);
		tp[x].emplace (f[y][0] + z - tmp);
	}
	if (tp[x].empty ()) f[x][1] = -INF;
	else f[x][1] = f[x][0] + *rbegin (tp[x]);
}
void dp (int x, int fr) {
	int f_x[2], f_y[2], tmp, numx, numy;
	memcpy (f_x, f[x], 8);
	ans = max (ans, f[x][0]);
	for (const auto [y, z] : e[x]) {
		if (y == fr) continue;
		// * Update new f(x).
		f[x][0] -= tmp = max (f[y][0], f[y][1] + z);
		tp[x].erase (tp[x].find (numx = f[y][0] + z - tmp));
		f[x][1] = tp[x].empty () ? -INF : f[x][0] + *rbegin (tp[x]);
		// * Update new f(y).
		memcpy (f_y, f[y], 8);
		f[y][0] += tmp = max (f[x][0], f[x][1] + z);
		tp[y].emplace (numy = f[x][0] + z - tmp);
		f[y][1] = f[y][0] + *rbegin (tp[y]);
		dp (y, x);
		memcpy (f[x], f_x, 8);
		memcpy (f[y], f_y, 8);
		tp[x].emplace (numx);
		tp[y].erase (tp[y].find (numy));
	}
}

int main () {
	/*  */
	scanf ("%d", &n);
	for (int i = 1; i < n; ++i)
		scanf ("%d%d%d", &x, &y, &z),
		e[x].empb (y, z), e[y].empb (x, z);
	dfs (1, 0); dp (1, 0);
	printf ("%d", ans);

	return 0;
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |  scanf ("%d", &n);
      |  ~~~~~~^~~~~~~~~~
beads.cpp:59:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   scanf ("%d%d%d", &x, &y, &z),
      |   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	14292 KB	Output is correct
2	Correct	8 ms	14336 KB	Output is correct
3	Correct	7 ms	14292 KB	Output is correct
4	Correct	7 ms	14408 KB	Output is correct
5	Correct	7 ms	14292 KB	Output is correct
6	Correct	9 ms	14400 KB	Output is correct
7	Correct	7 ms	14404 KB	Output is correct
8	Correct	7 ms	14408 KB	Output is correct
9	Correct	8 ms	14292 KB	Output is correct
10	Correct	7 ms	14292 KB	Output is correct
11	Correct	7 ms	14404 KB	Output is correct
12	Correct	7 ms	14400 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	14292 KB	Output is correct
2	Correct	8 ms	14336 KB	Output is correct
3	Correct	7 ms	14292 KB	Output is correct
4	Correct	7 ms	14408 KB	Output is correct
5	Correct	7 ms	14292 KB	Output is correct
6	Correct	9 ms	14400 KB	Output is correct
7	Correct	7 ms	14404 KB	Output is correct
8	Correct	7 ms	14408 KB	Output is correct
9	Correct	8 ms	14292 KB	Output is correct
10	Correct	7 ms	14292 KB	Output is correct
11	Correct	7 ms	14404 KB	Output is correct
12	Correct	7 ms	14400 KB	Output is correct
13	Correct	7 ms	14412 KB	Output is correct
14	Correct	7 ms	14400 KB	Output is correct
15	Correct	7 ms	14364 KB	Output is correct
16	Correct	8 ms	14400 KB	Output is correct
17	Correct	8 ms	14400 KB	Output is correct
18	Correct	7 ms	14420 KB	Output is correct
19	Correct	8 ms	14420 KB	Output is correct
20	Correct	7 ms	14420 KB	Output is correct
21	Correct	7 ms	14348 KB	Output is correct
22	Correct	8 ms	14420 KB	Output is correct

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	14292 KB	Output is correct
2	Correct	8 ms	14336 KB	Output is correct
3	Correct	7 ms	14292 KB	Output is correct
4	Correct	7 ms	14408 KB	Output is correct
5	Correct	7 ms	14292 KB	Output is correct
6	Correct	9 ms	14400 KB	Output is correct
7	Correct	7 ms	14404 KB	Output is correct
8	Correct	7 ms	14408 KB	Output is correct
9	Correct	8 ms	14292 KB	Output is correct
10	Correct	7 ms	14292 KB	Output is correct
11	Correct	7 ms	14404 KB	Output is correct
12	Correct	7 ms	14400 KB	Output is correct
13	Correct	7 ms	14412 KB	Output is correct
14	Correct	7 ms	14400 KB	Output is correct
15	Correct	7 ms	14364 KB	Output is correct
16	Correct	8 ms	14400 KB	Output is correct
17	Correct	8 ms	14400 KB	Output is correct
18	Correct	7 ms	14420 KB	Output is correct
19	Correct	8 ms	14420 KB	Output is correct
20	Correct	7 ms	14420 KB	Output is correct
21	Correct	7 ms	14348 KB	Output is correct
22	Correct	8 ms	14420 KB	Output is correct
23	Correct	11 ms	14932 KB	Output is correct
24	Correct	12 ms	14924 KB	Output is correct
25	Correct	11 ms	14928 KB	Output is correct
26	Correct	15 ms	15460 KB	Output is correct
27	Correct	15 ms	15380 KB	Output is correct
28	Correct	15 ms	15492 KB	Output is correct
29	Correct	19 ms	15460 KB	Output is correct
30	Correct	15 ms	15392 KB	Output is correct
31	Correct	14 ms	15956 KB	Output is correct

Subtask #4
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	14292 KB	Output is correct
2	Correct	8 ms	14336 KB	Output is correct
3	Correct	7 ms	14292 KB	Output is correct
4	Correct	7 ms	14408 KB	Output is correct
5	Correct	7 ms	14292 KB	Output is correct
6	Correct	9 ms	14400 KB	Output is correct
7	Correct	7 ms	14404 KB	Output is correct
8	Correct	7 ms	14408 KB	Output is correct
9	Correct	8 ms	14292 KB	Output is correct
10	Correct	7 ms	14292 KB	Output is correct
11	Correct	7 ms	14404 KB	Output is correct
12	Correct	7 ms	14400 KB	Output is correct
13	Correct	7 ms	14412 KB	Output is correct
14	Correct	7 ms	14400 KB	Output is correct
15	Correct	7 ms	14364 KB	Output is correct
16	Correct	8 ms	14400 KB	Output is correct
17	Correct	8 ms	14400 KB	Output is correct
18	Correct	7 ms	14420 KB	Output is correct
19	Correct	8 ms	14420 KB	Output is correct
20	Correct	7 ms	14420 KB	Output is correct
21	Correct	7 ms	14348 KB	Output is correct
22	Correct	8 ms	14420 KB	Output is correct
23	Correct	11 ms	14932 KB	Output is correct
24	Correct	12 ms	14924 KB	Output is correct
25	Correct	11 ms	14928 KB	Output is correct
26	Correct	15 ms	15460 KB	Output is correct
27	Correct	15 ms	15380 KB	Output is correct
28	Correct	15 ms	15492 KB	Output is correct
29	Correct	19 ms	15460 KB	Output is correct
30	Correct	15 ms	15392 KB	Output is correct
31	Correct	14 ms	15956 KB	Output is correct
32	Correct	52 ms	19752 KB	Output is correct
33	Correct	47 ms	19660 KB	Output is correct
34	Correct	47 ms	19656 KB	Output is correct
35	Correct	275 ms	36308 KB	Output is correct
36	Correct	278 ms	36340 KB	Output is correct
37	Correct	262 ms	36296 KB	Output is correct
38	Correct	310 ms	36732 KB	Output is correct
39	Correct	301 ms	36808 KB	Output is correct
40	Correct	291 ms	36588 KB	Output is correct
41	Correct	296 ms	43208 KB	Output is correct

Submission #698598

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 15.0 / 15.0

Subtask #3 29.0 / 29.0

Subtask #4 43.0 / 43.0

Subtask #1
13.0 / 13.0

Subtask #2
15.0 / 15.0

Subtask #3
29.0 / 29.0

Subtask #4
43.0 / 43.0