oj.uz

답안 #380238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
380238 2021-03-20T16:36:16 Z rqi 항공 노선도 (JOI18_airline) C++14
100 / 100
 916 ms 27656 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pi;
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];

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+12; i++){
		if(i == N+10) continue;
		if((deg[i] % 3 == 1)^((i >= N)&(i <= N+9))){
			eds.pb(mp(i, N+10));
		}
	}

	InitG(N+12, 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;
}

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-12;

	//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(deg[i] % 3 == 1){
				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;
		original_ind[add_node] = -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-12, sz(ans));
	for(auto u: ans){
		MakeMap(u.f, u.s);
	}
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7008 KB Output is correct
2 Correct 9 ms 7216 KB Output is correct
3 Correct 7 ms 7008 KB Output is correct
4 Correct 8 ms 7052 KB Output is correct
5 Correct 8 ms 7296 KB Output is correct
6 Correct 8 ms 7264 KB Output is correct
7 Correct 8 ms 7224 KB Output is correct
8 Correct 8 ms 7008 KB Output is correct
9 Correct 8 ms 7232 KB Output is correct
10 Correct 8 ms 7136 KB Output is correct
11 Correct 8 ms 7072 KB Output is correct
12 Correct 7 ms 7224 KB Output is correct
13 Correct 8 ms 7224 KB Output is correct
14 Correct 7 ms 7008 KB Output is correct
15 Correct 8 ms 7216 KB Output is correct
16 Correct 8 ms 7164 KB Output is correct
17 Correct 8 ms 7008 KB Output is correct
18 Correct 8 ms 7008 KB Output is correct
19 Correct 8 ms 7008 KB Output is correct
20 Correct 8 ms 7008 KB Output is correct
21 Correct 8 ms 7136 KB Output is correct
22 Correct 8 ms 7136 KB Output is correct
23 Correct 8 ms 7008 KB Output is correct
24 Correct 9 ms 7232 KB Output is correct
25 Correct 7 ms 7136 KB Output is correct
26 Correct 8 ms 7224 KB Output is correct
27 Correct 8 ms 7136 KB Output is correct
28 Correct 7 ms 7224 KB Output is correct
29 Correct 8 ms 7352 KB Output is correct
30 Correct 8 ms 7008 KB Output is correct
31 Correct 8 ms 7232 KB Output is correct
32 Correct 8 ms 7008 KB Output is correct
33 Correct 9 ms 7252 KB Output is correct
34 Correct 9 ms 7360 KB Output is correct
35 Correct 8 ms 7232 KB Output is correct
36 Correct 8 ms 7008 KB Output is correct
37 Correct 8 ms 7008 KB Output is correct
38 Correct 8 ms 7216 KB Output is correct
39 Correct 9 ms 7136 KB Output is correct
40 Correct 8 ms 7008 KB Output is correct
41 Correct 8 ms 7008 KB Output is correct
42 Correct 8 ms 7264 KB Output is correct
43 Correct 8 ms 7184 KB Output is correct
44 Correct 9 ms 7232 KB Output is correct
45 Correct 8 ms 7232 KB Output is correct
46 Correct 8 ms 7008 KB Output is correct
47 Correct 8 ms 7168 KB Output is correct
48 Correct 8 ms 7224 KB Output is correct
49 Correct 8 ms 7008 KB Output is correct
50 Correct 8 ms 7232 KB Output is correct
51 Correct 8 ms 7300 KB Output is correct
52 Correct 9 ms 7224 KB Output is correct
53 Correct 9 ms 7008 KB Output is correct
54 Correct 8 ms 7136 KB Output is correct
55 Correct 8 ms 7008 KB Output is correct
56 Correct 8 ms 7008 KB Output is correct
57 Correct 8 ms 7224 KB Output is correct
58 Correct 8 ms 7136 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7008 KB Output is correct
2 Correct 9 ms 7216 KB Output is correct
3 Correct 7 ms 7008 KB Output is correct
4 Correct 8 ms 7052 KB Output is correct
5 Correct 8 ms 7296 KB Output is correct
6 Correct 8 ms 7264 KB Output is correct
7 Correct 8 ms 7224 KB Output is correct
8 Correct 8 ms 7008 KB Output is correct
9 Correct 8 ms 7232 KB Output is correct
10 Correct 8 ms 7136 KB Output is correct
11 Correct 8 ms 7072 KB Output is correct
12 Correct 7 ms 7224 KB Output is correct
13 Correct 8 ms 7224 KB Output is correct
14 Correct 7 ms 7008 KB Output is correct
15 Correct 8 ms 7216 KB Output is correct
16 Correct 8 ms 7164 KB Output is correct
17 Correct 8 ms 7008 KB Output is correct
18 Correct 8 ms 7008 KB Output is correct
19 Correct 8 ms 7008 KB Output is correct
20 Correct 8 ms 7008 KB Output is correct
21 Correct 8 ms 7136 KB Output is correct
22 Correct 8 ms 7136 KB Output is correct
23 Correct 8 ms 7008 KB Output is correct
24 Correct 9 ms 7232 KB Output is correct
25 Correct 7 ms 7136 KB Output is correct
26 Correct 8 ms 7224 KB Output is correct
27 Correct 8 ms 7136 KB Output is correct
28 Correct 7 ms 7224 KB Output is correct
29 Correct 8 ms 7352 KB Output is correct
30 Correct 8 ms 7008 KB Output is correct
31 Correct 8 ms 7232 KB Output is correct
32 Correct 8 ms 7008 KB Output is correct
33 Correct 9 ms 7252 KB Output is correct
34 Correct 9 ms 7360 KB Output is correct
35 Correct 8 ms 7232 KB Output is correct
36 Correct 8 ms 7008 KB Output is correct
37 Correct 8 ms 7008 KB Output is correct
38 Correct 8 ms 7216 KB Output is correct
39 Correct 9 ms 7136 KB Output is correct
40 Correct 8 ms 7008 KB Output is correct
41 Correct 8 ms 7008 KB Output is correct
42 Correct 8 ms 7264 KB Output is correct
43 Correct 8 ms 7184 KB Output is correct
44 Correct 9 ms 7232 KB Output is correct
45 Correct 8 ms 7232 KB Output is correct
46 Correct 8 ms 7008 KB Output is correct
47 Correct 8 ms 7168 KB Output is correct
48 Correct 8 ms 7224 KB Output is correct
49 Correct 8 ms 7008 KB Output is correct
50 Correct 8 ms 7232 KB Output is correct
51 Correct 8 ms 7300 KB Output is correct
52 Correct 9 ms 7224 KB Output is correct
53 Correct 9 ms 7008 KB Output is correct
54 Correct 8 ms 7136 KB Output is correct
55 Correct 8 ms 7008 KB Output is correct
56 Correct 8 ms 7008 KB Output is correct
57 Correct 8 ms 7224 KB Output is correct
58 Correct 8 ms 7136 KB Output is correct
59 Correct 9 ms 7136 KB Output is correct
60 Correct 10 ms 7204 KB Output is correct
61 Correct 9 ms 7276 KB Output is correct
62 Correct 8 ms 7104 KB Output is correct
63 Correct 9 ms 7136 KB Output is correct
64 Correct 9 ms 7156 KB Output is correct
65 Correct 9 ms 7148 KB Output is correct
66 Correct 9 ms 7204 KB Output is correct
67 Correct 9 ms 7216 KB Output is correct
68 Correct 8 ms 7008 KB Output is correct
69 Correct 8 ms 7344 KB Output is correct
70 Correct 8 ms 7136 KB Output is correct
71 Correct 9 ms 7008 KB Output is correct
72 Correct 9 ms 7200 KB Output is correct
73 Correct 8 ms 7212 KB Output is correct
74 Correct 9 ms 7136 KB Output is correct
75 Correct 8 ms 7136 KB Output is correct
76 Correct 9 ms 7136 KB Output is correct
77 Correct 10 ms 7500 KB Output is correct
78 Correct 9 ms 7200 KB Output is correct
79 Correct 8 ms 7008 KB Output is correct
80 Correct 8 ms 7216 KB Output is correct
81 Correct 8 ms 7212 KB Output is correct
82 Correct 8 ms 7228 KB Output is correct
83 Correct 9 ms 7216 KB Output is correct
84 Correct 8 ms 7236 KB Output is correct
85 Correct 9 ms 7136 KB Output is correct
86 Correct 8 ms 7008 KB Output is correct
87 Correct 16 ms 7008 KB Output is correct
88 Correct 8 ms 7044 KB Output is correct
89 Correct 8 ms 7228 KB Output is correct
90 Correct 8 ms 7008 KB Output is correct
91 Correct 8 ms 7392 KB Output is correct
92 Correct 8 ms 7008 KB Output is correct
93 Correct 8 ms 7136 KB Output is correct
94 Correct 9 ms 7136 KB Output is correct
95 Correct 9 ms 7008 KB Output is correct
96 Correct 9 ms 7200 KB Output is correct
97 Correct 9 ms 7136 KB Output is correct
98 Correct 9 ms 7200 KB Output is correct
99 Correct 9 ms 7276 KB Output is correct
100 Correct 10 ms 7216 KB Output is correct
101 Correct 8 ms 7008 KB Output is correct
102 Correct 8 ms 7136 KB Output is correct
103 Correct 9 ms 7008 KB Output is correct
104 Correct 8 ms 7136 KB Output is correct
105 Correct 9 ms 7008 KB Output is correct
106 Correct 8 ms 7008 KB Output is correct
107 Correct 8 ms 7224 KB Output is correct
108 Correct 8 ms 7008 KB Output is correct
109 Correct 9 ms 7136 KB Output is correct
110 Correct 8 ms 7048 KB Output is correct
111 Correct 9 ms 7136 KB Output is correct
112 Correct 8 ms 7136 KB Output is correct
113 Correct 8 ms 7136 KB Output is correct
114 Correct 9 ms 7340 KB Output is correct
115 Correct 8 ms 7008 KB Output is correct
116 Correct 9 ms 7136 KB Output is correct
117 Correct 8 ms 7008 KB Output is correct
118 Correct 8 ms 7208 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 809 ms 27344 KB Output is correct : V - N = 12
2 Correct 734 ms 23840 KB Output is correct : V - N = 12
3 Correct 235 ms 14236 KB Output is correct : V - N = 12
4 Correct 24 ms 7620 KB Output is correct : V - N = 12
5 Correct 167 ms 11264 KB Output is correct : V - N = 12
6 Correct 482 ms 21912 KB Output is correct : V - N = 12
7 Correct 723 ms 26988 KB Output is correct : V - N = 12
8 Correct 843 ms 25584 KB Output is correct : V - N = 12
9 Correct 433 ms 16428 KB Output is correct : V - N = 12
10 Correct 51 ms 8712 KB Output is correct : V - N = 12
11 Correct 86 ms 9272 KB Output is correct : V - N = 12
12 Correct 430 ms 17496 KB Output is correct : V - N = 12
13 Correct 711 ms 26272 KB Output is correct : V - N = 12
14 Correct 677 ms 26584 KB Output is correct : V - N = 12
15 Correct 480 ms 20932 KB Output is correct : V - N = 12
16 Correct 110 ms 10360 KB Output is correct : V - N = 12
17 Correct 38 ms 7940 KB Output is correct : V - N = 12
18 Correct 301 ms 15380 KB Output is correct : V - N = 12
19 Correct 570 ms 24716 KB Output is correct : V - N = 12
20 Correct 709 ms 27200 KB Output is correct : V - N = 12
21 Correct 231 ms 12744 KB Output is correct : V - N = 12
22 Correct 140 ms 12080 KB Output is correct : V - N = 12
23 Correct 68 ms 9184 KB Output is correct : V - N = 12
24 Correct 13 ms 7376 KB Output is correct : V - N = 12
25 Correct 53 ms 8404 KB Output is correct : V - N = 12
26 Correct 174 ms 11148 KB Output is correct : V - N = 12
27 Correct 229 ms 12588 KB Output is correct : V - N = 12
28 Correct 158 ms 12012 KB Output is correct : V - N = 12
29 Correct 92 ms 9732 KB Output is correct : V - N = 12
30 Correct 17 ms 7760 KB Output is correct : V - N = 12
31 Correct 27 ms 7312 KB Output is correct : V - N = 12
32 Correct 25 ms 7392 KB Output is correct : V - N = 12
33 Correct 22 ms 7136 KB Output is correct : V - N = 12
34 Correct 22 ms 7312 KB Output is correct : V - N = 12
35 Correct 23 ms 7320 KB Output is correct : V - N = 12
36 Correct 688 ms 27420 KB Output is correct : V - N = 12
37 Correct 774 ms 27656 KB Output is correct : V - N = 12
38 Correct 916 ms 27328 KB Output is correct : V - N = 12
39 Correct 789 ms 27456 KB Output is correct : V - N = 12
40 Correct 740 ms 27552 KB Output is correct : V - N = 12
41 Correct 132 ms 11184 KB Output is correct : V - N = 12
42 Correct 126 ms 10096 KB Output is correct : V - N = 12
43 Correct 163 ms 10848 KB Output is correct : V - N = 12
44 Correct 23 ms 7388 KB Output is correct : V - N = 12
45 Correct 88 ms 9340 KB Output is correct : V - N = 12
46 Correct 333 ms 14660 KB Output is correct : V - N = 12
47 Correct 160 ms 11228 KB Output is correct : V - N = 12
48 Correct 354 ms 16532 KB Output is correct : V - N = 12
49 Correct 96 ms 9164 KB Output is correct : V - N = 12
50 Correct 34 ms 7904 KB Output is correct : V - N = 12
51 Correct 752 ms 23760 KB Output is correct : V - N = 12
52 Correct 24 ms 7628 KB Output is correct : V - N = 12
53 Correct 548 ms 21960 KB Output is correct : V - N = 12
54 Correct 564 ms 25316 KB Output is correct : V - N = 12
55 Correct 54 ms 8432 KB Output is correct : V - N = 12
56 Correct 430 ms 17436 KB Output is correct : V - N = 12
57 Correct 708 ms 26508 KB Output is correct : V - N = 12
58 Correct 133 ms 10192 KB Output is correct : V - N = 12
59 Correct 290 ms 15496 KB Output is correct : V - N = 12
60 Correct 728 ms 27092 KB Output is correct : V - N = 12
61 Correct 9 ms 7136 KB Output is correct : V - N = 12
62 Correct 9 ms 7136 KB Output is correct : V - N = 12
63 Correct 9 ms 7136 KB Output is correct : V - N = 12
64 Correct 8 ms 7092 KB Output is correct : V - N = 12
65 Correct 8 ms 7008 KB Output is correct : V - N = 12
66 Correct 8 ms 7008 KB Output is correct : V - N = 12
67 Correct 9 ms 7136 KB Output is correct : V - N = 12
68 Correct 9 ms 7008 KB Output is correct : V - N = 12
69 Correct 9 ms 7136 KB Output is correct : V - N = 12
70 Correct 8 ms 7008 KB Output is correct : V - N = 12
71 Correct 8 ms 7200 KB Output is correct : V - N = 12
72 Correct 8 ms 7136 KB Output is correct : V - N = 12
73 Correct 9 ms 7008 KB Output is correct : V - N = 12
74 Correct 9 ms 7008 KB Output is correct : V - N = 12
75 Correct 9 ms 7136 KB Output is correct : V - N = 12
76 Correct 8 ms 7136 KB Output is correct : V - N = 12
77 Correct 9 ms 7136 KB Output is correct : V - N = 12
78 Correct 8 ms 7136 KB Output is correct : V - N = 12
79 Correct 8 ms 7136 KB Output is correct : V - N = 12
80 Correct 9 ms 7008 KB Output is correct : V - N = 12
81 Correct 8 ms 7136 KB Output is correct : V - N = 12
82 Correct 8 ms 7208 KB Output is correct : V - N = 12
83 Correct 9 ms 7180 KB Output is correct : V - N = 12
84 Correct 8 ms 7220 KB Output is correct : V - N = 12
85 Correct 8 ms 7136 KB Output is correct : V - N = 12
86 Correct 8 ms 7216 KB Output is correct : V - N = 12
87 Correct 9 ms 7008 KB Output is correct : V - N = 12
88 Correct 8 ms 7212 KB Output is correct : V - N = 12
89 Correct 8 ms 7136 KB Output is correct : V - N = 12
90 Correct 7 ms 7264 KB Output is correct : V - N = 12
91 Correct 8 ms 7008 KB Output is correct : V - N = 12
92 Correct 8 ms 7228 KB Output is correct : V - N = 12
93 Correct 7 ms 7228 KB Output is correct : V - N = 12
94 Correct 9 ms 7008 KB Output is correct : V - N = 12
95 Correct 8 ms 7008 KB Output is correct : V - N = 12
96 Correct 9 ms 7156 KB Output is correct : V - N = 12
97 Correct 8 ms 7136 KB Output is correct : V - N = 12
98 Correct 9 ms 7392 KB Output is correct : V - N = 12
99 Correct 10 ms 7008 KB Output is correct : V - N = 12
100 Correct 8 ms 7208 KB Output is correct : V - N = 12
101 Correct 8 ms 7148 KB Output is correct : V - N = 12
102 Correct 8 ms 7008 KB Output is correct : V - N = 12
103 Correct 8 ms 7224 KB Output is correct : V - N = 12
104 Correct 7 ms 7236 KB Output is correct : V - N = 12
105 Correct 8 ms 7136 KB Output is correct : V - N = 12
106 Correct 8 ms 7136 KB Output is correct : V - N = 12
107 Correct 8 ms 7208 KB Output is correct : V - N = 12
108 Correct 8 ms 7008 KB Output is correct : V - N = 12
109 Correct 9 ms 7136 KB Output is correct : V - N = 12
110 Correct 8 ms 7264 KB Output is correct : V - N = 12
111 Correct 9 ms 7136 KB Output is correct : V - N = 12
112 Correct 7 ms 7008 KB Output is correct : V - N = 12
113 Correct 8 ms 7264 KB Output is correct : V - N = 12
114 Correct 8 ms 7208 KB Output is correct : V - N = 12
115 Correct 7 ms 7108 KB Output is correct : V - N = 12
116 Correct 8 ms 7272 KB Output is correct : V - N = 12
117 Correct 8 ms 7168 KB Output is correct : V - N = 12
118 Correct 8 ms 7008 KB Output is correct : V - N = 12
119 Correct 8 ms 7008 KB Output is correct : V - N = 12
120 Correct 7 ms 7208 KB Output is correct : V - N = 12
121 Correct 8 ms 7136 KB Output is correct : V - N = 12
122 Correct 8 ms 7108 KB Output is correct : V - N = 12
123 Correct 8 ms 7136 KB Output is correct : V - N = 12
124 Correct 8 ms 7240 KB Output is correct : V - N = 12
125 Correct 8 ms 7224 KB Output is correct : V - N = 12
126 Correct 8 ms 7136 KB Output is correct : V - N = 12
127 Correct 8 ms 7008 KB Output is correct : V - N = 12
128 Correct 7 ms 7216 KB Output is correct : V - N = 12
129 Correct 9 ms 7136 KB Output is correct : V - N = 12
130 Correct 7 ms 7136 KB Output is correct : V - N = 12
131 Correct 7 ms 7008 KB Output is correct : V - N = 12
132 Correct 7 ms 7136 KB Output is correct : V - N = 12
133 Correct 8 ms 7136 KB Output is correct : V - N = 12
134 Correct 8 ms 7136 KB Output is correct : V - N = 12
135 Correct 9 ms 7216 KB Output is correct : V - N = 12
136 Correct 8 ms 7284 KB Output is correct : V - N = 12
137 Correct 7 ms 7264 KB Output is correct : V - N = 12
138 Correct 8 ms 7224 KB Output is correct : V - N = 12
139 Correct 8 ms 7008 KB Output is correct : V - N = 12
140 Correct 8 ms 7296 KB Output is correct : V - N = 12
141 Correct 9 ms 7108 KB Output is correct : V - N = 12
142 Correct 8 ms 7008 KB Output is correct : V - N = 12
143 Correct 8 ms 7224 KB Output is correct : V - N = 12
144 Correct 8 ms 7136 KB Output is correct : V - N = 12
145 Correct 9 ms 7136 KB Output is correct : V - N = 12
146 Correct 7 ms 7384 KB Output is correct : V - N = 12
147 Correct 8 ms 7136 KB Output is correct : V - N = 12
148 Correct 9 ms 7088 KB Output is correct : V - N = 12
149 Correct 8 ms 7008 KB Output is correct : V - N = 12
150 Correct 9 ms 7232 KB Output is correct : V - N = 12
151 Correct 8 ms 7136 KB Output is correct : V - N = 12
152 Correct 8 ms 7136 KB Output is correct : V - N = 12
153 Correct 7 ms 7292 KB Output is correct : V - N = 12
154 Correct 8 ms 7008 KB Output is correct : V - N = 12
155 Correct 8 ms 7008 KB Output is correct : V - N = 12
156 Correct 8 ms 7008 KB Output is correct : V - N = 12
157 Correct 8 ms 7216 KB Output is correct : V - N = 12
158 Correct 8 ms 7008 KB Output is correct : V - N = 12
159 Correct 8 ms 7136 KB Output is correct : V - N = 12
160 Correct 8 ms 7216 KB Output is correct : V - N = 12
161 Correct 8 ms 7136 KB Output is correct : V - N = 12
162 Correct 7 ms 7136 KB Output is correct : V - N = 12
163 Correct 7 ms 7136 KB Output is correct : V - N = 12
164 Correct 8 ms 7136 KB Output is correct : V - N = 12
165 Correct 9 ms 7232 KB Output is correct : V - N = 12
166 Correct 7 ms 7136 KB Output is correct : V - N = 12
167 Correct 9 ms 7344 KB Output is correct : V - N = 12
168 Correct 8 ms 7008 KB Output is correct : V - N = 12
169 Correct 8 ms 7136 KB Output is correct : V - N = 12
170 Correct 9 ms 7008 KB Output is correct : V - N = 12
171 Correct 7 ms 7232 KB Output is correct : V - N = 12
172 Correct 8 ms 7264 KB Output is correct : V - N = 12
173 Correct 8 ms 7136 KB Output is correct : V - N = 12
174 Correct 7 ms 7288 KB Output is correct : V - N = 12
175 Correct 7 ms 7008 KB Output is correct : V - N = 12
176 Correct 8 ms 7136 KB Output is correct : V - N = 12
177 Correct 9 ms 7136 KB Output is correct : V - N = 12
178 Correct 7 ms 7224 KB Output is correct : V - N = 12