oj.uz

답안 #1028390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028390 2024-07-19T18:52:29 Z Antekb 항공 노선도 (JOI18_airline) C++17
100 / 100
 413 ms 29688 KB 
#pragma GCC optimize("O3")
#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

#include "Alicelib.h"

void Alice( int n, int m, int A[], int B[] ){
	vector<pii> edg;
	for(int i=0; i<m; i++){
		deb("Alice", A[i], B[i]);
		edg.pb(mp(A[i], B[i]));
	}
	int full=n;
	int bit_ptr=n+1;
	int bits_beg=n+2;
	int bits=10;
	for(int i=0; i<n; i++){
		edg.pb(mp(full, i));
		for(int j=0; j<bits; j++){
			if(i&(1<<j)){
				edg.pb(mp(i, bits_beg+j));
			}
		}
	}
	edg.pb(mp(bits_beg, bits_beg+2));
	edg.pb(mp(bits_beg, bits_beg+3));
	for(int j=0; j<bits; j++){
		if(j>1)edg.pb(mp(bits_beg+j-1, bits_beg+j));
		edg.pb(mp(full, bits_beg+j));
		edg.pb(mp(bit_ptr, bits_beg+j));
	}
	InitG( bits_beg+bits, edg.size() );
	for(int i=0; i<SZ(edg); i++){
		MakeG(i, edg[i].st, edg[i].nd );
	}
}


#pragma GCC optimize("O3")
#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

#include "Boblib.h"

vector<int> get_bits(vector<vi> &E, vi V){
	int k=V.size();
	vector<vi> E2(k);
	assert(k==10);
	for(int i=0; i<k; i++){
		for(int j=0; j<k; j++){
			if(find(all(E[V[i]]), V[j])!=E[V[i]].end()){
				E2[i].push_back(j);
			}
		}
	}
	vi deg3;
	for(int i=0; i<k; i++){
		if(E2[i].size()==3)deg3.pb(i);
	}
	assert(deg3.size()==2);
	vi ans(k, -1);
	for(int i=0; i<k; i++){
		if(binary_search(all(E2[i]), deg3[0]) && binary_search(all(E2[i]), deg3[1])){
			assert(ans[0]==-1);
			ans[0]=i;
		}
	}
	assert(ans[0]!=-1);
	E2[deg3[0]].erase(find(all(E2[deg3[0]]), ans[0]));
	E2[deg3[1]].erase(find(all(E2[deg3[1]]), ans[0]));
	E2[deg3[0]].erase(find(all(E2[deg3[0]]), deg3[1]));
	E2[deg3[1]].erase(find(all(E2[deg3[1]]), deg3[0]));
	if(E2[E2[deg3[0]][0]].size()==2){
		assert(E2[E2[deg3[1]][0]].size()==1);
		swap(deg3[0], deg3[1]);
	}
	ans[1]=E2[deg3[0]][0];
	ans[2]=deg3[0];
	ans[3]=deg3[1];
	for(int i=3; i<k-1; i++){
		E2[E2[ans[i]][0]].erase(find(all(E2[E2[ans[i]][0]]), ans[i]));
		assert(E2[ans[i]].size()==1);
		ans[i+1]=E2[ans[i]][0];
	}
	for(int &i:ans){
		i=V[i];
	}
	return ans;
}

void Bob( int n, int m, int A[], int B[] ){
	vector<vector<int> > E(n);
	for(int i=0; i<m; i++){
		E[A[i]].pb(B[i]);
		E[B[i]].pb(A[i]);
		deb("Bob", A[i], B[i]);
	}
	int full=-1;
	int bit_ptr=-1;
	for(int i=0; i<n; i++){
		if(SZ(E[i])==n-2){
			sort(all(E[i]));
			int cand=-1;
			for(int j=0; j<n; j++){
				if(j!=i && !binary_search(all(E[i]), j)){
					assert(cand==-1);
					cand=j;
				}
			}
			if(SZ(E[cand])==10){
				assert(full==-1);
				full=i;
				bit_ptr=cand;
			}
		}
	}
	deb(full, bit_ptr);
	assert(full!=-1);
	vector<int> bits=get_bits(E, E[bit_ptr]);
	deb(bits);

	vector<int> labels(n);
	for(int i:bits)labels[i]=-1;
	for(int i=0; i<m; i++){
		if(labels[A[i]]==-1 && labels[B[i]]==-1){
			deb(A[i], B[i]);
		}
	}
	labels[full]=-1;
	labels[bit_ptr]=-1;
	for(int i=0; i<n; i++){
		if(labels[i]!=-1){
			sort(all(E[i]));
			for(int j=0; j<SZ(bits); j++){
				if(binary_search(all(E[i]), bits[j]))labels[i]+=(1<<j);
			}
		}
	}
	vector<pii> edg;
	for(int i=0; i<n; i++){
		if(labels[i]==-1)continue;
		for(int j:E[i]){
			if(labels[j]!=-1 && j<i){
				edg.pb(mp(labels[i], labels[j]));
			}
		}
	}
	for(auto &[x, y]:edg){
		deb(x, y);
	}
	InitMap( n-SZ(bits)-2, SZ(edg) );
	for(auto &[x, y]:edg){
		MakeMap( x, y );
	}

}

Compilation message

Alice.cpp:18:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                  ^~~~
Alice.cpp:18:32: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                ^~~~
Alice.cpp:18:38: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                      ^~~~
Alice.cpp:20:17: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                 ^~~~
Alice.cpp:20:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                          ^~~~

Bob.cpp:18:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                  ^~~~
Bob.cpp:18:32: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                ^~~~
Bob.cpp:18:38: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                      ^~~~
Bob.cpp:20:17: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                 ^~~~
Bob.cpp:20:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                          ^~~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:135:12: warning: unused structured binding declaration [-Wunused-variable]
  135 |  for(auto &[x, y]:edg){
      |            ^~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 29344 KB Output is correct : V - N = 12
2 Correct 280 ms 25556 KB Output is correct : V - N = 12
3 Correct 104 ms 13976 KB Output is correct : V - N = 12
4 Correct 8 ms 5412 KB Output is correct : V - N = 12
5 Correct 76 ms 9876 KB Output is correct : V - N = 12
6 Correct 251 ms 23732 KB Output is correct : V - N = 12
7 Correct 386 ms 28860 KB Output is correct : V - N = 12
8 Correct 334 ms 27776 KB Output is correct : V - N = 12
9 Correct 153 ms 16432 KB Output is correct : V - N = 12
10 Correct 17 ms 6576 KB Output is correct : V - N = 12
11 Correct 28 ms 7632 KB Output is correct : V - N = 12
12 Correct 199 ms 18536 KB Output is correct : V - N = 12
13 Correct 329 ms 28092 KB Output is correct : V - N = 12
14 Correct 349 ms 28464 KB Output is correct : V - N = 12
15 Correct 227 ms 22816 KB Output is correct : V - N = 12
16 Correct 44 ms 8356 KB Output is correct : V - N = 12
17 Correct 9 ms 6000 KB Output is correct : V - N = 12
18 Correct 117 ms 15280 KB Output is correct : V - N = 12
19 Correct 288 ms 26692 KB Output is correct : V - N = 12
20 Correct 341 ms 29256 KB Output is correct : V - N = 12
21 Correct 92 ms 12468 KB Output is correct : V - N = 12
22 Correct 66 ms 10360 KB Output is correct : V - N = 12
23 Correct 26 ms 7660 KB Output is correct : V - N = 12
24 Correct 3 ms 4896 KB Output is correct : V - N = 12
25 Correct 15 ms 6456 KB Output is correct : V - N = 12
26 Correct 64 ms 9748 KB Output is correct : V - N = 12
27 Correct 96 ms 11288 KB Output is correct : V - N = 12
28 Correct 87 ms 10944 KB Output is correct : V - N = 12
29 Correct 40 ms 8100 KB Output is correct : V - N = 12
30 Correct 5 ms 5412 KB Output is correct : V - N = 12
31 Correct 5 ms 5140 KB Output is correct : V - N = 12
32 Correct 7 ms 5376 KB Output is correct : V - N = 12
33 Correct 7 ms 5140 KB Output is correct : V - N = 12
34 Correct 6 ms 5340 KB Output is correct : V - N = 12
35 Correct 5 ms 5140 KB Output is correct : V - N = 12
36 Correct 407 ms 29688 KB Output is correct : V - N = 12
37 Correct 408 ms 29404 KB Output is correct : V - N = 12
38 Correct 413 ms 29480 KB Output is correct : V - N = 12
39 Correct 387 ms 29436 KB Output is correct : V - N = 12
40 Correct 357 ms 29340 KB Output is correct : V - N = 12
41 Correct 60 ms 9764 KB Output is correct : V - N = 12
42 Correct 49 ms 8612 KB Output is correct : V - N = 12
43 Correct 53 ms 9620 KB Output is correct : V - N = 12
44 Correct 6 ms 5396 KB Output is correct : V - N = 12
45 Correct 32 ms 7664 KB Output is correct : V - N = 12
46 Correct 120 ms 14464 KB Output is correct : V - N = 12
47 Correct 62 ms 9752 KB Output is correct : V - N = 12
48 Correct 155 ms 16648 KB Output is correct : V - N = 12
49 Correct 26 ms 7596 KB Output is correct : V - N = 12
50 Correct 9 ms 5876 KB Output is correct : V - N = 12
51 Correct 302 ms 25708 KB Output is correct : V - N = 12
52 Correct 7 ms 5408 KB Output is correct : V - N = 12
53 Correct 268 ms 23604 KB Output is correct : V - N = 12
54 Correct 299 ms 27292 KB Output is correct : V - N = 12
55 Correct 22 ms 6472 KB Output is correct : V - N = 12
56 Correct 196 ms 17628 KB Output is correct : V - N = 12
57 Correct 370 ms 28388 KB Output is correct : V - N = 12
58 Correct 43 ms 8356 KB Output is correct : V - N = 12
59 Correct 130 ms 14844 KB Output is correct : V - N = 12
60 Correct 355 ms 28636 KB Output is correct : V - N = 12
61 Correct 2 ms 4888 KB Output is correct : V - N = 12
62 Correct 1 ms 4888 KB Output is correct : V - N = 12
63 Correct 2 ms 4916 KB Output is correct : V - N = 12
64 Correct 1 ms 4888 KB Output is correct : V - N = 12
65 Correct 1 ms 4888 KB Output is correct : V - N = 12
66 Correct 2 ms 4896 KB Output is correct : V - N = 12
67 Correct 2 ms 4884 KB Output is correct : V - N = 12
68 Correct 2 ms 4888 KB Output is correct : V - N = 12
69 Correct 1 ms 4888 KB Output is correct : V - N = 12
70 Correct 2 ms 4896 KB Output is correct : V - N = 12
71 Correct 3 ms 4888 KB Output is correct : V - N = 12
72 Correct 1 ms 4888 KB Output is correct : V - N = 12
73 Correct 3 ms 4888 KB Output is correct : V - N = 12
74 Correct 2 ms 4892 KB Output is correct : V - N = 12
75 Correct 2 ms 4888 KB Output is correct : V - N = 12
76 Correct 1 ms 4888 KB Output is correct : V - N = 12
77 Correct 3 ms 4896 KB Output is correct : V - N = 12
78 Correct 3 ms 4896 KB Output is correct : V - N = 12
79 Correct 2 ms 4888 KB Output is correct : V - N = 12
80 Correct 2 ms 4888 KB Output is correct : V - N = 12
81 Correct 2 ms 4888 KB Output is correct : V - N = 12
82 Correct 3 ms 5132 KB Output is correct : V - N = 12
83 Correct 1 ms 4884 KB Output is correct : V - N = 12
84 Correct 1 ms 4888 KB Output is correct : V - N = 12
85 Correct 1 ms 4888 KB Output is correct : V - N = 12
86 Correct 1 ms 4884 KB Output is correct : V - N = 12
87 Correct 2 ms 4888 KB Output is correct : V - N = 12
88 Correct 2 ms 4884 KB Output is correct : V - N = 12
89 Correct 3 ms 4888 KB Output is correct : V - N = 12
90 Correct 2 ms 4884 KB Output is correct : V - N = 12
91 Correct 3 ms 4884 KB Output is correct : V - N = 12
92 Correct 1 ms 4880 KB Output is correct : V - N = 12
93 Correct 1 ms 4880 KB Output is correct : V - N = 12
94 Correct 2 ms 4884 KB Output is correct : V - N = 12
95 Correct 1 ms 4884 KB Output is correct : V - N = 12
96 Correct 2 ms 4888 KB Output is correct : V - N = 12
97 Correct 3 ms 4888 KB Output is correct : V - N = 12
98 Correct 2 ms 4884 KB Output is correct : V - N = 12
99 Correct 1 ms 4888 KB Output is correct : V - N = 12
100 Correct 3 ms 4888 KB Output is correct : V - N = 12
101 Correct 2 ms 4888 KB Output is correct : V - N = 12
102 Correct 1 ms 4888 KB Output is correct : V - N = 12
103 Correct 1 ms 4888 KB Output is correct : V - N = 12
104 Correct 1 ms 4880 KB Output is correct : V - N = 12
105 Correct 1 ms 4884 KB Output is correct : V - N = 12
106 Correct 2 ms 4888 KB Output is correct : V - N = 12
107 Correct 3 ms 4888 KB Output is correct : V - N = 12
108 Correct 2 ms 4888 KB Output is correct : V - N = 12
109 Correct 2 ms 4888 KB Output is correct : V - N = 12
110 Correct 1 ms 4888 KB Output is correct : V - N = 12
111 Correct 2 ms 4896 KB Output is correct : V - N = 12
112 Correct 1 ms 4884 KB Output is correct : V - N = 12
113 Correct 2 ms 4888 KB Output is correct : V - N = 12
114 Correct 2 ms 4884 KB Output is correct : V - N = 12
115 Correct 2 ms 4884 KB Output is correct : V - N = 12
116 Correct 3 ms 4884 KB Output is correct : V - N = 12
117 Correct 2 ms 4896 KB Output is correct : V - N = 12
118 Correct 1 ms 4888 KB Output is correct : V - N = 12
119 Correct 1 ms 4888 KB Output is correct : V - N = 12
120 Correct 3 ms 4884 KB Output is correct : V - N = 12
121 Correct 1 ms 4888 KB Output is correct : V - N = 12
122 Correct 1 ms 4884 KB Output is correct : V - N = 12
123 Correct 1 ms 4892 KB Output is correct : V - N = 12
124 Correct 1 ms 4884 KB Output is correct : V - N = 12
125 Correct 2 ms 4888 KB Output is correct : V - N = 12
126 Correct 2 ms 4888 KB Output is correct : V - N = 12
127 Correct 1 ms 4884 KB Output is correct : V - N = 12
128 Correct 2 ms 4896 KB Output is correct : V - N = 12
129 Correct 2 ms 4884 KB Output is correct : V - N = 12
130 Correct 2 ms 4884 KB Output is correct : V - N = 12
131 Correct 1 ms 5136 KB Output is correct : V - N = 12
132 Correct 1 ms 4888 KB Output is correct : V - N = 12
133 Correct 1 ms 4888 KB Output is correct : V - N = 12
134 Correct 1 ms 4884 KB Output is correct : V - N = 12
135 Correct 1 ms 4888 KB Output is correct : V - N = 12
136 Correct 1 ms 4888 KB Output is correct : V - N = 12
137 Correct 1 ms 4880 KB Output is correct : V - N = 12
138 Correct 2 ms 4888 KB Output is correct : V - N = 12
139 Correct 1 ms 4888 KB Output is correct : V - N = 12
140 Correct 1 ms 4888 KB Output is correct : V - N = 12
141 Correct 1 ms 4884 KB Output is correct : V - N = 12
142 Correct 2 ms 4900 KB Output is correct : V - N = 12
143 Correct 3 ms 4884 KB Output is correct : V - N = 12
144 Correct 3 ms 4892 KB Output is correct : V - N = 12
145 Correct 2 ms 4888 KB Output is correct : V - N = 12
146 Correct 2 ms 4888 KB Output is correct : V - N = 12
147 Correct 1 ms 4828 KB Output is correct : V - N = 12
148 Correct 1 ms 4896 KB Output is correct : V - N = 12
149 Correct 3 ms 4884 KB Output is correct : V - N = 12
150 Correct 2 ms 4884 KB Output is correct : V - N = 12
151 Correct 2 ms 4884 KB Output is correct : V - N = 12
152 Correct 2 ms 4880 KB Output is correct : V - N = 12
153 Correct 1 ms 4884 KB Output is correct : V - N = 12
154 Correct 1 ms 4888 KB Output is correct : V - N = 12
155 Correct 1 ms 4884 KB Output is correct : V - N = 12
156 Correct 1 ms 4888 KB Output is correct : V - N = 12
157 Correct 2 ms 4896 KB Output is correct : V - N = 12
158 Correct 2 ms 4888 KB Output is correct : V - N = 12
159 Correct 2 ms 4884 KB Output is correct : V - N = 12
160 Correct 1 ms 4888 KB Output is correct : V - N = 12
161 Correct 1 ms 4888 KB Output is correct : V - N = 12
162 Correct 1 ms 4884 KB Output is correct : V - N = 12
163 Correct 2 ms 4888 KB Output is correct : V - N = 12
164 Correct 3 ms 4880 KB Output is correct : V - N = 12
165 Correct 2 ms 4892 KB Output is correct : V - N = 12
166 Correct 2 ms 4888 KB Output is correct : V - N = 12
167 Correct 1 ms 4884 KB Output is correct : V - N = 12
168 Correct 2 ms 4884 KB Output is correct : V - N = 12
169 Correct 2 ms 4884 KB Output is correct : V - N = 12
170 Correct 2 ms 4880 KB Output is correct : V - N = 12
171 Correct 1 ms 4888 KB Output is correct : V - N = 12
172 Correct 1 ms 4888 KB Output is correct : V - N = 12
173 Correct 2 ms 4892 KB Output is correct : V - N = 12
174 Correct 1 ms 4888 KB Output is correct : V - N = 12
175 Correct 1 ms 4884 KB Output is correct : V - N = 12
176 Correct 3 ms 4896 KB Output is correct : V - N = 12
177 Correct 2 ms 4888 KB Output is correct : V - N = 12
178 Correct 1 ms 4860 KB Output is correct : V - N = 12