oj.uz

Submission #765712

# Submission time Handle Problem Language Result Execution time Memory
765712 2023-06-25T03:51:49 Z minhcool Airline Route Map (JOI18_airline) C++17
0 / 100
 630 ms 28068 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 - 1, 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 + 5; i++) ck[tol_nodes][i] = 1;
	for(int i = 1; i < tol_nodes + 5; i++){
		for(int j = i + 1; j < tol_nodes + 5; 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 + 4, 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)) + 5;
		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
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4744 KB Output is correct
2 Correct 2 ms 4644 KB Output is correct
3 Correct 2 ms 4732 KB Output is correct
4 Correct 2 ms 4740 KB Output is correct
5 Correct 2 ms 4744 KB Output is correct
6 Correct 3 ms 4744 KB Output is correct
7 Correct 2 ms 4744 KB Output is correct
8 Correct 2 ms 4724 KB Output is correct
9 Correct 3 ms 4748 KB Output is correct
10 Correct 2 ms 4744 KB Output is correct
11 Correct 2 ms 4752 KB Output is correct
12 Correct 3 ms 4720 KB Output is correct
13 Correct 2 ms 4744 KB Output is correct
14 Correct 3 ms 4744 KB Output is correct
15 Correct 2 ms 4744 KB Output is correct
16 Correct 2 ms 4668 KB Output is correct
17 Correct 2 ms 4664 KB Output is correct
18 Correct 2 ms 4744 KB Output is correct
19 Correct 3 ms 4744 KB Output is correct
20 Correct 2 ms 4744 KB Output is correct
21 Correct 2 ms 4744 KB Output is correct
22 Correct 3 ms 4720 KB Output is correct
23 Correct 3 ms 4744 KB Output is correct
24 Correct 2 ms 4668 KB Output is correct
25 Correct 2 ms 4752 KB Output is correct
26 Correct 3 ms 4744 KB Output is correct
27 Correct 2 ms 4744 KB Output is correct
28 Correct 3 ms 4744 KB Output is correct
29 Correct 2 ms 4756 KB Output is correct
30 Correct 3 ms 4668 KB Output is correct
31 Correct 3 ms 4748 KB Output is correct
32 Correct 2 ms 4644 KB Output is correct
33 Correct 2 ms 4656 KB Output is correct
34 Correct 2 ms 4740 KB Output is correct
35 Correct 2 ms 4744 KB Output is correct
36 Correct 2 ms 4744 KB Output is correct
37 Correct 3 ms 4744 KB Output is correct
38 Correct 2 ms 4720 KB Output is correct
39 Correct 3 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 2 ms 4744 KB Output is correct
44 Correct 3 ms 4740 KB Output is correct
45 Correct 2 ms 4736 KB Output is correct
46 Correct 2 ms 4724 KB Output is correct
47 Correct 2 ms 4748 KB Output is correct
48 Correct 2 ms 4744 KB Output is correct
49 Correct 3 ms 4732 KB Output is correct
50 Correct 2 ms 4736 KB Output is correct
51 Correct 2 ms 4612 KB Output is correct
52 Correct 2 ms 4744 KB Output is correct
53 Incorrect 2 ms 4608 KB Wrong Answer [10]
54 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4744 KB Output is correct
2 Correct 2 ms 4644 KB Output is correct
3 Correct 2 ms 4732 KB Output is correct
4 Correct 2 ms 4740 KB Output is correct
5 Correct 2 ms 4744 KB Output is correct
6 Correct 3 ms 4744 KB Output is correct
7 Correct 2 ms 4744 KB Output is correct
8 Correct 2 ms 4724 KB Output is correct
9 Correct 3 ms 4748 KB Output is correct
10 Correct 2 ms 4744 KB Output is correct
11 Correct 2 ms 4752 KB Output is correct
12 Correct 3 ms 4720 KB Output is correct
13 Correct 2 ms 4744 KB Output is correct
14 Correct 3 ms 4744 KB Output is correct
15 Correct 2 ms 4744 KB Output is correct
16 Correct 2 ms 4668 KB Output is correct
17 Correct 2 ms 4664 KB Output is correct
18 Correct 2 ms 4744 KB Output is correct
19 Correct 3 ms 4744 KB Output is correct
20 Correct 2 ms 4744 KB Output is correct
21 Correct 2 ms 4744 KB Output is correct
22 Correct 3 ms 4720 KB Output is correct
23 Correct 3 ms 4744 KB Output is correct
24 Correct 2 ms 4668 KB Output is correct
25 Correct 2 ms 4752 KB Output is correct
26 Correct 3 ms 4744 KB Output is correct
27 Correct 2 ms 4744 KB Output is correct
28 Correct 3 ms 4744 KB Output is correct
29 Correct 2 ms 4756 KB Output is correct
30 Correct 3 ms 4668 KB Output is correct
31 Correct 3 ms 4748 KB Output is correct
32 Correct 2 ms 4644 KB Output is correct
33 Correct 2 ms 4656 KB Output is correct
34 Correct 2 ms 4740 KB Output is correct
35 Correct 2 ms 4744 KB Output is correct
36 Correct 2 ms 4744 KB Output is correct
37 Correct 3 ms 4744 KB Output is correct
38 Correct 2 ms 4720 KB Output is correct
39 Correct 3 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 2 ms 4744 KB Output is correct
44 Correct 3 ms 4740 KB Output is correct
45 Correct 2 ms 4736 KB Output is correct
46 Correct 2 ms 4724 KB Output is correct
47 Correct 2 ms 4748 KB Output is correct
48 Correct 2 ms 4744 KB Output is correct
49 Correct 3 ms 4732 KB Output is correct
50 Correct 2 ms 4736 KB Output is correct
51 Correct 2 ms 4612 KB Output is correct
52 Correct 2 ms 4744 KB Output is correct
53 Incorrect 2 ms 4608 KB Wrong Answer [10]
54 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Partially correct 399 ms 28044 KB Output is partially correct : V - N = 25
2 Partially correct 350 ms 24608 KB Output is partially correct : V - N = 25
3 Partially correct 195 ms 15016 KB Output is partially correct : V - N = 25
4 Partially correct 17 ms 8312 KB Output is partially correct : V - N = 25
5 Partially correct 81 ms 11972 KB Output is partially correct : V - N = 25
6 Partially correct 391 ms 22472 KB Output is partially correct : V - N = 25
7 Partially correct 630 ms 27752 KB Output is partially correct : V - N = 25
8 Partially correct 448 ms 26256 KB Output is partially correct : V - N = 25
9 Partially correct 177 ms 17016 KB Output is partially correct : V - N = 25
10 Partially correct 41 ms 9296 KB Output is partially correct : V - N = 25
11 Partially correct 62 ms 9924 KB Output is partially correct : V - N = 25
12 Partially correct 300 ms 18260 KB Output is partially correct : V - N = 25
13 Partially correct 453 ms 26748 KB Output is partially correct : V - N = 25
14 Partially correct 499 ms 27244 KB Output is partially correct : V - N = 25
15 Partially correct 390 ms 21276 KB Output is partially correct : V - N = 25
16 Partially correct 77 ms 10632 KB Output is partially correct : V - N = 25
17 Partially correct 27 ms 8684 KB Output is partially correct : V - N = 25
18 Partially correct 209 ms 15904 KB Output is partially correct : V - N = 25
19 Partially correct 422 ms 25404 KB Output is partially correct : V - N = 25
20 Partially correct 370 ms 27936 KB Output is partially correct : V - N = 25
21 Partially correct 147 ms 11720 KB Output is partially correct : V - N = 23
22 Partially correct 110 ms 10756 KB Output is partially correct : V - N = 23
23 Partially correct 48 ms 8324 KB Output is partially correct : V - N = 23
24 Partially correct 7 ms 6736 KB Output is partially correct : V - N = 25
25 Partially correct 30 ms 7584 KB Output is partially correct : V - N = 25
26 Partially correct 74 ms 10272 KB Output is partially correct : V - N = 23
27 Partially correct 138 ms 11644 KB Output is partially correct : V - N = 23
28 Partially correct 109 ms 11180 KB Output is partially correct : V - N = 25
29 Partially correct 73 ms 9000 KB Output is partially correct : V - N = 25
30 Partially correct 12 ms 6924 KB Output is partially correct : V - N = 23
31 Partially correct 16 ms 8196 KB Output is partially correct : V - N = 25
32 Partially correct 16 ms 8112 KB Output is partially correct : V - N = 25
33 Partially correct 18 ms 8208 KB Output is partially correct : V - N = 25
34 Partially correct 16 ms 8200 KB Output is partially correct : V - N = 25
35 Partially correct 20 ms 8172 KB Output is partially correct : V - N = 25
36 Partially correct 544 ms 27996 KB Output is partially correct : V - N = 25
37 Partially correct 471 ms 28004 KB Output is partially correct : V - N = 25
38 Partially correct 503 ms 28068 KB Output is partially correct : V - N = 25
39 Partially correct 505 ms 28068 KB Output is partially correct : V - N = 25
40 Partially correct 463 ms 27968 KB Output is partially correct : V - N = 25
41 Partially correct 79 ms 11920 KB Output is partially correct : V - N = 25
42 Partially correct 76 ms 10824 KB Output is partially correct : V - N = 25
43 Partially correct 72 ms 11656 KB Output is partially correct : V - N = 25
44 Partially correct 20 ms 8348 KB Output is partially correct : V - N = 25
45 Partially correct 59 ms 10320 KB Output is partially correct : V - N = 25
46 Partially correct 144 ms 15308 KB Output is partially correct : V - N = 25
47 Partially correct 88 ms 11852 KB Output is partially correct : V - N = 25
48 Partially correct 244 ms 17160 KB Output is partially correct : V - N = 25
49 Partially correct 61 ms 9884 KB Output is partially correct : V - N = 25
50 Partially correct 24 ms 8648 KB Output is partially correct : V - N = 25
51 Partially correct 296 ms 24400 KB Output is partially correct : V - N = 25
52 Partially correct 17 ms 8376 KB Output is partially correct : V - N = 25
53 Partially correct 318 ms 22228 KB Output is partially correct : V - N = 25
54 Partially correct 478 ms 25752 KB Output is partially correct : V - N = 25
55 Partially correct 33 ms 9252 KB Output is partially correct : V - N = 25
56 Partially correct 237 ms 17912 KB Output is partially correct : V - N = 25
57 Partially correct 504 ms 26940 KB Output is partially correct : V - N = 25
58 Partially correct 93 ms 10664 KB Output is partially correct : V - N = 25
59 Partially correct 226 ms 15808 KB Output is partially correct : V - N = 25
60 Partially correct 382 ms 27508 KB Output is partially correct : V - N = 25
61 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
62 Partially correct 3 ms 4936 KB Output is partially correct : V - N = 17
63 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
64 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
65 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 17
66 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 17
67 Partially correct 3 ms 4784 KB Output is partially correct : V - N = 17
68 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 17
69 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
70 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
71 Partially correct 2 ms 4908 KB Output is partially correct : V - N = 17
72 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 17
73 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
74 Partially correct 3 ms 4864 KB Output is partially correct : V - N = 17
75 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 17
76 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
77 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
78 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
79 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
80 Partially correct 3 ms 4852 KB Output is partially correct : V - N = 17
81 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
82 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
83 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 17
84 Partially correct 2 ms 4880 KB Output is partially correct : V - N = 15
85 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
86 Partially correct 3 ms 4796 KB Output is partially correct : V - N = 17
87 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
88 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
89 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
90 Partially correct 2 ms 4880 KB Output is partially correct : V - N = 15
91 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
92 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
93 Partially correct 3 ms 4768 KB Output is partially correct : V - N = 17
94 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
95 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
96 Partially correct 3 ms 4856 KB Output is partially correct : V - N = 17
97 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
98 Partially correct 3 ms 4876 KB Output is partially correct : V - N = 17
99 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 17
100 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
101 Partially correct 3 ms 4740 KB Output is partially correct : V - N = 17
102 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
103 Partially correct 3 ms 4796 KB Output is partially correct : V - N = 17
104 Partially correct 3 ms 4868 KB Output is partially correct : V - N = 17
105 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
106 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 17
107 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
108 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
109 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
110 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 17
111 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
112 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
113 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 15
114 Partially correct 3 ms 4768 KB Output is partially correct : V - N = 15
115 Partially correct 2 ms 4872 KB Output is partially correct : V - N = 15
116 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
117 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 17
118 Partially correct 3 ms 4768 KB Output is partially correct : V - N = 15
119 Partially correct 3 ms 4852 KB Output is partially correct : V - N = 17
120 Partially correct 3 ms 4872 KB Output is partially correct : V - N = 15
121 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
122 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
123 Partially correct 2 ms 4700 KB Output is partially correct : V - N = 13
124 Partially correct 2 ms 4720 KB Output is partially correct : V - N = 13
125 Partially correct 2 ms 4720 KB Output is partially correct : V - N = 13
126 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
127 Partially correct 6 ms 4724 KB Output is partially correct : V - N = 13
128 Partially correct 2 ms 4720 KB Output is partially correct : V - N = 13
129 Partially correct 2 ms 4752 KB Output is partially correct : V - N = 13
130 Partially correct 2 ms 4716 KB Output is partially correct : V - N = 13
131 Partially correct 3 ms 4744 KB Output is partially correct : V - N = 13
132 Partially correct 2 ms 4756 KB Output is partially correct : V - N = 13
133 Partially correct 2 ms 4752 KB Output is partially correct : V - N = 13
134 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
135 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
136 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
137 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
138 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
139 Partially correct 3 ms 4724 KB Output is partially correct : V - N = 13
140 Partially correct 3 ms 4744 KB Output is partially correct : V - N = 13
141 Partially correct 2 ms 4752 KB Output is partially correct : V - N = 13
142 Correct 2 ms 4732 KB Output is correct : V - N = 11
143 Partially correct 3 ms 4744 KB Output is partially correct : V - N = 13
144 Correct 3 ms 4740 KB Output is correct : V - N = 11
145 Correct 2 ms 4744 KB Output is correct : V - N = 11
146 Correct 2 ms 4668 KB Output is correct : V - N = 11
147 Correct 2 ms 4756 KB Output is correct : V - N = 11
148 Partially correct 3 ms 4664 KB Output is partially correct : V - N = 13
149 Correct 2 ms 4640 KB Output is correct : V - N = 11
150 Correct 2 ms 4716 KB Output is correct : V - N = 11
151 Partially correct 2 ms 4740 KB Output is partially correct : V - N = 13
152 Partially correct 1 ms 4740 KB Output is partially correct : V - N = 13
153 Partially correct 2 ms 4748 KB Output is partially correct : V - N = 13
154 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
155 Partially correct 2 ms 4740 KB Output is partially correct : V - N = 13
156 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
157 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
158 Partially correct 3 ms 4744 KB Output is partially correct : V - N = 13
159 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
160 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
161 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
162 Partially correct 1 ms 4744 KB Output is partially correct : V - N = 13
163 Partially correct 2 ms 4744 KB Output is partially correct : V - N = 13
164 Partially correct 2 ms 4740 KB Output is partially correct : V - N = 13
165 Partially correct 3 ms 4640 KB Output is partially correct : V - N = 13
166 Partially correct 2 ms 4736 KB Output is partially correct : V - N = 13
167 Partially correct 2 ms 4752 KB Output is partially correct : V - N = 13
168 Partially correct 4 ms 4728 KB Output is partially correct : V - N = 13
169 Partially correct 2 ms 4748 KB Output is partially correct : V - N = 13
170 Partially correct 2 ms 4668 KB Output is partially correct : V - N = 13
171 Correct 2 ms 4624 KB Output is correct : V - N = 5
172 Correct 1 ms 4756 KB Output is correct : V - N = 7
173 Incorrect 2 ms 4608 KB Wrong Answer [10]
174 Halted 0 ms 0 KB -