oj.uz

Submission #765715

# Submission time Handle Problem Language Result Execution time Memory
765715 2023-06-25T04:00:03 Z minhcool Airline Route Map (JOI18_airline) C++17
69 / 100
 595 ms 28180 KB 
//#define local
#ifndef local
#include "Alicelib.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

bool ck[1505][1505];

void Alice( int N, int M, int A[], int B[]){
	int tol_nodes = N + ceil(log2(N)) * 2 + 1;
	// first node in order to know n
	// next log2(n) nodes for addition
	// next nodes for getting permutation
	if(N == 2 && !M){
		InitG(tol_nodes + 2, 0);
		return;
	}
	for(int i = 1; i <= ceil(log2(N)); i++){
		for(int j = i + 1; j <= ceil(log2(N)); j++) ck[i][j] = 1;
		for(int j = 2 * ceil(log2(N)) + 1; j <= 2 * ceil(log2(N)) + N; j++){
			int a = i - ceil(log2(N)) - 1, b = j - 2 * ceil(log2(N)) - 1;
			if(!(b & (1LL << a))){
				ck[i][j] = 1;
			//	cout << "EDGE2 " << i << " " << j << "\n";
			}
		}
	}
	for(int i = ceil(log2(N)) + 1; i <= 2 * ceil(log2(N)); i++){
		for(int j = 2 * ceil(log2(N)) + 1; j < tol_nodes; j++){
			int a = i - 1 - ceil(log2(N)), b = j - 2 * ceil(log2(N)) - 1;
			if(b & (1LL << a)){
				ck[i][j] = 1;
		//		cout << "EDGE2 " << i << " " << j << "\n";
			}
		}
	}
	int maxi = -1;
	for(int i = 2 * ceil(log2(N)); i >= ceil(log2(N)) + 1; i--){
		int deg = 0;
		for(int j = 1; j < tol_nodes; j++) deg += (ck[i][j] | ck[j][i]);
		if(deg <= maxi && i <= 2 * ceil(log2(N))){
			for(int j = 1; j <= (maxi - deg + 1); j++) ck[j][i] = 1;
			deg += (maxi - deg + 1);
		}
		maxi = max(maxi, deg);
	//	cout << maxi << '\n';
	}
	for(int i = 0; i < M; i++){
		if(A[i] > B[i]) swap(A[i], B[i]);
		ck[A[i] + 2 * (int)ceil(log2(N)) + 1][B[i] + 2 * (int)ceil(log2(N)) + 1] = 1;
	}
	vector<ii> edges;
	vector<int> degs(tol_nodes + 6);
	for(int i = 1; i < tol_nodes; i++) ck[i][tol_nodes] = 1;
	for(int i = 1; i <= 2 * ceil(log2(N)); i++) ck[i][tol_nodes + 1] = 1;
	for(int i = tol_nodes + 2; i < tol_nodes + 3; i++) ck[tol_nodes][i] = 1;
	for(int i = 1; i < tol_nodes + 3; i++){
		for(int j = i + 1; j < tol_nodes + 3; j++){
			if(ck[i][j]){
		//		cout << i << " " << j << "\n";
				edges.pb({i, j});
				degs[i]++, degs[j]++;
			}
		}
	}
//	for(int i = 1; i < tol_nodes + 5; i++) cout << "DEGS " << i << " " << degs[i] << "\n";
	
	InitG(tol_nodes + 2, edges.size());
	int pos = 0;
	for(auto it : edges){
		MakeG(pos, it.fi - 1, it.se - 1);
		pos++;
	}
}

#ifdef local
void process(){

}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}
#endif

//#define local
#ifndef local
#include "Boblib.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

//mt19937 rng(1);

vector<ii> deg;

bool ckk[1505][1505];

int which[N];

bool is[N];

bool cmp(ii a, ii b){
	if(is[a.se] != is[b.se]) return is[a.se];
	else if(a.fi != b.fi) return a.fi > b.fi;
	else return a.se < b.se;
}

void Bob(int V, int U, int C[], int D[]){
	//return;
	int n;
	for(int i = 0; i <= 3000; i++){
	//	cout << i << " " << V << "\n";
		int temp = i + 2 * ceil(log2(i)) + 3;
		if(temp == V){
			n = i;
			break;
		}
	}
//	cout << n << "\n";
//	return;
	deg.resize(V);
	if(n == 1){
		InitMap(1, 0);
		return;
	}
	else if(n == 2 && !U){
		InitMap(2, 0);
		return;
	}
	else if(n == 2){
		InitMap(2, 1);
		MakeMap(0, 1);
		return;
	}
	for(int i = 0; i < V; i++) deg[i].se = i;
	for(int i = 0; i < U; i++){
		deg[C[i]].fi++;
		deg[D[i]].fi++;
		ckk[C[i]][D[i]] = ckk[D[i]][C[i]] = 1;
	//	cout << C[i] << " " << D[i] << "\n";
	}
	sort(deg.begin(), deg.end(), greater<ii>());
	int temp = deg[0].se, temp2;
	for(int i = 0; i < V; i++) if(i != temp && !ckk[i][temp]) temp2 = i;
//	cout << temp << " " << temp2 << "\n";
	vector<ii> deg2 = deg;
	deg.clear();
	for(int i = 0; i < V; i++){
		if(deg2[i].se == temp || deg2[i].se == temp2) continue;
	//	cout << deg2[i].se << " " << ckk[deg2[i].se][temp2] << "\n";
		if(ckk[deg2[i].se][temp2]) is[deg2[i].se] = 1;
		deg.pb(deg2[i]);
	}
	sort(deg.begin(), deg.end(), cmp);
	// first up: the nodes for addition (log2(n)) nodes
	// second up: the nodes from (log2(n) - 1 to 0)
	for(int i = ceil(log2(n)); i < 2 * ceil(log2(n)); i++){
		for(int j = 2 * ceil(log2(n)); j < 2 * ceil(log2(n)) + n; j++){
	//		cout << deg[i].se << " " << deg[j].se << "\n";
			if(ckk[deg[i].se][deg[j].se]){
	//			cout << "EDGE " << deg[i].se << " " << deg[j].se << "\n";
				which[deg[j].se] += (1LL << (i - (int)ceil(log2(n))));
			}
		} 
	}
	vector<ii> v;
	for(int j = 2 * ceil(log2(n)); j < 2 * ceil(log2(n)) + n; j++){
		for(int k = j + 1; k < 2 * ceil(log2(n)) + n; k++){
			//cout << deg[j].se << " " << deg[k].se << " " << which[deg[j].se] << " " << which[deg[k].se] << "\n";
			if(ckk[deg[j].se][deg[k].se]) v.pb({min(which[deg[j].se], which[deg[k].se]), max(which[deg[j].se], which[deg[k].se])});
		}
	}
	//cout << n << " " << v.size() << "\n";
	//for(int i = 0; i < n + 2 * ceil(log2(n)); i++) cout << "OK " << i << " " << which[i] << "\n";
	InitMap(n, (int)v.size());
	for(auto it : v) MakeMap(it.fi, it.se);
}

/*
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}*/



#ifdef local
void process(){

}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--) process();
}
#endif

Compilation message

Alice.cpp:22:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Bob.cpp:22:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:62:7: warning: 'n' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |  else if(n == 2){
      |       ^~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4752 KB Output is correct
2 Correct 2 ms 4752 KB Output is correct
3 Correct 2 ms 4680 KB Output is correct
4 Correct 3 ms 4736 KB Output is correct
5 Correct 2 ms 4744 KB Output is correct
6 Correct 2 ms 4744 KB Output is correct
7 Correct 2 ms 4744 KB Output is correct
8 Correct 2 ms 4748 KB Output is correct
9 Correct 2 ms 4744 KB Output is correct
10 Correct 2 ms 4740 KB Output is correct
11 Correct 1 ms 4640 KB Output is correct
12 Correct 2 ms 4752 KB Output is correct
13 Correct 3 ms 4744 KB Output is correct
14 Correct 3 ms 4744 KB Output is correct
15 Correct 2 ms 4752 KB Output is correct
16 Correct 3 ms 4744 KB Output is correct
17 Correct 2 ms 4720 KB Output is correct
18 Correct 1 ms 4744 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 2 ms 4752 KB Output is correct
21 Correct 2 ms 4744 KB Output is correct
22 Correct 2 ms 4744 KB Output is correct
23 Correct 2 ms 4744 KB Output is correct
24 Correct 2 ms 4740 KB Output is correct
25 Correct 2 ms 4752 KB Output is correct
26 Correct 2 ms 4744 KB Output is correct
27 Correct 3 ms 4740 KB Output is correct
28 Correct 2 ms 4664 KB Output is correct
29 Correct 2 ms 4740 KB Output is correct
30 Correct 2 ms 4752 KB Output is correct
31 Correct 2 ms 4740 KB Output is correct
32 Correct 2 ms 4752 KB Output is correct
33 Correct 2 ms 4828 KB Output is correct
34 Correct 2 ms 4748 KB Output is correct
35 Correct 1 ms 4740 KB Output is correct
36 Correct 2 ms 4744 KB Output is correct
37 Correct 2 ms 4744 KB Output is correct
38 Correct 3 ms 4668 KB Output is correct
39 Correct 2 ms 4744 KB Output is correct
40 Correct 2 ms 4744 KB Output is correct
41 Correct 2 ms 4744 KB Output is correct
42 Correct 2 ms 4744 KB Output is correct
43 Correct 3 ms 4720 KB Output is correct
44 Correct 2 ms 4740 KB Output is correct
45 Correct 3 ms 4740 KB Output is correct
46 Correct 2 ms 4668 KB Output is correct
47 Correct 1 ms 4744 KB Output is correct
48 Correct 2 ms 4640 KB Output is correct
49 Correct 2 ms 4744 KB Output is correct
50 Correct 3 ms 4668 KB Output is correct
51 Correct 2 ms 4612 KB Output is correct
52 Correct 3 ms 4720 KB Output is correct
53 Correct 2 ms 4604 KB Output is correct
54 Correct 2 ms 4724 KB Output is correct
55 Correct 2 ms 4752 KB Output is correct
56 Correct 1 ms 4668 KB Output is correct
57 Correct 2 ms 4744 KB Output is correct
58 Correct 2 ms 4744 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4752 KB Output is correct
2 Correct 2 ms 4752 KB Output is correct
3 Correct 2 ms 4680 KB Output is correct
4 Correct 3 ms 4736 KB Output is correct
5 Correct 2 ms 4744 KB Output is correct
6 Correct 2 ms 4744 KB Output is correct
7 Correct 2 ms 4744 KB Output is correct
8 Correct 2 ms 4748 KB Output is correct
9 Correct 2 ms 4744 KB Output is correct
10 Correct 2 ms 4740 KB Output is correct
11 Correct 1 ms 4640 KB Output is correct
12 Correct 2 ms 4752 KB Output is correct
13 Correct 3 ms 4744 KB Output is correct
14 Correct 3 ms 4744 KB Output is correct
15 Correct 2 ms 4752 KB Output is correct
16 Correct 3 ms 4744 KB Output is correct
17 Correct 2 ms 4720 KB Output is correct
18 Correct 1 ms 4744 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 2 ms 4752 KB Output is correct
21 Correct 2 ms 4744 KB Output is correct
22 Correct 2 ms 4744 KB Output is correct
23 Correct 2 ms 4744 KB Output is correct
24 Correct 2 ms 4740 KB Output is correct
25 Correct 2 ms 4752 KB Output is correct
26 Correct 2 ms 4744 KB Output is correct
27 Correct 3 ms 4740 KB Output is correct
28 Correct 2 ms 4664 KB Output is correct
29 Correct 2 ms 4740 KB Output is correct
30 Correct 2 ms 4752 KB Output is correct
31 Correct 2 ms 4740 KB Output is correct
32 Correct 2 ms 4752 KB Output is correct
33 Correct 2 ms 4828 KB Output is correct
34 Correct 2 ms 4748 KB Output is correct
35 Correct 1 ms 4740 KB Output is correct
36 Correct 2 ms 4744 KB Output is correct
37 Correct 2 ms 4744 KB Output is correct
38 Correct 3 ms 4668 KB Output is correct
39 Correct 2 ms 4744 KB Output is correct
40 Correct 2 ms 4744 KB Output is correct
41 Correct 2 ms 4744 KB Output is correct
42 Correct 2 ms 4744 KB Output is correct
43 Correct 3 ms 4720 KB Output is correct
44 Correct 2 ms 4740 KB Output is correct
45 Correct 3 ms 4740 KB Output is correct
46 Correct 2 ms 4668 KB Output is correct
47 Correct 1 ms 4744 KB Output is correct
48 Correct 2 ms 4640 KB Output is correct
49 Correct 2 ms 4744 KB Output is correct
50 Correct 3 ms 4668 KB Output is correct
51 Correct 2 ms 4612 KB Output is correct
52 Correct 3 ms 4720 KB Output is correct
53 Correct 2 ms 4604 KB Output is correct
54 Correct 2 ms 4724 KB Output is correct
55 Correct 2 ms 4752 KB Output is correct
56 Correct 1 ms 4668 KB Output is correct
57 Correct 2 ms 4744 KB Output is correct
58 Correct 2 ms 4744 KB Output is correct
59 Correct 3 ms 4772 KB Output is correct
60 Correct 3 ms 4868 KB Output is correct
61 Correct 3 ms 4872 KB Output is correct
62 Correct 2 ms 4876 KB Output is correct
63 Correct 2 ms 4872 KB Output is correct
64 Correct 3 ms 4872 KB Output is correct
65 Correct 3 ms 4796 KB Output is correct
66 Correct 3 ms 4872 KB Output is correct
67 Correct 3 ms 4872 KB Output is correct
68 Correct 2 ms 4876 KB Output is correct
69 Correct 2 ms 4872 KB Output is correct
70 Correct 3 ms 4868 KB Output is correct
71 Correct 3 ms 4872 KB Output is correct
72 Correct 3 ms 4872 KB Output is correct
73 Correct 3 ms 4880 KB Output is correct
74 Correct 2 ms 4876 KB Output is correct
75 Correct 3 ms 4880 KB Output is correct
76 Correct 3 ms 4872 KB Output is correct
77 Correct 3 ms 4872 KB Output is correct
78 Correct 3 ms 4872 KB Output is correct
79 Correct 3 ms 4868 KB Output is correct
80 Correct 3 ms 4772 KB Output is correct
81 Correct 3 ms 4872 KB Output is correct
82 Correct 2 ms 4872 KB Output is correct
83 Correct 2 ms 4808 KB Output is correct
84 Correct 3 ms 4880 KB Output is correct
85 Correct 3 ms 4872 KB Output is correct
86 Correct 2 ms 4872 KB Output is correct
87 Correct 3 ms 4872 KB Output is correct
88 Correct 2 ms 4872 KB Output is correct
89 Correct 2 ms 4876 KB Output is correct
90 Correct 3 ms 4868 KB Output is correct
91 Correct 3 ms 4864 KB Output is correct
92 Correct 3 ms 4996 KB Output is correct
93 Correct 2 ms 4868 KB Output is correct
94 Correct 3 ms 4880 KB Output is correct
95 Correct 3 ms 4872 KB Output is correct
96 Correct 3 ms 4872 KB Output is correct
97 Correct 3 ms 4872 KB Output is correct
98 Correct 3 ms 4872 KB Output is correct
99 Correct 3 ms 4872 KB Output is correct
100 Correct 3 ms 4872 KB Output is correct
101 Correct 2 ms 4880 KB Output is correct
102 Correct 2 ms 4868 KB Output is correct
103 Correct 3 ms 4920 KB Output is correct
104 Correct 3 ms 4880 KB Output is correct
105 Correct 2 ms 4856 KB Output is correct
106 Correct 3 ms 4872 KB Output is correct
107 Correct 2 ms 4872 KB Output is correct
108 Correct 2 ms 4856 KB Output is correct
109 Correct 3 ms 4872 KB Output is correct
110 Correct 2 ms 4872 KB Output is correct
111 Correct 3 ms 4872 KB Output is correct
112 Correct 3 ms 4872 KB Output is correct
113 Correct 3 ms 4848 KB Output is correct
114 Correct 3 ms 4872 KB Output is correct
115 Correct 3 ms 4872 KB Output is correct
116 Correct 2 ms 4872 KB Output is correct
117 Correct 3 ms 4872 KB Output is correct
118 Correct 3 ms 4880 KB Output is correct

Subtask #3
32.0 / 63.0

# Verdict Execution time Memory Grader output
1 Partially correct 363 ms 28180 KB Output is partially correct : V - N = 23
2 Partially correct 364 ms 24396 KB Output is partially correct : V - N = 23
3 Partially correct 138 ms 14776 KB Output is partially correct : V - N = 23
4 Partially correct 17 ms 8464 KB Output is partially correct : V - N = 23
5 Partially correct 135 ms 11908 KB Output is partially correct : V - N = 23
6 Partially correct 287 ms 22472 KB Output is partially correct : V - N = 23
7 Partially correct 418 ms 27748 KB Output is partially correct : V - N = 23
8 Partially correct 391 ms 26144 KB Output is partially correct : V - N = 23
9 Partially correct 224 ms 16988 KB Output is partially correct : V - N = 23
10 Partially correct 39 ms 9132 KB Output is partially correct : V - N = 23
11 Partially correct 53 ms 10128 KB Output is partially correct : V - N = 23
12 Partially correct 237 ms 18164 KB Output is partially correct : V - N = 23
13 Partially correct 463 ms 26800 KB Output is partially correct : V - N = 23
14 Partially correct 595 ms 27244 KB Output is partially correct : V - N = 23
15 Partially correct 261 ms 21340 KB Output is partially correct : V - N = 23
16 Partially correct 95 ms 10712 KB Output is partially correct : V - N = 23
17 Partially correct 22 ms 8652 KB Output is partially correct : V - N = 23
18 Partially correct 182 ms 16060 KB Output is partially correct : V - N = 23
19 Partially correct 453 ms 25272 KB Output is partially correct : V - N = 23
20 Partially correct 482 ms 27880 KB Output is partially correct : V - N = 23
21 Partially correct 135 ms 11760 KB Output is partially correct : V - N = 21
22 Partially correct 82 ms 10800 KB Output is partially correct : V - N = 21
23 Partially correct 59 ms 8284 KB Output is partially correct : V - N = 21
24 Partially correct 8 ms 6600 KB Output is partially correct : V - N = 23
25 Partially correct 26 ms 7584 KB Output is partially correct : V - N = 23
26 Partially correct 112 ms 10232 KB Output is partially correct : V - N = 21
27 Partially correct 140 ms 11588 KB Output is partially correct : V - N = 21
28 Partially correct 132 ms 11260 KB Output is partially correct : V - N = 23
29 Partially correct 71 ms 8976 KB Output is partially correct : V - N = 23
30 Partially correct 13 ms 7048 KB Output is partially correct : V - N = 21
31 Partially correct 18 ms 8096 KB Output is partially correct : V - N = 23
32 Partially correct 16 ms 8064 KB Output is partially correct : V - N = 23
33 Partially correct 16 ms 8208 KB Output is partially correct : V - N = 23
34 Partially correct 25 ms 8096 KB Output is partially correct : V - N = 23
35 Partially correct 18 ms 8176 KB Output is partially correct : V - N = 23
36 Partially correct 405 ms 28116 KB Output is partially correct : V - N = 23
37 Partially correct 406 ms 27972 KB Output is partially correct : V - N = 23
38 Partially correct 489 ms 27984 KB Output is partially correct : V - N = 23
39 Partially correct 496 ms 27996 KB Output is partially correct : V - N = 23
40 Partially correct 557 ms 27988 KB Output is partially correct : V - N = 23
41 Partially correct 120 ms 11916 KB Output is partially correct : V - N = 23
42 Partially correct 67 ms 10724 KB Output is partially correct : V - N = 23
43 Partially correct 78 ms 11648 KB Output is partially correct : V - N = 23
44 Partially correct 20 ms 8304 KB Output is partially correct : V - N = 23
45 Partially correct 54 ms 10048 KB Output is partially correct : V - N = 23
46 Partially correct 190 ms 15292 KB Output is partially correct : V - N = 23
47 Partially correct 96 ms 11844 KB Output is partially correct : V - N = 23
48 Partially correct 249 ms 17176 KB Output is partially correct : V - N = 23
49 Partially correct 60 ms 10000 KB Output is partially correct : V - N = 23
50 Partially correct 22 ms 8648 KB Output is partially correct : V - N = 23
51 Partially correct 413 ms 24412 KB Output is partially correct : V - N = 23
52 Partially correct 18 ms 8416 KB Output is partially correct : V - N = 23
53 Partially correct 311 ms 22296 KB Output is partially correct : V - N = 23
54 Partially correct 352 ms 25752 KB Output is partially correct : V - N = 23
55 Partially correct 36 ms 9164 KB Output is partially correct : V - N = 23
56 Partially correct 246 ms 17984 KB Output is partially correct : V - N = 23
57 Partially correct 380 ms 26892 KB Output is partially correct : V - N = 23
58 Partially correct 73 ms 10572 KB Output is partially correct : V - N = 23
59 Partially correct 164 ms 15848 KB Output is partially correct : V - N = 23
60 Partially correct 378 ms 27468 KB Output is partially correct : V - N = 23
61 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 15
62 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
63 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
64 Partially correct 2 ms 4784 KB Output is partially correct : V - N = 15
65 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
66 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
67 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
68 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
69 Partially correct 3 ms 4876 KB Output is partially correct : V - N = 15
70 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
71 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
72 Partially correct 2 ms 4880 KB Output is partially correct : V - N = 15
73 Partially correct 3 ms 4852 KB Output is partially correct : V - N = 15
74 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
75 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
76 Partially correct 3 ms 4808 KB Output is partially correct : V - N = 15
77 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
78 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
79 Partially correct 3 ms 4864 KB Output is partially correct : V - N = 15
80 Partially correct 3 ms 4820 KB Output is partially correct : V - N = 15
81 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 13
82 Partially correct 3 ms 4772 KB Output is partially correct : V - N = 13
83 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 15
84 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 13
85 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 13
86 Partially correct 2 ms 4796 KB Output is partially correct : V - N = 15
87 Partially correct 3 ms 4800 KB Output is partially correct : V - N = 15
88 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 13
89 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 13
90 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 13
91 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 15
92 Partially correct 3 ms 4808 KB Output is partially correct : V - N = 15
93 Partially correct 2 ms 4876 KB Output is partially correct : V - N = 15
94 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 15
95 Partially correct 2 ms 4844 KB Output is partially correct : V - N = 15
96 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
97 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
98 Partially correct 3 ms 4808 KB Output is partially correct : V - N = 15
99 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
100 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
101 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
102 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 15
103 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
104 Partially correct 2 ms 4868 KB Output is partially correct : V - N = 15
105 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
106 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
107 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 15
108 Partially correct 3 ms 4852 KB Output is partially correct : V - N = 15
109 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
110 Partially correct 3 ms 4864 KB Output is partially correct : V - N = 15
111 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
112 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 13
113 Partially correct 3 ms 4796 KB Output is partially correct : V - N = 13
114 Partially correct 3 ms 4808 KB Output is partially correct : V - N = 13
115 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 13
116 Partially correct 3 ms 4796 KB Output is partially correct : V - N = 13
117 Partially correct 3 ms 4924 KB Output is partially correct : V - N = 15
118 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 13
119 Partially correct 3 ms 4848 KB Output is partially correct : V - N = 15
120 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 13
121 Correct 2 ms 4840 KB Output is correct : V - N = 11
122 Correct 2 ms 4740 KB Output is correct : V - N = 11
123 Correct 2 ms 4744 KB Output is correct : V - N = 11
124 Correct 3 ms 4644 KB Output is correct : V - N = 11
125 Correct 2 ms 4752 KB Output is correct : V - N = 11
126 Correct 2 ms 4784 KB Output is correct : V - N = 11
127 Correct 3 ms 4744 KB Output is correct : V - N = 11
128 Correct 2 ms 4752 KB Output is correct : V - N = 11
129 Correct 3 ms 4744 KB Output is correct : V - N = 11
130 Correct 2 ms 4644 KB Output is correct : V - N = 11
131 Correct 2 ms 4668 KB Output is correct : V - N = 11
132 Correct 2 ms 4748 KB Output is correct : V - N = 11
133 Correct 3 ms 4720 KB Output is correct : V - N = 11
134 Correct 3 ms 4720 KB Output is correct : V - N = 11
135 Correct 2 ms 4744 KB Output is correct : V - N = 11
136 Correct 3 ms 4744 KB Output is correct : V - N = 11
137 Correct 3 ms 4744 KB Output is correct : V - N = 11
138 Correct 2 ms 4744 KB Output is correct : V - N = 11
139 Correct 2 ms 4748 KB Output is correct : V - N = 11
140 Correct 2 ms 4744 KB Output is correct : V - N = 11
141 Correct 2 ms 4752 KB Output is correct : V - N = 11
142 Correct 2 ms 4744 KB Output is correct : V - N = 9
143 Correct 3 ms 4744 KB Output is correct : V - N = 11
144 Correct 2 ms 4740 KB Output is correct : V - N = 9
145 Correct 3 ms 4744 KB Output is correct : V - N = 9
146 Correct 2 ms 4744 KB Output is correct : V - N = 9
147 Correct 2 ms 4680 KB Output is correct : V - N = 9
148 Correct 2 ms 4744 KB Output is correct : V - N = 11
149 Correct 2 ms 4680 KB Output is correct : V - N = 9
150 Correct 2 ms 4740 KB Output is correct : V - N = 9
151 Correct 2 ms 4740 KB Output is correct : V - N = 11
152 Correct 2 ms 4744 KB Output is correct : V - N = 11
153 Correct 2 ms 4736 KB Output is correct : V - N = 11
154 Correct 2 ms 4740 KB Output is correct : V - N = 11
155 Correct 2 ms 4740 KB Output is correct : V - N = 11
156 Correct 2 ms 4632 KB Output is correct : V - N = 11
157 Correct 3 ms 4808 KB Output is correct : V - N = 11
158 Correct 2 ms 4748 KB Output is correct : V - N = 11
159 Correct 2 ms 4744 KB Output is correct : V - N = 11
160 Correct 2 ms 4744 KB Output is correct : V - N = 11
161 Correct 2 ms 4744 KB Output is correct : V - N = 11
162 Correct 3 ms 4748 KB Output is correct : V - N = 11
163 Correct 2 ms 4752 KB Output is correct : V - N = 11
164 Correct 3 ms 4740 KB Output is correct : V - N = 11
165 Correct 2 ms 4740 KB Output is correct : V - N = 11
166 Correct 2 ms 4748 KB Output is correct : V - N = 11
167 Correct 3 ms 4756 KB Output is correct : V - N = 11
168 Correct 3 ms 4752 KB Output is correct : V - N = 11
169 Correct 3 ms 4732 KB Output is correct : V - N = 11
170 Correct 3 ms 4740 KB Output is correct : V - N = 11
171 Correct 3 ms 4612 KB Output is correct : V - N = 3
172 Correct 2 ms 4744 KB Output is correct : V - N = 5
173 Correct 3 ms 4588 KB Output is correct : V - N = 5
174 Correct 2 ms 4744 KB Output is correct : V - N = 7
175 Correct 3 ms 4740 KB Output is correct : V - N = 7
176 Correct 2 ms 4744 KB Output is correct : V - N = 7
177 Correct 2 ms 4744 KB Output is correct : V - N = 7
178 Correct 3 ms 4752 KB Output is correct : V - N = 9