oj.uz

Submission #393236

# Submission time Handle Problem Language Result Execution time Memory
393236 2021-04-23T03:01:22 Z arwaeystoamneg Power Plant (JOI20_power) C++17
100 / 100
 182 ms 26120 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}

const int MAX = 200005;
int n, dp[MAX];
vi adj[MAX];
string a;
int ans = 0;
void solve(int i, int p = -1)
{
	int v = 0;
	trav(x, adj[i])
	{
		if (x == p)continue;
		solve(x, i);
		dp[i] += dp[x];
		v = max(v, dp[x]);
	}
	if (a[i] == '1')
	{
		dp[i] = max(dp[i] - 1, 1);
		ans = max(ans, 1 + v);
	}
	ans = max(ans, dp[i]);
}
int main() 
{
	setIO("");
	cin >> n;
	F0R(i, n - 1)
	{
		int x, y;
		cin >> x >> y;
		adj[--x].pb(--y);
		adj[y].pb(x);
	}
	cin >> a;
	solve(0);
	cout << ans << endl;
}

Compilation message

power.cpp: In function 'void setIO(std::string)':
power.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
power.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 4944 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4944 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 4 ms 5020 KB Output is correct
24 Correct 4 ms 5068 KB Output is correct
25 Correct 4 ms 4976 KB Output is correct
26 Correct 4 ms 5068 KB Output is correct
27 Correct 4 ms 5068 KB Output is correct
28 Correct 5 ms 5068 KB Output is correct
29 Correct 4 ms 5196 KB Output is correct
30 Correct 4 ms 5176 KB Output is correct
31 Correct 5 ms 5068 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 4 ms 5068 KB Output is correct
35 Correct 4 ms 5068 KB Output is correct
36 Correct 4 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5068 KB Output is correct
39 Correct 5 ms 5068 KB Output is correct
40 Correct 4 ms 5068 KB Output is correct
41 Correct 4 ms 5068 KB Output is correct
42 Correct 4 ms 5068 KB Output is correct
43 Correct 4 ms 5068 KB Output is correct
44 Correct 4 ms 5068 KB Output is correct
45 Correct 4 ms 5068 KB Output is correct
46 Correct 5 ms 5068 KB Output is correct
47 Correct 4 ms 5068 KB Output is correct
48 Correct 5 ms 5160 KB Output is correct
49 Correct 4 ms 5068 KB Output is correct
50 Correct 4 ms 5068 KB Output is correct
51 Correct 4 ms 5068 KB Output is correct
52 Correct 4 ms 5068 KB Output is correct
53 Correct 4 ms 5068 KB Output is correct
54 Correct 4 ms 5068 KB Output is correct
55 Correct 4 ms 5068 KB Output is correct
56 Correct 4 ms 5068 KB Output is correct
57 Correct 4 ms 5196 KB Output is correct
58 Correct 4 ms 5068 KB Output is correct
59 Correct 4 ms 5068 KB Output is correct
60 Correct 4 ms 5068 KB Output is correct
61 Correct 4 ms 5068 KB Output is correct
62 Correct 4 ms 5196 KB Output is correct
63 Correct 4 ms 5068 KB Output is correct
64 Correct 165 ms 12488 KB Output is correct
65 Correct 173 ms 12472 KB Output is correct
66 Correct 136 ms 12424 KB Output is correct
67 Correct 146 ms 12660 KB Output is correct
68 Correct 137 ms 12400 KB Output is correct
69 Correct 138 ms 12480 KB Output is correct
70 Correct 139 ms 12436 KB Output is correct
71 Correct 145 ms 12372 KB Output is correct
72 Correct 182 ms 12416 KB Output is correct
73 Correct 166 ms 25020 KB Output is correct
74 Correct 158 ms 24964 KB Output is correct
75 Correct 147 ms 12292 KB Output is correct
76 Correct 165 ms 12352 KB Output is correct
77 Correct 143 ms 12288 KB Output is correct
78 Correct 140 ms 12288 KB Output is correct
79 Correct 145 ms 12316 KB Output is correct
80 Correct 146 ms 12292 KB Output is correct
81 Correct 122 ms 12756 KB Output is correct
82 Correct 127 ms 12536 KB Output is correct
83 Correct 151 ms 17544 KB Output is correct
84 Correct 151 ms 19624 KB Output is correct
85 Correct 149 ms 19344 KB Output is correct
86 Correct 150 ms 13724 KB Output is correct
87 Correct 143 ms 13144 KB Output is correct
88 Correct 135 ms 13632 KB Output is correct
89 Correct 132 ms 13688 KB Output is correct
90 Correct 154 ms 13452 KB Output is correct
91 Correct 141 ms 13628 KB Output is correct
92 Correct 134 ms 14028 KB Output is correct
93 Correct 131 ms 16456 KB Output is correct
94 Correct 169 ms 18288 KB Output is correct
95 Correct 129 ms 16784 KB Output is correct
96 Correct 130 ms 15044 KB Output is correct
97 Correct 132 ms 13448 KB Output is correct
98 Correct 133 ms 12960 KB Output is correct
99 Correct 160 ms 12848 KB Output is correct
100 Correct 130 ms 16000 KB Output is correct
101 Correct 138 ms 13956 KB Output is correct
102 Correct 171 ms 13184 KB Output is correct
103 Correct 139 ms 12968 KB Output is correct
104 Correct 77 ms 12460 KB Output is correct
105 Correct 159 ms 21980 KB Output is correct
106 Correct 84 ms 13276 KB Output is correct
107 Correct 80 ms 13200 KB Output is correct
108 Correct 162 ms 25836 KB Output is correct
109 Correct 82 ms 12472 KB Output is correct
110 Correct 161 ms 26120 KB Output is correct
111 Correct 150 ms 12288 KB Output is correct