oj.uz

답안 #413644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
413644 2021-05-29T07:31:05 Z Berted 도로 폐쇄 (APIO21_roads) C++14
100 / 100
 202 ms 40844 KB 
#include "roads.h"

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#define ll long long
#define pii pair<ll, ll>
#define ppi pair<pii, ll>
#define fst first
#define snd second

using namespace std;

vector<pii> adj[100001];
vector<ll> temp;

namespace BIT
{
	vector<ll> C;
	ll BIT[100001][2];
	inline void reset()
	{
		for (int i = 0; i <= C.size(); i++) {BIT[i][0] = BIT[i][1] = 0;}
		C.clear();
	}
	inline void pushPoint(ll x) {C.push_back(x);}
	inline void process() {sort(C.begin(), C.end()); C.resize(unique(C.begin(), C.end()) - C.begin());}
	inline ll query(int t, ll x)
	{
		x = upper_bound(C.begin(), C.end(), x) - C.begin();
		ll ret = 0;
		for (; x; x -= x & (-x)) {ret += BIT[x][t];}
		return ret;
	}
	inline ll query2(int t, ll x)
	{
		ll ret = 0;
		for (; x; x -= x & (-x)) {ret += BIT[x][t];}
		return ret;
	}
	inline void update(int t, int x, ll v)
	{
		x = upper_bound(C.begin(), C.end(), x) - C.begin();
		//cerr << "UPD: " << t << " " << x << " " << v << "\n";
		for (; x <= C.size(); x += x & (-x)) {BIT[x][t] += v;}
	}
	inline ll findKth(int x)
	{
		int L = 1, R = C.size() + 1;
		while (L < R)
		{
			int M = L + R >> 1;
			if (query2(0, M) < x) {L = M + 1;}
			else {R = M;}
		}
		if (L == C.size() + 1) {return query2(1, C.size());}
		else {return query2(1, L - 1) + C[L - 1] * (x - query2(0, L - 1));}
	}
}
struct DS {vector<pii> DP; int fix = 0;};

inline bool comp(const pair<DS*, int> L, const pair<DS*, int> R)
{
	return L.fst -> DP.size() > R.fst -> DP.size();
}

DS* DFS(int u, int p)
{
	vector<pair<DS*, int>> child;
	for (const auto &v : adj[u])
	{
		if (v.fst == p) continue;
		child.push_back({DFS(v.fst, u), v.snd});
	}

	int deg = adj[u].size();
	if (child.size())
	{
		BIT :: reset();
		for (const auto &v : adj[u])
		{
			if (v.fst == p) continue;
			BIT :: pushPoint(-v.snd);
		}
		BIT :: process();
		sort(child.begin(), child.end(), comp);
		
		while (child[0].fst -> DP.size() < deg) child[0].fst -> DP.push_back({0, 0});
		for (int j = child[0].fst -> fix; j < deg; j++) {child[0].fst -> DP[j].fst = child[0].fst -> DP[j].snd;}
		for (int j = deg; j < child[0].fst -> fix; j++) {child[0].fst -> DP[j].snd = min(child[0].fst -> DP[j].snd, child[0].fst -> DP[j].fst + child[0].snd);}
		child[0].fst -> fix = deg;

		//cerr << "DFS: " << u << " " << child.size() << '\n';

		int jj = child.size() - 1; ll tp = 0; 
		for (int i = 0; i < deg; i++)
		{
			vector<ll> V; ll t = 0;
			for (; jj >= 0 && child[jj].fst -> DP.size() <= i; jj--)
			{
				//cerr << "jj: " << jj << "\n";
				tp += child[jj].snd;
				BIT :: update(0, -child[jj].snd, 1);
				BIT :: update(1, -child[jj].snd, -child[jj].snd);
			}
			t = tp;

			for (int j = 0; j <= jj; j++)
			{
				if (i >= child[j].fst -> fix) {child[j].fst -> DP[i].fst = child[j].fst -> DP[i].snd;}
				t += child[j].fst -> DP[i].fst + child[j].snd;
				V.push_back(child[j].fst -> DP[i].snd - (child[j].fst -> DP[i].fst + child[j].snd));
				if (V.back() >= 0) {V.pop_back();}
			}
			//cerr << i << ": " << t << " " << jj << '\n';
			sort(V.begin(), V.end());
			child[0].fst -> DP[i].fst = child[0].fst -> DP[i].snd = t;

			int j = 0;
			for (j = 0; j < V.size(); j++)
			{
				if (BIT :: query(0, V[j]) + (j + 1) <= i + 1) {child[0].fst -> DP[i].fst += V[j];}
				else {break;}
			}
			//cerr << j << " " << i + 1 - j << " " << BIT :: findKth(i + 1 - j) << "\n";
			child[0].fst -> DP[i].fst += BIT :: findKth(i + 1 - j);

			j = 0;
			for (j = 0; j < V.size(); j++)
			{
				if (BIT :: query(0, V[j]) + (j + 1) <= i) {child[0].fst -> DP[i].snd += V[j];}
				else {break;}
			}
			//cerr << j << " " << i - j << " " << BIT :: findKth(i - j) << "\n";
			child[0].fst -> DP[i].snd += BIT :: findKth(i - j);
		}

		for (int j = 1; j < child.size(); j++)
		{
			for (int k = deg; k < child[j].fst -> DP.size(); k++) 
			{
				if (k < child[j].fst -> fix) child[0].fst -> DP[k].snd += min(child[j].fst -> DP[k].fst + child[j].snd, child[j].fst -> DP[k].snd);
				else child[0].fst -> DP[k].snd += child[j].fst -> DP[k].snd;
			}
		}

		/*cerr << "DFS: " << u << " " << child[0].fst -> fix << "\n";
		for (int i = 0; i < child[0].fst -> DP.size(); i++)
		{
			cerr << child[0].fst -> DP[i].fst << " " << child[0].fst -> DP[i].snd << "\n";
		}*/

		return child[0].fst;
	}
	else {return new DS;}
}

vector<ll> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) 
{
	vector<ll> ret(N);
	for (int i = 1; i < N; i++)
	{
		ret[0] += W[i - 1];
		adj[U[i - 1]].push_back({V[i - 1], W[i - 1]});
		adj[V[i - 1]].push_back({U[i - 1], W[i - 1]});
	}

	DS* ans = DFS(0, -1);
	for (int i = 0; i < ans -> DP.size(); i++) 
	{
		if (i < ans -> fix) ret[i + 1] = ans -> DP[i].fst;
		else ret[i + 1] = ans -> DP[i].snd;
	}

	return ret;
}

Compilation message

roads.cpp: In function 'void BIT::reset()':
roads.cpp:24:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for (int i = 0; i <= C.size(); i++) {BIT[i][0] = BIT[i][1] = 0;}
      |                   ~~^~~~~~~~~~~
roads.cpp: In function 'void BIT::update(int, int, long long int)':
roads.cpp:46:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   for (; x <= C.size(); x += x & (-x)) {BIT[x][t] += v;}
      |          ~~^~~~~~~~~~~
roads.cpp: In function 'long long int BIT::findKth(int)':
roads.cpp:53:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |    int M = L + R >> 1;
      |            ~~^~~
roads.cpp:57:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   if (L == C.size() + 1) {return query2(1, C.size());}
      |       ~~^~~~~~~~~~~~~~~
roads.cpp: In function 'DS* DFS(int, int)':
roads.cpp:89:36: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   89 |   while (child[0].fst -> DP.size() < deg) child[0].fst -> DP.push_back({0, 0});
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
roads.cpp:100:49: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  100 |    for (; jj >= 0 && child[jj].fst -> DP.size() <= i; jj--)
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
roads.cpp:121:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |    for (j = 0; j < V.size(); j++)
      |                ~~^~~~~~~~~~
roads.cpp:130:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |    for (j = 0; j < V.size(); j++)
      |                ~~^~~~~~~~~~
roads.cpp:139:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<DS*, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |   for (int j = 1; j < child.size(); j++)
      |                   ~~^~~~~~~~~~~~~~
roads.cpp:141:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |    for (int k = deg; k < child[j].fst -> DP.size(); k++)
      |                      ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:170:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |  for (int i = 0; i < ans -> DP.size(); i++)
      |                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 5 ms 2988 KB Output is correct
3 Correct 6 ms 3020 KB Output is correct
4 Correct 4 ms 3020 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 4 ms 3020 KB Output is correct
9 Correct 4 ms 3020 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 58 ms 14012 KB Output is correct
13 Correct 102 ms 22092 KB Output is correct
14 Correct 160 ms 22252 KB Output is correct
15 Correct 179 ms 24284 KB Output is correct
16 Correct 195 ms 24404 KB Output is correct
17 Correct 94 ms 22928 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 80 ms 20564 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 86 ms 34188 KB Output is correct
3 Correct 93 ms 38320 KB Output is correct
4 Correct 99 ms 40672 KB Output is correct
5 Correct 98 ms 40844 KB Output is correct
6 Correct 4 ms 3276 KB Output is correct
7 Correct 4 ms 3404 KB Output is correct
8 Correct 4 ms 3276 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 54 ms 25008 KB Output is correct
13 Correct 90 ms 39996 KB Output is correct
14 Correct 3 ms 2636 KB Output is correct
15 Correct 106 ms 36204 KB Output is correct
16 Correct 91 ms 39932 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 15036 KB Output is correct
2 Correct 116 ms 14744 KB Output is correct
3 Correct 94 ms 18788 KB Output is correct
4 Correct 109 ms 15364 KB Output is correct
5 Correct 101 ms 20144 KB Output is correct
6 Correct 96 ms 18140 KB Output is correct
7 Correct 106 ms 18148 KB Output is correct
8 Correct 84 ms 21124 KB Output is correct
9 Correct 111 ms 25764 KB Output is correct
10 Correct 115 ms 15820 KB Output is correct
11 Correct 87 ms 18372 KB Output is correct
12 Correct 108 ms 19920 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 82 ms 36200 KB Output is correct
15 Correct 91 ms 39880 KB Output is correct
16 Correct 5 ms 2892 KB Output is correct
17 Correct 4 ms 2820 KB Output is correct
18 Correct 4 ms 2892 KB Output is correct
19 Correct 4 ms 2892 KB Output is correct
20 Correct 4 ms 2944 KB Output is correct
21 Correct 81 ms 20440 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 15036 KB Output is correct
2 Correct 116 ms 14744 KB Output is correct
3 Correct 94 ms 18788 KB Output is correct
4 Correct 109 ms 15364 KB Output is correct
5 Correct 101 ms 20144 KB Output is correct
6 Correct 96 ms 18140 KB Output is correct
7 Correct 106 ms 18148 KB Output is correct
8 Correct 84 ms 21124 KB Output is correct
9 Correct 111 ms 25764 KB Output is correct
10 Correct 115 ms 15820 KB Output is correct
11 Correct 87 ms 18372 KB Output is correct
12 Correct 108 ms 19920 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 82 ms 36200 KB Output is correct
15 Correct 91 ms 39880 KB Output is correct
16 Correct 5 ms 2892 KB Output is correct
17 Correct 4 ms 2820 KB Output is correct
18 Correct 4 ms 2892 KB Output is correct
19 Correct 4 ms 2892 KB Output is correct
20 Correct 4 ms 2944 KB Output is correct
21 Correct 81 ms 20440 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 2 ms 2636 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 96 ms 13580 KB Output is correct
26 Correct 94 ms 12484 KB Output is correct
27 Correct 122 ms 15520 KB Output is correct
28 Correct 107 ms 18744 KB Output is correct
29 Correct 105 ms 18756 KB Output is correct
30 Correct 97 ms 17604 KB Output is correct
31 Correct 97 ms 18164 KB Output is correct
32 Correct 136 ms 15104 KB Output is correct
33 Correct 92 ms 21428 KB Output is correct
34 Correct 149 ms 18144 KB Output is correct
35 Correct 126 ms 25668 KB Output is correct
36 Correct 103 ms 18400 KB Output is correct
37 Correct 93 ms 18120 KB Output is correct
38 Correct 56 ms 25028 KB Output is correct
39 Correct 112 ms 39912 KB Output is correct
40 Correct 5 ms 2764 KB Output is correct
41 Correct 4 ms 2892 KB Output is correct
42 Correct 4 ms 3020 KB Output is correct
43 Correct 3 ms 2892 KB Output is correct
44 Correct 4 ms 3020 KB Output is correct
45 Correct 2 ms 2636 KB Output is correct
46 Correct 2 ms 2636 KB Output is correct
47 Correct 2 ms 2732 KB Output is correct
48 Correct 2 ms 2636 KB Output is correct
49 Correct 2 ms 2636 KB Output is correct
50 Correct 68 ms 14088 KB Output is correct
51 Correct 114 ms 22120 KB Output is correct
52 Correct 122 ms 14904 KB Output is correct
53 Correct 109 ms 14740 KB Output is correct
54 Correct 94 ms 18776 KB Output is correct
55 Correct 141 ms 15328 KB Output is correct
56 Correct 97 ms 20052 KB Output is correct
57 Correct 89 ms 18116 KB Output is correct
58 Correct 104 ms 18088 KB Output is correct
59 Correct 102 ms 21044 KB Output is correct
60 Correct 109 ms 25880 KB Output is correct
61 Correct 135 ms 15772 KB Output is correct
62 Correct 100 ms 18348 KB Output is correct
63 Correct 87 ms 19912 KB Output is correct
64 Correct 3 ms 2636 KB Output is correct
65 Correct 83 ms 36264 KB Output is correct
66 Correct 101 ms 40156 KB Output is correct
67 Correct 4 ms 2892 KB Output is correct
68 Correct 6 ms 2804 KB Output is correct
69 Correct 4 ms 2892 KB Output is correct
70 Correct 4 ms 2892 KB Output is correct
71 Correct 5 ms 2968 KB Output is correct
72 Correct 86 ms 20360 KB Output is correct

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 5 ms 2988 KB Output is correct
3 Correct 6 ms 3020 KB Output is correct
4 Correct 4 ms 3020 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 4 ms 3020 KB Output is correct
9 Correct 4 ms 3020 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 58 ms 14012 KB Output is correct
13 Correct 102 ms 22092 KB Output is correct
14 Correct 160 ms 22252 KB Output is correct
15 Correct 179 ms 24284 KB Output is correct
16 Correct 195 ms 24404 KB Output is correct
17 Correct 94 ms 22928 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 80 ms 20564 KB Output is correct
20 Correct 3 ms 2636 KB Output is correct
21 Correct 86 ms 34188 KB Output is correct
22 Correct 93 ms 38320 KB Output is correct
23 Correct 99 ms 40672 KB Output is correct
24 Correct 98 ms 40844 KB Output is correct
25 Correct 4 ms 3276 KB Output is correct
26 Correct 4 ms 3404 KB Output is correct
27 Correct 4 ms 3276 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 2 ms 2636 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 54 ms 25008 KB Output is correct
32 Correct 90 ms 39996 KB Output is correct
33 Correct 3 ms 2636 KB Output is correct
34 Correct 106 ms 36204 KB Output is correct
35 Correct 91 ms 39932 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2572 KB Output is correct
42 Correct 2 ms 2636 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 2 ms 2636 KB Output is correct
46 Correct 3 ms 2636 KB Output is correct
47 Correct 3 ms 2636 KB Output is correct
48 Correct 3 ms 2636 KB Output is correct
49 Correct 3 ms 2636 KB Output is correct
50 Correct 3 ms 2636 KB Output is correct
51 Correct 3 ms 2636 KB Output is correct
52 Correct 2 ms 2636 KB Output is correct
53 Correct 2 ms 2636 KB Output is correct
54 Correct 2 ms 2636 KB Output is correct
55 Correct 2 ms 2636 KB Output is correct
56 Correct 2 ms 2636 KB Output is correct
57 Correct 2 ms 2636 KB Output is correct
58 Correct 4 ms 2736 KB Output is correct
59 Correct 4 ms 2944 KB Output is correct
60 Correct 5 ms 2860 KB Output is correct
61 Correct 6 ms 2892 KB Output is correct
62 Correct 6 ms 2944 KB Output is correct
63 Correct 4 ms 2892 KB Output is correct
64 Correct 4 ms 2892 KB Output is correct
65 Correct 4 ms 2940 KB Output is correct
66 Correct 4 ms 2944 KB Output is correct
67 Correct 4 ms 2892 KB Output is correct
68 Correct 4 ms 3276 KB Output is correct
69 Correct 4 ms 3276 KB Output is correct
70 Correct 4 ms 3276 KB Output is correct
71 Correct 5 ms 3020 KB Output is correct
72 Correct 5 ms 3020 KB Output is correct
73 Correct 4 ms 3020 KB Output is correct
74 Correct 3 ms 2636 KB Output is correct
75 Correct 2 ms 2636 KB Output is correct
76 Correct 3 ms 2636 KB Output is correct
77 Correct 3 ms 2636 KB Output is correct
78 Correct 2 ms 2636 KB Output is correct
79 Correct 2 ms 2636 KB Output is correct
80 Correct 2 ms 2636 KB Output is correct
81 Correct 2 ms 2636 KB Output is correct
82 Correct 2 ms 2636 KB Output is correct
83 Correct 2 ms 2636 KB Output is correct
84 Correct 2 ms 2636 KB Output is correct
85 Correct 2 ms 2636 KB Output is correct
86 Correct 2 ms 2636 KB Output is correct
87 Correct 2 ms 2636 KB Output is correct
88 Correct 4 ms 2816 KB Output is correct
89 Correct 4 ms 2892 KB Output is correct
90 Correct 4 ms 2944 KB Output is correct
91 Correct 3 ms 2940 KB Output is correct
92 Correct 5 ms 3020 KB Output is correct
93 Correct 2 ms 2640 KB Output is correct
94 Correct 2 ms 2636 KB Output is correct
95 Correct 2 ms 2636 KB Output is correct
96 Correct 2 ms 2636 KB Output is correct
97 Correct 2 ms 2636 KB Output is correct
98 Correct 2 ms 2636 KB Output is correct
99 Correct 4 ms 2892 KB Output is correct
100 Correct 4 ms 2892 KB Output is correct
101 Correct 4 ms 2948 KB Output is correct
102 Correct 4 ms 2944 KB Output is correct
103 Correct 4 ms 2892 KB Output is correct
104 Correct 114 ms 15036 KB Output is correct
105 Correct 116 ms 14744 KB Output is correct
106 Correct 94 ms 18788 KB Output is correct
107 Correct 109 ms 15364 KB Output is correct
108 Correct 101 ms 20144 KB Output is correct
109 Correct 96 ms 18140 KB Output is correct
110 Correct 106 ms 18148 KB Output is correct
111 Correct 84 ms 21124 KB Output is correct
112 Correct 111 ms 25764 KB Output is correct
113 Correct 115 ms 15820 KB Output is correct
114 Correct 87 ms 18372 KB Output is correct
115 Correct 108 ms 19920 KB Output is correct
116 Correct 2 ms 2636 KB Output is correct
117 Correct 82 ms 36200 KB Output is correct
118 Correct 91 ms 39880 KB Output is correct
119 Correct 5 ms 2892 KB Output is correct
120 Correct 4 ms 2820 KB Output is correct
121 Correct 4 ms 2892 KB Output is correct
122 Correct 4 ms 2892 KB Output is correct
123 Correct 4 ms 2944 KB Output is correct
124 Correct 81 ms 20440 KB Output is correct
125 Correct 2 ms 2636 KB Output is correct
126 Correct 2 ms 2636 KB Output is correct
127 Correct 2 ms 2636 KB Output is correct
128 Correct 96 ms 13580 KB Output is correct
129 Correct 94 ms 12484 KB Output is correct
130 Correct 122 ms 15520 KB Output is correct
131 Correct 107 ms 18744 KB Output is correct
132 Correct 105 ms 18756 KB Output is correct
133 Correct 97 ms 17604 KB Output is correct
134 Correct 97 ms 18164 KB Output is correct
135 Correct 136 ms 15104 KB Output is correct
136 Correct 92 ms 21428 KB Output is correct
137 Correct 149 ms 18144 KB Output is correct
138 Correct 126 ms 25668 KB Output is correct
139 Correct 103 ms 18400 KB Output is correct
140 Correct 93 ms 18120 KB Output is correct
141 Correct 56 ms 25028 KB Output is correct
142 Correct 112 ms 39912 KB Output is correct
143 Correct 5 ms 2764 KB Output is correct
144 Correct 4 ms 2892 KB Output is correct
145 Correct 4 ms 3020 KB Output is correct
146 Correct 3 ms 2892 KB Output is correct
147 Correct 4 ms 3020 KB Output is correct
148 Correct 2 ms 2636 KB Output is correct
149 Correct 2 ms 2636 KB Output is correct
150 Correct 2 ms 2732 KB Output is correct
151 Correct 2 ms 2636 KB Output is correct
152 Correct 2 ms 2636 KB Output is correct
153 Correct 68 ms 14088 KB Output is correct
154 Correct 114 ms 22120 KB Output is correct
155 Correct 122 ms 14904 KB Output is correct
156 Correct 109 ms 14740 KB Output is correct
157 Correct 94 ms 18776 KB Output is correct
158 Correct 141 ms 15328 KB Output is correct
159 Correct 97 ms 20052 KB Output is correct
160 Correct 89 ms 18116 KB Output is correct
161 Correct 104 ms 18088 KB Output is correct
162 Correct 102 ms 21044 KB Output is correct
163 Correct 109 ms 25880 KB Output is correct
164 Correct 135 ms 15772 KB Output is correct
165 Correct 100 ms 18348 KB Output is correct
166 Correct 87 ms 19912 KB Output is correct
167 Correct 3 ms 2636 KB Output is correct
168 Correct 83 ms 36264 KB Output is correct
169 Correct 101 ms 40156 KB Output is correct
170 Correct 4 ms 2892 KB Output is correct
171 Correct 6 ms 2804 KB Output is correct
172 Correct 4 ms 2892 KB Output is correct
173 Correct 4 ms 2892 KB Output is correct
174 Correct 5 ms 2968 KB Output is correct
175 Correct 86 ms 20360 KB Output is correct
176 Correct 2 ms 2636 KB Output is correct
177 Correct 130 ms 15980 KB Output is correct
178 Correct 96 ms 13108 KB Output is correct
179 Correct 119 ms 18648 KB Output is correct
180 Correct 142 ms 19588 KB Output is correct
181 Correct 108 ms 20944 KB Output is correct
182 Correct 104 ms 20076 KB Output is correct
183 Correct 145 ms 18156 KB Output is correct
184 Correct 149 ms 18628 KB Output is correct
185 Correct 149 ms 18736 KB Output is correct
186 Correct 159 ms 17700 KB Output is correct
187 Correct 183 ms 24556 KB Output is correct
188 Correct 114 ms 14712 KB Output is correct
189 Correct 126 ms 15924 KB Output is correct
190 Correct 148 ms 19208 KB Output is correct
191 Correct 89 ms 18408 KB Output is correct
192 Correct 189 ms 21680 KB Output is correct
193 Correct 176 ms 20888 KB Output is correct
194 Correct 108 ms 19268 KB Output is correct
195 Correct 78 ms 34300 KB Output is correct
196 Correct 110 ms 38416 KB Output is correct
197 Correct 95 ms 40772 KB Output is correct
198 Correct 99 ms 40804 KB Output is correct
199 Correct 5 ms 2764 KB Output is correct
200 Correct 4 ms 2892 KB Output is correct
201 Correct 4 ms 2764 KB Output is correct
202 Correct 5 ms 2944 KB Output is correct
203 Correct 5 ms 2924 KB Output is correct
204 Correct 4 ms 2940 KB Output is correct
205 Correct 4 ms 2892 KB Output is correct
206 Correct 5 ms 2948 KB Output is correct
207 Correct 5 ms 2940 KB Output is correct
208 Correct 4 ms 2892 KB Output is correct
209 Correct 5 ms 3372 KB Output is correct
210 Correct 4 ms 3276 KB Output is correct
211 Correct 4 ms 3320 KB Output is correct
212 Correct 5 ms 3020 KB Output is correct
213 Correct 5 ms 3020 KB Output is correct
214 Correct 5 ms 3020 KB Output is correct
215 Correct 2 ms 2636 KB Output is correct
216 Correct 2 ms 2636 KB Output is correct
217 Correct 2 ms 2636 KB Output is correct
218 Correct 3 ms 2636 KB Output is correct
219 Correct 3 ms 2636 KB Output is correct
220 Correct 2 ms 2636 KB Output is correct
221 Correct 3 ms 2636 KB Output is correct
222 Correct 2 ms 2636 KB Output is correct
223 Correct 3 ms 2636 KB Output is correct
224 Correct 3 ms 2636 KB Output is correct
225 Correct 2 ms 2652 KB Output is correct
226 Correct 2 ms 2636 KB Output is correct
227 Correct 2 ms 2636 KB Output is correct
228 Correct 2 ms 2636 KB Output is correct
229 Correct 100 ms 13624 KB Output is correct
230 Correct 92 ms 12536 KB Output is correct
231 Correct 126 ms 15532 KB Output is correct
232 Correct 122 ms 18656 KB Output is correct
233 Correct 93 ms 18816 KB Output is correct
234 Correct 97 ms 17584 KB Output is correct
235 Correct 101 ms 18300 KB Output is correct
236 Correct 106 ms 15104 KB Output is correct
237 Correct 87 ms 21520 KB Output is correct
238 Correct 114 ms 18084 KB Output is correct
239 Correct 134 ms 25820 KB Output is correct
240 Correct 104 ms 18412 KB Output is correct
241 Correct 92 ms 18112 KB Output is correct
242 Correct 54 ms 24964 KB Output is correct
243 Correct 90 ms 39980 KB Output is correct
244 Correct 4 ms 2764 KB Output is correct
245 Correct 4 ms 2892 KB Output is correct
246 Correct 4 ms 2948 KB Output is correct
247 Correct 4 ms 2892 KB Output is correct
248 Correct 4 ms 3020 KB Output is correct
249 Correct 2 ms 2636 KB Output is correct
250 Correct 3 ms 2636 KB Output is correct
251 Correct 3 ms 2636 KB Output is correct
252 Correct 2 ms 2636 KB Output is correct
253 Correct 2 ms 2636 KB Output is correct
254 Correct 54 ms 14112 KB Output is correct
255 Correct 94 ms 22132 KB Output is correct
256 Correct 165 ms 22260 KB Output is correct
257 Correct 176 ms 24056 KB Output is correct
258 Correct 202 ms 24400 KB Output is correct
259 Correct 96 ms 23000 KB Output is correct
260 Correct 105 ms 15044 KB Output is correct
261 Correct 115 ms 14776 KB Output is correct
262 Correct 109 ms 18820 KB Output is correct
263 Correct 116 ms 15372 KB Output is correct
264 Correct 132 ms 19996 KB Output is correct
265 Correct 119 ms 18116 KB Output is correct
266 Correct 109 ms 18144 KB Output is correct
267 Correct 83 ms 21044 KB Output is correct
268 Correct 146 ms 25796 KB Output is correct
269 Correct 114 ms 15820 KB Output is correct
270 Correct 90 ms 18424 KB Output is correct
271 Correct 90 ms 19924 KB Output is correct
272 Correct 3 ms 2636 KB Output is correct
273 Correct 96 ms 36204 KB Output is correct
274 Correct 113 ms 39912 KB Output is correct
275 Correct 4 ms 2892 KB Output is correct
276 Correct 4 ms 2892 KB Output is correct
277 Correct 4 ms 2892 KB Output is correct
278 Correct 5 ms 2892 KB Output is correct
279 Correct 4 ms 2944 KB Output is correct
280 Correct 80 ms 20404 KB Output is correct