oj.uz

Submission #380247

# Submission time Handle Problem Language Result Execution time Memory
380247 2021-03-20T16:55:23 Z rqi Airline Route Map (JOI18_airline) C++14
100 / 100
 879 ms 27728 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;

#define mp make_pair
#define f first
#define s second
#define pb push_back

#define sz(x) (int)(x).size()

static vpi eds;
static int deg[1505];

static vi rand_nums = []() {
	srand(10);
	vi ans;
	for(int i = 0; i < 1500; i++) ans.pb(rand()%2);
	return ans;
}();

static bool hashDeg(int a){
	return rand_nums[a];
}

void Alice( int N, int M, int A[], int B[]){
	eds.clear();
	for(int i = 0; i < 1505; i++){
		deg[i] = 0;
	}

	for(int i = 0; i < M; i++){
		eds.pb(mp(A[i], B[i]));
	}
	for(int i = 0; i < N; i++){
		for(int j = 0; j < 10; j++){
			if((i>>j)&1){
				eds.pb(mp(i, N+j));
			}
		}
	}

	vpi tree_eds = vpi{mp(0, 1), mp(0, 2), mp(2, 3), mp(0, 4), mp(4, 5), mp(5, 6), mp(6, 7), mp(7, 8), mp(8, 9)};

	for(auto u: tree_eds){
		eds.pb(mp(N+u.f, N+u.s));
	}

	// for(int j = 0; j < 10; j++){
	// 	eds.pb(mp(N+j, N+11));
	// }

	for(auto u: eds){
		deg[u.f]++;
		deg[u.s]++;
	}

	for(int i = 0; i < N+10; i++){
		if((hashDeg(deg[i]))^((i >= N)&(i <= N+9))){
			eds.pb(mp(i, N+10));
		}
	}

	InitG(N+11, sz(eds));

	// cout << "nodes: " << N+12 << "\n";
	// cout << "Actual graph: " << "\n";
	for(int i = 0; i < sz(eds); i++){
		MakeG(i, eds[i].f, eds[i].s);
		// cout << eds[i].f << " " << eds[i].s << "\n";
	}
}


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

typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;

#define mp make_pair
#define f first
#define s second
#define pb push_back
#define all(x) begin(x), end(x)

#define sz(x) (int)(x).size()

static bool adj[1505][1505];
static int deg[1505];
static int original_ind[1505];
static bool pres[1505];
static vi small_adj[10];

static vi checkSmall(vpi small_eds){
	// cout << "checkSmall(";
	// for(auto u: small_eds){
	// 	cout << u.f << " " << u.s << "\n";
	// }
	// cout << ")" << "\n";

	if(sz(small_eds) != 9) return vi{};
	for(auto u: small_eds){
		assert(0 <= u.f && u.s <= 9);
	}

	int cen = -1;
	for(int i = 0; i < 10; i++){
		small_adj[i].clear();
	}
	for(auto u: small_eds){
		small_adj[u.f].pb(u.s);
		small_adj[u.s].pb(u.f);
	}

	for(int i = 0; i < 10; i++){
		if(sz(small_adj[i]) == 3){
			if(cen == -1){
				cen = i;
			}
			else{
				cen = -2;
			}
		}
	}

	if(cen < 0) return vi{};

	//cout << "cen: " << cen << "\n";

	vector<pair<int, vi>> branches;

	bool works = 1;
	for(auto node: small_adj[cen]){
		vi branch;
		int last_node = cen;
		while(true){
			if(node == cen){ //cycle
				works = 0;
				break;
			}

			branch.pb(node);
			if(sz(small_adj[node]) == 1) break;
			if(sz(small_adj[node]) != 2){
				works = 0;
				break;
			}

			if(small_adj[node][0] == last_node){
				last_node = node;
				node = small_adj[node][1];
			}
			else{
				last_node = node;
				node = small_adj[node][0];
			}
		}

		branches.pb(mp(sz(branch), branch));

		if(!works) break;
	}
	if(!works) return vi{};
	
	sort(all(branches));
	if(sz(branches) != 3 || branches[0].f != 1 || branches[1].f != 2 || branches[2].f != 6) return vi{};

	vi res(10, 0);
	res[0] = cen;
	int cur = 0;
	for(auto &u: branches){
		for(auto &x: u.s){
			res[++cur] = x;
		}
	}

	// cout << "res: ";
	// for(auto u: res){
	// 	cout << u << " ";
	// }
	// cout << "\n";
	return res;
}

static vi rand_nums = []() {
	srand(10);
	vi ans;
	for(int i = 0; i < 1500; i++) ans.pb(rand()%2);
	return ans;
}();

static bool hashDeg(int a){
	return rand_nums[a];
}

void Bob( int V, int U, int C[], int D[]){

	for(int i = 0; i < 1505; i++){
		for(int j = 0; j < 1505; j++){
			adj[i][j] = 0;
		}
	}
	for(int i = 0; i < 1505; i++){
		deg[i] = 0;
		original_ind[i] = 0;
	}

	int N = V-11;

	//cout << "encrypted graph: " << "\n";
	for(int i = 0; i < U; i++){
		adj[C[i]][D[i]] = 1;
		adj[D[i]][C[i]] = 1;
		deg[C[i]]++; deg[D[i]]++;
		//cout << C[i] << " " << D[i] << "\n";
	}

	vector<pair<int, vi>> bin_cands;

	for(int spec_node = 0; spec_node < V; spec_node++){
		vi dif_nodes;

		for(int i = 0; i < V; i++){
			if(spec_node == i) continue;
			if(adj[i][spec_node]){
				deg[i]--;
			}
		}

		for(int i = 0; i < V; i++){
			if(spec_node == i) continue;
			bool is_dif = 0;
			if(adj[i][spec_node]){
				is_dif^=1;
			}
			if(hashDeg(deg[i])){
				is_dif^=1;
			}

			if(is_dif){
				dif_nodes.pb(i);
			}
		}

		for(int i = 0; i < V; i++){
			if(spec_node == i) continue;
			if(adj[i][spec_node]){
				deg[i]++;
			}
		}

		if(sz(dif_nodes) == 10){
			bin_cands.pb(mp(spec_node, dif_nodes));
		}
	}

	vpi ans;

	for(auto x: bin_cands){
		//cout << "spec node: " << x.f << "\n";
		vi bins = x.s;
		// cout << "bins: " << "\n";
		// for(auto u: bins){
		// 	cout << u << " ";
		// }
		// cout << "\n";
		vpi small_eds;
		for(int i = 0; i < sz(bins); i++){
			for(int j = i+1; j < sz(bins); j++){
				if(adj[bins[i]][bins[j]]){
					small_eds.pb(mp(i, j));
				}
			}
		}



		vi res = checkSmall(small_eds); //bins[res[i]] is original node N+i

		if(sz(res) == 0) continue;


		// int add_node = -1;
		// for(int i = 0; i < V; i++){
		// 	if(i == x.f) continue;

			
		// 	bool is_add_node = 1;

		// 	for(int j = 0; j < 10; j++){
		// 		if(bins[j] == i){
		// 			is_add_node = 0;
		// 			break;
		// 		}
		// 		if(!adj[i][bins[j]]){
		// 			is_add_node = 0;
		// 			break;
		// 		}
		// 	}

		// 	if(adj[x.f][i]) deg[i]--;
		// 	if(deg[i] != 10){
		// 		is_add_node = 0;
		// 	}
		// 	if(adj[x.f][i]) deg[i]++;
			
		// 	if(is_add_node){
		// 		if(add_node == -1){
		// 			add_node = i;
		// 		}
		// 		else{
		// 			add_node = -2;
		// 		}
		// 	}
		// }
		// if(add_node < 0){
		// 	continue;
		// }

		for(int i = 0; i < V; i++){
			original_ind[i] = 0;
		}

		for(int i = 0; i < 10; i++){
			for(int j = 0; j < V; j++){
				if(adj[bins[res[i]]][j]){
					original_ind[j]+=(1<<i);
				}
			}
		}
		original_ind[x.f] = -1;
		for(auto u: bins){
			original_ind[u] = -1;
		}

		for(int i = 0; i < N; i++){
			pres[i] = 0;
		}

		for(int i = 0; i < V; i++){
			if(original_ind[i] == -1) continue;
			if(0 <= original_ind[i] && original_ind[i] < N){
				pres[original_ind[i]] = 1;
			}
		}

		bool works = 1;
		for(int i = 0; i < N; i++){
			if(!pres[i]){
				works = 0;
				break;
			}
		}
		if(!works) continue;

		//cout << "FOUND CANDIDATE" << "\n";
		for(int i = 0; i < V; i++){
			for(int j = i+1; j < V; j++){
				if(original_ind[i] >= 0 && original_ind[j] >= 0){
					if(adj[i][j]){
						ans.pb(mp(original_ind[i], original_ind[j]));
					}
				}
			}
		}
		break;
	}

	InitMap(V-11, sz(ans));
	for(auto u: ans){
		MakeMap(u.f, u.s);
	}
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7212 KB Output is correct
2 Correct 7 ms 7136 KB Output is correct
3 Correct 8 ms 7008 KB Output is correct
4 Correct 8 ms 7008 KB Output is correct
5 Correct 8 ms 7008 KB Output is correct
6 Correct 8 ms 7220 KB Output is correct
7 Correct 7 ms 7008 KB Output is correct
8 Correct 8 ms 7008 KB Output is correct
9 Correct 9 ms 7008 KB Output is correct
10 Correct 8 ms 7008 KB Output is correct
11 Correct 8 ms 7220 KB Output is correct
12 Correct 9 ms 7008 KB Output is correct
13 Correct 8 ms 7008 KB Output is correct
14 Correct 8 ms 7008 KB Output is correct
15 Correct 9 ms 7212 KB Output is correct
16 Correct 9 ms 7008 KB Output is correct
17 Correct 9 ms 7220 KB Output is correct
18 Correct 7 ms 7008 KB Output is correct
19 Correct 8 ms 7212 KB Output is correct
20 Correct 8 ms 7008 KB Output is correct
21 Correct 8 ms 7136 KB Output is correct
22 Correct 7 ms 7136 KB Output is correct
23 Correct 8 ms 7212 KB Output is correct
24 Correct 7 ms 7136 KB Output is correct
25 Correct 8 ms 7220 KB Output is correct
26 Correct 8 ms 7136 KB Output is correct
27 Correct 8 ms 7008 KB Output is correct
28 Correct 8 ms 7008 KB Output is correct
29 Correct 9 ms 7212 KB Output is correct
30 Correct 9 ms 7136 KB Output is correct
31 Correct 8 ms 7220 KB Output is correct
32 Correct 8 ms 7228 KB Output is correct
33 Correct 8 ms 7268 KB Output is correct
34 Correct 8 ms 7136 KB Output is correct
35 Correct 9 ms 7136 KB Output is correct
36 Correct 8 ms 7008 KB Output is correct
37 Correct 8 ms 7136 KB Output is correct
38 Correct 8 ms 7008 KB Output is correct
39 Correct 8 ms 7136 KB Output is correct
40 Correct 8 ms 7148 KB Output is correct
41 Correct 10 ms 7212 KB Output is correct
42 Correct 8 ms 7136 KB Output is correct
43 Correct 8 ms 7136 KB Output is correct
44 Correct 7 ms 7228 KB Output is correct
45 Correct 7 ms 7136 KB Output is correct
46 Correct 9 ms 7136 KB Output is correct
47 Correct 8 ms 7152 KB Output is correct
48 Correct 7 ms 7136 KB Output is correct
49 Correct 8 ms 7212 KB Output is correct
50 Correct 8 ms 7008 KB Output is correct
51 Correct 8 ms 7008 KB Output is correct
52 Correct 11 ms 7136 KB Output is correct
53 Correct 7 ms 7008 KB Output is correct
54 Correct 8 ms 7008 KB Output is correct
55 Correct 10 ms 7212 KB Output is correct
56 Correct 9 ms 7136 KB Output is correct
57 Correct 9 ms 7212 KB Output is correct
58 Correct 9 ms 7220 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7212 KB Output is correct
2 Correct 7 ms 7136 KB Output is correct
3 Correct 8 ms 7008 KB Output is correct
4 Correct 8 ms 7008 KB Output is correct
5 Correct 8 ms 7008 KB Output is correct
6 Correct 8 ms 7220 KB Output is correct
7 Correct 7 ms 7008 KB Output is correct
8 Correct 8 ms 7008 KB Output is correct
9 Correct 9 ms 7008 KB Output is correct
10 Correct 8 ms 7008 KB Output is correct
11 Correct 8 ms 7220 KB Output is correct
12 Correct 9 ms 7008 KB Output is correct
13 Correct 8 ms 7008 KB Output is correct
14 Correct 8 ms 7008 KB Output is correct
15 Correct 9 ms 7212 KB Output is correct
16 Correct 9 ms 7008 KB Output is correct
17 Correct 9 ms 7220 KB Output is correct
18 Correct 7 ms 7008 KB Output is correct
19 Correct 8 ms 7212 KB Output is correct
20 Correct 8 ms 7008 KB Output is correct
21 Correct 8 ms 7136 KB Output is correct
22 Correct 7 ms 7136 KB Output is correct
23 Correct 8 ms 7212 KB Output is correct
24 Correct 7 ms 7136 KB Output is correct
25 Correct 8 ms 7220 KB Output is correct
26 Correct 8 ms 7136 KB Output is correct
27 Correct 8 ms 7008 KB Output is correct
28 Correct 8 ms 7008 KB Output is correct
29 Correct 9 ms 7212 KB Output is correct
30 Correct 9 ms 7136 KB Output is correct
31 Correct 8 ms 7220 KB Output is correct
32 Correct 8 ms 7228 KB Output is correct
33 Correct 8 ms 7268 KB Output is correct
34 Correct 8 ms 7136 KB Output is correct
35 Correct 9 ms 7136 KB Output is correct
36 Correct 8 ms 7008 KB Output is correct
37 Correct 8 ms 7136 KB Output is correct
38 Correct 8 ms 7008 KB Output is correct
39 Correct 8 ms 7136 KB Output is correct
40 Correct 8 ms 7148 KB Output is correct
41 Correct 10 ms 7212 KB Output is correct
42 Correct 8 ms 7136 KB Output is correct
43 Correct 8 ms 7136 KB Output is correct
44 Correct 7 ms 7228 KB Output is correct
45 Correct 7 ms 7136 KB Output is correct
46 Correct 9 ms 7136 KB Output is correct
47 Correct 8 ms 7152 KB Output is correct
48 Correct 7 ms 7136 KB Output is correct
49 Correct 8 ms 7212 KB Output is correct
50 Correct 8 ms 7008 KB Output is correct
51 Correct 8 ms 7008 KB Output is correct
52 Correct 11 ms 7136 KB Output is correct
53 Correct 7 ms 7008 KB Output is correct
54 Correct 8 ms 7008 KB Output is correct
55 Correct 10 ms 7212 KB Output is correct
56 Correct 9 ms 7136 KB Output is correct
57 Correct 9 ms 7212 KB Output is correct
58 Correct 9 ms 7220 KB Output is correct
59 Correct 9 ms 7008 KB Output is correct
60 Correct 10 ms 7088 KB Output is correct
61 Correct 10 ms 7204 KB Output is correct
62 Correct 8 ms 7008 KB Output is correct
63 Correct 8 ms 7208 KB Output is correct
64 Correct 9 ms 7136 KB Output is correct
65 Correct 9 ms 7192 KB Output is correct
66 Correct 9 ms 7136 KB Output is correct
67 Correct 8 ms 7136 KB Output is correct
68 Correct 8 ms 7136 KB Output is correct
69 Correct 8 ms 7212 KB Output is correct
70 Correct 8 ms 7204 KB Output is correct
71 Correct 9 ms 7008 KB Output is correct
72 Correct 9 ms 7136 KB Output is correct
73 Correct 9 ms 7208 KB Output is correct
74 Correct 8 ms 7220 KB Output is correct
75 Correct 9 ms 7136 KB Output is correct
76 Correct 8 ms 7156 KB Output is correct
77 Correct 9 ms 7008 KB Output is correct
78 Correct 9 ms 7264 KB Output is correct
79 Correct 8 ms 7264 KB Output is correct
80 Correct 8 ms 7008 KB Output is correct
81 Correct 9 ms 7136 KB Output is correct
82 Correct 8 ms 7212 KB Output is correct
83 Correct 8 ms 7008 KB Output is correct
84 Correct 9 ms 7244 KB Output is correct
85 Correct 9 ms 7208 KB Output is correct
86 Correct 8 ms 7200 KB Output is correct
87 Correct 8 ms 7204 KB Output is correct
88 Correct 8 ms 7136 KB Output is correct
89 Correct 8 ms 7136 KB Output is correct
90 Correct 9 ms 7136 KB Output is correct
91 Correct 8 ms 7136 KB Output is correct
92 Correct 8 ms 7008 KB Output is correct
93 Correct 8 ms 7220 KB Output is correct
94 Correct 10 ms 7008 KB Output is correct
95 Correct 9 ms 7136 KB Output is correct
96 Correct 9 ms 7008 KB Output is correct
97 Correct 8 ms 7192 KB Output is correct
98 Correct 9 ms 7136 KB Output is correct
99 Correct 8 ms 7008 KB Output is correct
100 Correct 9 ms 7008 KB Output is correct
101 Correct 8 ms 7008 KB Output is correct
102 Correct 8 ms 7008 KB Output is correct
103 Correct 8 ms 7252 KB Output is correct
104 Correct 8 ms 7008 KB Output is correct
105 Correct 8 ms 7136 KB Output is correct
106 Correct 8 ms 7136 KB Output is correct
107 Correct 8 ms 7136 KB Output is correct
108 Correct 9 ms 7136 KB Output is correct
109 Correct 9 ms 7136 KB Output is correct
110 Correct 9 ms 7136 KB Output is correct
111 Correct 8 ms 7136 KB Output is correct
112 Correct 9 ms 7136 KB Output is correct
113 Correct 9 ms 7136 KB Output is correct
114 Correct 9 ms 7204 KB Output is correct
115 Correct 8 ms 7008 KB Output is correct
116 Correct 8 ms 7136 KB Output is correct
117 Correct 8 ms 7008 KB Output is correct
118 Correct 8 ms 7008 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 730 ms 27576 KB Output is correct : V - N = 11
2 Correct 562 ms 23864 KB Output is correct : V - N = 11
3 Correct 292 ms 14352 KB Output is correct : V - N = 11
4 Correct 24 ms 7808 KB Output is correct : V - N = 11
5 Correct 169 ms 11292 KB Output is correct : V - N = 11
6 Correct 568 ms 21840 KB Output is correct : V - N = 11
7 Correct 686 ms 27416 KB Output is correct : V - N = 11
8 Correct 757 ms 25804 KB Output is correct : V - N = 11
9 Correct 359 ms 16636 KB Output is correct : V - N = 11
10 Correct 56 ms 8540 KB Output is correct : V - N = 11
11 Correct 86 ms 9460 KB Output is correct : V - N = 11
12 Correct 473 ms 17704 KB Output is correct : V - N = 11
13 Correct 756 ms 26312 KB Output is correct : V - N = 11
14 Correct 694 ms 26772 KB Output is correct : V - N = 11
15 Correct 548 ms 20768 KB Output is correct : V - N = 11
16 Correct 127 ms 10208 KB Output is correct : V - N = 11
17 Correct 35 ms 8004 KB Output is correct : V - N = 11
18 Correct 318 ms 15380 KB Output is correct : V - N = 11
19 Correct 728 ms 24736 KB Output is correct : V - N = 11
20 Correct 863 ms 27312 KB Output is correct : V - N = 11
21 Correct 254 ms 13100 KB Output is correct : V - N = 11
22 Correct 178 ms 11824 KB Output is correct : V - N = 11
23 Correct 69 ms 9164 KB Output is correct : V - N = 11
24 Correct 13 ms 7272 KB Output is correct : V - N = 11
25 Correct 54 ms 8408 KB Output is correct : V - N = 11
26 Correct 130 ms 11256 KB Output is correct : V - N = 11
27 Correct 193 ms 12588 KB Output is correct : V - N = 11
28 Correct 180 ms 12208 KB Output is correct : V - N = 11
29 Correct 87 ms 9896 KB Output is correct : V - N = 11
30 Correct 17 ms 7760 KB Output is correct : V - N = 11
31 Correct 23 ms 7264 KB Output is correct : V - N = 11
32 Correct 23 ms 7264 KB Output is correct : V - N = 11
33 Correct 23 ms 7300 KB Output is correct : V - N = 11
34 Correct 23 ms 7308 KB Output is correct : V - N = 11
35 Correct 23 ms 7264 KB Output is correct : V - N = 11
36 Correct 750 ms 27304 KB Output is correct : V - N = 11
37 Correct 702 ms 27728 KB Output is correct : V - N = 11
38 Correct 725 ms 27440 KB Output is correct : V - N = 11
39 Correct 738 ms 27644 KB Output is correct : V - N = 11
40 Correct 803 ms 27588 KB Output is correct : V - N = 11
41 Correct 156 ms 11364 KB Output is correct : V - N = 11
42 Correct 121 ms 10168 KB Output is correct : V - N = 11
43 Correct 170 ms 10948 KB Output is correct : V - N = 11
44 Correct 24 ms 7508 KB Output is correct : V - N = 11
45 Correct 93 ms 9472 KB Output is correct : V - N = 11
46 Correct 251 ms 15072 KB Output is correct : V - N = 11
47 Correct 140 ms 11228 KB Output is correct : V - N = 11
48 Correct 333 ms 16544 KB Output is correct : V - N = 11
49 Correct 82 ms 9296 KB Output is correct : V - N = 11
50 Correct 37 ms 7904 KB Output is correct : V - N = 11
51 Correct 539 ms 23796 KB Output is correct : V - N = 11
52 Correct 27 ms 7540 KB Output is correct : V - N = 11
53 Correct 545 ms 21580 KB Output is correct : V - N = 11
54 Correct 644 ms 25200 KB Output is correct : V - N = 11
55 Correct 63 ms 8412 KB Output is correct : V - N = 11
56 Correct 383 ms 17296 KB Output is correct : V - N = 11
57 Correct 691 ms 26456 KB Output is correct : V - N = 11
58 Correct 108 ms 10216 KB Output is correct : V - N = 11
59 Correct 371 ms 15188 KB Output is correct : V - N = 11
60 Correct 879 ms 26844 KB Output is correct : V - N = 11
61 Correct 8 ms 7264 KB Output is correct : V - N = 11
62 Correct 9 ms 7212 KB Output is correct : V - N = 11
63 Correct 8 ms 7008 KB Output is correct : V - N = 11
64 Correct 9 ms 7340 KB Output is correct : V - N = 11
65 Correct 8 ms 7136 KB Output is correct : V - N = 11
66 Correct 8 ms 7136 KB Output is correct : V - N = 11
67 Correct 9 ms 7192 KB Output is correct : V - N = 11
68 Correct 9 ms 7008 KB Output is correct : V - N = 11
69 Correct 8 ms 7008 KB Output is correct : V - N = 11
70 Correct 8 ms 7008 KB Output is correct : V - N = 11
71 Correct 8 ms 7008 KB Output is correct : V - N = 11
72 Correct 10 ms 7136 KB Output is correct : V - N = 11
73 Correct 9 ms 7196 KB Output is correct : V - N = 11
74 Correct 8 ms 7008 KB Output is correct : V - N = 11
75 Correct 8 ms 7136 KB Output is correct : V - N = 11
76 Correct 8 ms 7008 KB Output is correct : V - N = 11
77 Correct 9 ms 7136 KB Output is correct : V - N = 11
78 Correct 8 ms 7008 KB Output is correct : V - N = 11
79 Correct 9 ms 7008 KB Output is correct : V - N = 11
80 Correct 9 ms 7088 KB Output is correct : V - N = 11
81 Correct 8 ms 7364 KB Output is correct : V - N = 11
82 Correct 8 ms 7008 KB Output is correct : V - N = 11
83 Correct 8 ms 7136 KB Output is correct : V - N = 11
84 Correct 8 ms 7212 KB Output is correct : V - N = 11
85 Correct 9 ms 7008 KB Output is correct : V - N = 11
86 Correct 9 ms 7136 KB Output is correct : V - N = 11
87 Correct 8 ms 7008 KB Output is correct : V - N = 11
88 Correct 10 ms 7136 KB Output is correct : V - N = 11
89 Correct 8 ms 7332 KB Output is correct : V - N = 11
90 Correct 8 ms 7136 KB Output is correct : V - N = 11
91 Correct 8 ms 7136 KB Output is correct : V - N = 11
92 Correct 8 ms 7136 KB Output is correct : V - N = 11
93 Correct 8 ms 7392 KB Output is correct : V - N = 11
94 Correct 8 ms 7168 KB Output is correct : V - N = 11
95 Correct 9 ms 7136 KB Output is correct : V - N = 11
96 Correct 10 ms 7136 KB Output is correct : V - N = 11
97 Correct 8 ms 7008 KB Output is correct : V - N = 11
98 Correct 9 ms 7200 KB Output is correct : V - N = 11
99 Correct 8 ms 7008 KB Output is correct : V - N = 11
100 Correct 9 ms 7156 KB Output is correct : V - N = 11
101 Correct 8 ms 7200 KB Output is correct : V - N = 11
102 Correct 8 ms 7136 KB Output is correct : V - N = 11
103 Correct 8 ms 7008 KB Output is correct : V - N = 11
104 Correct 8 ms 7228 KB Output is correct : V - N = 11
105 Correct 8 ms 7136 KB Output is correct : V - N = 11
106 Correct 8 ms 7008 KB Output is correct : V - N = 11
107 Correct 8 ms 7136 KB Output is correct : V - N = 11
108 Correct 10 ms 7136 KB Output is correct : V - N = 11
109 Correct 9 ms 7136 KB Output is correct : V - N = 11
110 Correct 8 ms 7008 KB Output is correct : V - N = 11
111 Correct 8 ms 7200 KB Output is correct : V - N = 11
112 Correct 7 ms 7008 KB Output is correct : V - N = 11
113 Correct 8 ms 7008 KB Output is correct : V - N = 11
114 Correct 8 ms 7204 KB Output is correct : V - N = 11
115 Correct 9 ms 7136 KB Output is correct : V - N = 11
116 Correct 9 ms 7136 KB Output is correct : V - N = 11
117 Correct 10 ms 7008 KB Output is correct : V - N = 11
118 Correct 8 ms 7008 KB Output is correct : V - N = 11
119 Correct 8 ms 7204 KB Output is correct : V - N = 11
120 Correct 9 ms 7224 KB Output is correct : V - N = 11
121 Correct 8 ms 7008 KB Output is correct : V - N = 11
122 Correct 8 ms 7136 KB Output is correct : V - N = 11
123 Correct 7 ms 7220 KB Output is correct : V - N = 11
124 Correct 8 ms 7008 KB Output is correct : V - N = 11
125 Correct 9 ms 7212 KB Output is correct : V - N = 11
126 Correct 9 ms 7136 KB Output is correct : V - N = 11
127 Correct 8 ms 7008 KB Output is correct : V - N = 11
128 Correct 8 ms 7136 KB Output is correct : V - N = 11
129 Correct 8 ms 7136 KB Output is correct : V - N = 11
130 Correct 7 ms 7228 KB Output is correct : V - N = 11
131 Correct 8 ms 7136 KB Output is correct : V - N = 11
132 Correct 8 ms 7008 KB Output is correct : V - N = 11
133 Correct 8 ms 7284 KB Output is correct : V - N = 11
134 Correct 8 ms 7136 KB Output is correct : V - N = 11
135 Correct 8 ms 7264 KB Output is correct : V - N = 11
136 Correct 8 ms 7136 KB Output is correct : V - N = 11
137 Correct 8 ms 7136 KB Output is correct : V - N = 11
138 Correct 7 ms 7212 KB Output is correct : V - N = 11
139 Correct 8 ms 7008 KB Output is correct : V - N = 11
140 Correct 8 ms 7008 KB Output is correct : V - N = 11
141 Correct 8 ms 7340 KB Output is correct : V - N = 11
142 Correct 8 ms 7104 KB Output is correct : V - N = 11
143 Correct 10 ms 7136 KB Output is correct : V - N = 11
144 Correct 8 ms 7136 KB Output is correct : V - N = 11
145 Correct 7 ms 7008 KB Output is correct : V - N = 11
146 Correct 8 ms 7212 KB Output is correct : V - N = 11
147 Correct 7 ms 7212 KB Output is correct : V - N = 11
148 Correct 7 ms 7212 KB Output is correct : V - N = 11
149 Correct 8 ms 7136 KB Output is correct : V - N = 11
150 Correct 8 ms 7008 KB Output is correct : V - N = 11
151 Correct 8 ms 7008 KB Output is correct : V - N = 11
152 Correct 9 ms 7348 KB Output is correct : V - N = 11
153 Correct 8 ms 7136 KB Output is correct : V - N = 11
154 Correct 9 ms 7228 KB Output is correct : V - N = 11
155 Correct 8 ms 7156 KB Output is correct : V - N = 11
156 Correct 7 ms 7284 KB Output is correct : V - N = 11
157 Correct 8 ms 7136 KB Output is correct : V - N = 11
158 Correct 8 ms 7136 KB Output is correct : V - N = 11
159 Correct 8 ms 7136 KB Output is correct : V - N = 11
160 Correct 8 ms 7136 KB Output is correct : V - N = 11
161 Correct 8 ms 7220 KB Output is correct : V - N = 11
162 Correct 8 ms 7220 KB Output is correct : V - N = 11
163 Correct 8 ms 7212 KB Output is correct : V - N = 11
164 Correct 9 ms 7008 KB Output is correct : V - N = 11
165 Correct 8 ms 7008 KB Output is correct : V - N = 11
166 Correct 8 ms 7136 KB Output is correct : V - N = 11
167 Correct 8 ms 7008 KB Output is correct : V - N = 11
168 Correct 8 ms 7136 KB Output is correct : V - N = 11
169 Correct 8 ms 7136 KB Output is correct : V - N = 11
170 Correct 8 ms 7220 KB Output is correct : V - N = 11
171 Correct 8 ms 7136 KB Output is correct : V - N = 11
172 Correct 8 ms 7008 KB Output is correct : V - N = 11
173 Correct 8 ms 7008 KB Output is correct : V - N = 11
174 Correct 9 ms 7136 KB Output is correct : V - N = 11
175 Correct 8 ms 7212 KB Output is correct : V - N = 11
176 Correct 8 ms 7008 KB Output is correct : V - N = 11
177 Correct 8 ms 7136 KB Output is correct : V - N = 11
178 Correct 8 ms 7008 KB Output is correct : V - N = 11