oj.uz

답안 #741021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741021 2023-05-13T12:18:24 Z LittleCube 화성 (APIO22_mars) C++17
89 / 100
 967 ms 4368 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include "mars.h"
#ifndef EVAL
#include "mars_grader.cpp"
#endif
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;

int get_count(string s)
{
	int ans = 0;
	for (int i = 90; i <= 99; i++)
		ans = ans * 2 + (s[i] == '1');
	return ans;
}

struct DSU
{
	int dsu[400];
	void init(int n)
	{
		for (int i = 0; i <= n + 5; i++)
			dsu[i] = i;
	}
	int find(int k)
	{
		return dsu[k] == k ? k : dsu[k] = find(dsu[k]);
	}
	int merge(int u, int v)
	{
		u = find(u), v = find(v);
		if (u == v)
			return 0;
		dsu[u] = v;
		return 1;
	}
} dsu;

vector<int> parse_corner(int n, int &idx, string s)
{
	vector<int> res(2 * n - 1, 0), mono;
	int j = 0;
	bool firstleft = 0;
	for (int i = 0; i < 2 * n - 1; i++, j += 2)
	{
		while (s[j] == '0' && s[j + 1] == '1')
		{
			mono.pop_back();
			j += 2;
		}
		if (firstleft == 0 && s[j] == '1')
		{
			firstleft = 1;
			mono.emplace_back(++idx);
			res[i] = mono.back();
			j--;
		}
		else if (s[j] == '1' && s[j + 1] == '0')
		{
			mono.emplace_back(++idx);
			res[i] = mono.back();
		}
		else if (s[j] == '0' && s[j + 1] == '0')
			res[i] = 0;
		else if (s[j] == '1' && s[j + 1] == '1')
			res[i] = mono.back();
		assert(j + 1 < 90);
	}
	return res;
}

vector<int> parse_edge(int n, int &idx, string s)
{
	vector<int> res(n, 0), mono;
	for (int i = 0, j = 0; i < n; i++, j++)
	{
		if (s[j] == '0')
			res[i] = 0;
		else
		{
			if (i && s[j - 1] == '1')
				res[i] = res[i - 1];
			else
				res[i] = ++idx;
		}
	}
	return res;
}

// for corner:
// new: 10, end: 01, continue: 11, zero: 00
// for edge:
// has: 1, no: 0, last 10 bits: count
// first 66 bits: record side, last 10 bits: count
// only border cells in charge, others record themselves

string merge_edge(int n, bool add, string edge)
{
	int tot = get_count(edge) + (edge[0] == '0' && add);

	string ans = string(100, '0');

	for (int i = n; i >= 1; i--)
		ans[i] = edge[i - 1];
	ans[0] = (add ? '1' : '0');

	for (int i = 99; i > 89; i--)
	{
		if (tot % 2)
			ans[i] = '1';
		tot /= 2;
	}
	return ans;
}

string merge_corner(int n, string before, string corner, string after, string middle)
{
	int idx = 0, tot = get_count(before) + get_count(corner) + get_count(after) + get_count(middle);

	dsu.init(4 * n);

	vector<int> cor = parse_corner(n, idx, corner),
				bef = parse_edge(n, idx, before),
				aft = parse_edge(n, idx, after),
				res(2 * n + 1, 0);

	int mid = (middle[0] == '1' ? ++idx : 0);
	reverse(bef.begin(), bef.end());
	for (int i = 0; i < n; i++)
		if (cor[i] && bef[i])
			tot -= dsu.merge(cor[i], bef[i]);
	for (int i = 0; i < n; i++)
		if (cor[i + n - 1] && aft[i])
			tot -= dsu.merge(cor[i + n - 1], aft[i]);
	if (bef[n - 1] && mid)
		tot -= dsu.merge(bef[n - 1], mid);
	if (aft[0] && mid)
		tot -= dsu.merge(aft[0], mid);
	for (int i = 0; i < n; i++)
		res[i] = dsu.find(bef[i]);
	res[n] = dsu.find(mid);
	for (int i = 0; i < n; i++)
		res[n + 1 + i] = dsu.find(aft[i]);

	string ans = string(100, '0');
	vector<int> mono, vis(4 * n + 5, 0);
	bool firstleft = 0;
	for (int i = 0, j = 0; i < 2 * n + 1; i++, j += 2)
	{
		if (res[i] == 0)
			ans[j] = ans[j + 1] = '0';
		else
		{
			if (vis[res[i]] == 0)
			{
				vis[res[i]] = 1;
				mono.emplace_back(res[i]);
				if (firstleft == 0)
				{
					firstleft = 1;
					ans[j] = '1';
					j--;
				}
				else
					ans[j] = '1', ans[j + 1] = '0';
			}
			else
			{
				while (mono.back() != res[i])
				{
					mono.pop_back();
					ans[j] = '0', ans[j + 1] = '1';
					j += 2;
				}
				ans[j] = '1', ans[j + 1] = '1';
			}
		}
	}
	for (int i = 99; i > 89; i--)
	{
		assert(ans[i] == '0');
		if (tot % 2)
			ans[i] = '1';
		tot /= 2;
	}
	// for (int i : bef)
	// 	cerr << i << ' ';
	// cerr << '\n';
	// for (int i : cor)
	// 	cerr << i << ' ';
	// cerr << '\n';
	// for (int i : aft)
	// 	cerr << i << ' ';
	// cerr << '\n';
	// cerr << mid << ' ';
	// cerr << '\n';
	// cerr << "merge into\n";
	// for (int i : res)
	// 	cerr << i << ' ';
	// cerr << '\n';
	// idx = 0;
	// res = parse_corner(n + 1, idx, ans);
	// cerr << "decode as\n";
	// for (int i : res)
	// 	cerr << i << ' ';
	// cerr << '\n';
	// cerr << '\n';
	return ans;
}

string process(vector<vector<string>> a, int i, int j, int k, int n)
{
	k++;
	i += k, j += k;
	if (k == 1)
	{
		for (int x = 0; x < 3; x++)
			for (int y = 0; y < 3; y++)
			{
				if (a[x][y][0] == '1')
					a[x][y][0] = '1', a[x][y][1] = '0', a[x][y][2] = '0', a[x][y][3] = '1', a[x][y][99] = '1';
			}
	}
	// return answer
	if (k == n)
	{
		int idx = 0, tot = 0;
		for (int x = 0; x < 3; x++)
			for (int y = 0; y < 3; y++)
				tot += get_count(a[x][y]);
		// cerr << tot << '\n';
		dsu.init(9 * n + 5);

		vector<int> ul = parse_corner(n, idx, a[0][0]),
					ur = parse_corner(n, idx, a[0][2]),
					dr = parse_corner(n, idx, a[2][2]),
					dl = parse_corner(n, idx, a[2][0]),
					l = parse_edge(n, idx, a[1][0]),
					r = parse_edge(n, idx, a[1][2]),
					u = parse_edge(n, idx, a[0][1]),
					d = parse_edge(n, idx, a[2][1]);
		int mid = (a[1][1][0] == '1' ? ++idx : 0);

#define merge1(a, b)            \
	for (int p = 0; p < n; p++) \
		if (a[p] && b[p])       \
			tot -= dsu.merge(a[p], b[p]);
#define merge2(a, b)              \
	for (int p = 0; p < n; p++)   \
		if (a[p + n - 1] && b[p]) \
			tot -= dsu.merge(a[p + n - 1], b[p]);

		merge2(ul, u);
		merge2(ur, r);
		merge2(dr, d);
		merge2(dl, l);

		if (mid && l[0])
			tot -= dsu.merge(mid, l[0]);
		if (mid && r[0])
			tot -= dsu.merge(mid, r[0]);
		if (mid && d[0])
			tot -= dsu.merge(mid, d[0]);
		if (mid && u[0])
			tot -= dsu.merge(mid, u[0]);

		reverse(l.begin(), l.end());
		reverse(r.begin(), r.end());
		reverse(d.begin(), d.end());
		reverse(u.begin(), u.end());

		merge1(ul, l);
		merge1(ur, u);
		merge1(dr, r);
		merge1(dl, d);

		string ans = string(100, '0');
		for (int p = 0; p < 10; p++)
		{
			if (tot % 2)
				ans[p] = '1';
			tot /= 2;
		}
		return ans;
	}
	int sz = k;
	// top left
	if (i == k && j == k)
		return merge_corner(sz, a[1][0], a[0][0], a[0][1], a[1][1]);
	// top right
	if (i == k && j + k == 2 * n)
		return merge_corner(sz, a[0][1], a[0][2], a[1][2], a[1][1]);
	// bottom left
	if (i + k == 2 * n && j == k)
		return merge_corner(sz, a[2][1], a[2][0], a[1][0], a[1][1]);
	// bottom right
	if (i + k == 2 * n && j + k == 2 * n)
		return merge_corner(sz, a[1][2], a[2][2], a[2][1], a[1][1]);
	// top
	if (i == k)
		return merge_edge(sz, a[1][1][0] == '1', a[0][1]);
	// left
	if (j == k)
		return merge_edge(sz, a[1][1][0] == '1', a[1][0]);
	// bottom
	if (i + k == 2 * n)
		return merge_edge(sz, a[1][1][0] == '1', a[2][1]);
	// right
	if (j + k == 2 * n)
		return merge_edge(sz, a[1][1][0] == '1', a[1][2]);

	return a[1][1];
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct
29 Correct 124 ms 2764 KB Output is correct
30 Correct 164 ms 2840 KB Output is correct
31 Correct 165 ms 3116 KB Output is correct
32 Correct 167 ms 2864 KB Output is correct
33 Correct 161 ms 2884 KB Output is correct
34 Correct 167 ms 2884 KB Output is correct
35 Correct 161 ms 2868 KB Output is correct
36 Correct 172 ms 2964 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct
29 Correct 124 ms 2764 KB Output is correct
30 Correct 164 ms 2840 KB Output is correct
31 Correct 165 ms 3116 KB Output is correct
32 Correct 167 ms 2864 KB Output is correct
33 Correct 161 ms 2884 KB Output is correct
34 Correct 167 ms 2884 KB Output is correct
35 Correct 161 ms 2868 KB Output is correct
36 Correct 172 ms 2964 KB Output is correct
37 Correct 222 ms 3220 KB Output is correct
38 Correct 287 ms 3412 KB Output is correct
39 Correct 275 ms 3324 KB Output is correct
40 Correct 271 ms 3192 KB Output is correct
41 Correct 285 ms 3280 KB Output is correct
42 Correct 271 ms 3300 KB Output is correct
43 Correct 275 ms 3256 KB Output is correct
44 Correct 267 ms 3384 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct
29 Correct 124 ms 2764 KB Output is correct
30 Correct 164 ms 2840 KB Output is correct
31 Correct 165 ms 3116 KB Output is correct
32 Correct 167 ms 2864 KB Output is correct
33 Correct 161 ms 2884 KB Output is correct
34 Correct 167 ms 2884 KB Output is correct
35 Correct 161 ms 2868 KB Output is correct
36 Correct 172 ms 2964 KB Output is correct
37 Correct 222 ms 3220 KB Output is correct
38 Correct 287 ms 3412 KB Output is correct
39 Correct 275 ms 3324 KB Output is correct
40 Correct 271 ms 3192 KB Output is correct
41 Correct 285 ms 3280 KB Output is correct
42 Correct 271 ms 3300 KB Output is correct
43 Correct 275 ms 3256 KB Output is correct
44 Correct 267 ms 3384 KB Output is correct
45 Correct 339 ms 3276 KB Output is correct
46 Correct 425 ms 3468 KB Output is correct
47 Correct 428 ms 3396 KB Output is correct
48 Correct 429 ms 3440 KB Output is correct
49 Correct 452 ms 3472 KB Output is correct
50 Correct 430 ms 3452 KB Output is correct
51 Correct 441 ms 3668 KB Output is correct
52 Correct 438 ms 3400 KB Output is correct
53 Correct 427 ms 3564 KB Output is correct
54 Correct 424 ms 3364 KB Output is correct
55 Correct 434 ms 3576 KB Output is correct
56 Correct 421 ms 3448 KB Output is correct

Subtask #8
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct
29 Correct 124 ms 2764 KB Output is correct
30 Correct 164 ms 2840 KB Output is correct
31 Correct 165 ms 3116 KB Output is correct
32 Correct 167 ms 2864 KB Output is correct
33 Correct 161 ms 2884 KB Output is correct
34 Correct 167 ms 2884 KB Output is correct
35 Correct 161 ms 2868 KB Output is correct
36 Correct 172 ms 2964 KB Output is correct
37 Correct 222 ms 3220 KB Output is correct
38 Correct 287 ms 3412 KB Output is correct
39 Correct 275 ms 3324 KB Output is correct
40 Correct 271 ms 3192 KB Output is correct
41 Correct 285 ms 3280 KB Output is correct
42 Correct 271 ms 3300 KB Output is correct
43 Correct 275 ms 3256 KB Output is correct
44 Correct 267 ms 3384 KB Output is correct
45 Correct 339 ms 3276 KB Output is correct
46 Correct 425 ms 3468 KB Output is correct
47 Correct 428 ms 3396 KB Output is correct
48 Correct 429 ms 3440 KB Output is correct
49 Correct 452 ms 3472 KB Output is correct
50 Correct 430 ms 3452 KB Output is correct
51 Correct 441 ms 3668 KB Output is correct
52 Correct 438 ms 3400 KB Output is correct
53 Correct 427 ms 3564 KB Output is correct
54 Correct 424 ms 3364 KB Output is correct
55 Correct 434 ms 3576 KB Output is correct
56 Correct 421 ms 3448 KB Output is correct
57 Correct 535 ms 3788 KB Output is correct
58 Correct 654 ms 4100 KB Output is correct
59 Correct 628 ms 4100 KB Output is correct
60 Correct 628 ms 4104 KB Output is correct
61 Correct 627 ms 4036 KB Output is correct
62 Correct 639 ms 4240 KB Output is correct
63 Correct 633 ms 4084 KB Output is correct
64 Correct 650 ms 4072 KB Output is correct
65 Correct 632 ms 4124 KB Output is correct
66 Correct 650 ms 4216 KB Output is correct
67 Correct 640 ms 4060 KB Output is correct
68 Correct 658 ms 4144 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct
29 Correct 124 ms 2764 KB Output is correct
30 Correct 164 ms 2840 KB Output is correct
31 Correct 165 ms 3116 KB Output is correct
32 Correct 167 ms 2864 KB Output is correct
33 Correct 161 ms 2884 KB Output is correct
34 Correct 167 ms 2884 KB Output is correct
35 Correct 161 ms 2868 KB Output is correct
36 Correct 172 ms 2964 KB Output is correct
37 Correct 222 ms 3220 KB Output is correct
38 Correct 287 ms 3412 KB Output is correct
39 Correct 275 ms 3324 KB Output is correct
40 Correct 271 ms 3192 KB Output is correct
41 Correct 285 ms 3280 KB Output is correct
42 Correct 271 ms 3300 KB Output is correct
43 Correct 275 ms 3256 KB Output is correct
44 Correct 267 ms 3384 KB Output is correct
45 Correct 339 ms 3276 KB Output is correct
46 Correct 425 ms 3468 KB Output is correct
47 Correct 428 ms 3396 KB Output is correct
48 Correct 429 ms 3440 KB Output is correct
49 Correct 452 ms 3472 KB Output is correct
50 Correct 430 ms 3452 KB Output is correct
51 Correct 441 ms 3668 KB Output is correct
52 Correct 438 ms 3400 KB Output is correct
53 Correct 427 ms 3564 KB Output is correct
54 Correct 424 ms 3364 KB Output is correct
55 Correct 434 ms 3576 KB Output is correct
56 Correct 421 ms 3448 KB Output is correct
57 Correct 535 ms 3788 KB Output is correct
58 Correct 654 ms 4100 KB Output is correct
59 Correct 628 ms 4100 KB Output is correct
60 Correct 628 ms 4104 KB Output is correct
61 Correct 627 ms 4036 KB Output is correct
62 Correct 639 ms 4240 KB Output is correct
63 Correct 633 ms 4084 KB Output is correct
64 Correct 650 ms 4072 KB Output is correct
65 Correct 632 ms 4124 KB Output is correct
66 Correct 650 ms 4216 KB Output is correct
67 Correct 640 ms 4060 KB Output is correct
68 Correct 658 ms 4144 KB Output is correct
69 Correct 782 ms 4228 KB Output is correct
70 Correct 889 ms 4212 KB Output is correct
71 Correct 933 ms 4240 KB Output is correct
72 Correct 924 ms 4292 KB Output is correct
73 Correct 894 ms 4368 KB Output is correct
74 Correct 911 ms 4296 KB Output is correct
75 Correct 937 ms 4316 KB Output is correct
76 Correct 948 ms 4356 KB Output is correct

Subtask #10
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1844 KB Output is correct
2 Correct 8 ms 2048 KB Output is correct
3 Correct 8 ms 1972 KB Output is correct
4 Correct 8 ms 2148 KB Output is correct
5 Correct 8 ms 1964 KB Output is correct
6 Correct 8 ms 1876 KB Output is correct
7 Correct 10 ms 1960 KB Output is correct
8 Correct 16 ms 1980 KB Output is correct
9 Correct 16 ms 1776 KB Output is correct
10 Correct 16 ms 1784 KB Output is correct
11 Correct 16 ms 2192 KB Output is correct
12 Correct 16 ms 1888 KB Output is correct
13 Correct 16 ms 1988 KB Output is correct
14 Correct 27 ms 2468 KB Output is correct
15 Correct 39 ms 2632 KB Output is correct
16 Correct 38 ms 2512 KB Output is correct
17 Correct 39 ms 2460 KB Output is correct
18 Correct 43 ms 2560 KB Output is correct
19 Correct 40 ms 2544 KB Output is correct
20 Correct 40 ms 2536 KB Output is correct
21 Correct 57 ms 2612 KB Output is correct
22 Correct 84 ms 2664 KB Output is correct
23 Correct 86 ms 2632 KB Output is correct
24 Correct 81 ms 2680 KB Output is correct
25 Correct 81 ms 2692 KB Output is correct
26 Correct 84 ms 2680 KB Output is correct
27 Correct 85 ms 2748 KB Output is correct
28 Correct 83 ms 2676 KB Output is correct
29 Correct 124 ms 2764 KB Output is correct
30 Correct 164 ms 2840 KB Output is correct
31 Correct 165 ms 3116 KB Output is correct
32 Correct 167 ms 2864 KB Output is correct
33 Correct 161 ms 2884 KB Output is correct
34 Correct 167 ms 2884 KB Output is correct
35 Correct 161 ms 2868 KB Output is correct
36 Correct 172 ms 2964 KB Output is correct
37 Correct 222 ms 3220 KB Output is correct
38 Correct 287 ms 3412 KB Output is correct
39 Correct 275 ms 3324 KB Output is correct
40 Correct 271 ms 3192 KB Output is correct
41 Correct 285 ms 3280 KB Output is correct
42 Correct 271 ms 3300 KB Output is correct
43 Correct 275 ms 3256 KB Output is correct
44 Correct 267 ms 3384 KB Output is correct
45 Correct 339 ms 3276 KB Output is correct
46 Correct 425 ms 3468 KB Output is correct
47 Correct 428 ms 3396 KB Output is correct
48 Correct 429 ms 3440 KB Output is correct
49 Correct 452 ms 3472 KB Output is correct
50 Correct 430 ms 3452 KB Output is correct
51 Correct 441 ms 3668 KB Output is correct
52 Correct 438 ms 3400 KB Output is correct
53 Correct 427 ms 3564 KB Output is correct
54 Correct 424 ms 3364 KB Output is correct
55 Correct 434 ms 3576 KB Output is correct
56 Correct 421 ms 3448 KB Output is correct
57 Correct 535 ms 3788 KB Output is correct
58 Correct 654 ms 4100 KB Output is correct
59 Correct 628 ms 4100 KB Output is correct
60 Correct 628 ms 4104 KB Output is correct
61 Correct 627 ms 4036 KB Output is correct
62 Correct 639 ms 4240 KB Output is correct
63 Correct 633 ms 4084 KB Output is correct
64 Correct 650 ms 4072 KB Output is correct
65 Correct 632 ms 4124 KB Output is correct
66 Correct 650 ms 4216 KB Output is correct
67 Correct 640 ms 4060 KB Output is correct
68 Correct 658 ms 4144 KB Output is correct
69 Correct 782 ms 4228 KB Output is correct
70 Correct 889 ms 4212 KB Output is correct
71 Correct 933 ms 4240 KB Output is correct
72 Correct 924 ms 4292 KB Output is correct
73 Correct 894 ms 4368 KB Output is correct
74 Correct 911 ms 4296 KB Output is correct
75 Correct 937 ms 4316 KB Output is correct
76 Correct 948 ms 4356 KB Output is correct
77 Correct 967 ms 4300 KB Output is correct
78 Incorrect 160 ms 592 KB Incorrect
79 Halted 0 ms 0 KB -