답안 #417168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417168	2021-06-03T12:32:28 Z	Knps4422	Power Plant (JOI20_power)	C++14	47 / 100	1500 ms	63316 KB

power

//#pragma optimization_level 3
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordset;
*/
#define fr first
#define sc second
#define vec vector
#define pb push_back
#define pii pair<int, int>
#define forn(x,y) for(int x = 1 ; x <= (int)y ; ++x)
#define all(x) (x).begin(),(x).end()
#define fast cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);cout.sync_with_stdio(0);
 
using namespace std;
 
typedef long long ll;
typedef unsigned int uint;
typedef pair<ll,ll> pll;
typedef complex<int> point;
const int nmax = 200005;
const ll linf = 1e18;
const ll mod = 998244353;
const int inf = 1e9+10;
const int sq = 5000;

int n;
char asd[nmax];
int viz[nmax];
vec < int > g[nmax] , ng[nmax];
vec < pii > edges;

map < pair<int,int> , pair < int,int> > dp;
int compute_dp(int nod1 , int nod2){
	if(dp[{nod1,nod2}].sc > 0){
		//cout << "dp: " << nod1 << ' '<< nod2 << ' '<< dp[{nod1,nod2}].fr << '\n';
		return dp[{nod1,nod2}].fr;
	}
	int rs = -(asd[nod2] == '1') , rs2 = (asd[nod2] == '1');
	for(int i : g[nod2]){
		if(i != nod1){
			rs+= compute_dp(nod2,i);
		}
	}
	dp[{nod1,nod2}] = {max(rs,rs2),1};
	//cout << "dp: " << nod1 << ' '<< nod2 << ' '<< max(rs,rs2) << '\n';
	return max(rs,rs2);
}

int main(){
	cin >> n;
	for(int i = 1; i < n; i++){
		int a, b;
		cin >> a >> b;
		g[a].pb(b);
		g[b].pb(a);
		edges.pb({a,b});
	}
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		cin >> asd[i];
		cnt += (asd[i] == '1');
	}
	int rez;
	if(cnt >= 2){
		rez = 2;
	}else{
		rez = 1;
	}
	for(int i = 1; i <= n; i++){
		int rs;
		//cout << "COMPUTE " << i << '\n';
		if(asd[i] == '1')rs = -1;
		else rs = 0;
		//cout << rs << '\n';
		for(int j : g[i]){
			rs += compute_dp(i,j);
		}
		//cout << i << ' ' << rs << '\n';
		rez = max(rez,rs);
	}
	cout << rez << '\n';

}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	9676 KB	Output is correct
2	Correct	5 ms	9584 KB	Output is correct
3	Correct	5 ms	9688 KB	Output is correct
4	Correct	5 ms	9688 KB	Output is correct
5	Correct	6 ms	9676 KB	Output is correct
6	Correct	6 ms	9676 KB	Output is correct
7	Correct	5 ms	9692 KB	Output is correct
8	Correct	6 ms	9636 KB	Output is correct
9	Correct	7 ms	9676 KB	Output is correct
10	Correct	6 ms	9692 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	6 ms	9752 KB	Output is correct
13	Correct	6 ms	9692 KB	Output is correct
14	Correct	5 ms	9676 KB	Output is correct
15	Correct	5 ms	9676 KB	Output is correct
16	Correct	6 ms	9676 KB	Output is correct
17	Correct	5 ms	9676 KB	Output is correct
18	Correct	6 ms	9676 KB	Output is correct
19	Correct	5 ms	9676 KB	Output is correct
20	Correct	5 ms	9692 KB	Output is correct
21	Correct	5 ms	9688 KB	Output is correct

Subtask #2
41.0 / 41.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	9676 KB	Output is correct
2	Correct	5 ms	9584 KB	Output is correct
3	Correct	5 ms	9688 KB	Output is correct
4	Correct	5 ms	9688 KB	Output is correct
5	Correct	6 ms	9676 KB	Output is correct
6	Correct	6 ms	9676 KB	Output is correct
7	Correct	5 ms	9692 KB	Output is correct
8	Correct	6 ms	9636 KB	Output is correct
9	Correct	7 ms	9676 KB	Output is correct
10	Correct	6 ms	9692 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	6 ms	9752 KB	Output is correct
13	Correct	6 ms	9692 KB	Output is correct
14	Correct	5 ms	9676 KB	Output is correct
15	Correct	5 ms	9676 KB	Output is correct
16	Correct	6 ms	9676 KB	Output is correct
17	Correct	5 ms	9676 KB	Output is correct
18	Correct	6 ms	9676 KB	Output is correct
19	Correct	5 ms	9676 KB	Output is correct
20	Correct	5 ms	9692 KB	Output is correct
21	Correct	5 ms	9688 KB	Output is correct
22	Correct	10 ms	9932 KB	Output is correct
23	Correct	10 ms	9932 KB	Output is correct
24	Correct	11 ms	9932 KB	Output is correct
25	Correct	10 ms	9932 KB	Output is correct
26	Correct	10 ms	9932 KB	Output is correct
27	Correct	10 ms	9956 KB	Output is correct
28	Correct	10 ms	9932 KB	Output is correct
29	Correct	9 ms	10188 KB	Output is correct
30	Correct	10 ms	10084 KB	Output is correct
31	Correct	10 ms	9956 KB	Output is correct
32	Correct	10 ms	9932 KB	Output is correct
33	Correct	9 ms	10048 KB	Output is correct
34	Correct	10 ms	9932 KB	Output is correct
35	Correct	10 ms	9932 KB	Output is correct
36	Correct	10 ms	9932 KB	Output is correct
37	Correct	155 ms	9932 KB	Output is correct
38	Correct	40 ms	10016 KB	Output is correct
39	Correct	10 ms	10060 KB	Output is correct
40	Correct	10 ms	10060 KB	Output is correct
41	Correct	10 ms	10096 KB	Output is correct
42	Correct	10 ms	10060 KB	Output is correct
43	Correct	10 ms	10060 KB	Output is correct
44	Correct	14 ms	10088 KB	Output is correct
45	Correct	16 ms	10060 KB	Output is correct
46	Correct	13 ms	10060 KB	Output is correct
47	Correct	13 ms	10060 KB	Output is correct
48	Correct	152 ms	10128 KB	Output is correct
49	Correct	62 ms	10112 KB	Output is correct
50	Correct	41 ms	10052 KB	Output is correct
51	Correct	24 ms	10028 KB	Output is correct
52	Correct	11 ms	9960 KB	Output is correct
53	Correct	44 ms	10012 KB	Output is correct
54	Correct	15 ms	10068 KB	Output is correct
55	Correct	12 ms	10060 KB	Output is correct
56	Correct	738 ms	9964 KB	Output is correct
57	Correct	9 ms	10188 KB	Output is correct
58	Correct	733 ms	10000 KB	Output is correct
59	Correct	733 ms	10148 KB	Output is correct
60	Correct	9 ms	10060 KB	Output is correct
61	Correct	780 ms	10060 KB	Output is correct
62	Correct	9 ms	10188 KB	Output is correct
63	Correct	10 ms	10048 KB	Output is correct

Subtask #3
0.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	9676 KB	Output is correct
2	Correct	5 ms	9584 KB	Output is correct
3	Correct	5 ms	9688 KB	Output is correct
4	Correct	5 ms	9688 KB	Output is correct
5	Correct	6 ms	9676 KB	Output is correct
6	Correct	6 ms	9676 KB	Output is correct
7	Correct	5 ms	9692 KB	Output is correct
8	Correct	6 ms	9636 KB	Output is correct
9	Correct	7 ms	9676 KB	Output is correct
10	Correct	6 ms	9692 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	6 ms	9752 KB	Output is correct
13	Correct	6 ms	9692 KB	Output is correct
14	Correct	5 ms	9676 KB	Output is correct
15	Correct	5 ms	9676 KB	Output is correct
16	Correct	6 ms	9676 KB	Output is correct
17	Correct	5 ms	9676 KB	Output is correct
18	Correct	6 ms	9676 KB	Output is correct
19	Correct	5 ms	9676 KB	Output is correct
20	Correct	5 ms	9692 KB	Output is correct
21	Correct	5 ms	9688 KB	Output is correct
22	Correct	10 ms	9932 KB	Output is correct
23	Correct	10 ms	9932 KB	Output is correct
24	Correct	11 ms	9932 KB	Output is correct
25	Correct	10 ms	9932 KB	Output is correct
26	Correct	10 ms	9932 KB	Output is correct
27	Correct	10 ms	9956 KB	Output is correct
28	Correct	10 ms	9932 KB	Output is correct
29	Correct	9 ms	10188 KB	Output is correct
30	Correct	10 ms	10084 KB	Output is correct
31	Correct	10 ms	9956 KB	Output is correct
32	Correct	10 ms	9932 KB	Output is correct
33	Correct	9 ms	10048 KB	Output is correct
34	Correct	10 ms	9932 KB	Output is correct
35	Correct	10 ms	9932 KB	Output is correct
36	Correct	10 ms	9932 KB	Output is correct
37	Correct	155 ms	9932 KB	Output is correct
38	Correct	40 ms	10016 KB	Output is correct
39	Correct	10 ms	10060 KB	Output is correct
40	Correct	10 ms	10060 KB	Output is correct
41	Correct	10 ms	10096 KB	Output is correct
42	Correct	10 ms	10060 KB	Output is correct
43	Correct	10 ms	10060 KB	Output is correct
44	Correct	14 ms	10088 KB	Output is correct
45	Correct	16 ms	10060 KB	Output is correct
46	Correct	13 ms	10060 KB	Output is correct
47	Correct	13 ms	10060 KB	Output is correct
48	Correct	152 ms	10128 KB	Output is correct
49	Correct	62 ms	10112 KB	Output is correct
50	Correct	41 ms	10052 KB	Output is correct
51	Correct	24 ms	10028 KB	Output is correct
52	Correct	11 ms	9960 KB	Output is correct
53	Correct	44 ms	10012 KB	Output is correct
54	Correct	15 ms	10068 KB	Output is correct
55	Correct	12 ms	10060 KB	Output is correct
56	Correct	738 ms	9964 KB	Output is correct
57	Correct	9 ms	10188 KB	Output is correct
58	Correct	733 ms	10000 KB	Output is correct
59	Correct	733 ms	10148 KB	Output is correct
60	Correct	9 ms	10060 KB	Output is correct
61	Correct	780 ms	10060 KB	Output is correct
62	Correct	9 ms	10188 KB	Output is correct
63	Correct	10 ms	10048 KB	Output is correct
64	Correct	872 ms	45508 KB	Output is correct
65	Correct	869 ms	45548 KB	Output is correct
66	Correct	856 ms	45620 KB	Output is correct
67	Correct	875 ms	45528 KB	Output is correct
68	Correct	864 ms	45508 KB	Output is correct
69	Correct	852 ms	45868 KB	Output is correct
70	Correct	867 ms	45596 KB	Output is correct
71	Correct	863 ms	45728 KB	Output is correct
72	Correct	888 ms	45620 KB	Output is correct
73	Correct	1081 ms	63316 KB	Output is correct
74	Correct	1078 ms	63264 KB	Output is correct
75	Correct	902 ms	45504 KB	Output is correct
76	Correct	890 ms	45356 KB	Output is correct
77	Correct	926 ms	45492 KB	Output is correct
78	Correct	902 ms	45404 KB	Output is correct
79	Correct	922 ms	45472 KB	Output is correct
80	Correct	927 ms	45620 KB	Output is correct
81	Execution timed out	1574 ms	33448 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #417168

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 0.0 / 53.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
0.0 / 53.0