oj.uz

답안 #164066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164066 2019-11-17T08:46:58 Z oolimry 항공 노선도 (JOI18_airline) C++14
100 / 100
 1020 ms 30800 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;

void Alice( int n, int m, int A[], int B[] ){
	int cnt = 0;
	vector<int> nums;
	for(int i = 0;i < 1024;i++){
		int bits = 0;
		for(int j = 1;j < 1024;j *= 2){
			if((i & j) != 0) bits++;
		}
		if(bits >= 2){
			nums.push_back(i);
		}
		if(nums.size() == n) break;
	}
	typedef pair<int,int> ii;
	vector<ii> edges;
	for(int i = 0;i < m;i++){
		edges.push_back(ii(A[i],B[i]));
	}
	
	int x = n+10;
	int y = n+11;
	int anchor[10];
	for(int i = 0;i < 10;i++) anchor[i] = n+i;
	
	edges.push_back(ii(x,y));
	for(int i = 0;i < 10;i++){
		edges.push_back(ii(y,anchor[i]));
	}
	
	for(int i = 1;i < 9;i++){
		edges.push_back(ii(anchor[0],anchor[i]));
		edges.push_back(ii(anchor[i],anchor[i+1]));
	}
	
	
	for(int i = 0;i < n;i++){
		int k = nums[i];
		for(int j = 0;j < 10;j++){
			if((k & (1 << j)) != 0){
				edges.push_back(ii(i,anchor[j]));
			}
		}
	}
	/*
	for(ii x : edges){
		cout << x.first << " " << x.second << "\n";
	}
	//*/
	InitG(n+12,edges.size());
	for(int i = 0;i < edges.size();i++){
		MakeG(i,edges[i].first,edges[i].second);
	}
	//cout << "\n\n";
}
#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;

void Bob( int n, int m, int C[], int D[] ){
	int on = n - 12;
	vector<int> nums;
	typedef pair<int,int> ii;

	bool adjMat[n][n];
	for(int i = 0;i < n;i++)
		for(int j = 0;j < n;j++)
			adjMat[i][j] = false;
	for(int i = 0;i < 1024;i++){
		int bits = 0;
		for(int j = 1;j < 1024;j *= 2){
			if((i & j) != 0) bits++;
		}
		if(bits >= 2){
			nums.push_back(i);
		}
		if(nums.size() == on) break;
	}
	
	vector<int> adj[n];
	for(int i = 0;i < m;i++){
		adj[C[i]].push_back(D[i]);
		adj[D[i]].push_back(C[i]);
		//cout << C[i] << " " << D[i] << "\n";
		//edges.insert(ii(C[i],D[i]));
		//edges.insert(ii(D[i],C[i]));
		adjMat[C[i]][D[i]] = true;
		adjMat[D[i]][C[i]] = true;
	}
	int x, y;
	for(int i = 0;i < n;i++){
		if(adj[i].size() == 1){
			x = i;
			y = adj[i][0];
			break;
		}
	}
	
	//cout << x << "\n" << y << "\n";
	
	vector<int> aa;
	for(int i = 0;i < n;i++){
		if(i == x || i == y){
			continue;
		}
		if(adjMat[i][y]){
			aa.push_back(i);
		}
	}
	set<int> anchorSet;
	for(int k : aa){
		//cout << k << " ";
		anchorSet.insert(k);
	}
	
	int anchor[10];
	
	fill(anchor,anchor+10,-1);
	for(int i = 0;i < 10;i++){
		int cnt = 0;
		for(int j = 0;j < 10;j++){
			if(adjMat[aa[i]][aa[j]]){
				cnt++;
			}
		}
		if(cnt == 8){
			anchor[0] = aa[i];
		}
		else if(cnt == 1){
			anchor[9] = aa[i];
		}
	}
	
	int cur = anchor[9];
	for(int i = 9;i >= 2;i--){
		for(int v : adj[cur]){
			if(v != anchor[0] && anchorSet.find(v) != anchorSet.end()){
				if(i == 9 || v != anchor[i+1]){
					cur = v;
					anchor[i-1] = cur;
					break;
				} 
			}
		}
	}
	bool extras[n];
	int anchorMap[n];
	int normalMap[n];
	fill(extras,extras+n,false);
	//unordered_map<int,int> anchorMap;
	//cout << "\n";
	for(int i =0 ;i < 10;i++){
		//cout << anchor[i] << " ";
		extras[anchor[i]] = true;
		anchorMap[anchor[i]] = i;
	}
	extras[x] = true;
	extras[y] = true;
	//cout << "\n";
	//unordered_map<int,int> normalMap;
	for(int u = 0;u < n;u++){
		int value = 0;
		if(extras[u]) continue;
		for(int v : adj[u]){
			if(!extras[v]) continue;
			
			int bit = anchorMap[v];
			value |= (1 << bit);
		}
		int pos = lower_bound(nums.begin(),nums.end(),value) - nums.begin();
		normalMap[u] = pos;
		//cout << u << " " << pos << "\n";
	}
	vector<ii> finalEdges;
	for(int i = 0;i < m;i++){
		int u = C[i];
		int v = D[i];
		if(extras[u] || extras[v]) continue;
		finalEdges.push_back(ii(normalMap[u],normalMap[v]));
	}
	
	//cout << "\n";
	//for(ii k : finalEdges) cout << k.first << " " << k.second << "\n";
	
	InitMap(on, finalEdges.size());
	for(ii k : finalEdges) MakeMap(k.first,k.second);
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:16:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(nums.size() == n) break;
      ~~~~~~~~~~~~^~~~
Alice.cpp:54:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0;i < edges.size();i++){
                ~~^~~~~~~~~~~~~~
Alice.cpp:6:6: warning: unused variable 'cnt' [-Wunused-variable]
  int cnt = 0;
      ^~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:22:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(nums.size() == on) break;
      ~~~~~~~~~~~~^~~~~
Bob.cpp:103:12: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
  extras[y] = true;
  ~~~~~~~~~~^~~~~~
Bob.cpp:102:12: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
  extras[x] = true;
  ~~~~~~~~~~^~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1006 ms 30704 KB Output is correct : V - N = 12
2 Correct 769 ms 26700 KB Output is correct : V - N = 12
3 Correct 305 ms 14984 KB Output is correct : V - N = 12
4 Correct 17 ms 7400 KB Output is correct : V - N = 12
5 Correct 191 ms 11168 KB Output is correct : V - N = 12
6 Correct 658 ms 24856 KB Output is correct : V - N = 12
7 Correct 970 ms 30208 KB Output is correct : V - N = 12
8 Correct 888 ms 28340 KB Output is correct : V - N = 12
9 Correct 430 ms 17416 KB Output is correct : V - N = 12
10 Correct 61 ms 8168 KB Output is correct : V - N = 12
11 Correct 98 ms 8928 KB Output is correct : V - N = 12
12 Correct 512 ms 19176 KB Output is correct : V - N = 12
13 Correct 904 ms 29076 KB Output is correct : V - N = 12
14 Correct 919 ms 29688 KB Output is correct : V - N = 12
15 Correct 594 ms 23744 KB Output is correct : V - N = 12
16 Correct 134 ms 9848 KB Output is correct : V - N = 12
17 Correct 35 ms 7664 KB Output is correct : V - N = 12
18 Correct 357 ms 16184 KB Output is correct : V - N = 12
19 Correct 839 ms 27632 KB Output is correct : V - N = 12
20 Correct 1020 ms 30800 KB Output is correct : V - N = 12
21 Correct 261 ms 13200 KB Output is correct : V - N = 12
22 Correct 214 ms 12016 KB Output is correct : V - N = 12
23 Correct 89 ms 8928 KB Output is correct : V - N = 12
24 Correct 11 ms 6896 KB Output is correct : V - N = 12
25 Correct 54 ms 8168 KB Output is correct : V - N = 12
26 Correct 174 ms 10968 KB Output is correct : V - N = 12
27 Correct 252 ms 13056 KB Output is correct : V - N = 12
28 Correct 228 ms 12544 KB Output is correct : V - N = 12
29 Correct 124 ms 9696 KB Output is correct : V - N = 12
30 Correct 16 ms 7248 KB Output is correct : V - N = 12
31 Correct 15 ms 7144 KB Output is correct : V - N = 12
32 Correct 15 ms 7152 KB Output is correct : V - N = 12
33 Correct 15 ms 7152 KB Output is correct : V - N = 12
34 Correct 15 ms 7144 KB Output is correct : V - N = 12
35 Correct 15 ms 7144 KB Output is correct : V - N = 12
36 Correct 973 ms 30792 KB Output is correct : V - N = 12
37 Correct 989 ms 30592 KB Output is correct : V - N = 12
38 Correct 1014 ms 30560 KB Output is correct : V - N = 12
39 Correct 981 ms 30496 KB Output is correct : V - N = 12
40 Correct 1014 ms 30776 KB Output is correct : V - N = 12
41 Correct 192 ms 11112 KB Output is correct : V - N = 12
42 Correct 155 ms 10200 KB Output is correct : V - N = 12
43 Correct 146 ms 10856 KB Output is correct : V - N = 12
44 Correct 16 ms 7144 KB Output is correct : V - N = 12
45 Correct 101 ms 9080 KB Output is correct : V - N = 12
46 Correct 341 ms 15572 KB Output is correct : V - N = 12
47 Correct 169 ms 10896 KB Output is correct : V - N = 12
48 Correct 460 ms 17400 KB Output is correct : V - N = 12
49 Correct 94 ms 8928 KB Output is correct : V - N = 12
50 Correct 41 ms 7664 KB Output is correct : V - N = 12
51 Correct 821 ms 26676 KB Output is correct : V - N = 12
52 Correct 17 ms 7400 KB Output is correct : V - N = 12
53 Correct 673 ms 24548 KB Output is correct : V - N = 12
54 Correct 900 ms 27992 KB Output is correct : V - N = 12
55 Correct 60 ms 8168 KB Output is correct : V - N = 12
56 Correct 486 ms 18824 KB Output is correct : V - N = 12
57 Correct 954 ms 29208 KB Output is correct : V - N = 12
58 Correct 132 ms 9944 KB Output is correct : V - N = 12
59 Correct 371 ms 15952 KB Output is correct : V - N = 12
60 Correct 986 ms 29848 KB Output is correct : V - N = 12
61 Correct 9 ms 6640 KB Output is correct : V - N = 12
62 Correct 9 ms 6896 KB Output is correct : V - N = 12
63 Correct 13 ms 6800 KB Output is correct : V - N = 12
64 Correct 9 ms 6640 KB Output is correct : V - N = 12
65 Correct 9 ms 6640 KB Output is correct : V - N = 12
66 Correct 23 ms 6640 KB Output is correct : V - N = 12
67 Correct 9 ms 6640 KB Output is correct : V - N = 12
68 Correct 9 ms 6896 KB Output is correct : V - N = 12
69 Correct 9 ms 6680 KB Output is correct : V - N = 12
70 Correct 20 ms 6640 KB Output is correct : V - N = 12
71 Correct 9 ms 6736 KB Output is correct : V - N = 12
72 Correct 9 ms 6640 KB Output is correct : V - N = 12
73 Correct 9 ms 6640 KB Output is correct : V - N = 12
74 Correct 17 ms 6640 KB Output is correct : V - N = 12
75 Correct 9 ms 6648 KB Output is correct : V - N = 12
76 Correct 9 ms 6896 KB Output is correct : V - N = 12
77 Correct 9 ms 6640 KB Output is correct : V - N = 12
78 Correct 9 ms 6896 KB Output is correct : V - N = 12
79 Correct 9 ms 6640 KB Output is correct : V - N = 12
80 Correct 10 ms 6640 KB Output is correct : V - N = 12
81 Correct 9 ms 6696 KB Output is correct : V - N = 12
82 Correct 9 ms 6896 KB Output is correct : V - N = 12
83 Correct 10 ms 6640 KB Output is correct : V - N = 12
84 Correct 9 ms 6640 KB Output is correct : V - N = 12
85 Correct 9 ms 6896 KB Output is correct : V - N = 12
86 Correct 9 ms 6640 KB Output is correct : V - N = 12
87 Correct 9 ms 6640 KB Output is correct : V - N = 12
88 Correct 9 ms 6896 KB Output is correct : V - N = 12
89 Correct 9 ms 6896 KB Output is correct : V - N = 12
90 Correct 9 ms 6640 KB Output is correct : V - N = 12
91 Correct 9 ms 6640 KB Output is correct : V - N = 12
92 Correct 10 ms 6640 KB Output is correct : V - N = 12
93 Correct 9 ms 6896 KB Output is correct : V - N = 12
94 Correct 9 ms 6896 KB Output is correct : V - N = 12
95 Correct 8 ms 6640 KB Output is correct : V - N = 12
96 Correct 9 ms 6640 KB Output is correct : V - N = 12
97 Correct 9 ms 6896 KB Output is correct : V - N = 12
98 Correct 9 ms 6904 KB Output is correct : V - N = 12
99 Correct 9 ms 6896 KB Output is correct : V - N = 12
100 Correct 9 ms 6896 KB Output is correct : V - N = 12
101 Correct 9 ms 6640 KB Output is correct : V - N = 12
102 Correct 9 ms 6640 KB Output is correct : V - N = 12
103 Correct 9 ms 6640 KB Output is correct : V - N = 12
104 Correct 9 ms 6896 KB Output is correct : V - N = 12
105 Correct 9 ms 6896 KB Output is correct : V - N = 12
106 Correct 9 ms 6904 KB Output is correct : V - N = 12
107 Correct 9 ms 6640 KB Output is correct : V - N = 12
108 Correct 10 ms 6640 KB Output is correct : V - N = 12
109 Correct 9 ms 6896 KB Output is correct : V - N = 12
110 Correct 9 ms 6640 KB Output is correct : V - N = 12
111 Correct 9 ms 6736 KB Output is correct : V - N = 12
112 Correct 9 ms 6640 KB Output is correct : V - N = 12
113 Correct 9 ms 6904 KB Output is correct : V - N = 12
114 Correct 9 ms 6648 KB Output is correct : V - N = 12
115 Correct 9 ms 6896 KB Output is correct : V - N = 12
116 Correct 9 ms 6736 KB Output is correct : V - N = 12
117 Correct 10 ms 6896 KB Output is correct : V - N = 12
118 Correct 9 ms 6640 KB Output is correct : V - N = 12
119 Correct 10 ms 6896 KB Output is correct : V - N = 12
120 Correct 9 ms 6640 KB Output is correct : V - N = 12
121 Correct 9 ms 6896 KB Output is correct : V - N = 12
122 Correct 9 ms 6896 KB Output is correct : V - N = 12
123 Correct 9 ms 6640 KB Output is correct : V - N = 12
124 Correct 9 ms 6640 KB Output is correct : V - N = 12
125 Correct 9 ms 6640 KB Output is correct : V - N = 12
126 Correct 9 ms 6896 KB Output is correct : V - N = 12
127 Correct 9 ms 6896 KB Output is correct : V - N = 12
128 Correct 9 ms 6640 KB Output is correct : V - N = 12
129 Correct 9 ms 6640 KB Output is correct : V - N = 12
130 Correct 9 ms 6896 KB Output is correct : V - N = 12
131 Correct 9 ms 6640 KB Output is correct : V - N = 12
132 Correct 9 ms 6640 KB Output is correct : V - N = 12
133 Correct 9 ms 6640 KB Output is correct : V - N = 12
134 Correct 9 ms 6640 KB Output is correct : V - N = 12
135 Correct 9 ms 6896 KB Output is correct : V - N = 12
136 Correct 8 ms 6640 KB Output is correct : V - N = 12
137 Correct 9 ms 6640 KB Output is correct : V - N = 12
138 Correct 9 ms 6736 KB Output is correct : V - N = 12
139 Correct 9 ms 6640 KB Output is correct : V - N = 12
140 Correct 10 ms 6640 KB Output is correct : V - N = 12
141 Correct 9 ms 6640 KB Output is correct : V - N = 12
142 Correct 8 ms 6896 KB Output is correct : V - N = 12
143 Correct 9 ms 6896 KB Output is correct : V - N = 12
144 Correct 9 ms 6736 KB Output is correct : V - N = 12
145 Correct 9 ms 6640 KB Output is correct : V - N = 12
146 Correct 9 ms 6640 KB Output is correct : V - N = 12
147 Correct 13 ms 6640 KB Output is correct : V - N = 12
148 Correct 9 ms 6648 KB Output is correct : V - N = 12
149 Correct 9 ms 6896 KB Output is correct : V - N = 12
150 Correct 9 ms 6896 KB Output is correct : V - N = 12
151 Correct 9 ms 6640 KB Output is correct : V - N = 12
152 Correct 9 ms 6640 KB Output is correct : V - N = 12
153 Correct 9 ms 6736 KB Output is correct : V - N = 12
154 Correct 9 ms 6648 KB Output is correct : V - N = 12
155 Correct 9 ms 6640 KB Output is correct : V - N = 12
156 Correct 9 ms 6640 KB Output is correct : V - N = 12
157 Correct 9 ms 6648 KB Output is correct : V - N = 12
158 Correct 9 ms 6640 KB Output is correct : V - N = 12
159 Correct 8 ms 6640 KB Output is correct : V - N = 12
160 Correct 9 ms 6640 KB Output is correct : V - N = 12
161 Correct 9 ms 6648 KB Output is correct : V - N = 12
162 Correct 9 ms 6640 KB Output is correct : V - N = 12
163 Correct 9 ms 6896 KB Output is correct : V - N = 12
164 Correct 9 ms 6640 KB Output is correct : V - N = 12
165 Correct 9 ms 6896 KB Output is correct : V - N = 12
166 Correct 11 ms 6736 KB Output is correct : V - N = 12
167 Correct 10 ms 6640 KB Output is correct : V - N = 12
168 Correct 16 ms 6648 KB Output is correct : V - N = 12
169 Correct 9 ms 6640 KB Output is correct : V - N = 12
170 Correct 9 ms 6896 KB Output is correct : V - N = 12
171 Correct 9 ms 6640 KB Output is correct : V - N = 12
172 Correct 9 ms 6896 KB Output is correct : V - N = 12
173 Correct 9 ms 6904 KB Output is correct : V - N = 12
174 Correct 9 ms 6896 KB Output is correct : V - N = 12
175 Correct 9 ms 6640 KB Output is correct : V - N = 12
176 Correct 15 ms 6896 KB Output is correct : V - N = 12
177 Correct 9 ms 6896 KB Output is correct : V - N = 12
178 Correct 9 ms 6640 KB Output is correct : V - N = 12