oj.uz

답안 #219548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219548 2020-04-05T14:14:05 Z mode149256 항공 노선도 (JOI18_airline) C++14
100 / 100
 722 ms 31160 KB 
/*input

*/
#include <bits/stdc++.h>
#include "Alicelib.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

static unordered_map<int, int> sk = {
	{511, 1012},
	{767, 1013},
	{895, 1014},
	{959, 1016},
	{991, 1017},
	{1007, 1018},
	{1015, 1020},
	{1019, 1023},
	{1021, 1024},
	{1022, 1025},
};

void Alice( int N, int M, int A[], int B[] ) {
	for (int i = 0; i < N; ++i)
	{
		if (__builtin_popcount(i) != 9)
			sk[i] = i;
	}
	vpi edges;
	for (int i = 0; i < M; ++i) {
		edges.emplace_back(A[i], B[i]);
	}

	for (int i = 0; i < 9; ++i)
	{
		edges.emplace_back(N + i, N + i + 1);
	}
	for (int i = 0; i < N; ++i)
	{
		for (int j = 0; j < 10; ++j)
		{
			if ((sk[i] >> j) & 1)
				edges.emplace_back(i, N + j);
		}

		edges.emplace_back(N + 10, i);
	}

	for (int i = 0; i < N + 10; ++i)
		edges.emplace_back(N + 11, i);

	InitG( N + 12, (int)edges.size());

	for (int i = 0; i < (int)edges.size(); ++i)
	{
		// printf("%d %d\n", edges[i].x, edges[i].y);
		MakeG(i, edges[i].x, edges[i].y);
	}
}


/*input

*/
#include <bits/stdc++.h>
#include "Boblib.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

static unordered_map<int, int> sk = {
	{1012, 511},
	{1013, 767},
	{1014, 895},
	{1016, 959},
	{1017, 991},
	{1018, 1007},
	{1020, 1015},
	{1023, 1019},
	{1024, 1021},
	{1025, 1022},
};

void Bob( int V, int U, int C[], int D[] ) {
	// printf("IM IN BOB\n");
	int N = V - 12;
	vi kas(V, 0);
	vii edges(V);

	for (int i = 0; i < U; ++i)
	{
		edges[C[i]].emplace_back(D[i]);
		edges[D[i]].emplace_back(C[i]);
	}

	int n11 = -1;

	for (int i = 0; i < V; ++i)
	{
		if ((int)edges[i].size() == N + 10) {
			kas[i] = N + 11;
			n11 = i;
			break;
		}
	}

	int n10 = 0;
	{
		vb buvo(V, false);
		buvo[n11] = true;
		for (auto u : edges[n11])
			buvo[u] = true;

		for (int i = 0; i < V; ++i)
		{
			if (!buvo[i]) {
				n10 = i;
				kas[i] = N + 10;
			}
		}
	}

	vi pirmiN;
	// vi bitai;
	vi bit(10);

	vb bitas(V, true);
	{
		// vb buvo(V, false);
		bitas[n11] = false;
		bitas[n10] = false;
		for (auto u : edges[n10]) {
			pirmiN.emplace_back(u);
			bitas[u] = false;
		}

		vi sonai;
		for (int i = 0; i < V; ++i) {
			if (bitas[i]) {
				int cnt = 0;
				for (auto u : edges[i]) {
					if (bitas[u])
						cnt++;
				}

				if (cnt == 1)
					sonai.emplace_back(i);
			}
		}

		assert(sonai.size() == 2);
		int n0;
		if (edges[sonai[0]].size() > edges[sonai[1]].size())
			n0 = sonai[0];
		else
			n0 = sonai[1];

		kas[n0] = N + 0;
		bit[0] = n0;
		int curr = n0;
		bool ch = true;

		while (ch) {
			ch = false;
			for (auto u : edges[curr]) {
				if (bitas[u]) {
					bitas[curr] = false;
					kas[u] = kas[curr] + 1;
					bit[kas[u] - N] = u;
					curr = u;
					ch = true;
					break;
				}
			}
		}
	}

	bitas = vb(V, true);
	bitas[n11] = false;
	bitas[n10] = false;
	for (auto u : edges[n10]) {
		// pirmiN.emplace_back(u);
		bitas[u] = false;
	}

	{
		for (int i = 0; i < 10; ++i)
		{
			for (auto u : edges[bit[i]]) {
				if (bitas[u]) continue;

				kas[u] |= (1 << i);
			}
		}
	}
	// print(kas);
	// printf("ATS\n");
	vpi ats;
	for (int i = 0; i < U; ++i)
	{
		if (sk.count(kas[C[i]])) kas[C[i]] = sk[kas[C[i]]];
		if (sk.count(kas[D[i]])) kas[D[i]] = sk[kas[D[i]]];

		if (kas[C[i]] < N and kas[D[i]] < N) {
			// printf("%d %d\n", kas[C[i]], kas[D[i]]);
			ats.emplace_back(kas[C[i]], kas[D[i]]);
		}
	}

	InitMap( N, (int)ats.size());
	for (auto u : ats)
		MakeMap(u.x, u.y);
}

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6912 KB Output is correct
2 Correct 13 ms 6912 KB Output is correct
3 Correct 13 ms 6912 KB Output is correct
4 Correct 14 ms 6912 KB Output is correct
5 Correct 13 ms 6864 KB Output is correct
6 Correct 13 ms 6912 KB Output is correct
7 Correct 15 ms 6912 KB Output is correct
8 Correct 13 ms 6976 KB Output is correct
9 Correct 13 ms 6912 KB Output is correct
10 Correct 13 ms 6912 KB Output is correct
11 Correct 13 ms 6912 KB Output is correct
12 Correct 14 ms 6912 KB Output is correct
13 Correct 13 ms 6912 KB Output is correct
14 Correct 15 ms 6864 KB Output is correct
15 Correct 13 ms 6912 KB Output is correct
16 Correct 13 ms 6912 KB Output is correct
17 Correct 13 ms 6912 KB Output is correct
18 Correct 13 ms 6912 KB Output is correct
19 Correct 13 ms 7016 KB Output is correct
20 Correct 14 ms 6912 KB Output is correct
21 Correct 13 ms 6912 KB Output is correct
22 Correct 13 ms 6912 KB Output is correct
23 Correct 13 ms 6912 KB Output is correct
24 Correct 15 ms 6912 KB Output is correct
25 Correct 14 ms 6912 KB Output is correct
26 Correct 13 ms 6912 KB Output is correct
27 Correct 13 ms 6912 KB Output is correct
28 Correct 15 ms 6912 KB Output is correct
29 Correct 14 ms 6912 KB Output is correct
30 Correct 15 ms 6912 KB Output is correct
31 Correct 14 ms 6912 KB Output is correct
32 Correct 13 ms 6912 KB Output is correct
33 Correct 14 ms 6912 KB Output is correct
34 Correct 13 ms 6912 KB Output is correct
35 Correct 13 ms 6912 KB Output is correct
36 Correct 13 ms 6912 KB Output is correct
37 Correct 13 ms 6912 KB Output is correct
38 Correct 13 ms 6912 KB Output is correct
39 Correct 14 ms 6912 KB Output is correct
40 Correct 14 ms 6912 KB Output is correct
41 Correct 15 ms 7016 KB Output is correct
42 Correct 13 ms 6912 KB Output is correct
43 Correct 13 ms 6912 KB Output is correct
44 Correct 13 ms 6656 KB Output is correct
45 Correct 14 ms 6912 KB Output is correct
46 Correct 13 ms 6912 KB Output is correct
47 Correct 13 ms 6912 KB Output is correct
48 Correct 13 ms 6912 KB Output is correct
49 Correct 13 ms 6912 KB Output is correct
50 Correct 13 ms 6912 KB Output is correct
51 Correct 13 ms 6912 KB Output is correct
52 Correct 13 ms 6912 KB Output is correct
53 Correct 13 ms 6912 KB Output is correct
54 Correct 13 ms 6912 KB Output is correct
55 Correct 13 ms 6912 KB Output is correct
56 Correct 13 ms 6912 KB Output is correct
57 Correct 13 ms 6912 KB Output is correct
58 Correct 13 ms 6912 KB Output is correct
59 Correct 13 ms 6912 KB Output is correct
60 Correct 13 ms 6912 KB Output is correct
61 Correct 13 ms 6912 KB Output is correct
62 Correct 13 ms 6912 KB Output is correct
63 Correct 13 ms 6912 KB Output is correct
64 Correct 15 ms 6912 KB Output is correct
65 Correct 14 ms 6912 KB Output is correct
66 Correct 13 ms 6912 KB Output is correct
67 Correct 13 ms 6912 KB Output is correct
68 Correct 13 ms 6912 KB Output is correct
69 Correct 13 ms 6912 KB Output is correct
70 Correct 13 ms 6912 KB Output is correct
71 Correct 14 ms 6912 KB Output is correct
72 Correct 14 ms 6912 KB Output is correct
73 Correct 13 ms 6912 KB Output is correct
74 Correct 13 ms 6912 KB Output is correct
75 Correct 13 ms 6912 KB Output is correct
76 Correct 13 ms 6912 KB Output is correct
77 Correct 13 ms 6912 KB Output is correct
78 Correct 13 ms 6912 KB Output is correct
79 Correct 13 ms 6912 KB Output is correct
80 Correct 13 ms 6912 KB Output is correct
81 Correct 13 ms 6912 KB Output is correct
82 Correct 13 ms 6912 KB Output is correct
83 Correct 13 ms 6912 KB Output is correct
84 Correct 13 ms 6912 KB Output is correct
85 Correct 15 ms 7016 KB Output is correct
86 Correct 13 ms 6912 KB Output is correct
87 Correct 13 ms 6912 KB Output is correct
88 Correct 13 ms 6912 KB Output is correct
89 Correct 14 ms 6760 KB Output is correct
90 Correct 13 ms 6912 KB Output is correct
91 Correct 13 ms 6912 KB Output is correct
92 Correct 13 ms 6912 KB Output is correct
93 Correct 14 ms 6912 KB Output is correct
94 Correct 13 ms 6912 KB Output is correct
95 Correct 13 ms 6912 KB Output is correct
96 Correct 13 ms 6912 KB Output is correct
97 Correct 13 ms 6912 KB Output is correct
98 Correct 14 ms 6912 KB Output is correct
99 Correct 13 ms 6912 KB Output is correct
100 Correct 13 ms 6912 KB Output is correct
101 Correct 13 ms 6912 KB Output is correct
102 Correct 14 ms 6912 KB Output is correct
103 Correct 13 ms 6912 KB Output is correct
104 Correct 13 ms 6912 KB Output is correct
105 Correct 13 ms 6912 KB Output is correct
106 Correct 13 ms 6912 KB Output is correct
107 Correct 13 ms 6912 KB Output is correct
108 Correct 13 ms 6912 KB Output is correct
109 Correct 13 ms 6912 KB Output is correct
110 Correct 14 ms 6912 KB Output is correct
111 Correct 13 ms 6912 KB Output is correct
112 Correct 13 ms 6912 KB Output is correct
113 Correct 13 ms 6912 KB Output is correct
114 Correct 13 ms 6912 KB Output is correct
115 Correct 14 ms 6912 KB Output is correct
116 Correct 13 ms 6912 KB Output is correct
117 Correct 13 ms 6912 KB Output is correct
118 Correct 13 ms 6912 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 683 ms 30968 KB Output is correct : V - N = 12
2 Correct 544 ms 26084 KB Output is correct : V - N = 12
3 Correct 215 ms 14296 KB Output is correct : V - N = 12
4 Correct 23 ms 7528 KB Output is correct : V - N = 12
5 Correct 147 ms 11488 KB Output is correct : V - N = 12
6 Correct 463 ms 23884 KB Output is correct : V - N = 12
7 Correct 671 ms 30656 KB Output is correct : V - N = 12
8 Correct 611 ms 27848 KB Output is correct : V - N = 12
9 Correct 304 ms 17616 KB Output is correct : V - N = 12
10 Correct 45 ms 8440 KB Output is correct : V - N = 12
11 Correct 81 ms 9440 KB Output is correct : V - N = 12
12 Correct 363 ms 19112 KB Output is correct : V - N = 12
13 Correct 656 ms 29128 KB Output is correct : V - N = 12
14 Correct 681 ms 29640 KB Output is correct : V - N = 12
15 Correct 416 ms 22740 KB Output is correct : V - N = 12
16 Correct 110 ms 10208 KB Output is correct : V - N = 12
17 Correct 32 ms 7936 KB Output is correct : V - N = 12
18 Correct 259 ms 15824 KB Output is correct : V - N = 12
19 Correct 574 ms 26976 KB Output is correct : V - N = 12
20 Correct 690 ms 30616 KB Output is correct : V - N = 12
21 Correct 188 ms 13384 KB Output is correct : V - N = 12
22 Correct 145 ms 11992 KB Output is correct : V - N = 12
23 Correct 68 ms 9184 KB Output is correct : V - N = 12
24 Correct 19 ms 7168 KB Output is correct : V - N = 12
25 Correct 38 ms 8328 KB Output is correct : V - N = 12
26 Correct 119 ms 11224 KB Output is correct : V - N = 12
27 Correct 191 ms 13272 KB Output is correct : V - N = 12
28 Correct 178 ms 12760 KB Output is correct : V - N = 12
29 Correct 89 ms 9952 KB Output is correct : V - N = 12
30 Correct 19 ms 7536 KB Output is correct : V - N = 12
31 Correct 19 ms 7424 KB Output is correct : V - N = 12
32 Correct 20 ms 7424 KB Output is correct : V - N = 12
33 Correct 19 ms 7424 KB Output is correct : V - N = 12
34 Correct 18 ms 7424 KB Output is correct : V - N = 12
35 Correct 19 ms 7424 KB Output is correct : V - N = 12
36 Correct 711 ms 31128 KB Output is correct : V - N = 12
37 Correct 689 ms 30960 KB Output is correct : V - N = 12
38 Correct 673 ms 31008 KB Output is correct : V - N = 12
39 Correct 691 ms 31160 KB Output is correct : V - N = 12
40 Correct 722 ms 30960 KB Output is correct : V - N = 12
41 Correct 134 ms 11224 KB Output is correct : V - N = 12
42 Correct 103 ms 10456 KB Output is correct : V - N = 12
43 Correct 124 ms 10968 KB Output is correct : V - N = 12
44 Correct 20 ms 7544 KB Output is correct : V - N = 12
45 Correct 77 ms 9440 KB Output is correct : V - N = 12
46 Correct 239 ms 15064 KB Output is correct : V - N = 12
47 Correct 133 ms 11224 KB Output is correct : V - N = 12
48 Correct 311 ms 18136 KB Output is correct : V - N = 12
49 Correct 66 ms 9248 KB Output is correct : V - N = 12
50 Correct 32 ms 7936 KB Output is correct : V - N = 12
51 Correct 542 ms 26092 KB Output is correct : V - N = 12
52 Correct 22 ms 7528 KB Output is correct : V - N = 12
53 Correct 441 ms 23684 KB Output is correct : V - N = 12
54 Correct 660 ms 27784 KB Output is correct : V - N = 12
55 Correct 44 ms 8424 KB Output is correct : V - N = 12
56 Correct 351 ms 18896 KB Output is correct : V - N = 12
57 Correct 636 ms 29528 KB Output is correct : V - N = 12
58 Correct 95 ms 10464 KB Output is correct : V - N = 12
59 Correct 265 ms 15568 KB Output is correct : V - N = 12
60 Correct 665 ms 29896 KB Output is correct : V - N = 12
61 Correct 14 ms 6912 KB Output is correct : V - N = 12
62 Correct 15 ms 6912 KB Output is correct : V - N = 12
63 Correct 13 ms 6912 KB Output is correct : V - N = 12
64 Correct 14 ms 6912 KB Output is correct : V - N = 12
65 Correct 13 ms 6912 KB Output is correct : V - N = 12
66 Correct 15 ms 6912 KB Output is correct : V - N = 12
67 Correct 17 ms 6912 KB Output is correct : V - N = 12
68 Correct 16 ms 6912 KB Output is correct : V - N = 12
69 Correct 13 ms 6912 KB Output is correct : V - N = 12
70 Correct 15 ms 6912 KB Output is correct : V - N = 12
71 Correct 17 ms 6912 KB Output is correct : V - N = 12
72 Correct 14 ms 6912 KB Output is correct : V - N = 12
73 Correct 13 ms 6912 KB Output is correct : V - N = 12
74 Correct 15 ms 6912 KB Output is correct : V - N = 12
75 Correct 14 ms 6912 KB Output is correct : V - N = 12
76 Correct 14 ms 6912 KB Output is correct : V - N = 12
77 Correct 14 ms 6912 KB Output is correct : V - N = 12
78 Correct 15 ms 6912 KB Output is correct : V - N = 12
79 Correct 13 ms 6912 KB Output is correct : V - N = 12
80 Correct 14 ms 6912 KB Output is correct : V - N = 12
81 Correct 13 ms 6912 KB Output is correct : V - N = 12
82 Correct 14 ms 6912 KB Output is correct : V - N = 12
83 Correct 14 ms 6912 KB Output is correct : V - N = 12
84 Correct 13 ms 6864 KB Output is correct : V - N = 12
85 Correct 13 ms 6912 KB Output is correct : V - N = 12
86 Correct 15 ms 6912 KB Output is correct : V - N = 12
87 Correct 15 ms 6912 KB Output is correct : V - N = 12
88 Correct 15 ms 6912 KB Output is correct : V - N = 12
89 Correct 13 ms 6912 KB Output is correct : V - N = 12
90 Correct 13 ms 6912 KB Output is correct : V - N = 12
91 Correct 13 ms 6912 KB Output is correct : V - N = 12
92 Correct 13 ms 6912 KB Output is correct : V - N = 12
93 Correct 13 ms 6912 KB Output is correct : V - N = 12
94 Correct 13 ms 6912 KB Output is correct : V - N = 12
95 Correct 13 ms 6912 KB Output is correct : V - N = 12
96 Correct 15 ms 6936 KB Output is correct : V - N = 12
97 Correct 17 ms 6912 KB Output is correct : V - N = 12
98 Correct 16 ms 6912 KB Output is correct : V - N = 12
99 Correct 16 ms 6976 KB Output is correct : V - N = 12
100 Correct 13 ms 6912 KB Output is correct : V - N = 12
101 Correct 13 ms 6912 KB Output is correct : V - N = 12
102 Correct 14 ms 6912 KB Output is correct : V - N = 12
103 Correct 13 ms 6912 KB Output is correct : V - N = 12
104 Correct 15 ms 6912 KB Output is correct : V - N = 12
105 Correct 14 ms 6912 KB Output is correct : V - N = 12
106 Correct 13 ms 6912 KB Output is correct : V - N = 12
107 Correct 14 ms 6760 KB Output is correct : V - N = 12
108 Correct 15 ms 6912 KB Output is correct : V - N = 12
109 Correct 14 ms 6912 KB Output is correct : V - N = 12
110 Correct 13 ms 6912 KB Output is correct : V - N = 12
111 Correct 13 ms 6912 KB Output is correct : V - N = 12
112 Correct 13 ms 6912 KB Output is correct : V - N = 12
113 Correct 16 ms 6912 KB Output is correct : V - N = 12
114 Correct 13 ms 6912 KB Output is correct : V - N = 12
115 Correct 13 ms 6912 KB Output is correct : V - N = 12
116 Correct 13 ms 6912 KB Output is correct : V - N = 12
117 Correct 13 ms 6912 KB Output is correct : V - N = 12
118 Correct 13 ms 6912 KB Output is correct : V - N = 12
119 Correct 13 ms 6912 KB Output is correct : V - N = 12
120 Correct 14 ms 6912 KB Output is correct : V - N = 12
121 Correct 13 ms 6912 KB Output is correct : V - N = 12
122 Correct 13 ms 6912 KB Output is correct : V - N = 12
123 Correct 14 ms 6912 KB Output is correct : V - N = 12
124 Correct 13 ms 6912 KB Output is correct : V - N = 12
125 Correct 14 ms 6912 KB Output is correct : V - N = 12
126 Correct 14 ms 6912 KB Output is correct : V - N = 12
127 Correct 13 ms 6912 KB Output is correct : V - N = 12
128 Correct 14 ms 6912 KB Output is correct : V - N = 12
129 Correct 13 ms 6912 KB Output is correct : V - N = 12
130 Correct 14 ms 6912 KB Output is correct : V - N = 12
131 Correct 13 ms 6912 KB Output is correct : V - N = 12
132 Correct 13 ms 6912 KB Output is correct : V - N = 12
133 Correct 13 ms 6912 KB Output is correct : V - N = 12
134 Correct 13 ms 6912 KB Output is correct : V - N = 12
135 Correct 13 ms 6912 KB Output is correct : V - N = 12
136 Correct 13 ms 6912 KB Output is correct : V - N = 12
137 Correct 13 ms 6912 KB Output is correct : V - N = 12
138 Correct 15 ms 6912 KB Output is correct : V - N = 12
139 Correct 13 ms 6912 KB Output is correct : V - N = 12
140 Correct 13 ms 6912 KB Output is correct : V - N = 12
141 Correct 15 ms 6912 KB Output is correct : V - N = 12
142 Correct 13 ms 6912 KB Output is correct : V - N = 12
143 Correct 14 ms 6912 KB Output is correct : V - N = 12
144 Correct 14 ms 6912 KB Output is correct : V - N = 12
145 Correct 18 ms 6752 KB Output is correct : V - N = 12
146 Correct 14 ms 6752 KB Output is correct : V - N = 12
147 Correct 16 ms 6912 KB Output is correct : V - N = 12
148 Correct 15 ms 7008 KB Output is correct : V - N = 12
149 Correct 14 ms 6912 KB Output is correct : V - N = 12
150 Correct 14 ms 6912 KB Output is correct : V - N = 12
151 Correct 13 ms 6656 KB Output is correct : V - N = 12
152 Correct 15 ms 6912 KB Output is correct : V - N = 12
153 Correct 13 ms 6656 KB Output is correct : V - N = 12
154 Correct 15 ms 6656 KB Output is correct : V - N = 12
155 Correct 13 ms 6912 KB Output is correct : V - N = 12
156 Correct 13 ms 6912 KB Output is correct : V - N = 12
157 Correct 13 ms 6800 KB Output is correct : V - N = 12
158 Correct 14 ms 6912 KB Output is correct : V - N = 12
159 Correct 14 ms 6912 KB Output is correct : V - N = 12
160 Correct 13 ms 6912 KB Output is correct : V - N = 12
161 Correct 13 ms 6912 KB Output is correct : V - N = 12
162 Correct 13 ms 6912 KB Output is correct : V - N = 12
163 Correct 13 ms 6912 KB Output is correct : V - N = 12
164 Correct 13 ms 7016 KB Output is correct : V - N = 12
165 Correct 13 ms 6912 KB Output is correct : V - N = 12
166 Correct 13 ms 6912 KB Output is correct : V - N = 12
167 Correct 13 ms 6912 KB Output is correct : V - N = 12
168 Correct 14 ms 6912 KB Output is correct : V - N = 12
169 Correct 13 ms 6912 KB Output is correct : V - N = 12
170 Correct 13 ms 6912 KB Output is correct : V - N = 12
171 Correct 13 ms 6912 KB Output is correct : V - N = 12
172 Correct 15 ms 6912 KB Output is correct : V - N = 12
173 Correct 13 ms 6912 KB Output is correct : V - N = 12
174 Correct 15 ms 6912 KB Output is correct : V - N = 12
175 Correct 13 ms 6912 KB Output is correct : V - N = 12
176 Correct 13 ms 6912 KB Output is correct : V - N = 12
177 Correct 14 ms 6912 KB Output is correct : V - N = 12
178 Correct 16 ms 6912 KB Output is correct : V - N = 12