답안 #57655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57655	2018-07-15T17:44:26 Z	ksun48	항공 노선도 (JOI18_airline)	C++14	100 / 100	772 ms	46672 KB

Alice

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

void send(vector<vector<int> > message){
	int V = message.size();
	int U = 0;
	for(int i = 0; i < V; i++){
		for(int j = i + 1; j < V; j++){
			if(message[i][j]){
				U++;
			}
		}
	}
	InitG(V, U);
	U = 0;
	for(int i = 0; i < V; i++){
		for(int j = i + 1; j < V; j++){
			if(message[i][j]){
				MakeG(U, i, j);
				U++;
			}
		}
	}
}

void Alice(int N, int M, int A[], int B[]){
	int L = 10;
	int n = N;
	int m = M;

	vector<vector<int> > graph(n, vector<int>(n, 0));
	vector<vector<int> > message(n + L + 2, vector<int>(n + L + 2, 0) );
	for(int i = 0; i < m; i++){
		graph[A[i]][B[i]] = graph[B[i]][A[i]] = 1;
	}

	vector<vector<int> > something(L, vector<int>(L, 0));
	for(int r = 1; r < L; r++){
		int s = r - 1;
		if(r == 4) s--;
		something[r][s] = something[s][r] = 1;
	}

	// start

	int p = n + L;
	int q = n + L + 1;
	for(int i = 0; i < p; i++){
		message[i][q] = message[q][i] = 1;
	}
	for(int i = 0; i < L; i++){
		message[n + i][p] = message[p][n + i] = 1;
	}
	for(int i = 0; i < L; i++){
		for(int a = 0; a < n; a++){
			if((1 << i) & a){
				message[a][n + i] = message[n + i][a] = 1;
			}
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(graph[i][j]){
				message[i][j] = message[j][i] = 1;
			}
		}
	}
	for(int i = 0; i < L; i++){
		for(int j = 0; j < L; j++){
			if(something[i][j]){
				message[n + i][n + j] = message[n + j][n + i] = 1;
			}
		}
	}

	send(message);
}

Bob

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

void answer(vector<vector<int> > graph){
	int N = graph.size();
	int M = 0;
	for(int i = 0; i < N; i++){
		for(int j = i + 1; j < N; j++){
			if(graph[i][j]){
				M++;
			}
		}
	}
	InitMap(N, M);
	for(int i = 0; i < N; i++){
		for(int j = i + 1; j < N; j++){
			if(graph[i][j]){
				MakeMap(i, j);
			}
		}
	}
}
void Bob(int V, int U, int C[], int D[]){
	int L = 10;
	int v = V;
	int u = U;
	int n = v - L - 2;

	vector<vector<int> > graph(n, vector<int>(n, 0));
	vector<vector<int> > message(v, vector<int>(v, 0) );
	for(int i = 0; i < u; i++){
		message[C[i]][D[i]] = message[D[i]][C[i]] = 1;
	}

	vector<vector<int> > something(L, vector<int>(L, 0));
	for(int r = 1; r < L; r++){
		int s = r - 1;
		if(r == 4) s--;
		something[r][s] = something[s][r] = 1;
	}

	// start


	vector<int> degrees(v, 0);
	for(int i = 0; i < v; i++){
		for(int j = i + 1; j < v; j++){
			degrees[i] += message[i][j];
			degrees[j] += message[i][j];
		}
	}

	int q = -1;
	for(int i = 0; i < v; i++){
		if(degrees[i] == n + L){
			q = i;
		}
	}
	assert(q != -1);
	int p = -1;
	for(int i = 0; i < v; i++){
		if(i == q) continue;
		if(message[i][q] == 0){
			p = i;
		}
	}
	assert(p != -1);

	vector<int> pneighbors;
	vector<int> rest;
	for(int i = 0; i < v; i++){
		if(message[i][p] == 1){
			pneighbors.push_back(i);
		} else if(i != p & i != q){
			rest.push_back(i);
		}
	}
	assert(pneighbors.size() == L);
	assert(rest.size() == n);
	sort(pneighbors.begin(), pneighbors.end());
	while(1){
		int okay = 1;
		for(int i = 0; i < L; i++){
			for(int j = 0; j < L; j++){
				if(message[pneighbors[i]][pneighbors[j]] != something[i][j]){
					okay = 0;
					break;
				}
			}
			if(!okay) break;
		}
		if(okay) break;
		assert(next_permutation(pneighbors.begin(), pneighbors.end()));
	}

	vector<int> ids(n, 0);
	for(int i = 0; i < n; i++){
		for(int a = 0; a < L; a++){
			if(message[pneighbors[a]][rest[i]] == 1){
				ids[i] ^= (1 << a);
			}
		}
	}
	vector<int> sortedids = ids;
	sort(sortedids.begin(), sortedids.end());
	for(int i = 0; i < n; i++){
		assert(sortedids[i] == i);
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(message[rest[i]][rest[j]] == 1){
				graph[ids[i]][ids[j]] = 1;
			}
		}
	}
	answer(graph);
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:75:15: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   } else if(i != p & i != q){
             ~~^~~~
In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from Bob.cpp:2:
Bob.cpp:79:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(pneighbors.size() == L);
         ~~~~~~~~~~~~~~~~~~^~~~
Bob.cpp:80:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(rest.size() == n);
         ~~~~~~~~~~~~^~~~

Subtask #1

22.0 / 22.0

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

Subtask #2

15.0 / 15.0

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

Subtask #3

63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	672 ms	46448 KB	Output is correct : V - N = 12
2	Correct	598 ms	42784 KB	Output is correct : V - N = 12
3	Correct	245 ms	35512 KB	Output is correct : V - N = 12
4	Correct	49 ms	30960 KB	Output is correct : V - N = 12
5	Correct	175 ms	33528 KB	Output is correct : V - N = 12
6	Correct	487 ms	40776 KB	Output is correct : V - N = 12
7	Correct	678 ms	46088 KB	Output is correct : V - N = 12
8	Correct	666 ms	44520 KB	Output is correct : V - N = 12
9	Correct	345 ms	37600 KB	Output is correct : V - N = 12
10	Correct	90 ms	31688 KB	Output is correct : V - N = 12
11	Correct	106 ms	32136 KB	Output is correct : V - N = 12
12	Correct	401 ms	38856 KB	Output is correct : V - N = 12
13	Correct	635 ms	45176 KB	Output is correct : V - N = 12
14	Correct	667 ms	45856 KB	Output is correct : V - N = 12
15	Correct	441 ms	39800 KB	Output is correct : V - N = 12
16	Correct	132 ms	32704 KB	Output is correct : V - N = 12
17	Correct	58 ms	31064 KB	Output is correct : V - N = 12
18	Correct	287 ms	36408 KB	Output is correct : V - N = 12
19	Correct	607 ms	43896 KB	Output is correct : V - N = 12
20	Correct	694 ms	46672 KB	Output is correct : V - N = 12
21	Correct	215 ms	17320 KB	Output is correct : V - N = 12
22	Correct	130 ms	16424 KB	Output is correct : V - N = 12
23	Correct	62 ms	14456 KB	Output is correct : V - N = 12
24	Correct	17 ms	13296 KB	Output is correct : V - N = 12
25	Correct	48 ms	13808 KB	Output is correct : V - N = 12
26	Correct	141 ms	15600 KB	Output is correct : V - N = 12
27	Correct	199 ms	17120 KB	Output is correct : V - N = 12
28	Correct	181 ms	16744 KB	Output is correct : V - N = 12
29	Correct	103 ms	15088 KB	Output is correct : V - N = 12
30	Correct	36 ms	13424 KB	Output is correct : V - N = 12
31	Correct	47 ms	30840 KB	Output is correct : V - N = 12
32	Correct	49 ms	30960 KB	Output is correct : V - N = 12
33	Correct	46 ms	30776 KB	Output is correct : V - N = 12
34	Correct	43 ms	30960 KB	Output is correct : V - N = 12
35	Correct	57 ms	30800 KB	Output is correct : V - N = 12
36	Correct	731 ms	46568 KB	Output is correct : V - N = 12
37	Correct	772 ms	46544 KB	Output is correct : V - N = 12
38	Correct	716 ms	46472 KB	Output is correct : V - N = 12
39	Correct	740 ms	46408 KB	Output is correct : V - N = 12
40	Correct	712 ms	46400 KB	Output is correct : V - N = 12
41	Correct	126 ms	33512 KB	Output is correct : V - N = 12
42	Correct	150 ms	32784 KB	Output is correct : V - N = 12
43	Correct	159 ms	33184 KB	Output is correct : V - N = 12
44	Correct	50 ms	30968 KB	Output is correct : V - N = 12
45	Correct	113 ms	32080 KB	Output is correct : V - N = 12
46	Correct	299 ms	35784 KB	Output is correct : V - N = 12
47	Correct	156 ms	33344 KB	Output is correct : V - N = 12
48	Correct	333 ms	37816 KB	Output is correct : V - N = 12
49	Correct	96 ms	32128 KB	Output is correct : V - N = 12
50	Correct	68 ms	31368 KB	Output is correct : V - N = 12
51	Correct	572 ms	42952 KB	Output is correct : V - N = 12
52	Correct	43 ms	30960 KB	Output is correct : V - N = 12
53	Correct	480 ms	40480 KB	Output is correct : V - N = 12
54	Correct	609 ms	43768 KB	Output is correct : V - N = 12
55	Correct	82 ms	31216 KB	Output is correct : V - N = 12
56	Correct	419 ms	37872 KB	Output is correct : V - N = 12
57	Correct	676 ms	45080 KB	Output is correct : V - N = 12
58	Correct	122 ms	32368 KB	Output is correct : V - N = 12
59	Correct	327 ms	35960 KB	Output is correct : V - N = 12
60	Correct	699 ms	45216 KB	Output is correct : V - N = 12
61	Correct	16 ms	6640 KB	Output is correct : V - N = 12
62	Correct	9 ms	6896 KB	Output is correct : V - N = 12
63	Correct	17 ms	6640 KB	Output is correct : V - N = 12
64	Correct	23 ms	6640 KB	Output is correct : V - N = 12
65	Correct	21 ms	6640 KB	Output is correct : V - N = 12
66	Correct	12 ms	6896 KB	Output is correct : V - N = 12
67	Correct	18 ms	7152 KB	Output is correct : V - N = 12
68	Correct	21 ms	6640 KB	Output is correct : V - N = 12
69	Correct	25 ms	6640 KB	Output is correct : V - N = 12
70	Correct	28 ms	7000 KB	Output is correct : V - N = 12
71	Correct	18 ms	6648 KB	Output is correct : V - N = 12
72	Correct	18 ms	6640 KB	Output is correct : V - N = 12
73	Correct	20 ms	6888 KB	Output is correct : V - N = 12
74	Correct	28 ms	6896 KB	Output is correct : V - N = 12
75	Correct	21 ms	6784 KB	Output is correct : V - N = 12
76	Correct	17 ms	6896 KB	Output is correct : V - N = 12
77	Correct	9 ms	6640 KB	Output is correct : V - N = 12
78	Correct	30 ms	6736 KB	Output is correct : V - N = 12
79	Correct	15 ms	6640 KB	Output is correct : V - N = 12
80	Correct	18 ms	6640 KB	Output is correct : V - N = 12
81	Correct	28 ms	6640 KB	Output is correct : V - N = 12
82	Correct	28 ms	6640 KB	Output is correct : V - N = 12
83	Correct	13 ms	6640 KB	Output is correct : V - N = 12
84	Correct	11 ms	6640 KB	Output is correct : V - N = 12
85	Correct	28 ms	6640 KB	Output is correct : V - N = 12
86	Correct	25 ms	6648 KB	Output is correct : V - N = 12
87	Correct	11 ms	6896 KB	Output is correct : V - N = 12
88	Correct	15 ms	6640 KB	Output is correct : V - N = 12
89	Correct	9 ms	6896 KB	Output is correct : V - N = 12
90	Correct	8 ms	6896 KB	Output is correct : V - N = 12
91	Correct	22 ms	6640 KB	Output is correct : V - N = 12
92	Correct	30 ms	6640 KB	Output is correct : V - N = 12
93	Correct	10 ms	6896 KB	Output is correct : V - N = 12
94	Correct	27 ms	6896 KB	Output is correct : V - N = 12
95	Correct	23 ms	6640 KB	Output is correct : V - N = 12
96	Correct	17 ms	6640 KB	Output is correct : V - N = 12
97	Correct	9 ms	6896 KB	Output is correct : V - N = 12
98	Correct	8 ms	6776 KB	Output is correct : V - N = 12
99	Correct	19 ms	6640 KB	Output is correct : V - N = 12
100	Correct	27 ms	6896 KB	Output is correct : V - N = 12
101	Correct	26 ms	6896 KB	Output is correct : V - N = 12
102	Correct	11 ms	6896 KB	Output is correct : V - N = 12
103	Correct	30 ms	6896 KB	Output is correct : V - N = 12
104	Correct	12 ms	6896 KB	Output is correct : V - N = 12
105	Correct	17 ms	6896 KB	Output is correct : V - N = 12
106	Correct	24 ms	6896 KB	Output is correct : V - N = 12
107	Correct	9 ms	6640 KB	Output is correct : V - N = 12
108	Correct	27 ms	6736 KB	Output is correct : V - N = 12
109	Correct	12 ms	6640 KB	Output is correct : V - N = 12
110	Correct	16 ms	6736 KB	Output is correct : V - N = 12
111	Correct	15 ms	6896 KB	Output is correct : V - N = 12
112	Correct	13 ms	6640 KB	Output is correct : V - N = 12
113	Correct	19 ms	6640 KB	Output is correct : V - N = 12
114	Correct	23 ms	6736 KB	Output is correct : V - N = 12
115	Correct	9 ms	6640 KB	Output is correct : V - N = 12
116	Correct	19 ms	6896 KB	Output is correct : V - N = 12
117	Correct	25 ms	6736 KB	Output is correct : V - N = 12
118	Correct	18 ms	6896 KB	Output is correct : V - N = 12
119	Correct	11 ms	6640 KB	Output is correct : V - N = 12
120	Correct	24 ms	6896 KB	Output is correct : V - N = 12
121	Correct	13 ms	6896 KB	Output is correct : V - N = 12
122	Correct	17 ms	6896 KB	Output is correct : V - N = 12
123	Correct	29 ms	6640 KB	Output is correct : V - N = 12
124	Correct	15 ms	6640 KB	Output is correct : V - N = 12
125	Correct	26 ms	6640 KB	Output is correct : V - N = 12
126	Correct	13 ms	7152 KB	Output is correct : V - N = 12
127	Correct	17 ms	6640 KB	Output is correct : V - N = 12
128	Correct	13 ms	6640 KB	Output is correct : V - N = 12
129	Correct	16 ms	6896 KB	Output is correct : V - N = 12
130	Correct	18 ms	6896 KB	Output is correct : V - N = 12
131	Correct	8 ms	6904 KB	Output is correct : V - N = 12
132	Correct	28 ms	6640 KB	Output is correct : V - N = 12
133	Correct	24 ms	6640 KB	Output is correct : V - N = 12
134	Correct	16 ms	6640 KB	Output is correct : V - N = 12
135	Correct	29 ms	6640 KB	Output is correct : V - N = 12
136	Correct	29 ms	6736 KB	Output is correct : V - N = 12
137	Correct	16 ms	6984 KB	Output is correct : V - N = 12
138	Correct	26 ms	6896 KB	Output is correct : V - N = 12
139	Correct	16 ms	6640 KB	Output is correct : V - N = 12
140	Correct	27 ms	6640 KB	Output is correct : V - N = 12
141	Correct	17 ms	6736 KB	Output is correct : V - N = 12
142	Correct	28 ms	6640 KB	Output is correct : V - N = 12
143	Correct	19 ms	6640 KB	Output is correct : V - N = 12
144	Correct	10 ms	6640 KB	Output is correct : V - N = 12
145	Correct	20 ms	6896 KB	Output is correct : V - N = 12
146	Correct	28 ms	6640 KB	Output is correct : V - N = 12
147	Correct	10 ms	6896 KB	Output is correct : V - N = 12
148	Correct	27 ms	6640 KB	Output is correct : V - N = 12
149	Correct	25 ms	6648 KB	Output is correct : V - N = 12
150	Correct	15 ms	6640 KB	Output is correct : V - N = 12
151	Correct	19 ms	6640 KB	Output is correct : V - N = 12
152	Correct	12 ms	6640 KB	Output is correct : V - N = 12
153	Correct	19 ms	6896 KB	Output is correct : V - N = 12
154	Correct	12 ms	6640 KB	Output is correct : V - N = 12
155	Correct	16 ms	6552 KB	Output is correct : V - N = 12
156	Correct	31 ms	6640 KB	Output is correct : V - N = 12
157	Correct	9 ms	6896 KB	Output is correct : V - N = 12
158	Correct	30 ms	6640 KB	Output is correct : V - N = 12
159	Correct	11 ms	6640 KB	Output is correct : V - N = 12
160	Correct	13 ms	6640 KB	Output is correct : V - N = 12
161	Correct	15 ms	6896 KB	Output is correct : V - N = 12
162	Correct	27 ms	6640 KB	Output is correct : V - N = 12
163	Correct	22 ms	6640 KB	Output is correct : V - N = 12
164	Correct	10 ms	6696 KB	Output is correct : V - N = 12
165	Correct	30 ms	6640 KB	Output is correct : V - N = 12
166	Correct	9 ms	6640 KB	Output is correct : V - N = 12
167	Correct	18 ms	6640 KB	Output is correct : V - N = 12
168	Correct	10 ms	6640 KB	Output is correct : V - N = 12
169	Correct	13 ms	6896 KB	Output is correct : V - N = 12
170	Correct	25 ms	6760 KB	Output is correct : V - N = 12
171	Correct	11 ms	6744 KB	Output is correct : V - N = 12
172	Correct	12 ms	6896 KB	Output is correct : V - N = 12
173	Correct	17 ms	6560 KB	Output is correct : V - N = 12
174	Correct	24 ms	6640 KB	Output is correct : V - N = 12
175	Correct	20 ms	6744 KB	Output is correct : V - N = 12
176	Correct	9 ms	6896 KB	Output is correct : V - N = 12
177	Correct	18 ms	6640 KB	Output is correct : V - N = 12
178	Correct	30 ms	6896 KB	Output is correct : V - N = 12