Submission #883768

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
883768	2023-12-06T01:31:45 Z	marvinthang	Power Plant (JOI20_power)	C++17	100 / 100	117 ms	30864 KB

power

/*************************************
*    author: marvinthang             *
*    created: 06.12.2023 08:20:33    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n; cin >> n;
	vector <vector <int>> adj(n);
	REP(i, n - 1) {
		int u, v; cin >> u >> v; --u; --v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	string s; cin >> s;
	int res = 0;
	function <int(int, int)> dfs = [&] (int u, int par) {
		int cur = 0;
		for (int v: adj[u]) if (v != par) {
			int x = dfs(v, u);
			cur += x;
			res = max(res, x + s[u] - '0');
		}
		cur = max(cur - s[u] + '0', s[u] - '0');
		res = max(res, cur);
		return cur;
	};
	dfs(0, 0);
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI20_power");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

power.cpp: In function 'int main()':
power.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
power.cpp:72:2: note: in expansion of macro 'file'
   72 |  file("JOI20_power");
      |  ^~~~
power.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
power.cpp:72:2: note: in expansion of macro 'file'
   72 |  file("JOI20_power");
      |  ^~~~

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct

Subtask #2
41.0 / 41.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	600 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	584 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	760 KB	Output is correct
43	Correct	1 ms	608 KB	Output is correct
44	Correct	1 ms	608 KB	Output is correct
45	Correct	1 ms	608 KB	Output is correct
46	Correct	1 ms	788 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	600 KB	Output is correct
54	Correct	1 ms	604 KB	Output is correct
55	Correct	1 ms	604 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	600 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	1 ms	600 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	1 ms	604 KB	Output is correct
62	Correct	1 ms	604 KB	Output is correct
63	Correct	1 ms	600 KB	Output is correct

Subtask #3
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	600 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	584 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	760 KB	Output is correct
43	Correct	1 ms	608 KB	Output is correct
44	Correct	1 ms	608 KB	Output is correct
45	Correct	1 ms	608 KB	Output is correct
46	Correct	1 ms	788 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	600 KB	Output is correct
54	Correct	1 ms	604 KB	Output is correct
55	Correct	1 ms	604 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	600 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	1 ms	600 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	1 ms	604 KB	Output is correct
62	Correct	1 ms	604 KB	Output is correct
63	Correct	1 ms	600 KB	Output is correct
64	Correct	70 ms	14608 KB	Output is correct
65	Correct	75 ms	14648 KB	Output is correct
66	Correct	76 ms	14524 KB	Output is correct
67	Correct	63 ms	14644 KB	Output is correct
68	Correct	60 ms	14540 KB	Output is correct
69	Correct	116 ms	14644 KB	Output is correct
70	Correct	56 ms	14648 KB	Output is correct
71	Correct	70 ms	14652 KB	Output is correct
72	Correct	109 ms	14532 KB	Output is correct
73	Correct	90 ms	29644 KB	Output is correct
74	Correct	88 ms	29596 KB	Output is correct
75	Correct	60 ms	14420 KB	Output is correct
76	Correct	72 ms	14420 KB	Output is correct
77	Correct	85 ms	14436 KB	Output is correct
78	Correct	94 ms	14392 KB	Output is correct
79	Correct	73 ms	14400 KB	Output is correct
80	Correct	59 ms	14388 KB	Output is correct
81	Correct	54 ms	14884 KB	Output is correct
82	Correct	65 ms	14580 KB	Output is correct
83	Correct	69 ms	20632 KB	Output is correct
84	Correct	103 ms	23228 KB	Output is correct
85	Correct	77 ms	22812 KB	Output is correct
86	Correct	61 ms	16016 KB	Output is correct
87	Correct	117 ms	15240 KB	Output is correct
88	Correct	59 ms	15820 KB	Output is correct
89	Correct	58 ms	15776 KB	Output is correct
90	Correct	62 ms	15604 KB	Output is correct
91	Correct	83 ms	15732 KB	Output is correct
92	Correct	62 ms	16256 KB	Output is correct
93	Correct	67 ms	19004 KB	Output is correct
94	Correct	72 ms	21192 KB	Output is correct
95	Correct	76 ms	19608 KB	Output is correct
96	Correct	57 ms	17524 KB	Output is correct
97	Correct	64 ms	15524 KB	Output is correct
98	Correct	81 ms	15204 KB	Output is correct
99	Correct	55 ms	14896 KB	Output is correct
100	Correct	64 ms	18588 KB	Output is correct
101	Correct	64 ms	16148 KB	Output is correct
102	Correct	57 ms	15208 KB	Output is correct
103	Correct	63 ms	15040 KB	Output is correct
104	Correct	44 ms	15296 KB	Output is correct
105	Correct	82 ms	25948 KB	Output is correct
106	Correct	43 ms	15044 KB	Output is correct
107	Correct	48 ms	15152 KB	Output is correct
108	Correct	100 ms	30400 KB	Output is correct
109	Correct	42 ms	15216 KB	Output is correct
110	Correct	85 ms	30864 KB	Output is correct
111	Correct	56 ms	14452 KB	Output is correct

Submission #883768

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 53.0 / 53.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
53.0 / 53.0