oj.uz

Submission #414924

# Submission time Handle Problem Language Result Execution time Memory
414924 2021-05-31T10:40:32 Z Pro_ktmr Airline Route Map (JOI18_airline) C++17
100 / 100
 849 ms 29304 KB 
#include"bits/stdc++.h"
#include"Alicelib.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
int dx[4]={ 1,0,-1,0 };
int dy[4]={ 0,1,0,-1 };
 
// void InitG(int V, int U)
// void MakeG(int pos, int C, int D)
 
void Alice(int N, int M, int A[], int B[]){
	vector<pair<int,int>> ret;
	rep(i, M) ret.pb({ A[i], B[i] });
 
	rep(i, N){
		rep(j, 10){
			if((i>>j)&1) ret.pb({i, N+j});
		}
	}
	rep(i, 10) ret.pb({ N+10, N+i });
	rep(i, 9) ret.pb({ N+i, N+1+i });
	rep(i, N+10){
		if(N > 500 && i == N) continue;
		if(N <= 500 && i == N+9) continue;
		ret.pb({ i, N+11 });
	}
 
	InitG(N+12, ret.size());
	rep(i, ret.size()) MakeG(i, ret[i].first, ret[i].second);
}
#include"bits/stdc++.h"
#include"Boblib.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
int dx[4]={ 1,0,-1,0 };
int dy[4]={ 0,1,0,-1 };
 
// void InitMap(int N, int M)
// void MakeMap(int A, int B)
 
bool isExist(vector<int>& v, int n){
	rep(i, v.size()){
		if(v[i] == n) return true;
	}
	return false;
}
 
void Bob(int V, int U, int C[], int D[]){
	if(V == 13){
		InitMap(1, 0);
		return;
	}
 
	vector<int> e[1020];
	rep(i, U){
		e[C[i]].pb(D[i]);
		e[D[i]].pb(C[i]);
		//cout << C[i] << " " << D[i] << endl;
	}
 
	int N = V-12;
	int r, b;
	vector<int> t(10, -1);
	rep(i, V){
		if(e[i].size() == N+9){
			r = i;
			rep(j, V){
				if(j != r && !isExist(e[r], j) && e[j].size() == 10) b = j;
				else if(j != r && !isExist(e[r], j)) t[0] = j;
			}
			int c = 0;
			rep(j, 10){
				if(isExist(e[t[0]], e[b][j])) c++;
			}
			if(c == 1 && e[t[0]].size()-2 == N/2) break;
		}
	}
	
	rep(i, 9){
		rep(j, 10){
			//cout << e[b][j] << " " << isExist(e[t[i]], e[b][j]) << " " << !isExist(t, e[b][j]) << endl;
			if(isExist(e[t[i]], e[b][j]) && !isExist(t, e[b][j])){
				t[i+1] = e[b][j];
			}
		}
	}
	if(N <= 500) reverse(all(t));
	//cout << "rb: " << r << " " << b << endl;
	//rep(i, 10) cout << t[i] << " ";
	//cout << endl;
 
	vector<int> ans(V, 0);
	rep(i, 10){
		rep(j, e[t[i]].size()){
			ans[e[t[i]][j]] += 1<<i;
		}
	}
 
	t.pb(r);
	t.pb(b);
	vector<pair<int, int>> edges;
	rep(i, U){
		if(isExist(t, C[i]) || isExist(t, D[i])) continue;
		edges.pb({ ans[C[i]], ans[D[i]] });
		//cout << ans[C[i]] << " " << ans[D[i]] << endl;
	}
 
	InitMap(N, edges.size());
	rep(i, edges.size()) MakeMap(edges[i].first, edges[i].second);
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:21:2: note: in expansion of macro 'rep'
   21 |  rep(i, M) ret.pb({ A[i], B[i] });
      |  ^~~
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:23:2: note: in expansion of macro 'rep'
   23 |  rep(i, N){
      |  ^~~
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:24:3: note: in expansion of macro 'rep'
   24 |   rep(j, 10){
      |   ^~~
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:28:2: note: in expansion of macro 'rep'
   28 |  rep(i, 10) ret.pb({ N+10, N+i });
      |  ^~~
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:29:2: note: in expansion of macro 'rep'
   29 |  rep(i, 9) ret.pb({ N+i, N+1+i });
      |  ^~~
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:30:2: note: in expansion of macro 'rep'
   30 |  rep(i, N+10){
      |  ^~~
Alice.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Alice.cpp:37:2: note: in expansion of macro 'rep'
   37 |  rep(i, ret.size()) MakeG(i, ret[i].first, ret[i].second);
      |  ^~~

Bob.cpp: In function 'bool isExist(std::vector<int>&, int)':
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:20:2: note: in expansion of macro 'rep'
   20 |  rep(i, v.size()){
      |  ^~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:33:2: note: in expansion of macro 'rep'
   33 |  rep(i, U){
      |  ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:42:2: note: in expansion of macro 'rep'
   42 |  rep(i, V){
      |  ^~~
Bob.cpp:43:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |   if(e[i].size() == N+9){
      |      ~~~~~~~~~~~~^~~~~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:45:4: note: in expansion of macro 'rep'
   45 |    rep(j, V){
      |    ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:50:4: note: in expansion of macro 'rep'
   50 |    rep(j, 10){
      |    ^~~
Bob.cpp:53:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |    if(c == 1 && e[t[0]].size()-2 == N/2) break;
      |                 ~~~~~~~~~~~~~~~~~^~~~~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:57:2: note: in expansion of macro 'rep'
   57 |  rep(i, 9){
      |  ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:58:3: note: in expansion of macro 'rep'
   58 |   rep(j, 10){
      |   ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:71:2: note: in expansion of macro 'rep'
   71 |  rep(i, 10){
      |  ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:72:3: note: in expansion of macro 'rep'
   72 |   rep(j, e[t[i]].size()){
      |   ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:80:2: note: in expansion of macro 'rep'
   80 |  rep(i, U){
      |  ^~~
Bob.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Bob.cpp:87:2: note: in expansion of macro 'rep'
   87 |  rep(i, edges.size()) MakeMap(edges[i].first, edges[i].second);
      |  ^~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4584 KB Output is correct
2 Correct 4 ms 4496 KB Output is correct
3 Correct 3 ms 4588 KB Output is correct
4 Correct 3 ms 4560 KB Output is correct
5 Correct 3 ms 4644 KB Output is correct
6 Correct 3 ms 4592 KB Output is correct
7 Correct 3 ms 4720 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 3 ms 4540 KB Output is correct
10 Correct 3 ms 4584 KB Output is correct
11 Correct 3 ms 4588 KB Output is correct
12 Correct 3 ms 4512 KB Output is correct
13 Correct 4 ms 4516 KB Output is correct
14 Correct 3 ms 4516 KB Output is correct
15 Correct 3 ms 4588 KB Output is correct
16 Correct 3 ms 4588 KB Output is correct
17 Correct 3 ms 4580 KB Output is correct
18 Correct 3 ms 4588 KB Output is correct
19 Correct 3 ms 4588 KB Output is correct
20 Correct 4 ms 4596 KB Output is correct
21 Correct 3 ms 4568 KB Output is correct
22 Correct 3 ms 4568 KB Output is correct
23 Correct 3 ms 4512 KB Output is correct
24 Correct 3 ms 4580 KB Output is correct
25 Correct 3 ms 4584 KB Output is correct
26 Correct 3 ms 4568 KB Output is correct
27 Correct 3 ms 4528 KB Output is correct
28 Correct 4 ms 4516 KB Output is correct
29 Correct 3 ms 4588 KB Output is correct
30 Correct 3 ms 4580 KB Output is correct
31 Correct 3 ms 4584 KB Output is correct
32 Correct 3 ms 4584 KB Output is correct
33 Correct 3 ms 4588 KB Output is correct
34 Correct 3 ms 4516 KB Output is correct
35 Correct 3 ms 4504 KB Output is correct
36 Correct 3 ms 4496 KB Output is correct
37 Correct 3 ms 4588 KB Output is correct
38 Correct 3 ms 4588 KB Output is correct
39 Correct 3 ms 4592 KB Output is correct
40 Correct 3 ms 4492 KB Output is correct
41 Correct 3 ms 4588 KB Output is correct
42 Correct 4 ms 4640 KB Output is correct
43 Correct 4 ms 4520 KB Output is correct
44 Correct 4 ms 4572 KB Output is correct
45 Correct 4 ms 4584 KB Output is correct
46 Correct 4 ms 4600 KB Output is correct
47 Correct 3 ms 4588 KB Output is correct
48 Correct 3 ms 4740 KB Output is correct
49 Correct 3 ms 4588 KB Output is correct
50 Correct 3 ms 4584 KB Output is correct
51 Correct 4 ms 4584 KB Output is correct
52 Correct 4 ms 4600 KB Output is correct
53 Correct 3 ms 4516 KB Output is correct
54 Correct 4 ms 4584 KB Output is correct
55 Correct 4 ms 4516 KB Output is correct
56 Correct 3 ms 4588 KB Output is correct
57 Correct 3 ms 4588 KB Output is correct
58 Correct 4 ms 4496 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4584 KB Output is correct
2 Correct 4 ms 4496 KB Output is correct
3 Correct 3 ms 4588 KB Output is correct
4 Correct 3 ms 4560 KB Output is correct
5 Correct 3 ms 4644 KB Output is correct
6 Correct 3 ms 4592 KB Output is correct
7 Correct 3 ms 4720 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 3 ms 4540 KB Output is correct
10 Correct 3 ms 4584 KB Output is correct
11 Correct 3 ms 4588 KB Output is correct
12 Correct 3 ms 4512 KB Output is correct
13 Correct 4 ms 4516 KB Output is correct
14 Correct 3 ms 4516 KB Output is correct
15 Correct 3 ms 4588 KB Output is correct
16 Correct 3 ms 4588 KB Output is correct
17 Correct 3 ms 4580 KB Output is correct
18 Correct 3 ms 4588 KB Output is correct
19 Correct 3 ms 4588 KB Output is correct
20 Correct 4 ms 4596 KB Output is correct
21 Correct 3 ms 4568 KB Output is correct
22 Correct 3 ms 4568 KB Output is correct
23 Correct 3 ms 4512 KB Output is correct
24 Correct 3 ms 4580 KB Output is correct
25 Correct 3 ms 4584 KB Output is correct
26 Correct 3 ms 4568 KB Output is correct
27 Correct 3 ms 4528 KB Output is correct
28 Correct 4 ms 4516 KB Output is correct
29 Correct 3 ms 4588 KB Output is correct
30 Correct 3 ms 4580 KB Output is correct
31 Correct 3 ms 4584 KB Output is correct
32 Correct 3 ms 4584 KB Output is correct
33 Correct 3 ms 4588 KB Output is correct
34 Correct 3 ms 4516 KB Output is correct
35 Correct 3 ms 4504 KB Output is correct
36 Correct 3 ms 4496 KB Output is correct
37 Correct 3 ms 4588 KB Output is correct
38 Correct 3 ms 4588 KB Output is correct
39 Correct 3 ms 4592 KB Output is correct
40 Correct 3 ms 4492 KB Output is correct
41 Correct 3 ms 4588 KB Output is correct
42 Correct 4 ms 4640 KB Output is correct
43 Correct 4 ms 4520 KB Output is correct
44 Correct 4 ms 4572 KB Output is correct
45 Correct 4 ms 4584 KB Output is correct
46 Correct 4 ms 4600 KB Output is correct
47 Correct 3 ms 4588 KB Output is correct
48 Correct 3 ms 4740 KB Output is correct
49 Correct 3 ms 4588 KB Output is correct
50 Correct 3 ms 4584 KB Output is correct
51 Correct 4 ms 4584 KB Output is correct
52 Correct 4 ms 4600 KB Output is correct
53 Correct 3 ms 4516 KB Output is correct
54 Correct 4 ms 4584 KB Output is correct
55 Correct 4 ms 4516 KB Output is correct
56 Correct 3 ms 4588 KB Output is correct
57 Correct 3 ms 4588 KB Output is correct
58 Correct 4 ms 4496 KB Output is correct
59 Correct 5 ms 4720 KB Output is correct
60 Correct 4 ms 4712 KB Output is correct
61 Correct 4 ms 4516 KB Output is correct
62 Correct 4 ms 4588 KB Output is correct
63 Correct 4 ms 4588 KB Output is correct
64 Correct 4 ms 4588 KB Output is correct
65 Correct 4 ms 4716 KB Output is correct
66 Correct 4 ms 4588 KB Output is correct
67 Correct 3 ms 4588 KB Output is correct
68 Correct 3 ms 4588 KB Output is correct
69 Correct 3 ms 4564 KB Output is correct
70 Correct 4 ms 4644 KB Output is correct
71 Correct 4 ms 4564 KB Output is correct
72 Correct 5 ms 4624 KB Output is correct
73 Correct 5 ms 4624 KB Output is correct
74 Correct 4 ms 4588 KB Output is correct
75 Correct 3 ms 4588 KB Output is correct
76 Correct 4 ms 4588 KB Output is correct
77 Correct 3 ms 4656 KB Output is correct
78 Correct 4 ms 4716 KB Output is correct
79 Correct 4 ms 4588 KB Output is correct
80 Correct 3 ms 4580 KB Output is correct
81 Correct 3 ms 4588 KB Output is correct
82 Correct 4 ms 4508 KB Output is correct
83 Correct 4 ms 4496 KB Output is correct
84 Correct 3 ms 4588 KB Output is correct
85 Correct 4 ms 4696 KB Output is correct
86 Correct 4 ms 4624 KB Output is correct
87 Correct 3 ms 4596 KB Output is correct
88 Correct 3 ms 4568 KB Output is correct
89 Correct 4 ms 4588 KB Output is correct
90 Correct 4 ms 4564 KB Output is correct
91 Correct 3 ms 4580 KB Output is correct
92 Correct 4 ms 4528 KB Output is correct
93 Correct 4 ms 4624 KB Output is correct
94 Correct 5 ms 4624 KB Output is correct
95 Correct 4 ms 4716 KB Output is correct
96 Correct 4 ms 4692 KB Output is correct
97 Correct 4 ms 4644 KB Output is correct
98 Correct 4 ms 4716 KB Output is correct
99 Correct 4 ms 4596 KB Output is correct
100 Correct 4 ms 4600 KB Output is correct
101 Correct 3 ms 4516 KB Output is correct
102 Correct 3 ms 4584 KB Output is correct
103 Correct 3 ms 4588 KB Output is correct
104 Correct 3 ms 4584 KB Output is correct
105 Correct 4 ms 4716 KB Output is correct
106 Correct 5 ms 4644 KB Output is correct
107 Correct 3 ms 4516 KB Output is correct
108 Correct 3 ms 4548 KB Output is correct
109 Correct 5 ms 4624 KB Output is correct
110 Correct 3 ms 4540 KB Output is correct
111 Correct 3 ms 4772 KB Output is correct
112 Correct 3 ms 4580 KB Output is correct
113 Correct 3 ms 4592 KB Output is correct
114 Correct 3 ms 4588 KB Output is correct
115 Correct 4 ms 4716 KB Output is correct
116 Correct 4 ms 4588 KB Output is correct
117 Correct 4 ms 4632 KB Output is correct
118 Correct 4 ms 4652 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 849 ms 29236 KB Output is correct : V - N = 12
2 Correct 673 ms 25568 KB Output is correct : V - N = 12
3 Correct 205 ms 13824 KB Output is correct : V - N = 12
4 Correct 11 ms 5148 KB Output is correct : V - N = 12
5 Correct 147 ms 9800 KB Output is correct : V - N = 12
6 Correct 410 ms 23552 KB Output is correct : V - N = 12
7 Correct 647 ms 28872 KB Output is correct : V - N = 12
8 Correct 536 ms 27348 KB Output is correct : V - N = 12
9 Correct 291 ms 15988 KB Output is correct : V - N = 12
10 Correct 38 ms 6388 KB Output is correct : V - N = 12
11 Correct 91 ms 7372 KB Output is correct : V - N = 12
12 Correct 362 ms 18204 KB Output is correct : V - N = 12
13 Correct 659 ms 27968 KB Output is correct : V - N = 12
14 Correct 713 ms 28488 KB Output is correct : V - N = 12
15 Correct 391 ms 22508 KB Output is correct : V - N = 12
16 Correct 87 ms 8240 KB Output is correct : V - N = 12
17 Correct 28 ms 5676 KB Output is correct : V - N = 12
18 Correct 270 ms 14956 KB Output is correct : V - N = 12
19 Correct 634 ms 26576 KB Output is correct : V - N = 12
20 Correct 744 ms 29048 KB Output is correct : V - N = 12
21 Correct 142 ms 12284 KB Output is correct : V - N = 12
22 Correct 154 ms 10136 KB Output is correct : V - N = 12
23 Correct 43 ms 7240 KB Output is correct : V - N = 12
24 Correct 6 ms 4844 KB Output is correct : V - N = 12
25 Correct 46 ms 6096 KB Output is correct : V - N = 12
26 Correct 120 ms 9672 KB Output is correct : V - N = 12
27 Correct 174 ms 11164 KB Output is correct : V - N = 12
28 Correct 204 ms 10612 KB Output is correct : V - N = 12
29 Correct 100 ms 7812 KB Output is correct : V - N = 12
30 Correct 12 ms 5264 KB Output is correct : V - N = 12
31 Correct 10 ms 5008 KB Output is correct : V - N = 12
32 Correct 10 ms 5008 KB Output is correct : V - N = 12
33 Correct 10 ms 4900 KB Output is correct : V - N = 12
34 Correct 11 ms 4880 KB Output is correct : V - N = 12
35 Correct 12 ms 4948 KB Output is correct : V - N = 12
36 Correct 689 ms 29268 KB Output is correct : V - N = 12
37 Correct 812 ms 29272 KB Output is correct : V - N = 12
38 Correct 778 ms 29168 KB Output is correct : V - N = 12
39 Correct 768 ms 29164 KB Output is correct : V - N = 12
40 Correct 710 ms 29304 KB Output is correct : V - N = 12
41 Correct 152 ms 9732 KB Output is correct : V - N = 12
42 Correct 105 ms 8448 KB Output is correct : V - N = 12
43 Correct 144 ms 9492 KB Output is correct : V - N = 12
44 Correct 14 ms 5084 KB Output is correct : V - N = 12
45 Correct 86 ms 7500 KB Output is correct : V - N = 12
46 Correct 188 ms 14268 KB Output is correct : V - N = 12
47 Correct 126 ms 9800 KB Output is correct : V - N = 12
48 Correct 322 ms 16168 KB Output is correct : V - N = 12
49 Correct 70 ms 7156 KB Output is correct : V - N = 12
50 Correct 19 ms 5632 KB Output is correct : V - N = 12
51 Correct 573 ms 25552 KB Output is correct : V - N = 12
52 Correct 13 ms 5168 KB Output is correct : V - N = 12
53 Correct 452 ms 23476 KB Output is correct : V - N = 12
54 Correct 552 ms 26984 KB Output is correct : V - N = 12
55 Correct 40 ms 6304 KB Output is correct : V - N = 12
56 Correct 372 ms 17680 KB Output is correct : V - N = 12
57 Correct 723 ms 28232 KB Output is correct : V - N = 12
58 Correct 83 ms 8296 KB Output is correct : V - N = 12
59 Correct 280 ms 14772 KB Output is correct : V - N = 12
60 Correct 609 ms 28648 KB Output is correct : V - N = 12
61 Correct 4 ms 4772 KB Output is correct : V - N = 12
62 Correct 4 ms 4560 KB Output is correct : V - N = 12
63 Correct 4 ms 4528 KB Output is correct : V - N = 12
64 Correct 4 ms 4588 KB Output is correct : V - N = 12
65 Correct 4 ms 4516 KB Output is correct : V - N = 12
66 Correct 4 ms 4636 KB Output is correct : V - N = 12
67 Correct 4 ms 4716 KB Output is correct : V - N = 12
68 Correct 4 ms 4696 KB Output is correct : V - N = 12
69 Correct 4 ms 4644 KB Output is correct : V - N = 12
70 Correct 5 ms 4584 KB Output is correct : V - N = 12
71 Correct 3 ms 4516 KB Output is correct : V - N = 12
72 Correct 4 ms 4696 KB Output is correct : V - N = 12
73 Correct 3 ms 4644 KB Output is correct : V - N = 12
74 Correct 4 ms 4716 KB Output is correct : V - N = 12
75 Correct 3 ms 4716 KB Output is correct : V - N = 12
76 Correct 3 ms 4596 KB Output is correct : V - N = 12
77 Correct 3 ms 4588 KB Output is correct : V - N = 12
78 Correct 4 ms 4636 KB Output is correct : V - N = 12
79 Correct 4 ms 4588 KB Output is correct : V - N = 12
80 Correct 5 ms 4624 KB Output is correct : V - N = 12
81 Correct 4 ms 4568 KB Output is correct : V - N = 12
82 Correct 3 ms 4588 KB Output is correct : V - N = 12
83 Correct 3 ms 4568 KB Output is correct : V - N = 12
84 Correct 4 ms 4580 KB Output is correct : V - N = 12
85 Correct 4 ms 4568 KB Output is correct : V - N = 12
86 Correct 3 ms 4568 KB Output is correct : V - N = 12
87 Correct 4 ms 4644 KB Output is correct : V - N = 12
88 Correct 4 ms 4716 KB Output is correct : V - N = 12
89 Correct 4 ms 4568 KB Output is correct : V - N = 12
90 Correct 4 ms 4496 KB Output is correct : V - N = 12
91 Correct 3 ms 4584 KB Output is correct : V - N = 12
92 Correct 3 ms 4564 KB Output is correct : V - N = 12
93 Correct 3 ms 4592 KB Output is correct : V - N = 12
94 Correct 3 ms 4496 KB Output is correct : V - N = 12
95 Correct 5 ms 4516 KB Output is correct : V - N = 12
96 Correct 5 ms 4716 KB Output is correct : V - N = 12
97 Correct 4 ms 4624 KB Output is correct : V - N = 12
98 Correct 4 ms 4716 KB Output is correct : V - N = 12
99 Correct 4 ms 4724 KB Output is correct : V - N = 12
100 Correct 4 ms 4712 KB Output is correct : V - N = 12
101 Correct 4 ms 4624 KB Output is correct : V - N = 12
102 Correct 5 ms 4516 KB Output is correct : V - N = 12
103 Correct 4 ms 4708 KB Output is correct : V - N = 12
104 Correct 3 ms 4512 KB Output is correct : V - N = 12
105 Correct 3 ms 4588 KB Output is correct : V - N = 12
106 Correct 3 ms 4588 KB Output is correct : V - N = 12
107 Correct 4 ms 4496 KB Output is correct : V - N = 12
108 Correct 3 ms 4596 KB Output is correct : V - N = 12
109 Correct 4 ms 4588 KB Output is correct : V - N = 12
110 Correct 3 ms 4516 KB Output is correct : V - N = 12
111 Correct 3 ms 4640 KB Output is correct : V - N = 12
112 Correct 3 ms 4588 KB Output is correct : V - N = 12
113 Correct 3 ms 4576 KB Output is correct : V - N = 12
114 Correct 3 ms 4588 KB Output is correct : V - N = 12
115 Correct 3 ms 4588 KB Output is correct : V - N = 12
116 Correct 3 ms 4572 KB Output is correct : V - N = 12
117 Correct 4 ms 4716 KB Output is correct : V - N = 12
118 Correct 3 ms 4588 KB Output is correct : V - N = 12
119 Correct 3 ms 4584 KB Output is correct : V - N = 12
120 Correct 3 ms 4588 KB Output is correct : V - N = 12
121 Correct 3 ms 4496 KB Output is correct : V - N = 12
122 Correct 3 ms 4588 KB Output is correct : V - N = 12
123 Correct 3 ms 4592 KB Output is correct : V - N = 12
124 Correct 4 ms 4496 KB Output is correct : V - N = 12
125 Correct 3 ms 4524 KB Output is correct : V - N = 12
126 Correct 3 ms 4584 KB Output is correct : V - N = 12
127 Correct 3 ms 4592 KB Output is correct : V - N = 12
128 Correct 3 ms 4644 KB Output is correct : V - N = 12
129 Correct 3 ms 4540 KB Output is correct : V - N = 12
130 Correct 4 ms 4592 KB Output is correct : V - N = 12
131 Correct 3 ms 4568 KB Output is correct : V - N = 12
132 Correct 3 ms 4512 KB Output is correct : V - N = 12
133 Correct 4 ms 4528 KB Output is correct : V - N = 12
134 Correct 3 ms 4568 KB Output is correct : V - N = 12
135 Correct 5 ms 4496 KB Output is correct : V - N = 12
136 Correct 3 ms 4588 KB Output is correct : V - N = 12
137 Correct 4 ms 4564 KB Output is correct : V - N = 12
138 Correct 4 ms 4572 KB Output is correct : V - N = 12
139 Correct 3 ms 4588 KB Output is correct : V - N = 12
140 Correct 3 ms 4588 KB Output is correct : V - N = 12
141 Correct 3 ms 4568 KB Output is correct : V - N = 12
142 Correct 3 ms 4520 KB Output is correct : V - N = 12
143 Correct 3 ms 4588 KB Output is correct : V - N = 12
144 Correct 4 ms 4496 KB Output is correct : V - N = 12
145 Correct 3 ms 4516 KB Output is correct : V - N = 12
146 Correct 4 ms 4564 KB Output is correct : V - N = 12
147 Correct 4 ms 4640 KB Output is correct : V - N = 12
148 Correct 3 ms 4564 KB Output is correct : V - N = 12
149 Correct 3 ms 4540 KB Output is correct : V - N = 12
150 Correct 3 ms 4496 KB Output is correct : V - N = 12
151 Correct 3 ms 4584 KB Output is correct : V - N = 12
152 Correct 3 ms 4584 KB Output is correct : V - N = 12
153 Correct 4 ms 4496 KB Output is correct : V - N = 12
154 Correct 5 ms 4584 KB Output is correct : V - N = 12
155 Correct 3 ms 4496 KB Output is correct : V - N = 12
156 Correct 3 ms 4496 KB Output is correct : V - N = 12
157 Correct 3 ms 4568 KB Output is correct : V - N = 12
158 Correct 4 ms 4580 KB Output is correct : V - N = 12
159 Correct 3 ms 4588 KB Output is correct : V - N = 12
160 Correct 4 ms 4516 KB Output is correct : V - N = 12
161 Correct 3 ms 4624 KB Output is correct : V - N = 12
162 Correct 3 ms 4588 KB Output is correct : V - N = 12
163 Correct 3 ms 4596 KB Output is correct : V - N = 12
164 Correct 3 ms 4516 KB Output is correct : V - N = 12
165 Correct 3 ms 4528 KB Output is correct : V - N = 12
166 Correct 3 ms 4588 KB Output is correct : V - N = 12
167 Correct 4 ms 4584 KB Output is correct : V - N = 12
168 Correct 3 ms 4568 KB Output is correct : V - N = 12
169 Correct 3 ms 4496 KB Output is correct : V - N = 12
170 Correct 3 ms 4592 KB Output is correct : V - N = 12
171 Correct 4 ms 4528 KB Output is correct : V - N = 12
172 Correct 3 ms 4588 KB Output is correct : V - N = 12
173 Correct 4 ms 4496 KB Output is correct : V - N = 12
174 Correct 4 ms 4568 KB Output is correct : V - N = 12
175 Correct 3 ms 4516 KB Output is correct : V - N = 12
176 Correct 3 ms 4540 KB Output is correct : V - N = 12
177 Correct 3 ms 4600 KB Output is correct : V - N = 12
178 Correct 4 ms 4584 KB Output is correct : V - N = 12