oj.uz

Submission #48968

# Submission time Handle Problem Language Result Execution time Memory
48968 2018-05-20T16:19:15 Z polyfish Duathlon (APIO18_duathlon) C++14
69 / 100
 1000 ms 36024 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';}

bool maximize(int &a, int b) {if (a>=b) return false; a = b; return true;}

const int maxn = 100002;

int n, m, ID[maxn];
vector<int> g[maxn], node;
vector<pair<int, int> > edge;
bool visited[maxn];

class solver {	//Solve for connected graph
public:
	vector<int> g[maxn], BCC[maxn], tmp;
	int n, nTime, nBCC, num[maxn], low[maxn], nChild[maxn];
	int par[maxn], lastComponent[maxn];
	stack<int> st;
	map<int, int> f[maxn];

	void init(int _n, vector<pair<int, int> > e) {
		n = _n;
		for (int i=1; i<=n; ++i) {
			g[i].clear();
			BCC[i].clear();
			f[i].clear();
		}
		for (int i=0; i<e.size(); ++i) {
			g[e[i].first].push_back(e[i].second);
			g[e[i].second].push_back(e[i].first);
		}
		nBCC = 0;
		nTime = 0;
		while (st.size())
			st.pop();
		memset(lastComponent, 0, sizeof(lastComponent));
		memset(num, 0, sizeof(num));
	}

	int dfs(int u) {
		num[u] = low[u] = ++nTime;
		nChild[u] = 1;
		int tmp = 0;
		for (int i=0; i<g[u].size(); ++i) {
			int v = g[u][i];
			if (num[v])
				low[u] = min(low[u], num[v]);
			else {
				st.push(u);
				nChild[u] += dfs(v);
				low[u] = min(low[u], low[v]);
				if (low[v]>=num[u]) {
					tmp += nChild[v];
					++nBCC;
					while (true) {
						int t = st.top(); st.pop();
						if (maximize(lastComponent[t], nBCC))
							BCC[nBCC].push_back(t);
						if (t==u)
							break;
					}
					f[u][nBCC] = nChild[v] + 1;
				}
			}
		}
		par[u] = n - tmp - 1;
		st.push(u);
		return nChild[u];
	}

	int64_t solve() {
		if (n==1)
			return 0;
		int64_t res = 0;
		for (int i=1; i<=nBCC; ++i) {
			int sz = BCC[i].size();
			tmp.clear();
			for (int j=0; j<sz; ++j) {
				int u = BCC[i][j];
				if (f[u].count(i))
					tmp.push_back(n-f[u][i]);
				else
					tmp.push_back(n-par[u]-1);
			}
			res += 1LL*sz*(sz-1)*(sz-2);
			int64_t T = 0, sqrT = 0;
			for (int i=0; i<tmp.size(); ++i) {
				res += (1LL*(n-sz)*(sz-1) - (n-sz-tmp[i]));
				res += (1LL*(n-sz-tmp[i])*(sz-1) - (n-sz-tmp[i]));
				T += tmp[i];
				sqrT += 1LL*tmp[i]*(tmp[i]-1);
			}
			for (int i=0; i<tmp.size(); ++i) {
				res += (1LL*(T-tmp[i])*(T-tmp[i]-1) - sqrT + 1LL*tmp[i]*(tmp[i]-1));
				res += 1LL*tmp[i]*(T-tmp[i]);
			}
		}
		return res;
	}
} S;

void visit(int u) {
	node.push_back(u);
	visited[u] = true;
	for (int i=0; i<g[u].size(); ++i) {
		int v = g[u][i];
		edge.push_back(make_pair(max(u, v), min(u, v)));
		if (!visited[v]) {
			visit(v);
		}
	}
}

void make_graph() {
	int cnt = 0;
	sort(node.begin(), node.end());
	sort(edge.begin(), edge.end());
	edge.resize(unique(edge.begin(), edge.end())-edge.begin());
	for (int i=0; i<node.size(); ++i) {
		ID[node[i]] = i+1;
	}
	for (int i=0; i<edge.size(); ++i) {
		edge[i].first = ID[edge[i].first];
		edge[i].second = ID[edge[i].second];
	}
	//PR0(node, node.size());
	//for (int i=0; i<edge.size(); ++i)
	//	cerr << edge[i].first << ' ' << edge[i].second << '\n';
}

int main() {
	//freopen("count-triplets.inp", "r", stdin);
	//freopen("count-triplets.out", "w", stdout);
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m;
	for (int i=1; i<=m; ++i) {
		int u, v; cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	int64_t res = 0;
	for (int i=1; i<=n; ++i) {
		if (!visited[i]) {
			edge.clear();
			node.clear();
			visit(i);
			make_graph();
			S.init(node.size(), edge);
			S.dfs(1);
			res += S.solve();
		}
	}
	cout << res;
}

Compilation message

count_triplets.cpp: In member function 'void solver::init(int, std::vector<std::pair<int, int> >)':
count_triplets.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<e.size(); ++i) {
                 ~^~~~~~~~~
count_triplets.cpp: In member function 'int solver::dfs(int)':
count_triplets.cpp:49:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<g[u].size(); ++i) {
                 ~^~~~~~~~~~~~
count_triplets.cpp: In member function 'int64_t solver::solve()':
count_triplets.cpp:92:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i=0; i<tmp.size(); ++i) {
                  ~^~~~~~~~~~~
count_triplets.cpp:98:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i=0; i<tmp.size(); ++i) {
                  ~^~~~~~~~~~~
count_triplets.cpp: In function 'void visit(int)':
count_triplets.cpp:110:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<g[u].size(); ++i) {
                ~^~~~~~~~~~~~
count_triplets.cpp: In function 'void make_graph()':
count_triplets.cpp:124:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<node.size(); ++i) {
                ~^~~~~~~~~~~~
count_triplets.cpp:127:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<edge.size(); ++i) {
                ~^~~~~~~~~~~~
count_triplets.cpp:120:6: warning: unused variable 'cnt' [-Wunused-variable]
  int cnt = 0;
      ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12792 KB Output is correct
2 Correct 14 ms 12980 KB Output is correct
3 Correct 14 ms 12980 KB Output is correct
4 Correct 16 ms 13012 KB Output is correct
5 Correct 15 ms 13012 KB Output is correct
6 Correct 17 ms 13060 KB Output is correct
7 Correct 14 ms 13072 KB Output is correct
8 Correct 16 ms 13092 KB Output is correct
9 Correct 14 ms 13092 KB Output is correct
10 Correct 17 ms 13092 KB Output is correct
11 Correct 16 ms 13136 KB Output is correct
12 Correct 14 ms 13140 KB Output is correct
13 Correct 15 ms 13140 KB Output is correct
14 Correct 14 ms 13140 KB Output is correct
15 Correct 15 ms 13140 KB Output is correct
16 Correct 12 ms 13164 KB Output is correct
17 Correct 13 ms 13164 KB Output is correct
18 Correct 15 ms 13164 KB Output is correct
19 Correct 12 ms 13164 KB Output is correct
20 Correct 13 ms 13164 KB Output is correct
21 Correct 13 ms 13164 KB Output is correct
22 Correct 13 ms 13168 KB Output is correct
23 Correct 13 ms 13180 KB Output is correct
24 Correct 15 ms 13180 KB Output is correct
25 Correct 13 ms 13180 KB Output is correct
26 Correct 13 ms 13180 KB Output is correct
27 Correct 13 ms 13180 KB Output is correct
28 Correct 13 ms 13180 KB Output is correct
29 Correct 12 ms 13180 KB Output is correct
30 Correct 16 ms 13180 KB Output is correct
31 Correct 16 ms 13180 KB Output is correct
32 Correct 13 ms 13184 KB Output is correct
33 Correct 13 ms 13184 KB Output is correct
34 Correct 16 ms 13184 KB Output is correct
35 Correct 12 ms 13184 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12792 KB Output is correct
2 Correct 14 ms 12980 KB Output is correct
3 Correct 14 ms 12980 KB Output is correct
4 Correct 16 ms 13012 KB Output is correct
5 Correct 15 ms 13012 KB Output is correct
6 Correct 17 ms 13060 KB Output is correct
7 Correct 14 ms 13072 KB Output is correct
8 Correct 16 ms 13092 KB Output is correct
9 Correct 14 ms 13092 KB Output is correct
10 Correct 17 ms 13092 KB Output is correct
11 Correct 16 ms 13136 KB Output is correct
12 Correct 14 ms 13140 KB Output is correct
13 Correct 15 ms 13140 KB Output is correct
14 Correct 14 ms 13140 KB Output is correct
15 Correct 15 ms 13140 KB Output is correct
16 Correct 12 ms 13164 KB Output is correct
17 Correct 13 ms 13164 KB Output is correct
18 Correct 15 ms 13164 KB Output is correct
19 Correct 12 ms 13164 KB Output is correct
20 Correct 13 ms 13164 KB Output is correct
21 Correct 13 ms 13164 KB Output is correct
22 Correct 13 ms 13168 KB Output is correct
23 Correct 13 ms 13180 KB Output is correct
24 Correct 15 ms 13180 KB Output is correct
25 Correct 13 ms 13180 KB Output is correct
26 Correct 13 ms 13180 KB Output is correct
27 Correct 13 ms 13180 KB Output is correct
28 Correct 13 ms 13180 KB Output is correct
29 Correct 12 ms 13180 KB Output is correct
30 Correct 16 ms 13180 KB Output is correct
31 Correct 16 ms 13180 KB Output is correct
32 Correct 13 ms 13184 KB Output is correct
33 Correct 13 ms 13184 KB Output is correct
34 Correct 16 ms 13184 KB Output is correct
35 Correct 12 ms 13184 KB Output is correct
36 Correct 15 ms 13184 KB Output is correct
37 Correct 14 ms 13184 KB Output is correct
38 Correct 15 ms 13184 KB Output is correct
39 Correct 16 ms 13184 KB Output is correct
40 Correct 13 ms 13184 KB Output is correct
41 Correct 14 ms 13184 KB Output is correct
42 Correct 16 ms 13184 KB Output is correct
43 Correct 15 ms 13184 KB Output is correct
44 Correct 17 ms 13184 KB Output is correct
45 Correct 21 ms 13184 KB Output is correct
46 Correct 14 ms 13184 KB Output is correct
47 Correct 14 ms 13184 KB Output is correct
48 Correct 16 ms 13184 KB Output is correct
49 Correct 16 ms 13308 KB Output is correct
50 Correct 14 ms 13308 KB Output is correct
51 Correct 12 ms 13308 KB Output is correct
52 Correct 14 ms 13308 KB Output is correct
53 Correct 11 ms 13308 KB Output is correct
54 Correct 13 ms 13308 KB Output is correct
55 Correct 13 ms 13308 KB Output is correct
56 Correct 13 ms 13308 KB Output is correct
57 Correct 13 ms 13308 KB Output is correct
58 Correct 18 ms 13308 KB Output is correct
59 Correct 12 ms 13308 KB Output is correct
60 Correct 13 ms 13308 KB Output is correct
61 Correct 12 ms 13308 KB Output is correct
62 Correct 13 ms 13308 KB Output is correct
63 Correct 13 ms 13308 KB Output is correct
64 Correct 58 ms 13308 KB Output is correct
65 Correct 13 ms 13308 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 34476 KB Output is correct
2 Correct 231 ms 34484 KB Output is correct
3 Correct 226 ms 34484 KB Output is correct
4 Correct 237 ms 34484 KB Output is correct
5 Correct 224 ms 34484 KB Output is correct
6 Correct 258 ms 34484 KB Output is correct
7 Correct 268 ms 34484 KB Output is correct
8 Correct 224 ms 34484 KB Output is correct
9 Correct 176 ms 34484 KB Output is correct
10 Correct 207 ms 34484 KB Output is correct
11 Execution timed out 1077 ms 34484 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 34484 KB Output is correct
2 Correct 264 ms 34484 KB Output is correct
3 Correct 304 ms 34484 KB Output is correct
4 Correct 277 ms 34484 KB Output is correct
5 Correct 262 ms 34484 KB Output is correct
6 Correct 316 ms 36024 KB Output is correct
7 Correct 315 ms 36024 KB Output is correct
8 Correct 318 ms 36024 KB Output is correct
9 Correct 244 ms 36024 KB Output is correct
10 Correct 202 ms 36024 KB Output is correct
11 Correct 217 ms 36024 KB Output is correct
12 Correct 183 ms 36024 KB Output is correct
13 Correct 175 ms 36024 KB Output is correct
14 Correct 523 ms 36024 KB Output is correct
15 Execution timed out 1014 ms 36024 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36024 KB Output is correct
2 Correct 14 ms 36024 KB Output is correct
3 Correct 15 ms 36024 KB Output is correct
4 Correct 17 ms 36024 KB Output is correct
5 Correct 15 ms 36024 KB Output is correct
6 Correct 15 ms 36024 KB Output is correct
7 Correct 15 ms 36024 KB Output is correct
8 Correct 14 ms 36024 KB Output is correct
9 Correct 13 ms 36024 KB Output is correct
10 Correct 15 ms 36024 KB Output is correct
11 Correct 14 ms 36024 KB Output is correct
12 Correct 18 ms 36024 KB Output is correct
13 Correct 15 ms 36024 KB Output is correct
14 Correct 15 ms 36024 KB Output is correct
15 Correct 14 ms 36024 KB Output is correct
16 Correct 17 ms 36024 KB Output is correct
17 Correct 15 ms 36024 KB Output is correct
18 Correct 17 ms 36024 KB Output is correct
19 Correct 18 ms 36024 KB Output is correct
20 Correct 23 ms 36024 KB Output is correct
21 Correct 15 ms 36024 KB Output is correct
22 Correct 17 ms 36024 KB Output is correct
23 Correct 14 ms 36024 KB Output is correct
24 Correct 15 ms 36024 KB Output is correct
25 Correct 48 ms 36024 KB Output is correct
26 Correct 52 ms 36024 KB Output is correct
27 Correct 58 ms 36024 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 36024 KB Output is correct
2 Correct 307 ms 36024 KB Output is correct
3 Correct 288 ms 36024 KB Output is correct
4 Correct 317 ms 36024 KB Output is correct
5 Correct 274 ms 36024 KB Output is correct
6 Correct 239 ms 36024 KB Output is correct
7 Correct 234 ms 36024 KB Output is correct
8 Correct 239 ms 36024 KB Output is correct
9 Correct 230 ms 36024 KB Output is correct
10 Correct 218 ms 36024 KB Output is correct
11 Correct 206 ms 36024 KB Output is correct
12 Correct 214 ms 36024 KB Output is correct
13 Correct 159 ms 36024 KB Output is correct
14 Correct 212 ms 36024 KB Output is correct
15 Correct 236 ms 36024 KB Output is correct
16 Correct 340 ms 36024 KB Output is correct
17 Correct 320 ms 36024 KB Output is correct
18 Correct 324 ms 36024 KB Output is correct
19 Correct 273 ms 36024 KB Output is correct
20 Correct 256 ms 36024 KB Output is correct
21 Correct 267 ms 36024 KB Output is correct
22 Correct 596 ms 36024 KB Output is correct
23 Correct 991 ms 36024 KB Output is correct
24 Correct 209 ms 36024 KB Output is correct
25 Correct 217 ms 36024 KB Output is correct
26 Correct 268 ms 36024 KB Output is correct
27 Correct 290 ms 36024 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12792 KB Output is correct
2 Correct 14 ms 12980 KB Output is correct
3 Correct 14 ms 12980 KB Output is correct
4 Correct 16 ms 13012 KB Output is correct
5 Correct 15 ms 13012 KB Output is correct
6 Correct 17 ms 13060 KB Output is correct
7 Correct 14 ms 13072 KB Output is correct
8 Correct 16 ms 13092 KB Output is correct
9 Correct 14 ms 13092 KB Output is correct
10 Correct 17 ms 13092 KB Output is correct
11 Correct 16 ms 13136 KB Output is correct
12 Correct 14 ms 13140 KB Output is correct
13 Correct 15 ms 13140 KB Output is correct
14 Correct 14 ms 13140 KB Output is correct
15 Correct 15 ms 13140 KB Output is correct
16 Correct 12 ms 13164 KB Output is correct
17 Correct 13 ms 13164 KB Output is correct
18 Correct 15 ms 13164 KB Output is correct
19 Correct 12 ms 13164 KB Output is correct
20 Correct 13 ms 13164 KB Output is correct
21 Correct 13 ms 13164 KB Output is correct
22 Correct 13 ms 13168 KB Output is correct
23 Correct 13 ms 13180 KB Output is correct
24 Correct 15 ms 13180 KB Output is correct
25 Correct 13 ms 13180 KB Output is correct
26 Correct 13 ms 13180 KB Output is correct
27 Correct 13 ms 13180 KB Output is correct
28 Correct 13 ms 13180 KB Output is correct
29 Correct 12 ms 13180 KB Output is correct
30 Correct 16 ms 13180 KB Output is correct
31 Correct 16 ms 13180 KB Output is correct
32 Correct 13 ms 13184 KB Output is correct
33 Correct 13 ms 13184 KB Output is correct
34 Correct 16 ms 13184 KB Output is correct
35 Correct 12 ms 13184 KB Output is correct
36 Correct 15 ms 13184 KB Output is correct
37 Correct 14 ms 13184 KB Output is correct
38 Correct 15 ms 13184 KB Output is correct
39 Correct 16 ms 13184 KB Output is correct
40 Correct 13 ms 13184 KB Output is correct
41 Correct 14 ms 13184 KB Output is correct
42 Correct 16 ms 13184 KB Output is correct
43 Correct 15 ms 13184 KB Output is correct
44 Correct 17 ms 13184 KB Output is correct
45 Correct 21 ms 13184 KB Output is correct
46 Correct 14 ms 13184 KB Output is correct
47 Correct 14 ms 13184 KB Output is correct
48 Correct 16 ms 13184 KB Output is correct
49 Correct 16 ms 13308 KB Output is correct
50 Correct 14 ms 13308 KB Output is correct
51 Correct 12 ms 13308 KB Output is correct
52 Correct 14 ms 13308 KB Output is correct
53 Correct 11 ms 13308 KB Output is correct
54 Correct 13 ms 13308 KB Output is correct
55 Correct 13 ms 13308 KB Output is correct
56 Correct 13 ms 13308 KB Output is correct
57 Correct 13 ms 13308 KB Output is correct
58 Correct 18 ms 13308 KB Output is correct
59 Correct 12 ms 13308 KB Output is correct
60 Correct 13 ms 13308 KB Output is correct
61 Correct 12 ms 13308 KB Output is correct
62 Correct 13 ms 13308 KB Output is correct
63 Correct 13 ms 13308 KB Output is correct
64 Correct 58 ms 13308 KB Output is correct
65 Correct 13 ms 13308 KB Output is correct
66 Correct 57 ms 36024 KB Output is correct
67 Correct 36 ms 36024 KB Output is correct
68 Correct 23 ms 36024 KB Output is correct
69 Correct 20 ms 36024 KB Output is correct
70 Correct 16 ms 36024 KB Output is correct
71 Correct 34 ms 36024 KB Output is correct
72 Correct 29 ms 36024 KB Output is correct
73 Correct 25 ms 36024 KB Output is correct
74 Correct 25 ms 36024 KB Output is correct
75 Correct 25 ms 36024 KB Output is correct
76 Correct 14 ms 36024 KB Output is correct
77 Correct 14 ms 36024 KB Output is correct
78 Correct 17 ms 36024 KB Output is correct
79 Correct 14 ms 36024 KB Output is correct
80 Correct 16 ms 36024 KB Output is correct
81 Correct 13 ms 36024 KB Output is correct
82 Correct 14 ms 36024 KB Output is correct
83 Correct 14 ms 36024 KB Output is correct
84 Correct 13 ms 36024 KB Output is correct
85 Correct 13 ms 36024 KB Output is correct
86 Correct 13 ms 36024 KB Output is correct
87 Correct 14 ms 36024 KB Output is correct
88 Correct 16 ms 36024 KB Output is correct
89 Correct 19 ms 36024 KB Output is correct
90 Correct 21 ms 36024 KB Output is correct
91 Correct 14 ms 36024 KB Output is correct
92 Correct 16 ms 36024 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12792 KB Output is correct
2 Correct 14 ms 12980 KB Output is correct
3 Correct 14 ms 12980 KB Output is correct
4 Correct 16 ms 13012 KB Output is correct
5 Correct 15 ms 13012 KB Output is correct
6 Correct 17 ms 13060 KB Output is correct
7 Correct 14 ms 13072 KB Output is correct
8 Correct 16 ms 13092 KB Output is correct
9 Correct 14 ms 13092 KB Output is correct
10 Correct 17 ms 13092 KB Output is correct
11 Correct 16 ms 13136 KB Output is correct
12 Correct 14 ms 13140 KB Output is correct
13 Correct 15 ms 13140 KB Output is correct
14 Correct 14 ms 13140 KB Output is correct
15 Correct 15 ms 13140 KB Output is correct
16 Correct 12 ms 13164 KB Output is correct
17 Correct 13 ms 13164 KB Output is correct
18 Correct 15 ms 13164 KB Output is correct
19 Correct 12 ms 13164 KB Output is correct
20 Correct 13 ms 13164 KB Output is correct
21 Correct 13 ms 13164 KB Output is correct
22 Correct 13 ms 13168 KB Output is correct
23 Correct 13 ms 13180 KB Output is correct
24 Correct 15 ms 13180 KB Output is correct
25 Correct 13 ms 13180 KB Output is correct
26 Correct 13 ms 13180 KB Output is correct
27 Correct 13 ms 13180 KB Output is correct
28 Correct 13 ms 13180 KB Output is correct
29 Correct 12 ms 13180 KB Output is correct
30 Correct 16 ms 13180 KB Output is correct
31 Correct 16 ms 13180 KB Output is correct
32 Correct 13 ms 13184 KB Output is correct
33 Correct 13 ms 13184 KB Output is correct
34 Correct 16 ms 13184 KB Output is correct
35 Correct 12 ms 13184 KB Output is correct
36 Correct 15 ms 13184 KB Output is correct
37 Correct 14 ms 13184 KB Output is correct
38 Correct 15 ms 13184 KB Output is correct
39 Correct 16 ms 13184 KB Output is correct
40 Correct 13 ms 13184 KB Output is correct
41 Correct 14 ms 13184 KB Output is correct
42 Correct 16 ms 13184 KB Output is correct
43 Correct 15 ms 13184 KB Output is correct
44 Correct 17 ms 13184 KB Output is correct
45 Correct 21 ms 13184 KB Output is correct
46 Correct 14 ms 13184 KB Output is correct
47 Correct 14 ms 13184 KB Output is correct
48 Correct 16 ms 13184 KB Output is correct
49 Correct 16 ms 13308 KB Output is correct
50 Correct 14 ms 13308 KB Output is correct
51 Correct 12 ms 13308 KB Output is correct
52 Correct 14 ms 13308 KB Output is correct
53 Correct 11 ms 13308 KB Output is correct
54 Correct 13 ms 13308 KB Output is correct
55 Correct 13 ms 13308 KB Output is correct
56 Correct 13 ms 13308 KB Output is correct
57 Correct 13 ms 13308 KB Output is correct
58 Correct 18 ms 13308 KB Output is correct
59 Correct 12 ms 13308 KB Output is correct
60 Correct 13 ms 13308 KB Output is correct
61 Correct 12 ms 13308 KB Output is correct
62 Correct 13 ms 13308 KB Output is correct
63 Correct 13 ms 13308 KB Output is correct
64 Correct 58 ms 13308 KB Output is correct
65 Correct 13 ms 13308 KB Output is correct
66 Correct 239 ms 34476 KB Output is correct
67 Correct 231 ms 34484 KB Output is correct
68 Correct 226 ms 34484 KB Output is correct
69 Correct 237 ms 34484 KB Output is correct
70 Correct 224 ms 34484 KB Output is correct
71 Correct 258 ms 34484 KB Output is correct
72 Correct 268 ms 34484 KB Output is correct
73 Correct 224 ms 34484 KB Output is correct
74 Correct 176 ms 34484 KB Output is correct
75 Correct 207 ms 34484 KB Output is correct
76 Execution timed out 1077 ms 34484 KB Time limit exceeded
77 Halted 0 ms 0 KB -