oj.uz

Submission #525872

# Submission time Handle Problem Language Result Execution time Memory
525872 2022-02-13T04:40:14 Z koioi.org-koosaga Mountains and Valleys (CCO20_day1problem3) C++17
5 / 25
 340 ms 37964 KB 
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long lint;
typedef pair<lint, lint> pi;
const int MAXN = 500005;

struct edge{
	int s, e, x;
};

int n, m;
vector<int> gph[MAXN];
int par[20][MAXN], dep[MAXN];

int lca(int x, int y){
	if(dep[x] > dep[y]) swap(x, y);
	int dx = dep[y] - dep[x];
	for(int i = 0; dx; i++){
		if(dx & 1) y = par[i][y];
		dx >>= 1;
	}
	for(int i = 19; i >= 0; i--){
		if(par[i][x] != par[i][y]){
			x = par[i][x];
			y = par[i][y];
		}
	}
	if(x != y) return par[0][x];
	return x;
}

vector<int> ord;
int din[MAXN], dout[MAXN], piv;
int far[MAXN], diam[MAXN], pfar[MAXN], pdiam[MAXN];
int f[20][MAXN], g[MAXN];
vector<pi> fars[MAXN];
vector<pi> subDiams[MAXN];

int fPathMax(int x, int v){
	int ans = -1e9;
	for(int i = 0; v; i++){
		if(v & 1){
			ans = max(ans, f[i][x]);
			x = par[i][x];
		}
		v >>= 1;
	}
	return ans;
}

bool in(int u, int v){
	return din[u] <= din[v] && dout[v] <= dout[u];
}

void dfs(int x, int p = -1){
	ord.push_back(x);
	din[x] = ++piv;
	for(auto &y : gph[x]){
		if(y == p) continue;
		par[0][y] = x;
		dep[y] = dep[x] + 1;
		dfs(y, x);
	}
	dout[x] = piv;
}

bool vis[MAXN];

pi dfsl(int x, int p = -1){
	pi ret(0, x);
	for(auto &y : gph[x]){
		if(y == p || vis[y]) continue;
		auto ans = dfsl(y, x);
		ans.first++;
		ret = max(ret, ans);
	}
	return ret;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	vector<edge> qry;
	for(int i = 0; i < m; i++){
		int s, e, x; cin >> s >> e >> x;
		if(x == 1){
			gph[s].push_back(e);
			gph[e].push_back(s);
		}
		else{
			qry.push_back({s, e, x});
		}
	}
	dfs(0);
	for(int i = 1; i < 20; i++){
		for(int j = 0; j < n; j++){
			par[i][j] = par[i-1][par[i-1][j]];
		}
	}
	{
		for(int i = 1; i < 20; i++){
			for(int j = 0; j < n; j++){
				f[i][j] = max(f[i-1][j], f[i-1][par[i-1][j]]);
			}
		}
		reverse(all(ord));
		for(auto &i : ord){
			for(auto &j : gph[i]){
				if(j == par[0][i]) continue;
				far[i] = max(far[i], far[j] + 1);
				diam[i] = max({diam[i], diam[j], far[j] + 1});
				fars[i].emplace_back(far[j], j);
			}
			sort(all(fars[i]));
			reverse(all(fars[i]));
			if(sz(fars[i]) >= 2) diam[i] = max(diam[i], (int)fars[i][0].first + (int)fars[i][1].first + 2);
		}
		reverse(all(ord));
		for(auto &i : ord){
			if(i == 0) continue;
			for(auto &j : fars[par[0][i]]){
				if(j.second == i) continue;
				pfar[i] = j.first + 1;
				break;
			}
			fars[i].emplace_back(pfar[i], par[0][i]);
			sort(all(fars[i]));
			reverse(all(fars[i]));
		}	
		for(auto &i : ord){
			if(i == 0) continue;
			for(auto &[d, v] : subDiams[par[0][i]]){
				if(v == i) continue;
				pdiam[i] = max(pdiam[i], (int)d);
			}
			{
				int new_diam = 0;
				int cnt = 0;
				for(auto &[d, v] : fars[par[0][i]]){
					if(v == i) continue;
					new_diam += d + 1;
					cnt += 1;
					if(cnt == 2) break;
				}
				pdiam[i] = max(pdiam[i], new_diam);
			}
			for(auto &j : gph[i]){
				if(j == par[0][i]) subDiams[i].emplace_back(pdiam[i], j);
				else subDiams[i].emplace_back(diam[j], j);
			}
			sort(all(subDiams[i]));
			reverse(all(subDiams[i]));
		}
		// TODO: n^2
		for(int i = 0; i < n; i++){
			if(dep[i] >= 2){
				vis[i] = 1;
				vis[par[1][i]] = 1;
				auto x = dfsl(par[0][i]);
				g[i] = x.first;
				f[0][i] = dfsl(x.second).first;
				vis[i] = 0;
				vis[par[1][i]] = 0;
			}
		}
	}
	int ans = 2 * n - 2 - diam[0];
	for(auto &x : qry){
		int l = lca(x.s, x.e);
		int plen = dep[x.s] + dep[x.e] - 2 * dep[l] + 1;
		int maxPath = -1e9;
		if(dep[x.s] >= dep[l] + 2){
			maxPath = max(maxPath, fPathMax(x.s, dep[x.s] - dep[l] - 1) - 3 + plen);
		}
		if(dep[x.e] >= dep[l] + 2){
			maxPath = max(maxPath, fPathMax(x.e, dep[x.e] - dep[l] - 1) - 3 + plen);
		}
		if(l != x.s){
			maxPath = max(maxPath, diam[x.s] - 3 + plen);
		}
		if(l != x.e){
			maxPath = max(maxPath, diam[x.e] - 3 + plen);
		}
		{
			int new_diam = 0;
			int cnt = 0;
			// passes through l
			for(auto &[d, v] : fars[l]){
				if((in(v, x.s) || in(v, x.e)) && v != par[0][l]) continue;
				new_diam += d + 1;
				cnt += 1;
				if(cnt == 2) break;
			}
			for(auto &[d, v] : subDiams[l]){
				if((in(v, x.s) || in(v, x.e)) && v != par[0][l]) continue;
				new_diam = max(new_diam, (int)d);
				break;
			}
			maxPath = max(maxPath, new_diam - 3 + plen);
		}
		// TODO: qn.
		vector<int> valup, valdown;
		if(x.s != l) valup.push_back(far[x.s]);
		if(x.e != l) valdown.push_back(far[x.e]);
		for(int i = x.s; dep[i] >= dep[l] + 2; i = par[0][i]) valup.push_back(g[i]);
		for(int i = x.e; dep[i] >= dep[l] + 2; i = par[0][i]) valdown.push_back(g[i]);
		{
			int dist = 0;
			for(auto &[d, v] : fars[l]){
				if((in(v, x.s) || in(v, x.e)) && v != par[0][l]) continue;
				dist = max(dist, (int)d + 1);
				break;
			}
			valup.push_back(dist);
		}
		vector<int> val;
		{
			reverse(all(valdown));
			for(auto &i : valup) val.push_back(i);
			for(auto &i : valdown) val.push_back(i);
		}
		int pmax = -1e9;
		for(int i = 0; i < sz(val); i++){
			maxPath = max(maxPath, sz(val) - 1 - i + val[i] + pmax);
			pmax = max(pmax, i + val[i]);
		}
		ans = min(ans, 2 * n - 4 + x.x - maxPath);
	}
	cout << ans << endl;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct
16 Correct 16 ms 35812 KB Output is correct
17 Correct 17 ms 35916 KB Output is correct
18 Correct 16 ms 35852 KB Output is correct
19 Correct 19 ms 35876 KB Output is correct
20 Correct 17 ms 35788 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 17 ms 35916 KB Output is correct
23 Correct 18 ms 35904 KB Output is correct
24 Correct 18 ms 35840 KB Output is correct
25 Correct 18 ms 35916 KB Output is correct
26 Correct 18 ms 35916 KB Output is correct
27 Correct 16 ms 35868 KB Output is correct
28 Correct 16 ms 35916 KB Output is correct
29 Correct 18 ms 35832 KB Output is correct
30 Correct 18 ms 35916 KB Output is correct
31 Correct 18 ms 35916 KB Output is correct
32 Correct 16 ms 35828 KB Output is correct
33 Correct 17 ms 35808 KB Output is correct
34 Correct 16 ms 35916 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 37872 KB Output is correct
2 Correct 196 ms 37964 KB Output is correct
3 Correct 132 ms 37744 KB Output is correct
4 Correct 89 ms 37708 KB Output is correct
5 Correct 91 ms 37628 KB Output is correct
6 Correct 340 ms 37488 KB Output is correct
7 Correct 162 ms 37944 KB Output is correct
8 Correct 225 ms 37860 KB Output is correct
9 Correct 212 ms 37908 KB Output is correct
10 Correct 78 ms 37756 KB Output is correct
11 Correct 89 ms 37700 KB Output is correct
12 Correct 127 ms 37744 KB Output is correct
13 Correct 93 ms 37820 KB Output is correct
14 Correct 86 ms 37756 KB Output is correct

Subtask #4
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct
16 Correct 16 ms 35812 KB Output is correct
17 Correct 17 ms 35916 KB Output is correct
18 Correct 16 ms 35852 KB Output is correct
19 Correct 19 ms 35876 KB Output is correct
20 Correct 17 ms 35788 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 17 ms 35916 KB Output is correct
23 Correct 18 ms 35904 KB Output is correct
24 Correct 18 ms 35840 KB Output is correct
25 Correct 18 ms 35916 KB Output is correct
26 Correct 18 ms 35916 KB Output is correct
27 Correct 16 ms 35868 KB Output is correct
28 Correct 16 ms 35916 KB Output is correct
29 Correct 18 ms 35832 KB Output is correct
30 Correct 18 ms 35916 KB Output is correct
31 Correct 18 ms 35916 KB Output is correct
32 Correct 16 ms 35828 KB Output is correct
33 Correct 17 ms 35808 KB Output is correct
34 Correct 16 ms 35916 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 19 ms 35916 KB Output is correct
37 Correct 16 ms 35916 KB Output is correct
38 Correct 19 ms 35916 KB Output is correct
39 Correct 18 ms 35916 KB Output is correct
40 Correct 18 ms 35944 KB Output is correct
41 Correct 17 ms 35916 KB Output is correct
42 Correct 18 ms 35916 KB Output is correct
43 Correct 17 ms 35916 KB Output is correct
44 Correct 20 ms 35916 KB Output is correct
45 Correct 17 ms 35836 KB Output is correct
46 Correct 16 ms 35872 KB Output is correct
47 Incorrect 16 ms 35916 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct
16 Correct 16 ms 35812 KB Output is correct
17 Correct 17 ms 35916 KB Output is correct
18 Correct 16 ms 35852 KB Output is correct
19 Correct 19 ms 35876 KB Output is correct
20 Correct 17 ms 35788 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 17 ms 35916 KB Output is correct
23 Correct 18 ms 35904 KB Output is correct
24 Correct 18 ms 35840 KB Output is correct
25 Correct 18 ms 35916 KB Output is correct
26 Correct 18 ms 35916 KB Output is correct
27 Correct 16 ms 35868 KB Output is correct
28 Correct 16 ms 35916 KB Output is correct
29 Correct 18 ms 35832 KB Output is correct
30 Correct 18 ms 35916 KB Output is correct
31 Correct 18 ms 35916 KB Output is correct
32 Correct 16 ms 35828 KB Output is correct
33 Correct 17 ms 35808 KB Output is correct
34 Correct 16 ms 35916 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 19 ms 35916 KB Output is correct
37 Correct 16 ms 35916 KB Output is correct
38 Correct 19 ms 35916 KB Output is correct
39 Correct 18 ms 35916 KB Output is correct
40 Correct 18 ms 35944 KB Output is correct
41 Correct 17 ms 35916 KB Output is correct
42 Correct 18 ms 35916 KB Output is correct
43 Correct 17 ms 35916 KB Output is correct
44 Correct 20 ms 35916 KB Output is correct
45 Correct 17 ms 35836 KB Output is correct
46 Correct 16 ms 35872 KB Output is correct
47 Incorrect 16 ms 35916 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #6
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct
16 Correct 16 ms 35812 KB Output is correct
17 Correct 17 ms 35916 KB Output is correct
18 Correct 16 ms 35852 KB Output is correct
19 Correct 19 ms 35876 KB Output is correct
20 Correct 17 ms 35788 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 17 ms 35916 KB Output is correct
23 Correct 18 ms 35904 KB Output is correct
24 Correct 18 ms 35840 KB Output is correct
25 Correct 18 ms 35916 KB Output is correct
26 Correct 18 ms 35916 KB Output is correct
27 Correct 16 ms 35868 KB Output is correct
28 Correct 16 ms 35916 KB Output is correct
29 Correct 18 ms 35832 KB Output is correct
30 Correct 18 ms 35916 KB Output is correct
31 Correct 18 ms 35916 KB Output is correct
32 Correct 16 ms 35828 KB Output is correct
33 Correct 17 ms 35808 KB Output is correct
34 Correct 16 ms 35916 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 144 ms 37872 KB Output is correct
37 Correct 196 ms 37964 KB Output is correct
38 Correct 132 ms 37744 KB Output is correct
39 Correct 89 ms 37708 KB Output is correct
40 Correct 91 ms 37628 KB Output is correct
41 Correct 340 ms 37488 KB Output is correct
42 Correct 162 ms 37944 KB Output is correct
43 Correct 225 ms 37860 KB Output is correct
44 Correct 212 ms 37908 KB Output is correct
45 Correct 78 ms 37756 KB Output is correct
46 Correct 89 ms 37700 KB Output is correct
47 Correct 127 ms 37744 KB Output is correct
48 Correct 93 ms 37820 KB Output is correct
49 Correct 86 ms 37756 KB Output is correct
50 Correct 19 ms 35916 KB Output is correct
51 Correct 16 ms 35916 KB Output is correct
52 Correct 19 ms 35916 KB Output is correct
53 Correct 18 ms 35916 KB Output is correct
54 Correct 18 ms 35944 KB Output is correct
55 Correct 17 ms 35916 KB Output is correct
56 Correct 18 ms 35916 KB Output is correct
57 Correct 17 ms 35916 KB Output is correct
58 Correct 20 ms 35916 KB Output is correct
59 Correct 17 ms 35836 KB Output is correct
60 Correct 16 ms 35872 KB Output is correct
61 Incorrect 16 ms 35916 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct
16 Correct 16 ms 35812 KB Output is correct
17 Correct 17 ms 35916 KB Output is correct
18 Correct 16 ms 35852 KB Output is correct
19 Correct 19 ms 35876 KB Output is correct
20 Correct 17 ms 35788 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 17 ms 35916 KB Output is correct
23 Correct 18 ms 35904 KB Output is correct
24 Correct 18 ms 35840 KB Output is correct
25 Correct 18 ms 35916 KB Output is correct
26 Correct 18 ms 35916 KB Output is correct
27 Correct 16 ms 35868 KB Output is correct
28 Correct 16 ms 35916 KB Output is correct
29 Correct 18 ms 35832 KB Output is correct
30 Correct 18 ms 35916 KB Output is correct
31 Correct 18 ms 35916 KB Output is correct
32 Correct 16 ms 35828 KB Output is correct
33 Correct 17 ms 35808 KB Output is correct
34 Correct 16 ms 35916 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 144 ms 37872 KB Output is correct
37 Correct 196 ms 37964 KB Output is correct
38 Correct 132 ms 37744 KB Output is correct
39 Correct 89 ms 37708 KB Output is correct
40 Correct 91 ms 37628 KB Output is correct
41 Correct 340 ms 37488 KB Output is correct
42 Correct 162 ms 37944 KB Output is correct
43 Correct 225 ms 37860 KB Output is correct
44 Correct 212 ms 37908 KB Output is correct
45 Correct 78 ms 37756 KB Output is correct
46 Correct 89 ms 37700 KB Output is correct
47 Correct 127 ms 37744 KB Output is correct
48 Correct 93 ms 37820 KB Output is correct
49 Correct 86 ms 37756 KB Output is correct
50 Correct 19 ms 35916 KB Output is correct
51 Correct 16 ms 35916 KB Output is correct
52 Correct 19 ms 35916 KB Output is correct
53 Correct 18 ms 35916 KB Output is correct
54 Correct 18 ms 35944 KB Output is correct
55 Correct 17 ms 35916 KB Output is correct
56 Correct 18 ms 35916 KB Output is correct
57 Correct 17 ms 35916 KB Output is correct
58 Correct 20 ms 35916 KB Output is correct
59 Correct 17 ms 35836 KB Output is correct
60 Correct 16 ms 35872 KB Output is correct
61 Incorrect 16 ms 35916 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #8
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35820 KB Output is correct
3 Correct 17 ms 35792 KB Output is correct
4 Correct 23 ms 35844 KB Output is correct
5 Correct 17 ms 35844 KB Output is correct
6 Correct 16 ms 35872 KB Output is correct
7 Correct 16 ms 35860 KB Output is correct
8 Correct 16 ms 35916 KB Output is correct
9 Correct 17 ms 35828 KB Output is correct
10 Correct 16 ms 35800 KB Output is correct
11 Correct 16 ms 35848 KB Output is correct
12 Correct 18 ms 35916 KB Output is correct
13 Correct 16 ms 35916 KB Output is correct
14 Correct 16 ms 35868 KB Output is correct
15 Correct 16 ms 35820 KB Output is correct
16 Correct 16 ms 35812 KB Output is correct
17 Correct 17 ms 35916 KB Output is correct
18 Correct 16 ms 35852 KB Output is correct
19 Correct 19 ms 35876 KB Output is correct
20 Correct 17 ms 35788 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 17 ms 35916 KB Output is correct
23 Correct 18 ms 35904 KB Output is correct
24 Correct 18 ms 35840 KB Output is correct
25 Correct 18 ms 35916 KB Output is correct
26 Correct 18 ms 35916 KB Output is correct
27 Correct 16 ms 35868 KB Output is correct
28 Correct 16 ms 35916 KB Output is correct
29 Correct 18 ms 35832 KB Output is correct
30 Correct 18 ms 35916 KB Output is correct
31 Correct 18 ms 35916 KB Output is correct
32 Correct 16 ms 35828 KB Output is correct
33 Correct 17 ms 35808 KB Output is correct
34 Correct 16 ms 35916 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 144 ms 37872 KB Output is correct
37 Correct 196 ms 37964 KB Output is correct
38 Correct 132 ms 37744 KB Output is correct
39 Correct 89 ms 37708 KB Output is correct
40 Correct 91 ms 37628 KB Output is correct
41 Correct 340 ms 37488 KB Output is correct
42 Correct 162 ms 37944 KB Output is correct
43 Correct 225 ms 37860 KB Output is correct
44 Correct 212 ms 37908 KB Output is correct
45 Correct 78 ms 37756 KB Output is correct
46 Correct 89 ms 37700 KB Output is correct
47 Correct 127 ms 37744 KB Output is correct
48 Correct 93 ms 37820 KB Output is correct
49 Correct 86 ms 37756 KB Output is correct
50 Correct 19 ms 35916 KB Output is correct
51 Correct 16 ms 35916 KB Output is correct
52 Correct 19 ms 35916 KB Output is correct
53 Correct 18 ms 35916 KB Output is correct
54 Correct 18 ms 35944 KB Output is correct
55 Correct 17 ms 35916 KB Output is correct
56 Correct 18 ms 35916 KB Output is correct
57 Correct 17 ms 35916 KB Output is correct
58 Correct 20 ms 35916 KB Output is correct
59 Correct 17 ms 35836 KB Output is correct
60 Correct 16 ms 35872 KB Output is correct
61 Incorrect 16 ms 35916 KB Output isn't correct
62 Halted 0 ms 0 KB -