oj.uz

답안 #252436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252436 2020-07-25T15:16:34 Z amoo_safar 철인 이종 경기 (APIO18_duathlon) C++14
49 / 100
 394 ms 144240 KB 
#include<bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define debug(x) cerr << #x << " = " << x << '\n'

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 1e5 + 10;
const int N2 = N * 4;

ll ans;
int n, m;

int la;
vector<int> H[N], G[N2], R[N2];

int mk[N2], st[N], T = 1, dep[N2], wh[N];

void AddEdge(int u, int v){
	G[u].pb(v);
	G[v].pb(u);
	//cerr << u << ' ' << v << '\n';
}

int dfs(int u, int p, int d){
	mk[u] = 1;
	dep[u] = d;
	st[u] = T ++;

	int hbk = d, res;
	int cnt = (p == -1 ? 0 : 1);
	
	vector<pii> V;

	for(auto adj : H[u]){
		if(adj == p) continue;
		if(mk[adj]){
			hbk = min(hbk, dep[adj]);
		} else {
			res = dfs(adj, u, d + 1);
			hbk = min(hbk, res);
			if(res >= d){
				cnt ++;
				V.pb({T, cnt});
			} else {
				V.pb({T, 1});
			}

		}
	}
	//cerr << "! " << u << ' ' << cnt << ' ' << la << '\n';
	if(cnt > 0){
		wh[u] = la + 1;
		for(int i = 1; i <= cnt; i++) AddEdge(u, la + i);
		int idx;
		for(auto adj : H[u]){
			if(dep[adj] < dep[u]) idx = 1;
			else idx = upper_bound(V.begin(), V.end(), pii(st[adj], cnt + 1)) -> S;
			if(dep[adj] >= dep[u]) AddEdge(wh[adj], la + idx);
		}
		la += cnt;
	} else{
		wh[u] = la + 1;
		for(auto adj : H[u]){
			if(dep[adj] >= dep[u]) AddEdge(wh[adj], la + 1);
		}
		la ++;
	}
	return hbk;
}

int par[N2], sz[N];
int Find(int u){
	if(par[u] == u) return u;
	return par[u] = Find(par[u]);
}
void Unite(int u, int v){
	u = Find(u); v = Find(v);
	if(u == v) return ;
	par[u] = v;
	sz[v] += sz[u];
}

vector<pii> cut;
int DFS(int u, int p, int d){
	mk[u] = 1;
	dep[u] = d;

	int hbk = d, res;
	for(auto adj : G[u]){
		if(adj == p) continue;
		if(mk[adj]){
			hbk = min(hbk, dep[adj]);
			Unite(u, adj);
		} else {
			res = DFS(adj, u, d + 1);
			hbk = min(res, hbk);
			if(res <= d) Unite(adj, u);
			else {
				cut.pb(pii(adj, u));
			}
		}
	}
	return hbk;
}
int sub[N2];
vector<int> vis;
vector<pii> oth;
void DFS2(int u, int p, int d){
	vis.pb(u);
	sub[u] = sz[u];
	dep[u] = d;
	mk[u] = 1;
	for(auto adj : R[u]){
		if(adj == p) continue;
		DFS2(adj, u, d + 1);
		sub[u] += sub[adj];
	}
}

vector<int> com[N2];
vector<int> fuck[N2];

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	int u, v;
	for(int i = 1; i <= m; i++){
		cin >> u >> v;
		H[u].pb(v);
		H[v].pb(u);
	}

	cerr << '\n';
	
	la = n;
	for(int i = 1; i <= n; i++){
		if(mk[i]) continue;
		dfs(i, -1, 0);
	}
	iota(par, par + N2, 0);
	fill(sz + 1, sz + n + 1, 1);

	memset(mk, 0, sizeof mk);
	for(int i = 1; i <= la; i++){
		if(mk[i]) continue;
		DFS(i, -1, 0);
	}
	for(int i = 1; i <= la; i++) com[Find(i)].pb(i);

	for(auto &x : cut){
		x.F = Find(x.F); x.S = Find(x.S);
		R[x.F].pb(x.S);
		R[x.S].pb(x.F);
	}

	memset(mk, 0, sizeof mk);
	
	for(int i = 1; i <= la; i++){
		if(mk[i]) continue;
		if(Find(i) != i) continue;
		vis.clear();
		DFS2(i, -1, 0);


		int sm = sub[i];
		for(auto nd : vis){
			oth.clear();
			vector<int> con;
			for(auto nd2 : com[nd]){
				int res = (nd2 <= n), res2 = 0, tmp;
				
				vector<pii> ed;
				for(auto adj : G[nd2]){
					if(Find(adj) == nd) continue;
					int tm;
					tmp = Find(adj);
					if(dep[tmp] > dep[nd]) tm = sub[tmp];
					else tm = sm - sub[nd];
					ed.pb({tm, adj});
					res += tm;
					res2 += tm;
				}
				ll S2 = 0;
				for(auto [tm, adj] : ed) S2 += (tm) * (tm - 1); 
				bool fl = false;
				for(auto [tm, adj] : ed){
					if((adj <= n) && (wh[adj] != adj)){
						fuck[adj].pb(sm - tm);
						//if(nd2 <= n) tm --;
						ans += 1ll * (res2 - tm) * (res2 - tm - 1);
						ans -= S2 - (tm * (tm - 1));

						ans += 2ll * (sm - res) * (res2 - tm);
						fl = true;
					}
				}
				oth.pb({res, fl});
			}
			ll Sum = 0, S2 = 0;
			for(auto [res, fl] : oth){
				Sum += res;
				S2 += res * (res - 1);
			}
			for(auto [res, fl] : oth){
				if(fl){
					ans += 1ll * (Sum - res) * (Sum - res - 1);
					ans -= S2 - (1ll * (res) * (res - 1));
				}
			}
				
		}
	}
	for(int i = 1; i <= n; i++){
		if(wh[i] == i) continue;

		int sm = 0;
		for(auto x : fuck[i]){
			sm += x;
			ans -= 1ll * x * (x - 1);
		}
		ans += 1ll * sm * (sm - 1);
	}
	cout << ans << '\n';
	return 0;
}
/*
9 10
1 2
2 3
3 4
4 5
4 2
3 6
6 7
6 8
8 3
8 9

4 3
1 2
2 3
3 4

4 4
1 2
2 3
3 4
4 2

4 3
1 2
1 3
1 4


*/

Compilation message

count_triplets.cpp: In function 'int main()':
count_triplets.cpp:190:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for(auto [tm, adj] : ed) S2 += (tm) * (tm - 1); 
              ^
count_triplets.cpp:190:22: warning: unused variable 'adj' [-Wunused-variable]
     for(auto [tm, adj] : ed) S2 += (tm) * (tm - 1); 
                      ^
count_triplets.cpp:192:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for(auto [tm, adj] : ed){
              ^
count_triplets.cpp:206:13: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
    for(auto [res, fl] : oth){
             ^
count_triplets.cpp:206:21: warning: unused variable 'fl' [-Wunused-variable]
    for(auto [res, fl] : oth){
                     ^
count_triplets.cpp:210:13: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
    for(auto [res, fl] : oth){
             ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 43392 KB Output is correct
2 Correct 23 ms 43392 KB Output is correct
3 Correct 23 ms 43392 KB Output is correct
4 Correct 25 ms 43392 KB Output is correct
5 Correct 27 ms 43392 KB Output is correct
6 Correct 23 ms 43392 KB Output is correct
7 Correct 26 ms 43392 KB Output is correct
8 Correct 23 ms 43392 KB Output is correct
9 Correct 27 ms 43392 KB Output is correct
10 Correct 23 ms 43392 KB Output is correct
11 Correct 23 ms 43392 KB Output is correct
12 Correct 23 ms 43392 KB Output is correct
13 Correct 25 ms 43384 KB Output is correct
14 Correct 23 ms 43392 KB Output is correct
15 Correct 26 ms 43392 KB Output is correct
16 Correct 24 ms 43392 KB Output is correct
17 Correct 23 ms 43384 KB Output is correct
18 Correct 23 ms 43392 KB Output is correct
19 Correct 27 ms 43392 KB Output is correct
20 Correct 23 ms 43392 KB Output is correct
21 Correct 23 ms 43392 KB Output is correct
22 Correct 23 ms 43392 KB Output is correct
23 Correct 23 ms 43392 KB Output is correct
24 Correct 22 ms 43392 KB Output is correct
25 Correct 26 ms 43392 KB Output is correct
26 Correct 24 ms 43520 KB Output is correct
27 Correct 23 ms 43392 KB Output is correct
28 Correct 23 ms 43392 KB Output is correct
29 Correct 22 ms 43392 KB Output is correct
30 Correct 23 ms 43392 KB Output is correct
31 Correct 23 ms 43392 KB Output is correct
32 Correct 23 ms 43384 KB Output is correct
33 Correct 22 ms 43392 KB Output is correct
34 Correct 25 ms 43392 KB Output is correct
35 Correct 26 ms 43384 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 43392 KB Output is correct
2 Correct 23 ms 43392 KB Output is correct
3 Correct 23 ms 43392 KB Output is correct
4 Correct 25 ms 43392 KB Output is correct
5 Correct 27 ms 43392 KB Output is correct
6 Correct 23 ms 43392 KB Output is correct
7 Correct 26 ms 43392 KB Output is correct
8 Correct 23 ms 43392 KB Output is correct
9 Correct 27 ms 43392 KB Output is correct
10 Correct 23 ms 43392 KB Output is correct
11 Correct 23 ms 43392 KB Output is correct
12 Correct 23 ms 43392 KB Output is correct
13 Correct 25 ms 43384 KB Output is correct
14 Correct 23 ms 43392 KB Output is correct
15 Correct 26 ms 43392 KB Output is correct
16 Correct 24 ms 43392 KB Output is correct
17 Correct 23 ms 43384 KB Output is correct
18 Correct 23 ms 43392 KB Output is correct
19 Correct 27 ms 43392 KB Output is correct
20 Correct 23 ms 43392 KB Output is correct
21 Correct 23 ms 43392 KB Output is correct
22 Correct 23 ms 43392 KB Output is correct
23 Correct 23 ms 43392 KB Output is correct
24 Correct 22 ms 43392 KB Output is correct
25 Correct 26 ms 43392 KB Output is correct
26 Correct 24 ms 43520 KB Output is correct
27 Correct 23 ms 43392 KB Output is correct
28 Correct 23 ms 43392 KB Output is correct
29 Correct 22 ms 43392 KB Output is correct
30 Correct 23 ms 43392 KB Output is correct
31 Correct 23 ms 43392 KB Output is correct
32 Correct 23 ms 43384 KB Output is correct
33 Correct 22 ms 43392 KB Output is correct
34 Correct 25 ms 43392 KB Output is correct
35 Correct 26 ms 43384 KB Output is correct
36 Correct 22 ms 43392 KB Output is correct
37 Correct 26 ms 43392 KB Output is correct
38 Correct 23 ms 43392 KB Output is correct
39 Correct 32 ms 43384 KB Output is correct
40 Correct 22 ms 43392 KB Output is correct
41 Correct 30 ms 43392 KB Output is correct
42 Correct 23 ms 43384 KB Output is correct
43 Correct 23 ms 43368 KB Output is correct
44 Correct 23 ms 43488 KB Output is correct
45 Correct 26 ms 43384 KB Output is correct
46 Correct 22 ms 43392 KB Output is correct
47 Correct 23 ms 43392 KB Output is correct
48 Correct 24 ms 43384 KB Output is correct
49 Correct 23 ms 43392 KB Output is correct
50 Correct 33 ms 43384 KB Output is correct
51 Correct 23 ms 43384 KB Output is correct
52 Correct 27 ms 43392 KB Output is correct
53 Correct 23 ms 43392 KB Output is correct
54 Correct 23 ms 43392 KB Output is correct
55 Correct 23 ms 43392 KB Output is correct
56 Correct 23 ms 43392 KB Output is correct
57 Correct 26 ms 43384 KB Output is correct
58 Correct 23 ms 43392 KB Output is correct
59 Correct 26 ms 43392 KB Output is correct
60 Correct 27 ms 43392 KB Output is correct
61 Correct 24 ms 43392 KB Output is correct
62 Correct 27 ms 43384 KB Output is correct
63 Correct 22 ms 43392 KB Output is correct
64 Correct 23 ms 43392 KB Output is correct
65 Correct 23 ms 43392 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 266 ms 144240 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 43896 KB Output is correct
2 Correct 25 ms 43904 KB Output is correct
3 Correct 24 ms 43904 KB Output is correct
4 Correct 25 ms 44024 KB Output is correct
5 Correct 25 ms 44028 KB Output is correct
6 Correct 25 ms 43904 KB Output is correct
7 Correct 29 ms 44032 KB Output is correct
8 Correct 24 ms 43904 KB Output is correct
9 Correct 29 ms 43904 KB Output is correct
10 Correct 27 ms 43896 KB Output is correct
11 Correct 25 ms 43896 KB Output is correct
12 Correct 29 ms 43768 KB Output is correct
13 Correct 25 ms 43776 KB Output is correct
14 Correct 24 ms 43776 KB Output is correct
15 Correct 24 ms 43776 KB Output is correct
16 Correct 28 ms 43648 KB Output is correct
17 Correct 25 ms 43904 KB Output is correct
18 Correct 28 ms 43904 KB Output is correct
19 Correct 25 ms 43904 KB Output is correct
20 Correct 29 ms 43896 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 349 ms 85284 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 43896 KB Output is correct
2 Correct 25 ms 43888 KB Output is correct
3 Correct 29 ms 43776 KB Output is correct
4 Correct 25 ms 43776 KB Output is correct
5 Correct 28 ms 43768 KB Output is correct
6 Correct 26 ms 43756 KB Output is correct
7 Correct 24 ms 43648 KB Output is correct
8 Correct 27 ms 43648 KB Output is correct
9 Correct 25 ms 43648 KB Output is correct
10 Correct 25 ms 43648 KB Output is correct
11 Correct 24 ms 43644 KB Output is correct
12 Correct 25 ms 43904 KB Output is correct
13 Correct 25 ms 43896 KB Output is correct
14 Correct 24 ms 43904 KB Output is correct
15 Correct 27 ms 43896 KB Output is correct
16 Correct 25 ms 43776 KB Output is correct
17 Correct 25 ms 43768 KB Output is correct
18 Correct 24 ms 43776 KB Output is correct
19 Correct 29 ms 43768 KB Output is correct
20 Correct 24 ms 43648 KB Output is correct
21 Correct 33 ms 43768 KB Output is correct
22 Correct 25 ms 43836 KB Output is correct
23 Correct 26 ms 43776 KB Output is correct
24 Correct 35 ms 43768 KB Output is correct
25 Correct 27 ms 43512 KB Output is correct
26 Correct 31 ms 43520 KB Output is correct
27 Correct 27 ms 43512 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 394 ms 85360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 43392 KB Output is correct
2 Correct 23 ms 43392 KB Output is correct
3 Correct 23 ms 43392 KB Output is correct
4 Correct 25 ms 43392 KB Output is correct
5 Correct 27 ms 43392 KB Output is correct
6 Correct 23 ms 43392 KB Output is correct
7 Correct 26 ms 43392 KB Output is correct
8 Correct 23 ms 43392 KB Output is correct
9 Correct 27 ms 43392 KB Output is correct
10 Correct 23 ms 43392 KB Output is correct
11 Correct 23 ms 43392 KB Output is correct
12 Correct 23 ms 43392 KB Output is correct
13 Correct 25 ms 43384 KB Output is correct
14 Correct 23 ms 43392 KB Output is correct
15 Correct 26 ms 43392 KB Output is correct
16 Correct 24 ms 43392 KB Output is correct
17 Correct 23 ms 43384 KB Output is correct
18 Correct 23 ms 43392 KB Output is correct
19 Correct 27 ms 43392 KB Output is correct
20 Correct 23 ms 43392 KB Output is correct
21 Correct 23 ms 43392 KB Output is correct
22 Correct 23 ms 43392 KB Output is correct
23 Correct 23 ms 43392 KB Output is correct
24 Correct 22 ms 43392 KB Output is correct
25 Correct 26 ms 43392 KB Output is correct
26 Correct 24 ms 43520 KB Output is correct
27 Correct 23 ms 43392 KB Output is correct
28 Correct 23 ms 43392 KB Output is correct
29 Correct 22 ms 43392 KB Output is correct
30 Correct 23 ms 43392 KB Output is correct
31 Correct 23 ms 43392 KB Output is correct
32 Correct 23 ms 43384 KB Output is correct
33 Correct 22 ms 43392 KB Output is correct
34 Correct 25 ms 43392 KB Output is correct
35 Correct 26 ms 43384 KB Output is correct
36 Correct 22 ms 43392 KB Output is correct
37 Correct 26 ms 43392 KB Output is correct
38 Correct 23 ms 43392 KB Output is correct
39 Correct 32 ms 43384 KB Output is correct
40 Correct 22 ms 43392 KB Output is correct
41 Correct 30 ms 43392 KB Output is correct
42 Correct 23 ms 43384 KB Output is correct
43 Correct 23 ms 43368 KB Output is correct
44 Correct 23 ms 43488 KB Output is correct
45 Correct 26 ms 43384 KB Output is correct
46 Correct 22 ms 43392 KB Output is correct
47 Correct 23 ms 43392 KB Output is correct
48 Correct 24 ms 43384 KB Output is correct
49 Correct 23 ms 43392 KB Output is correct
50 Correct 33 ms 43384 KB Output is correct
51 Correct 23 ms 43384 KB Output is correct
52 Correct 27 ms 43392 KB Output is correct
53 Correct 23 ms 43392 KB Output is correct
54 Correct 23 ms 43392 KB Output is correct
55 Correct 23 ms 43392 KB Output is correct
56 Correct 23 ms 43392 KB Output is correct
57 Correct 26 ms 43384 KB Output is correct
58 Correct 23 ms 43392 KB Output is correct
59 Correct 26 ms 43392 KB Output is correct
60 Correct 27 ms 43392 KB Output is correct
61 Correct 24 ms 43392 KB Output is correct
62 Correct 27 ms 43384 KB Output is correct
63 Correct 22 ms 43392 KB Output is correct
64 Correct 23 ms 43392 KB Output is correct
65 Correct 23 ms 43392 KB Output is correct
66 Correct 23 ms 43520 KB Output is correct
67 Correct 23 ms 43648 KB Output is correct
68 Correct 25 ms 43776 KB Output is correct
69 Correct 24 ms 43776 KB Output is correct
70 Correct 30 ms 43768 KB Output is correct
71 Correct 28 ms 43640 KB Output is correct
72 Correct 25 ms 43768 KB Output is correct
73 Correct 26 ms 43648 KB Output is correct
74 Correct 26 ms 43648 KB Output is correct
75 Correct 25 ms 43648 KB Output is correct
76 Correct 27 ms 43392 KB Output is correct
77 Correct 27 ms 43776 KB Output is correct
78 Correct 28 ms 43776 KB Output is correct
79 Correct 28 ms 43768 KB Output is correct
80 Correct 25 ms 43648 KB Output is correct
81 Correct 26 ms 43648 KB Output is correct
82 Correct 25 ms 43776 KB Output is correct
83 Correct 26 ms 43776 KB Output is correct
84 Correct 25 ms 43776 KB Output is correct
85 Correct 24 ms 43776 KB Output is correct
86 Correct 28 ms 43672 KB Output is correct
87 Correct 25 ms 43640 KB Output is correct
88 Correct 25 ms 43648 KB Output is correct
89 Correct 27 ms 43648 KB Output is correct
90 Correct 25 ms 43728 KB Output is correct
91 Correct 26 ms 43648 KB Output is correct
92 Correct 25 ms 43648 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 43392 KB Output is correct
2 Correct 23 ms 43392 KB Output is correct
3 Correct 23 ms 43392 KB Output is correct
4 Correct 25 ms 43392 KB Output is correct
5 Correct 27 ms 43392 KB Output is correct
6 Correct 23 ms 43392 KB Output is correct
7 Correct 26 ms 43392 KB Output is correct
8 Correct 23 ms 43392 KB Output is correct
9 Correct 27 ms 43392 KB Output is correct
10 Correct 23 ms 43392 KB Output is correct
11 Correct 23 ms 43392 KB Output is correct
12 Correct 23 ms 43392 KB Output is correct
13 Correct 25 ms 43384 KB Output is correct
14 Correct 23 ms 43392 KB Output is correct
15 Correct 26 ms 43392 KB Output is correct
16 Correct 24 ms 43392 KB Output is correct
17 Correct 23 ms 43384 KB Output is correct
18 Correct 23 ms 43392 KB Output is correct
19 Correct 27 ms 43392 KB Output is correct
20 Correct 23 ms 43392 KB Output is correct
21 Correct 23 ms 43392 KB Output is correct
22 Correct 23 ms 43392 KB Output is correct
23 Correct 23 ms 43392 KB Output is correct
24 Correct 22 ms 43392 KB Output is correct
25 Correct 26 ms 43392 KB Output is correct
26 Correct 24 ms 43520 KB Output is correct
27 Correct 23 ms 43392 KB Output is correct
28 Correct 23 ms 43392 KB Output is correct
29 Correct 22 ms 43392 KB Output is correct
30 Correct 23 ms 43392 KB Output is correct
31 Correct 23 ms 43392 KB Output is correct
32 Correct 23 ms 43384 KB Output is correct
33 Correct 22 ms 43392 KB Output is correct
34 Correct 25 ms 43392 KB Output is correct
35 Correct 26 ms 43384 KB Output is correct
36 Correct 22 ms 43392 KB Output is correct
37 Correct 26 ms 43392 KB Output is correct
38 Correct 23 ms 43392 KB Output is correct
39 Correct 32 ms 43384 KB Output is correct
40 Correct 22 ms 43392 KB Output is correct
41 Correct 30 ms 43392 KB Output is correct
42 Correct 23 ms 43384 KB Output is correct
43 Correct 23 ms 43368 KB Output is correct
44 Correct 23 ms 43488 KB Output is correct
45 Correct 26 ms 43384 KB Output is correct
46 Correct 22 ms 43392 KB Output is correct
47 Correct 23 ms 43392 KB Output is correct
48 Correct 24 ms 43384 KB Output is correct
49 Correct 23 ms 43392 KB Output is correct
50 Correct 33 ms 43384 KB Output is correct
51 Correct 23 ms 43384 KB Output is correct
52 Correct 27 ms 43392 KB Output is correct
53 Correct 23 ms 43392 KB Output is correct
54 Correct 23 ms 43392 KB Output is correct
55 Correct 23 ms 43392 KB Output is correct
56 Correct 23 ms 43392 KB Output is correct
57 Correct 26 ms 43384 KB Output is correct
58 Correct 23 ms 43392 KB Output is correct
59 Correct 26 ms 43392 KB Output is correct
60 Correct 27 ms 43392 KB Output is correct
61 Correct 24 ms 43392 KB Output is correct
62 Correct 27 ms 43384 KB Output is correct
63 Correct 22 ms 43392 KB Output is correct
64 Correct 23 ms 43392 KB Output is correct
65 Correct 23 ms 43392 KB Output is correct
66 Runtime error 266 ms 144240 KB Execution killed with signal 11 (could be triggered by violating memory limits)
67 Halted 0 ms 0 KB -