oj.uz

Submission #469462

# Submission time Handle Problem Language Result Execution time Memory
469462 2021-09-01T04:12:24 Z errorgorn Airline Route Map (JOI18_airline) C++17
100 / 100
 906 ms 34072 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bugz

void Alice( int n, int m, int a[], int b[] ){
	int arr[10][10]={
		{0,0,0,0,0,0,0,0,1,0},	
		{0,0,1,0,0,0,1,0,0,0},	
		{0,0,0,1,0,0,0,0,0,0},	
		{0,0,0,0,1,1,0,0,0,0},	
		{0,0,0,0,0,1,0,0,0,0},	
		{0,0,0,0,0,0,0,1,0,0},	
		{0,0,0,0,0,0,0,1,1,1},	
		{0,0,0,0,0,0,0,0,1,1},	
		{0,0,0,0,0,0,0,0,0,1},	
		{0,0,0,0,0,0,0,0,0,0}	
	};
	
	vector<int> id;
	rep(x,0,1024) if (__builtin_popcount(x)<9) id.pub(x);
	
	vector<ii> v;
	
	rep(x,0,10) rep(y,0,10) if (arr[x][y]) v.pub({n+x,n+y});
	
	rep(x,0,n+10) v.pub({n+10,x});
	rep(x,0,n) v.pub({n+11,x});
	
	rep(x,0,m) v.pub({a[x],b[x]});
	
	rep(x,0,n){
		rep(y,0,10) if (id[x]&(1<<y)) v.pub({x,n+y});
	}
	
	InitG(n+12,sz(v));
	rep(x,0,sz(v)) MakeG(x,v[x].fi,v[x].se);
}


#include "Boblib.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

bool grid[1030][1030];
int ord[1030];

void Bob( int n, int m, int c[], int d[] ){
	int arr[10][10]={
		{0,0,0,0,0,0,0,0,1,0},	
		{0,0,1,0,0,0,1,0,0,0},	
		{0,0,0,1,0,0,0,0,0,0},	
		{0,0,0,0,1,1,0,0,0,0},	
		{0,0,0,0,0,1,0,0,0,0},	
		{0,0,0,0,0,0,0,1,0,0},	
		{0,0,0,0,0,0,0,1,1,1},	
		{0,0,0,0,0,0,0,0,1,1},	
		{0,0,0,0,0,0,0,0,0,1},	
		{0,0,0,0,0,0,0,0,0,0}	
	};
	
	vector<int> id;
	rep(x,0,1024) if (__builtin_popcount(x)<9) id.pub(x);
	
	rep(x,0,m){
		grid[c[x]][d[x]]=true;
		grid[d[x]][c[x]]=true;
	}
		
	int idx=-1;
	int mx=0;
	
	rep(x,0,n){
		int deg=0;
		rep(y,0,n) if (grid[x][y]) deg++;
		
		if (deg>mx){
			mx=deg;
			idx=x;
		}
	}
	
	//cout<<mx<<" "<<idx<<endl;	
	int idx2;
	rep(x,0,n) if (x!=idx && !grid[idx][x]) idx2=x;
	//cout<<idx2<<endl;
	
	vector<int> ids;
	rep(x,0,n) if (x!=idx2 && x!=idx && !grid[idx2][x]) ids.pub(x);
	
	sort(all(ids));
	//for (auto &it:ids) cout<<it<<" "; cout<<endl;
	
	do{
		bool can=true;
		rep(x,0,10) rep(y,x+1,10){
			if (arr[x][y]!=grid[ids[x]][ids[y]]){
				can=false;
				goto end;
			}	
		}
		
		end:;
		
		if (can) break;
	} while (next_permutation(all(ids)));
	
	//for (auto &it:ids) cout<<it<<" "; cout<<endl;
	
	rep(x,0,n) if (x!=idx && x!=idx2){
		bool can=true;
		rep(y,0,sz(ids)) if (x==ids[y]) can=false;
		if (can){
			int num=0;
			rep(y,0,10) if (grid[x][ids[y]]) num|=(1<<y);
			
			ord[num]=x;		
		}
	}
	
	vector<ii> ans;
	rep(x,0,n-12) rep(y,x+1,n-12){
		if (grid[ord[id[x]]][ord[id[y]]]) ans.pub({x,y});
	}
	
	InitMap(n-12,sz(ans));
	for (auto &it:ans) MakeMap(it.fi,it.se);
	
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:96:28: warning: 'idx2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   96 |  rep(x,0,n) if (x!=idx && x!=idx2){
      |                           ~^~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 4496 KB Output is correct
2 Correct 8 ms 4588 KB Output is correct
3 Correct 5 ms 4592 KB Output is correct
4 Correct 17 ms 4672 KB Output is correct
5 Correct 13 ms 4692 KB Output is correct
6 Correct 10 ms 4580 KB Output is correct
7 Correct 26 ms 4588 KB Output is correct
8 Correct 30 ms 4512 KB Output is correct
9 Correct 30 ms 4572 KB Output is correct
10 Correct 13 ms 4496 KB Output is correct
11 Correct 20 ms 4516 KB Output is correct
12 Correct 25 ms 4604 KB Output is correct
13 Correct 18 ms 4588 KB Output is correct
14 Correct 3 ms 4576 KB Output is correct
15 Correct 24 ms 4572 KB Output is correct
16 Correct 23 ms 4588 KB Output is correct
17 Correct 27 ms 4592 KB Output is correct
18 Correct 11 ms 4608 KB Output is correct
19 Correct 50 ms 4576 KB Output is correct
20 Correct 6 ms 4680 KB Output is correct
21 Correct 13 ms 4588 KB Output is correct
22 Correct 25 ms 4588 KB Output is correct
23 Correct 12 ms 4588 KB Output is correct
24 Correct 36 ms 4584 KB Output is correct
25 Correct 7 ms 4588 KB Output is correct
26 Correct 19 ms 4588 KB Output is correct
27 Correct 14 ms 4604 KB Output is correct
28 Correct 13 ms 4608 KB Output is correct
29 Correct 11 ms 4516 KB Output is correct
30 Correct 16 ms 4576 KB Output is correct
31 Correct 30 ms 4584 KB Output is correct
32 Correct 20 ms 4584 KB Output is correct
33 Correct 58 ms 4568 KB Output is correct
34 Correct 26 ms 4516 KB Output is correct
35 Correct 18 ms 4496 KB Output is correct
36 Correct 16 ms 4588 KB Output is correct
37 Correct 32 ms 4588 KB Output is correct
38 Correct 10 ms 4592 KB Output is correct
39 Correct 27 ms 4588 KB Output is correct
40 Correct 48 ms 4588 KB Output is correct
41 Correct 27 ms 4588 KB Output is correct
42 Correct 27 ms 4584 KB Output is correct
43 Correct 4 ms 4608 KB Output is correct
44 Correct 15 ms 4592 KB Output is correct
45 Correct 25 ms 4512 KB Output is correct
46 Correct 33 ms 4588 KB Output is correct
47 Correct 28 ms 4576 KB Output is correct
48 Correct 17 ms 4516 KB Output is correct
49 Correct 16 ms 4608 KB Output is correct
50 Correct 15 ms 4584 KB Output is correct
51 Correct 30 ms 4584 KB Output is correct
52 Correct 11 ms 4496 KB Output is correct
53 Correct 15 ms 4584 KB Output is correct
54 Correct 7 ms 4516 KB Output is correct
55 Correct 10 ms 4660 KB Output is correct
56 Correct 5 ms 4584 KB Output is correct
57 Correct 19 ms 4568 KB Output is correct
58 Correct 26 ms 4600 KB Output is correct
59 Correct 23 ms 4824 KB Output is correct
60 Correct 15 ms 4844 KB Output is correct
61 Correct 24 ms 4844 KB Output is correct
62 Correct 30 ms 4588 KB Output is correct
63 Correct 7 ms 4624 KB Output is correct
64 Correct 27 ms 4752 KB Output is correct
65 Correct 16 ms 4892 KB Output is correct
66 Correct 11 ms 4844 KB Output is correct
67 Correct 22 ms 4744 KB Output is correct
68 Correct 15 ms 4636 KB Output is correct
69 Correct 10 ms 4620 KB Output is correct
70 Correct 25 ms 4752 KB Output is correct
71 Correct 11 ms 4828 KB Output is correct
72 Correct 10 ms 4856 KB Output is correct
73 Correct 22 ms 4844 KB Output is correct
74 Correct 28 ms 4696 KB Output is correct
75 Correct 33 ms 4588 KB Output is correct
76 Correct 52 ms 4828 KB Output is correct
77 Correct 11 ms 4768 KB Output is correct
78 Correct 3 ms 4828 KB Output is correct
79 Correct 13 ms 4768 KB Output is correct
80 Correct 24 ms 4772 KB Output is correct
81 Correct 33 ms 4596 KB Output is correct
82 Correct 27 ms 4568 KB Output is correct
83 Correct 37 ms 4592 KB Output is correct
84 Correct 18 ms 4776 KB Output is correct
85 Correct 30 ms 4748 KB Output is correct
86 Correct 3 ms 4752 KB Output is correct
87 Correct 13 ms 4680 KB Output is correct
88 Correct 10 ms 4628 KB Output is correct
89 Correct 38 ms 4600 KB Output is correct
90 Correct 19 ms 4780 KB Output is correct
91 Correct 20 ms 4584 KB Output is correct
92 Correct 16 ms 4608 KB Output is correct
93 Correct 3 ms 4712 KB Output is correct
94 Correct 10 ms 4844 KB Output is correct
95 Correct 4 ms 4840 KB Output is correct
96 Correct 24 ms 4772 KB Output is correct
97 Correct 17 ms 4844 KB Output is correct
98 Correct 30 ms 4844 KB Output is correct
99 Correct 25 ms 4828 KB Output is correct
100 Correct 27 ms 4748 KB Output is correct
101 Correct 9 ms 4624 KB Output is correct
102 Correct 8 ms 4584 KB Output is correct
103 Correct 11 ms 4588 KB Output is correct
104 Correct 17 ms 4636 KB Output is correct
105 Correct 4 ms 4844 KB Output is correct
106 Correct 31 ms 4772 KB Output is correct
107 Correct 6 ms 4496 KB Output is correct
108 Correct 16 ms 4624 KB Output is correct
109 Correct 16 ms 4760 KB Output is correct
110 Correct 30 ms 4588 KB Output is correct
111 Correct 27 ms 4728 KB Output is correct
112 Correct 24 ms 4656 KB Output is correct
113 Correct 34 ms 4568 KB Output is correct
114 Correct 11 ms 4568 KB Output is correct
115 Correct 17 ms 4840 KB Output is correct
116 Correct 11 ms 4588 KB Output is correct
117 Correct 27 ms 4716 KB Output is correct
118 Correct 9 ms 4824 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 772 ms 34016 KB Output is correct : V - N = 12
2 Correct 535 ms 29312 KB Output is correct : V - N = 12
3 Correct 258 ms 16356 KB Output is correct : V - N = 12
4 Correct 29 ms 6272 KB Output is correct : V - N = 12
5 Correct 164 ms 11576 KB Output is correct : V - N = 12
6 Correct 432 ms 27332 KB Output is correct : V - N = 12
7 Correct 650 ms 33428 KB Output is correct : V - N = 12
8 Correct 645 ms 31612 KB Output is correct : V - N = 12
9 Correct 383 ms 18524 KB Output is correct : V - N = 12
10 Correct 48 ms 7488 KB Output is correct : V - N = 12
11 Correct 97 ms 8676 KB Output is correct : V - N = 12
12 Correct 349 ms 20084 KB Output is correct : V - N = 12
13 Correct 669 ms 32296 KB Output is correct : V - N = 12
14 Correct 691 ms 33048 KB Output is correct : V - N = 12
15 Correct 457 ms 26832 KB Output is correct : V - N = 12
16 Correct 99 ms 10016 KB Output is correct : V - N = 12
17 Correct 57 ms 6796 KB Output is correct : V - N = 12
18 Correct 248 ms 17252 KB Output is correct : V - N = 12
19 Correct 605 ms 30676 KB Output is correct : V - N = 12
20 Correct 636 ms 33624 KB Output is correct : V - N = 12
21 Correct 258 ms 13624 KB Output is correct : V - N = 12
22 Correct 138 ms 11404 KB Output is correct : V - N = 12
23 Correct 74 ms 8120 KB Output is correct : V - N = 12
24 Correct 27 ms 5416 KB Output is correct : V - N = 12
25 Correct 59 ms 6880 KB Output is correct : V - N = 12
26 Correct 175 ms 10808 KB Output is correct : V - N = 12
27 Correct 233 ms 13428 KB Output is correct : V - N = 12
28 Correct 230 ms 12056 KB Output is correct : V - N = 12
29 Correct 117 ms 8824 KB Output is correct : V - N = 12
30 Correct 25 ms 5932 KB Output is correct : V - N = 12
31 Correct 38 ms 6012 KB Output is correct : V - N = 12
32 Correct 35 ms 5904 KB Output is correct : V - N = 12
33 Correct 21 ms 6036 KB Output is correct : V - N = 12
34 Correct 31 ms 6028 KB Output is correct : V - N = 12
35 Correct 20 ms 6036 KB Output is correct : V - N = 12
36 Correct 657 ms 33784 KB Output is correct : V - N = 12
37 Correct 813 ms 33952 KB Output is correct : V - N = 12
38 Correct 824 ms 34072 KB Output is correct : V - N = 12
39 Correct 906 ms 33836 KB Output is correct : V - N = 12
40 Correct 695 ms 33724 KB Output is correct : V - N = 12
41 Correct 192 ms 11420 KB Output is correct : V - N = 12
42 Correct 108 ms 9908 KB Output is correct : V - N = 12
43 Correct 167 ms 11076 KB Output is correct : V - N = 12
44 Correct 39 ms 6156 KB Output is correct : V - N = 12
45 Correct 102 ms 8780 KB Output is correct : V - N = 12
46 Correct 296 ms 16640 KB Output is correct : V - N = 12
47 Correct 155 ms 11428 KB Output is correct : V - N = 12
48 Correct 307 ms 18856 KB Output is correct : V - N = 12
49 Correct 79 ms 8568 KB Output is correct : V - N = 12
50 Correct 40 ms 6872 KB Output is correct : V - N = 12
51 Correct 506 ms 29288 KB Output is correct : V - N = 12
52 Correct 19 ms 6192 KB Output is correct : V - N = 12
53 Correct 412 ms 27232 KB Output is correct : V - N = 12
54 Correct 561 ms 31112 KB Output is correct : V - N = 12
55 Correct 67 ms 7432 KB Output is correct : V - N = 12
56 Correct 407 ms 19900 KB Output is correct : V - N = 12
57 Correct 814 ms 32784 KB Output is correct : V - N = 12
58 Correct 96 ms 9816 KB Output is correct : V - N = 12
59 Correct 353 ms 17160 KB Output is correct : V - N = 12
60 Correct 693 ms 33156 KB Output is correct : V - N = 12
61 Correct 11 ms 4820 KB Output is correct : V - N = 12
62 Correct 7 ms 4848 KB Output is correct : V - N = 12
63 Correct 23 ms 4772 KB Output is correct : V - N = 12
64 Correct 20 ms 4716 KB Output is correct : V - N = 12
65 Correct 18 ms 4780 KB Output is correct : V - N = 12
66 Correct 36 ms 4824 KB Output is correct : V - N = 12
67 Correct 5 ms 4796 KB Output is correct : V - N = 12
68 Correct 12 ms 4724 KB Output is correct : V - N = 12
69 Correct 26 ms 4752 KB Output is correct : V - N = 12
70 Correct 28 ms 4588 KB Output is correct : V - N = 12
71 Correct 13 ms 4844 KB Output is correct : V - N = 12
72 Correct 27 ms 4852 KB Output is correct : V - N = 12
73 Correct 5 ms 4780 KB Output is correct : V - N = 12
74 Correct 23 ms 4752 KB Output is correct : V - N = 12
75 Correct 13 ms 4848 KB Output is correct : V - N = 12
76 Correct 33 ms 4716 KB Output is correct : V - N = 12
77 Correct 13 ms 4588 KB Output is correct : V - N = 12
78 Correct 12 ms 4836 KB Output is correct : V - N = 12
79 Correct 17 ms 4776 KB Output is correct : V - N = 12
80 Correct 7 ms 4772 KB Output is correct : V - N = 12
81 Correct 22 ms 4788 KB Output is correct : V - N = 12
82 Correct 17 ms 4764 KB Output is correct : V - N = 12
83 Correct 31 ms 4644 KB Output is correct : V - N = 12
84 Correct 26 ms 4520 KB Output is correct : V - N = 12
85 Correct 27 ms 4568 KB Output is correct : V - N = 12
86 Correct 27 ms 4696 KB Output is correct : V - N = 12
87 Correct 19 ms 4844 KB Output is correct : V - N = 12
88 Correct 9 ms 4796 KB Output is correct : V - N = 12
89 Correct 30 ms 4616 KB Output is correct : V - N = 12
90 Correct 30 ms 4588 KB Output is correct : V - N = 12
91 Correct 10 ms 4656 KB Output is correct : V - N = 12
92 Correct 28 ms 4624 KB Output is correct : V - N = 12
93 Correct 6 ms 4564 KB Output is correct : V - N = 12
94 Correct 27 ms 4624 KB Output is correct : V - N = 12
95 Correct 16 ms 4496 KB Output is correct : V - N = 12
96 Correct 15 ms 4772 KB Output is correct : V - N = 12
97 Correct 25 ms 4844 KB Output is correct : V - N = 12
98 Correct 27 ms 4832 KB Output is correct : V - N = 12
99 Correct 27 ms 4772 KB Output is correct : V - N = 12
100 Correct 32 ms 4844 KB Output is correct : V - N = 12
101 Correct 16 ms 4840 KB Output is correct : V - N = 12
102 Correct 26 ms 4756 KB Output is correct : V - N = 12
103 Correct 7 ms 4728 KB Output is correct : V - N = 12
104 Correct 9 ms 4564 KB Output is correct : V - N = 12
105 Correct 7 ms 4652 KB Output is correct : V - N = 12
106 Correct 6 ms 4844 KB Output is correct : V - N = 12
107 Correct 27 ms 4836 KB Output is correct : V - N = 12
108 Correct 34 ms 4852 KB Output is correct : V - N = 12
109 Correct 17 ms 4624 KB Output is correct : V - N = 12
110 Correct 19 ms 4628 KB Output is correct : V - N = 12
111 Correct 19 ms 4784 KB Output is correct : V - N = 12
112 Correct 30 ms 4584 KB Output is correct : V - N = 12
113 Correct 14 ms 4808 KB Output is correct : V - N = 12
114 Correct 20 ms 4756 KB Output is correct : V - N = 12
115 Correct 26 ms 4588 KB Output is correct : V - N = 12
116 Correct 18 ms 4836 KB Output is correct : V - N = 12
117 Correct 18 ms 4760 KB Output is correct : V - N = 12
118 Correct 11 ms 4588 KB Output is correct : V - N = 12
119 Correct 24 ms 4776 KB Output is correct : V - N = 12
120 Correct 25 ms 4700 KB Output is correct : V - N = 12
121 Correct 30 ms 4604 KB Output is correct : V - N = 12
122 Correct 22 ms 4604 KB Output is correct : V - N = 12
123 Correct 28 ms 4608 KB Output is correct : V - N = 12
124 Correct 19 ms 4588 KB Output is correct : V - N = 12
125 Correct 24 ms 4588 KB Output is correct : V - N = 12
126 Correct 32 ms 4588 KB Output is correct : V - N = 12
127 Correct 17 ms 4496 KB Output is correct : V - N = 12
128 Correct 13 ms 4516 KB Output is correct : V - N = 12
129 Correct 5 ms 4580 KB Output is correct : V - N = 12
130 Correct 28 ms 4668 KB Output is correct : V - N = 12
131 Correct 28 ms 4664 KB Output is correct : V - N = 12
132 Correct 38 ms 4588 KB Output is correct : V - N = 12
133 Correct 19 ms 4584 KB Output is correct : V - N = 12
134 Correct 18 ms 4600 KB Output is correct : V - N = 12
135 Correct 19 ms 4576 KB Output is correct : V - N = 12
136 Correct 9 ms 4604 KB Output is correct : V - N = 12
137 Correct 7 ms 4600 KB Output is correct : V - N = 12
138 Correct 20 ms 4588 KB Output is correct : V - N = 12
139 Correct 11 ms 4588 KB Output is correct : V - N = 12
140 Correct 19 ms 4568 KB Output is correct : V - N = 12
141 Correct 14 ms 4588 KB Output is correct : V - N = 12
142 Correct 24 ms 4808 KB Output is correct : V - N = 12
143 Correct 37 ms 4592 KB Output is correct : V - N = 12
144 Correct 7 ms 4592 KB Output is correct : V - N = 12
145 Correct 30 ms 4516 KB Output is correct : V - N = 12
146 Correct 27 ms 4604 KB Output is correct : V - N = 12
147 Correct 3 ms 4588 KB Output is correct : V - N = 12
148 Correct 11 ms 4676 KB Output is correct : V - N = 12
149 Correct 27 ms 4576 KB Output is correct : V - N = 12
150 Correct 19 ms 4592 KB Output is correct : V - N = 12
151 Correct 17 ms 4580 KB Output is correct : V - N = 12
152 Correct 27 ms 4592 KB Output is correct : V - N = 12
153 Correct 19 ms 4584 KB Output is correct : V - N = 12
154 Correct 6 ms 4584 KB Output is correct : V - N = 12
155 Correct 30 ms 4584 KB Output is correct : V - N = 12
156 Correct 28 ms 4588 KB Output is correct : V - N = 12
157 Correct 20 ms 4624 KB Output is correct : V - N = 12
158 Correct 10 ms 4588 KB Output is correct : V - N = 12
159 Correct 28 ms 4568 KB Output is correct : V - N = 12
160 Correct 27 ms 4588 KB Output is correct : V - N = 12
161 Correct 9 ms 4600 KB Output is correct : V - N = 12
162 Correct 25 ms 4568 KB Output is correct : V - N = 12
163 Correct 11 ms 4584 KB Output is correct : V - N = 12
164 Correct 7 ms 4584 KB Output is correct : V - N = 12
165 Correct 27 ms 4576 KB Output is correct : V - N = 12
166 Correct 24 ms 4568 KB Output is correct : V - N = 12
167 Correct 10 ms 4588 KB Output is correct : V - N = 12
168 Correct 16 ms 4616 KB Output is correct : V - N = 12
169 Correct 19 ms 4596 KB Output is correct : V - N = 12
170 Correct 23 ms 4584 KB Output is correct : V - N = 12
171 Correct 20 ms 4584 KB Output is correct : V - N = 12
172 Correct 33 ms 4592 KB Output is correct : V - N = 12
173 Correct 9 ms 4584 KB Output is correct : V - N = 12
174 Correct 18 ms 4568 KB Output is correct : V - N = 12
175 Correct 7 ms 4584 KB Output is correct : V - N = 12
176 Correct 10 ms 4676 KB Output is correct : V - N = 12
177 Correct 16 ms 4672 KB Output is correct : V - N = 12
178 Correct 6 ms 4588 KB Output is correct : V - N = 12