oj.uz

답안 #525881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525881 2022-02-13T05:39:51 Z koioi.org-koosaga Mountains and Valleys (CCO20_day1problem3) C++17
16 / 25
 7000 ms 63644 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;
}

struct node{
	int lmax, rmax, opt, len;
	node():
	lmax(-1e9), rmax(-1e9), opt(-1e9), len(0) {}
	node(int x):
	lmax(x), rmax(x), opt(-1e9), len(1) {}

	node(int a, int b, int c, int e):
	lmax(a), rmax(b), opt(c), len(e) {}

	node reverse(){
		return node(rmax, lmax, opt, len);
	}
	node operator+(const node &n)const{
		return node(
			max(lmax - n.len, n.lmax),
			max(rmax, n.rmax - len),
			max({opt, n.opt, lmax + n.rmax - 1}),
			len + n.len);
	};
};

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]];
		}
	}
	{
		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);
				break;
			}
			{
				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]));
		}
		for(int i = 0; i < n; i++){
			if(dep[i] >= 2){
				int cnt = 0;
				for(auto &[d, v] : fars[par[0][i]]){
					if(v == i || v == par[1][i]) continue;
					g[i] = max(g[i], (int)d + 1);
					f[0][i] += d + 1;
					cnt++;
					if(cnt == 2) break;
				}
				for(auto &[d, v] : subDiams[par[0][i]]){
					if(v == i || v == par[1][i]) continue;
					f[0][i] = max(f[0][i], (int)d);
					break;
				}
			}
		}
		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]]);
			}
		}
	}
	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.
		node valup, valdown;
		if(x.s != l) valup = valup + node(far[x.s]);
		if(x.e != l) valdown = valdown + node(far[x.e]);
		for(int i = x.s; dep[i] >= dep[l] + 2; i = par[0][i]) valup = valup + node(g[i]);
		for(int i = x.e; dep[i] >= dep[l] + 2; i = par[0][i]) valdown = valdown + node(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 = valup + node(dist);
		}
		node val = valup + valdown.reverse();
		maxPath = max(maxPath, val.opt + val.len - 1);
		ans = min(ans, 2 * n - 4 + x.x - maxPath);
	}
	cout << ans << endl;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct
16 Correct 18 ms 35836 KB Output is correct
17 Correct 21 ms 35872 KB Output is correct
18 Correct 22 ms 35788 KB Output is correct
19 Correct 18 ms 35788 KB Output is correct
20 Correct 16 ms 35916 KB Output is correct
21 Correct 16 ms 35808 KB Output is correct
22 Correct 15 ms 35916 KB Output is correct
23 Correct 16 ms 35788 KB Output is correct
24 Correct 17 ms 35916 KB Output is correct
25 Correct 17 ms 35880 KB Output is correct
26 Correct 21 ms 35916 KB Output is correct
27 Correct 21 ms 35892 KB Output is correct
28 Correct 17 ms 35916 KB Output is correct
29 Correct 17 ms 35872 KB Output is correct
30 Correct 16 ms 35924 KB Output is correct
31 Correct 16 ms 35888 KB Output is correct
32 Correct 16 ms 35812 KB Output is correct
33 Correct 16 ms 35864 KB Output is correct
34 Correct 17 ms 35884 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 37736 KB Output is correct
2 Correct 119 ms 37800 KB Output is correct
3 Correct 86 ms 37684 KB Output is correct
4 Correct 57 ms 37580 KB Output is correct
5 Correct 54 ms 37640 KB Output is correct
6 Correct 22 ms 37500 KB Output is correct
7 Correct 109 ms 37800 KB Output is correct
8 Correct 87 ms 37828 KB Output is correct
9 Correct 91 ms 37820 KB Output is correct
10 Correct 55 ms 37572 KB Output is correct
11 Correct 68 ms 37708 KB Output is correct
12 Correct 74 ms 37608 KB Output is correct
13 Correct 62 ms 37804 KB Output is correct
14 Correct 57 ms 37592 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct
16 Correct 18 ms 35836 KB Output is correct
17 Correct 21 ms 35872 KB Output is correct
18 Correct 22 ms 35788 KB Output is correct
19 Correct 18 ms 35788 KB Output is correct
20 Correct 16 ms 35916 KB Output is correct
21 Correct 16 ms 35808 KB Output is correct
22 Correct 15 ms 35916 KB Output is correct
23 Correct 16 ms 35788 KB Output is correct
24 Correct 17 ms 35916 KB Output is correct
25 Correct 17 ms 35880 KB Output is correct
26 Correct 21 ms 35916 KB Output is correct
27 Correct 21 ms 35892 KB Output is correct
28 Correct 17 ms 35916 KB Output is correct
29 Correct 17 ms 35872 KB Output is correct
30 Correct 16 ms 35924 KB Output is correct
31 Correct 16 ms 35888 KB Output is correct
32 Correct 16 ms 35812 KB Output is correct
33 Correct 16 ms 35864 KB Output is correct
34 Correct 17 ms 35884 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 16 ms 35832 KB Output is correct
37 Correct 18 ms 35880 KB Output is correct
38 Correct 18 ms 35916 KB Output is correct
39 Correct 22 ms 35832 KB Output is correct
40 Correct 19 ms 35932 KB Output is correct
41 Correct 17 ms 35916 KB Output is correct
42 Correct 16 ms 35896 KB Output is correct
43 Correct 16 ms 35884 KB Output is correct
44 Correct 17 ms 35916 KB Output is correct
45 Correct 17 ms 35916 KB Output is correct
46 Correct 16 ms 35916 KB Output is correct
47 Correct 17 ms 35936 KB Output is correct
48 Correct 18 ms 35916 KB Output is correct
49 Correct 16 ms 35916 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct
16 Correct 18 ms 35836 KB Output is correct
17 Correct 21 ms 35872 KB Output is correct
18 Correct 22 ms 35788 KB Output is correct
19 Correct 18 ms 35788 KB Output is correct
20 Correct 16 ms 35916 KB Output is correct
21 Correct 16 ms 35808 KB Output is correct
22 Correct 15 ms 35916 KB Output is correct
23 Correct 16 ms 35788 KB Output is correct
24 Correct 17 ms 35916 KB Output is correct
25 Correct 17 ms 35880 KB Output is correct
26 Correct 21 ms 35916 KB Output is correct
27 Correct 21 ms 35892 KB Output is correct
28 Correct 17 ms 35916 KB Output is correct
29 Correct 17 ms 35872 KB Output is correct
30 Correct 16 ms 35924 KB Output is correct
31 Correct 16 ms 35888 KB Output is correct
32 Correct 16 ms 35812 KB Output is correct
33 Correct 16 ms 35864 KB Output is correct
34 Correct 17 ms 35884 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 16 ms 35832 KB Output is correct
37 Correct 18 ms 35880 KB Output is correct
38 Correct 18 ms 35916 KB Output is correct
39 Correct 22 ms 35832 KB Output is correct
40 Correct 19 ms 35932 KB Output is correct
41 Correct 17 ms 35916 KB Output is correct
42 Correct 16 ms 35896 KB Output is correct
43 Correct 16 ms 35884 KB Output is correct
44 Correct 17 ms 35916 KB Output is correct
45 Correct 17 ms 35916 KB Output is correct
46 Correct 16 ms 35916 KB Output is correct
47 Correct 17 ms 35936 KB Output is correct
48 Correct 18 ms 35916 KB Output is correct
49 Correct 16 ms 35916 KB Output is correct
50 Correct 19 ms 36016 KB Output is correct
51 Correct 18 ms 35988 KB Output is correct
52 Correct 18 ms 36044 KB Output is correct
53 Correct 19 ms 35952 KB Output is correct
54 Correct 19 ms 36072 KB Output is correct
55 Correct 17 ms 36044 KB Output is correct
56 Correct 18 ms 36036 KB Output is correct
57 Correct 18 ms 36064 KB Output is correct
58 Correct 18 ms 36044 KB Output is correct
59 Correct 17 ms 36004 KB Output is correct
60 Correct 17 ms 36044 KB Output is correct
61 Correct 16 ms 36044 KB Output is correct
62 Correct 17 ms 35972 KB Output is correct
63 Correct 17 ms 36044 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct
16 Correct 18 ms 35836 KB Output is correct
17 Correct 21 ms 35872 KB Output is correct
18 Correct 22 ms 35788 KB Output is correct
19 Correct 18 ms 35788 KB Output is correct
20 Correct 16 ms 35916 KB Output is correct
21 Correct 16 ms 35808 KB Output is correct
22 Correct 15 ms 35916 KB Output is correct
23 Correct 16 ms 35788 KB Output is correct
24 Correct 17 ms 35916 KB Output is correct
25 Correct 17 ms 35880 KB Output is correct
26 Correct 21 ms 35916 KB Output is correct
27 Correct 21 ms 35892 KB Output is correct
28 Correct 17 ms 35916 KB Output is correct
29 Correct 17 ms 35872 KB Output is correct
30 Correct 16 ms 35924 KB Output is correct
31 Correct 16 ms 35888 KB Output is correct
32 Correct 16 ms 35812 KB Output is correct
33 Correct 16 ms 35864 KB Output is correct
34 Correct 17 ms 35884 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 111 ms 37736 KB Output is correct
37 Correct 119 ms 37800 KB Output is correct
38 Correct 86 ms 37684 KB Output is correct
39 Correct 57 ms 37580 KB Output is correct
40 Correct 54 ms 37640 KB Output is correct
41 Correct 22 ms 37500 KB Output is correct
42 Correct 109 ms 37800 KB Output is correct
43 Correct 87 ms 37828 KB Output is correct
44 Correct 91 ms 37820 KB Output is correct
45 Correct 55 ms 37572 KB Output is correct
46 Correct 68 ms 37708 KB Output is correct
47 Correct 74 ms 37608 KB Output is correct
48 Correct 62 ms 37804 KB Output is correct
49 Correct 57 ms 37592 KB Output is correct
50 Correct 16 ms 35832 KB Output is correct
51 Correct 18 ms 35880 KB Output is correct
52 Correct 18 ms 35916 KB Output is correct
53 Correct 22 ms 35832 KB Output is correct
54 Correct 19 ms 35932 KB Output is correct
55 Correct 17 ms 35916 KB Output is correct
56 Correct 16 ms 35896 KB Output is correct
57 Correct 16 ms 35884 KB Output is correct
58 Correct 17 ms 35916 KB Output is correct
59 Correct 17 ms 35916 KB Output is correct
60 Correct 16 ms 35916 KB Output is correct
61 Correct 17 ms 35936 KB Output is correct
62 Correct 18 ms 35916 KB Output is correct
63 Correct 16 ms 35916 KB Output is correct
64 Correct 19 ms 36016 KB Output is correct
65 Correct 18 ms 35988 KB Output is correct
66 Correct 18 ms 36044 KB Output is correct
67 Correct 19 ms 35952 KB Output is correct
68 Correct 19 ms 36072 KB Output is correct
69 Correct 17 ms 36044 KB Output is correct
70 Correct 18 ms 36036 KB Output is correct
71 Correct 18 ms 36064 KB Output is correct
72 Correct 18 ms 36044 KB Output is correct
73 Correct 17 ms 36004 KB Output is correct
74 Correct 17 ms 36044 KB Output is correct
75 Correct 16 ms 36044 KB Output is correct
76 Correct 17 ms 35972 KB Output is correct
77 Correct 17 ms 36044 KB Output is correct
78 Correct 75 ms 37604 KB Output is correct
79 Correct 103 ms 37720 KB Output is correct
80 Correct 82 ms 37676 KB Output is correct
81 Correct 69 ms 37688 KB Output is correct
82 Correct 65 ms 37616 KB Output is correct
83 Correct 23 ms 37580 KB Output is correct
84 Correct 93 ms 37724 KB Output is correct
85 Correct 76 ms 37780 KB Output is correct
86 Correct 91 ms 37708 KB Output is correct
87 Correct 70 ms 37580 KB Output is correct
88 Correct 76 ms 37580 KB Output is correct
89 Correct 76 ms 37580 KB Output is correct
90 Correct 37 ms 37576 KB Output is correct
91 Correct 36 ms 37524 KB Output is correct

Subtask #7
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct
16 Correct 18 ms 35836 KB Output is correct
17 Correct 21 ms 35872 KB Output is correct
18 Correct 22 ms 35788 KB Output is correct
19 Correct 18 ms 35788 KB Output is correct
20 Correct 16 ms 35916 KB Output is correct
21 Correct 16 ms 35808 KB Output is correct
22 Correct 15 ms 35916 KB Output is correct
23 Correct 16 ms 35788 KB Output is correct
24 Correct 17 ms 35916 KB Output is correct
25 Correct 17 ms 35880 KB Output is correct
26 Correct 21 ms 35916 KB Output is correct
27 Correct 21 ms 35892 KB Output is correct
28 Correct 17 ms 35916 KB Output is correct
29 Correct 17 ms 35872 KB Output is correct
30 Correct 16 ms 35924 KB Output is correct
31 Correct 16 ms 35888 KB Output is correct
32 Correct 16 ms 35812 KB Output is correct
33 Correct 16 ms 35864 KB Output is correct
34 Correct 17 ms 35884 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 111 ms 37736 KB Output is correct
37 Correct 119 ms 37800 KB Output is correct
38 Correct 86 ms 37684 KB Output is correct
39 Correct 57 ms 37580 KB Output is correct
40 Correct 54 ms 37640 KB Output is correct
41 Correct 22 ms 37500 KB Output is correct
42 Correct 109 ms 37800 KB Output is correct
43 Correct 87 ms 37828 KB Output is correct
44 Correct 91 ms 37820 KB Output is correct
45 Correct 55 ms 37572 KB Output is correct
46 Correct 68 ms 37708 KB Output is correct
47 Correct 74 ms 37608 KB Output is correct
48 Correct 62 ms 37804 KB Output is correct
49 Correct 57 ms 37592 KB Output is correct
50 Correct 16 ms 35832 KB Output is correct
51 Correct 18 ms 35880 KB Output is correct
52 Correct 18 ms 35916 KB Output is correct
53 Correct 22 ms 35832 KB Output is correct
54 Correct 19 ms 35932 KB Output is correct
55 Correct 17 ms 35916 KB Output is correct
56 Correct 16 ms 35896 KB Output is correct
57 Correct 16 ms 35884 KB Output is correct
58 Correct 17 ms 35916 KB Output is correct
59 Correct 17 ms 35916 KB Output is correct
60 Correct 16 ms 35916 KB Output is correct
61 Correct 17 ms 35936 KB Output is correct
62 Correct 18 ms 35916 KB Output is correct
63 Correct 16 ms 35916 KB Output is correct
64 Correct 19 ms 36016 KB Output is correct
65 Correct 18 ms 35988 KB Output is correct
66 Correct 18 ms 36044 KB Output is correct
67 Correct 19 ms 35952 KB Output is correct
68 Correct 19 ms 36072 KB Output is correct
69 Correct 17 ms 36044 KB Output is correct
70 Correct 18 ms 36036 KB Output is correct
71 Correct 18 ms 36064 KB Output is correct
72 Correct 18 ms 36044 KB Output is correct
73 Correct 17 ms 36004 KB Output is correct
74 Correct 17 ms 36044 KB Output is correct
75 Correct 16 ms 36044 KB Output is correct
76 Correct 17 ms 35972 KB Output is correct
77 Correct 17 ms 36044 KB Output is correct
78 Correct 75 ms 37604 KB Output is correct
79 Correct 103 ms 37720 KB Output is correct
80 Correct 82 ms 37676 KB Output is correct
81 Correct 69 ms 37688 KB Output is correct
82 Correct 65 ms 37616 KB Output is correct
83 Correct 23 ms 37580 KB Output is correct
84 Correct 93 ms 37724 KB Output is correct
85 Correct 76 ms 37780 KB Output is correct
86 Correct 91 ms 37708 KB Output is correct
87 Correct 70 ms 37580 KB Output is correct
88 Correct 76 ms 37580 KB Output is correct
89 Correct 76 ms 37580 KB Output is correct
90 Correct 37 ms 37576 KB Output is correct
91 Correct 36 ms 37524 KB Output is correct
92 Execution timed out 7050 ms 63644 KB Time limit exceeded
93 Halted 0 ms 0 KB -

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35788 KB Output is correct
2 Correct 17 ms 35788 KB Output is correct
3 Correct 20 ms 35788 KB Output is correct
4 Correct 22 ms 35884 KB Output is correct
5 Correct 21 ms 35856 KB Output is correct
6 Correct 17 ms 35916 KB Output is correct
7 Correct 17 ms 35788 KB Output is correct
8 Correct 17 ms 35852 KB Output is correct
9 Correct 18 ms 35788 KB Output is correct
10 Correct 17 ms 35788 KB Output is correct
11 Correct 17 ms 35788 KB Output is correct
12 Correct 16 ms 35824 KB Output is correct
13 Correct 16 ms 35868 KB Output is correct
14 Correct 17 ms 35916 KB Output is correct
15 Correct 17 ms 35788 KB Output is correct
16 Correct 18 ms 35836 KB Output is correct
17 Correct 21 ms 35872 KB Output is correct
18 Correct 22 ms 35788 KB Output is correct
19 Correct 18 ms 35788 KB Output is correct
20 Correct 16 ms 35916 KB Output is correct
21 Correct 16 ms 35808 KB Output is correct
22 Correct 15 ms 35916 KB Output is correct
23 Correct 16 ms 35788 KB Output is correct
24 Correct 17 ms 35916 KB Output is correct
25 Correct 17 ms 35880 KB Output is correct
26 Correct 21 ms 35916 KB Output is correct
27 Correct 21 ms 35892 KB Output is correct
28 Correct 17 ms 35916 KB Output is correct
29 Correct 17 ms 35872 KB Output is correct
30 Correct 16 ms 35924 KB Output is correct
31 Correct 16 ms 35888 KB Output is correct
32 Correct 16 ms 35812 KB Output is correct
33 Correct 16 ms 35864 KB Output is correct
34 Correct 17 ms 35884 KB Output is correct
35 Correct 16 ms 35916 KB Output is correct
36 Correct 111 ms 37736 KB Output is correct
37 Correct 119 ms 37800 KB Output is correct
38 Correct 86 ms 37684 KB Output is correct
39 Correct 57 ms 37580 KB Output is correct
40 Correct 54 ms 37640 KB Output is correct
41 Correct 22 ms 37500 KB Output is correct
42 Correct 109 ms 37800 KB Output is correct
43 Correct 87 ms 37828 KB Output is correct
44 Correct 91 ms 37820 KB Output is correct
45 Correct 55 ms 37572 KB Output is correct
46 Correct 68 ms 37708 KB Output is correct
47 Correct 74 ms 37608 KB Output is correct
48 Correct 62 ms 37804 KB Output is correct
49 Correct 57 ms 37592 KB Output is correct
50 Correct 16 ms 35832 KB Output is correct
51 Correct 18 ms 35880 KB Output is correct
52 Correct 18 ms 35916 KB Output is correct
53 Correct 22 ms 35832 KB Output is correct
54 Correct 19 ms 35932 KB Output is correct
55 Correct 17 ms 35916 KB Output is correct
56 Correct 16 ms 35896 KB Output is correct
57 Correct 16 ms 35884 KB Output is correct
58 Correct 17 ms 35916 KB Output is correct
59 Correct 17 ms 35916 KB Output is correct
60 Correct 16 ms 35916 KB Output is correct
61 Correct 17 ms 35936 KB Output is correct
62 Correct 18 ms 35916 KB Output is correct
63 Correct 16 ms 35916 KB Output is correct
64 Correct 19 ms 36016 KB Output is correct
65 Correct 18 ms 35988 KB Output is correct
66 Correct 18 ms 36044 KB Output is correct
67 Correct 19 ms 35952 KB Output is correct
68 Correct 19 ms 36072 KB Output is correct
69 Correct 17 ms 36044 KB Output is correct
70 Correct 18 ms 36036 KB Output is correct
71 Correct 18 ms 36064 KB Output is correct
72 Correct 18 ms 36044 KB Output is correct
73 Correct 17 ms 36004 KB Output is correct
74 Correct 17 ms 36044 KB Output is correct
75 Correct 16 ms 36044 KB Output is correct
76 Correct 17 ms 35972 KB Output is correct
77 Correct 17 ms 36044 KB Output is correct
78 Correct 75 ms 37604 KB Output is correct
79 Correct 103 ms 37720 KB Output is correct
80 Correct 82 ms 37676 KB Output is correct
81 Correct 69 ms 37688 KB Output is correct
82 Correct 65 ms 37616 KB Output is correct
83 Correct 23 ms 37580 KB Output is correct
84 Correct 93 ms 37724 KB Output is correct
85 Correct 76 ms 37780 KB Output is correct
86 Correct 91 ms 37708 KB Output is correct
87 Correct 70 ms 37580 KB Output is correct
88 Correct 76 ms 37580 KB Output is correct
89 Correct 76 ms 37580 KB Output is correct
90 Correct 37 ms 37576 KB Output is correct
91 Correct 36 ms 37524 KB Output is correct
92 Execution timed out 7050 ms 63644 KB Time limit exceeded
93 Halted 0 ms 0 KB -