oj.uz

답안 #103247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103247 2019-03-29T10:21:41 Z E869120 철인 이종 경기 (APIO18_duathlon) C++14
47 / 100
 636 ms 40852 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#pragma warning (disable: 4996)

class UnionFind {
public:
	vector<int>par;

	void init(int sz) {
		par.resize(sz, -1);
	}
	
	int root(int pos) {
		if (par[pos] == -1) return pos;
		par[pos] = root(par[pos]);
		return par[pos];
	}

	void unite(int u, int v) {
		u = root(u); v = root(v);
		if (u != v) par[u] = v;
	}

	bool same(int u, int v) {
		if (root(u) == root(v)) return true;
		return false;
	}
};

long long N, M, A[200009], B[200009], col[100009], col2[100009], dp[100009], cnt1, cnt2, cnts, cntv;
vector<int>X[100009], Y[100009], Z[100009], V, V2;
vector<int>G[59][59];
bool used[100009], cycles[200009];

map<pair<int, int>, int>Map;

void dfs(int pos) {
	if (col[pos] >= 1) return;
	col[pos] = cnts; V.push_back(pos); cnt1 += 1; cnt2 += X[pos].size();
	for (int i = 0; i < X[pos].size(); i++) {
		dfs(X[pos][i]);
	}
}

void dfs2(int pos) {
	if (col2[pos] >= 1) return;
	col2[pos] = cntv;
	for (int i = 0; i < Y[pos].size(); i++) {
		dfs2(Y[pos][i]);
	}
}

void dfs3(int pos, int target) {
	if (pos == target) {
		for (int i = 0; i < V.size() - 1; i++) {
			cycles[Map[make_pair(V[i], V[i + 1])]] = true;
		}
		return;
	}
	used[pos] = true;
	for (int i = 0; i < Z[pos].size(); i++) {
		if (used[Z[pos][i]] == true) continue;
		V.push_back(Z[pos][i]);
		dfs3(Z[pos][i], target);
		V.pop_back();
	}
}

void dfs4(int pos) {
	dp[pos] = 1; V2.push_back(pos);
	for (int i = 0; i < Y[pos].size(); i++) {
		if (dp[Y[pos][i]] >= 1) continue;
		dfs4(Y[pos][i]);
		dp[pos] += dp[Y[pos][i]];
	}
}

long long solve_subtask7() {
	UnionFind UF; UF.init(N + 2);
	for (int i = 1; i <= M; i++) {
		if (UF.same(A[i], B[i]) == true) {
			// この辺がサイクルに含まれる場合
			V.push_back(A[i]);
			dfs3(A[i], B[i]);
			V.clear();
			cycles[i] = true;
		}
		else {
			// この辺がサイクルに含まれない場合
			Z[A[i]].push_back(B[i]);
			Z[B[i]].push_back(A[i]);
			UF.unite(A[i], B[i]);
		}
	}

	for (int i = 1; i <= M; i++) {
		if (cycles[i] == true) continue;
		Y[A[i]].push_back(B[i]);
		Y[B[i]].push_back(A[i]);
	}

	long long FinalAns = 0;

	for (int i = 1; i <= N; i++) {
		if (col[i] >= 1) continue;
		V.clear();
		cnts++; dfs(i);

		vector<long long> dp1, dp2, dp3, dp4;
		for (int j = 0; j < V.size(); j++) {
			if (dp[V[j]] >= 1) continue;
			V2.clear(); dfs4(V[j]);

			long long A1 = 0, A2 = 0, A3 = 0;

			// dp1 の値を求める
			A1 = V2.size() - 1;

			// dp2 の値を求める
			for (int pos : V2) {
				if (pos != V[j]) A2 += (dp[pos] - 1LL);
			}

			// dp3 の値を求める
			A3 += 1LL * (long long)(V2.size() - 1) * ((long long)V2.size() - 2) * ((long long)V2.size() - 3);
			for (int pos : V2) {
				if (pos == V[j]) continue;
				long long rem = V2.size() - 2;
				for (int k = 0; k < Y[pos].size(); k++) {
					if (dp[Y[pos][k]] > dp[pos]) continue;
					A3 -= dp[Y[pos][k]] * (dp[Y[pos][k]] - 1);
					rem -= dp[Y[pos][k]];
				}
				A3 -= rem * (rem - 1);
			}

			dp1.push_back(A1);
			dp2.push_back(A2);
			dp3.push_back(A3);

			for (int k = 0; k < Y[V[j]].size(); k++) {
				dp4.push_back(dp[Y[V[j]][k]]);
			}
		}

		// 総計算
		FinalAns += 1LL * (long long)dp1.size() * ((long long)dp1.size() - 1) * ((long long)dp1.size() - 2);
		for (int j = 0; j < dp3.size(); j++) FinalAns += dp3[j];
		for (int j = 0; j < dp1.size(); j++) FinalAns += 2LL * (long long)(dp1.size() - 1) * ((long long)dp1.size() - 1) * dp1[j];
		for (int j = 0; j < dp2.size(); j++) FinalAns += 2LL * (long long)(dp1.size()) * dp2[j];
		
		long long X = 0; for (int j = 0; j < dp4.size(); j++) X += dp4[j];
		X *= X;
		for (int j = 0; j < dp4.size(); j++) X -= dp4[j] * dp4[j];
		FinalAns += X;
	}
	return FinalAns;
}

long long solve_subtask2() {
	for (int i = 1; i <= N; i++) {
		if (col[i] >= 1) continue;
		cnts++; dfs(i);
	}

	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) Y[j].clear();
		for (int j = 1; j <= M; j++) {
			if (A[j] == i || B[j] == i) continue;
			Y[A[j]].push_back(B[j]);
			Y[B[j]].push_back(A[j]);
		}

		cntv = 0;
		for (int j = 1; j <= N; j++) col2[j] = 0;
		for (int j = 1; j <= N; j++) {
			if (col2[j] >= 1) continue;
			cntv++; dfs2(j);
		}

		for (int j = 1; j <= N; j++) {
			for (int k = 1; k <= N; k++) {
				if (col[j] != col[k]) continue;
				if (col2[j] != col2[k]) G[j][k].push_back(i);
			}
		}
	}

	int cnt = 0;

	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			for (int k = 1; k <= N; k++) {
				if (i == j || i == k || j == k || col[i] != col[j] || col[j] != col[k]) continue;

				int d[55]; for (int l = 0; l < 55; l++) d[l] = 0;
				for (int l : G[i][j]) d[l]++;
				for (int l : G[j][k]) d[l]++;

				bool flag = false;
				for (int l = 0; l < 55; l++) {
					if (d[l] >= 2 && l != j) flag = true;
				}

				if (flag == false) {
					cnt++;
				}
			}
		}
	}
	return 1LL * cnt;
}

int main() {
	scanf("%lld%lld", &N, &M);
	for (int i = 1; i <= M; i++) {
		scanf("%lld%lld", &A[i], &B[i]);
		X[A[i]].push_back(B[i]); Map[make_pair(A[i], B[i])] = i;
		X[B[i]].push_back(A[i]); Map[make_pair(B[i], A[i])] = i;
	}

	if (N <= 50 && M <= 100) {
		cout << solve_subtask2() << endl;
	}
	else {
		cout << solve_subtask7() << endl;
	}
	return 0;
}

Compilation message

count_triplets.cpp:6:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
count_triplets.cpp: In function 'void dfs(int)':
count_triplets.cpp:43:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < X[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs2(int)':
count_triplets.cpp:51:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < Y[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs3(int, int)':
count_triplets.cpp:58:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < V.size() - 1; i++) {
                   ~~^~~~~~~~~~~~~~
count_triplets.cpp:64:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < Z[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs4(int)':
count_triplets.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < Y[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'long long int solve_subtask7()':
count_triplets.cpp:113:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < V.size(); j++) {
                   ~~^~~~~~~~~~
count_triplets.cpp:132:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int k = 0; k < Y[pos].size(); k++) {
                     ~~^~~~~~~~~~~~~~~
count_triplets.cpp:144:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < Y[V[j]].size(); k++) {
                    ~~^~~~~~~~~~~~~~~~
count_triplets.cpp:151:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < dp3.size(); j++) FinalAns += dp3[j];
                   ~~^~~~~~~~~~~~
count_triplets.cpp:152:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < dp1.size(); j++) FinalAns += 2LL * (long long)(dp1.size() - 1) * ((long long)dp1.size() - 1) * dp1[j];
                   ~~^~~~~~~~~~~~
count_triplets.cpp:153:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < dp2.size(); j++) FinalAns += 2LL * (long long)(dp1.size()) * dp2[j];
                   ~~^~~~~~~~~~~~
count_triplets.cpp:155:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   long long X = 0; for (int j = 0; j < dp4.size(); j++) X += dp4[j];
                                    ~~^~~~~~~~~~~~
count_triplets.cpp:157:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < dp4.size(); j++) X -= dp4[j] * dp4[j];
                   ~~^~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:218:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:220:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 575 ms 40704 KB Output is correct
2 Correct 570 ms 40852 KB Output is correct
3 Correct 561 ms 37380 KB Output is correct
4 Correct 564 ms 39964 KB Output is correct
5 Correct 603 ms 35472 KB Output is correct
6 Correct 636 ms 35756 KB Output is correct
7 Correct 540 ms 34540 KB Output is correct
8 Correct 553 ms 35252 KB Output is correct
9 Correct 583 ms 33272 KB Output is correct
10 Correct 571 ms 34088 KB Output is correct
11 Correct 436 ms 29560 KB Output is correct
12 Correct 416 ms 29172 KB Output is correct
13 Correct 370 ms 28216 KB Output is correct
14 Correct 355 ms 27728 KB Output is correct
15 Correct 278 ms 24568 KB Output is correct
16 Correct 304 ms 24184 KB Output is correct
17 Correct 40 ms 9464 KB Output is correct
18 Correct 31 ms 9512 KB Output is correct
19 Correct 40 ms 9464 KB Output is correct
20 Correct 24 ms 9472 KB Output is correct
21 Correct 37 ms 9508 KB Output is correct
22 Correct 34 ms 9396 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7680 KB Output is correct
2 Correct 10 ms 7752 KB Output is correct
3 Correct 13 ms 7680 KB Output is correct
4 Correct 12 ms 7808 KB Output is correct
5 Correct 17 ms 7808 KB Output is correct
6 Correct 10 ms 7680 KB Output is correct
7 Correct 14 ms 7808 KB Output is correct
8 Correct 11 ms 7808 KB Output is correct
9 Correct 11 ms 7680 KB Output is correct
10 Correct 11 ms 7680 KB Output is correct
11 Correct 11 ms 7680 KB Output is correct
12 Correct 11 ms 7744 KB Output is correct
13 Correct 10 ms 7680 KB Output is correct
14 Correct 12 ms 7680 KB Output is correct
15 Correct 12 ms 7680 KB Output is correct
16 Correct 9 ms 7680 KB Output is correct
17 Correct 10 ms 7808 KB Output is correct
18 Correct 9 ms 7808 KB Output is correct
19 Correct 11 ms 7680 KB Output is correct
20 Correct 12 ms 7808 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 34432 KB Output is correct
2 Correct 498 ms 34416 KB Output is correct
3 Correct 597 ms 34528 KB Output is correct
4 Correct 551 ms 34416 KB Output is correct
5 Correct 462 ms 34432 KB Output is correct
6 Correct 527 ms 36000 KB Output is correct
7 Correct 476 ms 35352 KB Output is correct
8 Correct 576 ms 35000 KB Output is correct
9 Correct 534 ms 34852 KB Output is correct
10 Correct 495 ms 33780 KB Output is correct
11 Correct 521 ms 34408 KB Output is correct
12 Correct 492 ms 33740 KB Output is correct
13 Correct 429 ms 33528 KB Output is correct
14 Correct 423 ms 31524 KB Output is correct
15 Correct 370 ms 29772 KB Output is correct
16 Correct 262 ms 23544 KB Output is correct
17 Correct 344 ms 35308 KB Output is correct
18 Correct 373 ms 35180 KB Output is correct
19 Correct 375 ms 35432 KB Output is correct
20 Correct 389 ms 35332 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 7680 KB Output is correct
2 Correct 11 ms 7776 KB Output is correct
3 Incorrect 12 ms 7808 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 34380 KB Output is correct
2 Correct 516 ms 34252 KB Output is correct
3 Incorrect 579 ms 36580 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 10 ms 7552 KB Output is correct
3 Correct 8 ms 7552 KB Output is correct
4 Correct 8 ms 7552 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 10 ms 7552 KB Output is correct
7 Correct 10 ms 7552 KB Output is correct
8 Correct 9 ms 7552 KB Output is correct
9 Correct 8 ms 7552 KB Output is correct
10 Correct 9 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 11 ms 7552 KB Output is correct
14 Correct 12 ms 7552 KB Output is correct
15 Correct 8 ms 7424 KB Output is correct
16 Correct 9 ms 7552 KB Output is correct
17 Correct 10 ms 7424 KB Output is correct
18 Correct 10 ms 7424 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 11 ms 7552 KB Output is correct
21 Correct 10 ms 7424 KB Output is correct
22 Correct 8 ms 7552 KB Output is correct
23 Correct 8 ms 7552 KB Output is correct
24 Correct 11 ms 7420 KB Output is correct
25 Correct 10 ms 7552 KB Output is correct
26 Correct 10 ms 7552 KB Output is correct
27 Correct 9 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 8 ms 7424 KB Output is correct
30 Correct 9 ms 7424 KB Output is correct
31 Correct 8 ms 7552 KB Output is correct
32 Correct 9 ms 7552 KB Output is correct
33 Correct 9 ms 7552 KB Output is correct
34 Correct 9 ms 7552 KB Output is correct
35 Correct 9 ms 7524 KB Output is correct
36 Correct 10 ms 7552 KB Output is correct
37 Correct 10 ms 7552 KB Output is correct
38 Correct 19 ms 7552 KB Output is correct
39 Correct 22 ms 7552 KB Output is correct
40 Correct 21 ms 7552 KB Output is correct
41 Correct 10 ms 7424 KB Output is correct
42 Correct 11 ms 7424 KB Output is correct
43 Correct 9 ms 7452 KB Output is correct
44 Correct 9 ms 7552 KB Output is correct
45 Correct 9 ms 7424 KB Output is correct
46 Correct 11 ms 7552 KB Output is correct
47 Correct 15 ms 7552 KB Output is correct
48 Correct 9 ms 7424 KB Output is correct
49 Correct 9 ms 7552 KB Output is correct
50 Correct 9 ms 7552 KB Output is correct
51 Correct 21 ms 7680 KB Output is correct
52 Correct 24 ms 7552 KB Output is correct
53 Correct 22 ms 7552 KB Output is correct
54 Correct 21 ms 7552 KB Output is correct
55 Correct 39 ms 7552 KB Output is correct
56 Correct 26 ms 7524 KB Output is correct
57 Correct 24 ms 7680 KB Output is correct
58 Correct 24 ms 7680 KB Output is correct
59 Correct 17 ms 7552 KB Output is correct
60 Correct 18 ms 7552 KB Output is correct
61 Correct 11 ms 7552 KB Output is correct
62 Correct 11 ms 7552 KB Output is correct
63 Correct 26 ms 7552 KB Output is correct
64 Correct 24 ms 7552 KB Output is correct
65 Correct 23 ms 7704 KB Output is correct
66 Correct 8 ms 7424 KB Output is correct
67 Correct 9 ms 7680 KB Output is correct
68 Incorrect 11 ms 7936 KB Output isn't correct
69 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 10 ms 7552 KB Output is correct
3 Correct 8 ms 7552 KB Output is correct
4 Correct 8 ms 7552 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 10 ms 7552 KB Output is correct
7 Correct 10 ms 7552 KB Output is correct
8 Correct 9 ms 7552 KB Output is correct
9 Correct 8 ms 7552 KB Output is correct
10 Correct 9 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 11 ms 7552 KB Output is correct
14 Correct 12 ms 7552 KB Output is correct
15 Correct 8 ms 7424 KB Output is correct
16 Correct 9 ms 7552 KB Output is correct
17 Correct 10 ms 7424 KB Output is correct
18 Correct 10 ms 7424 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 11 ms 7552 KB Output is correct
21 Correct 10 ms 7424 KB Output is correct
22 Correct 8 ms 7552 KB Output is correct
23 Correct 8 ms 7552 KB Output is correct
24 Correct 11 ms 7420 KB Output is correct
25 Correct 10 ms 7552 KB Output is correct
26 Correct 10 ms 7552 KB Output is correct
27 Correct 9 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 8 ms 7424 KB Output is correct
30 Correct 9 ms 7424 KB Output is correct
31 Correct 8 ms 7552 KB Output is correct
32 Correct 9 ms 7552 KB Output is correct
33 Correct 9 ms 7552 KB Output is correct
34 Correct 9 ms 7552 KB Output is correct
35 Correct 9 ms 7524 KB Output is correct
36 Correct 10 ms 7552 KB Output is correct
37 Correct 10 ms 7552 KB Output is correct
38 Correct 19 ms 7552 KB Output is correct
39 Correct 22 ms 7552 KB Output is correct
40 Correct 21 ms 7552 KB Output is correct
41 Correct 10 ms 7424 KB Output is correct
42 Correct 11 ms 7424 KB Output is correct
43 Correct 9 ms 7452 KB Output is correct
44 Correct 9 ms 7552 KB Output is correct
45 Correct 9 ms 7424 KB Output is correct
46 Correct 11 ms 7552 KB Output is correct
47 Correct 15 ms 7552 KB Output is correct
48 Correct 9 ms 7424 KB Output is correct
49 Correct 9 ms 7552 KB Output is correct
50 Correct 9 ms 7552 KB Output is correct
51 Correct 21 ms 7680 KB Output is correct
52 Correct 24 ms 7552 KB Output is correct
53 Correct 22 ms 7552 KB Output is correct
54 Correct 21 ms 7552 KB Output is correct
55 Correct 39 ms 7552 KB Output is correct
56 Correct 26 ms 7524 KB Output is correct
57 Correct 24 ms 7680 KB Output is correct
58 Correct 24 ms 7680 KB Output is correct
59 Correct 17 ms 7552 KB Output is correct
60 Correct 18 ms 7552 KB Output is correct
61 Correct 11 ms 7552 KB Output is correct
62 Correct 11 ms 7552 KB Output is correct
63 Correct 26 ms 7552 KB Output is correct
64 Correct 24 ms 7552 KB Output is correct
65 Correct 23 ms 7704 KB Output is correct
66 Correct 575 ms 40704 KB Output is correct
67 Correct 570 ms 40852 KB Output is correct
68 Correct 561 ms 37380 KB Output is correct
69 Correct 564 ms 39964 KB Output is correct
70 Correct 603 ms 35472 KB Output is correct
71 Correct 636 ms 35756 KB Output is correct
72 Correct 540 ms 34540 KB Output is correct
73 Correct 553 ms 35252 KB Output is correct
74 Correct 583 ms 33272 KB Output is correct
75 Correct 571 ms 34088 KB Output is correct
76 Correct 436 ms 29560 KB Output is correct
77 Correct 416 ms 29172 KB Output is correct
78 Correct 370 ms 28216 KB Output is correct
79 Correct 355 ms 27728 KB Output is correct
80 Correct 278 ms 24568 KB Output is correct
81 Correct 304 ms 24184 KB Output is correct
82 Correct 40 ms 9464 KB Output is correct
83 Correct 31 ms 9512 KB Output is correct
84 Correct 40 ms 9464 KB Output is correct
85 Correct 24 ms 9472 KB Output is correct
86 Correct 37 ms 9508 KB Output is correct
87 Correct 34 ms 9396 KB Output is correct
88 Correct 10 ms 7680 KB Output is correct
89 Correct 10 ms 7752 KB Output is correct
90 Correct 13 ms 7680 KB Output is correct
91 Correct 12 ms 7808 KB Output is correct
92 Correct 17 ms 7808 KB Output is correct
93 Correct 10 ms 7680 KB Output is correct
94 Correct 14 ms 7808 KB Output is correct
95 Correct 11 ms 7808 KB Output is correct
96 Correct 11 ms 7680 KB Output is correct
97 Correct 11 ms 7680 KB Output is correct
98 Correct 11 ms 7680 KB Output is correct
99 Correct 11 ms 7744 KB Output is correct
100 Correct 10 ms 7680 KB Output is correct
101 Correct 12 ms 7680 KB Output is correct
102 Correct 12 ms 7680 KB Output is correct
103 Correct 9 ms 7680 KB Output is correct
104 Correct 10 ms 7808 KB Output is correct
105 Correct 9 ms 7808 KB Output is correct
106 Correct 11 ms 7680 KB Output is correct
107 Correct 12 ms 7808 KB Output is correct
108 Correct 519 ms 34432 KB Output is correct
109 Correct 498 ms 34416 KB Output is correct
110 Correct 597 ms 34528 KB Output is correct
111 Correct 551 ms 34416 KB Output is correct
112 Correct 462 ms 34432 KB Output is correct
113 Correct 527 ms 36000 KB Output is correct
114 Correct 476 ms 35352 KB Output is correct
115 Correct 576 ms 35000 KB Output is correct
116 Correct 534 ms 34852 KB Output is correct
117 Correct 495 ms 33780 KB Output is correct
118 Correct 521 ms 34408 KB Output is correct
119 Correct 492 ms 33740 KB Output is correct
120 Correct 429 ms 33528 KB Output is correct
121 Correct 423 ms 31524 KB Output is correct
122 Correct 370 ms 29772 KB Output is correct
123 Correct 262 ms 23544 KB Output is correct
124 Correct 344 ms 35308 KB Output is correct
125 Correct 373 ms 35180 KB Output is correct
126 Correct 375 ms 35432 KB Output is correct
127 Correct 389 ms 35332 KB Output is correct
128 Correct 12 ms 7680 KB Output is correct
129 Correct 11 ms 7776 KB Output is correct
130 Incorrect 12 ms 7808 KB Output isn't correct
131 Halted 0 ms 0 KB -