Submission #846568

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
846568	2023-09-07T23:29:08 Z	PanosPask	Airline Route Map (JOI18_airline)	C++14	100 / 100	607 ms	31944 KB

Alice
Bob

#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#define pb push_back
#define CHECK_BIT(val, pos) (val & (1 << pos))
#include <vector>

const int BITS = 10;

using namespace std;

int V, E;

vector<int> C;
vector<int> D;

void Alice( int N, int M, int A[], int B[] ){
	// Just create some new nodes

	V = N;
	E = M;

	// First the bitnodes
	for (int b = 0; b < BITS; b++) {
		for (int i = 0; i < N; i++)
			if (CHECK_BIT(i, b)) {
				C.pb(i);
				D.pb(V);
			}
		if (b) {
			C.pb(V);
			D.pb(V - 1);
		}
		V++;
	}

	// Then the one with all the connections
	for (int i = 1; i <= BITS; i++) {
		C.pb(V);
		D.pb(V - i);
	}
	V++;

	// Then the one with all but this
	for (int i = 0; i < V - 1; i++) {
		C.pb(V);
		D.pb(i);
	}
	V++;

	InitG(V, C.size() + M);
	for (int i = 0; i < M; i++)
		MakeG(i, A[i], B[i]);
	for (int i = 0; i < C.size(); i++)
		MakeG(i + M, C[i], D[i]);

	return;;
}

#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <vector>
#include <bits/stdc++.h>
#define pb push_back

const int BITS = 10;

using namespace std;

// Bit nodes, in little endian order
vector<int> bitnodes;
vector<int> real_order;
vector<vector<int>> adj_list;

vector<int> actual;

int edge_ttl = 0;

vector<bool> banned;

int inside(int a, vector<int>& v)
{
	int p = lower_bound(v.begin(), v.end(), a) - v.begin();
	if (p != v.size() && v[p] == a)
		return true;

	return false;
}

int decode(int node)
{
	int res = 0;
	for (int i = 0; i < BITS; i++) {
		if (inside(bitnodes[i], adj_list[node])) {
			res += (1 << i);
			edge_ttl--;
		}
	}

	return res;
}

void find_next_bitnode(int node, int par)
{
	for (auto i : bitnodes) {
		if (i == node || i == par)
			continue;

		if (inside(i, adj_list[node])) {
			real_order.pb(i);
			find_next_bitnode(i, node);
			return;
		}
	}
}

void Bob( int V, int U, int C[], int D[] )
{
	bitnodes.clear();
	adj_list.clear();
	actual.clear();

	edge_ttl = U;

	adj_list.resize(V);
	banned.assign(V, false);
	actual.assign(V, -1);

	for (int i = 0; i < U; i++) {
		adj_list[C[i]].pb(D[i]);
		adj_list[D[i]].pb(C[i]);
	}

	int outl = -1;
	for (int i = 0; i < V; i++) {
		if (adj_list[i].size() == V - 2)
			outl = i;

		sort(adj_list[i].begin(), adj_list[i].end());
	}

	// Find the node not connected to outlier
	int curp = 0;
	int special = -1;
	for (int i = 0; i < V - 1; i++) {
		if (i == outl)
			continue;

		if (adj_list[outl][curp++] != i) {
			special = i;
			break;
		}
	}
	if (special == -1)
		special = V - 1;

	banned[special] = banned[outl] = true;
	edge_ttl -= adj_list[special].size() + adj_list[outl].size();
	edge_ttl -= BITS - 1;

	// Found special, find bitnodes
	for (auto neigh : adj_list[special]) {
		bitnodes.pb(neigh);
		banned[neigh] = true;
	}

	// Find correct ordering
	// Find one of the starts

	int st = -1;
	for (int i = 0; i < BITS; i++) {
		int cnt = 0;
		for (int j = 0; j < BITS; j++) {
			if (inside(bitnodes[j], adj_list[bitnodes[i]]))
				cnt++;
		}
		if (cnt == 1)
			st = bitnodes[i];
	}
	real_order.pb(st);
	find_next_bitnode(st, -1);

	if (adj_list[real_order.front()].size() < adj_list[real_order.back()].size())
		reverse(real_order.begin(), real_order.end());
	bitnodes = real_order;

	for (int i = 0; i < V; i++) {
		if (!banned[i])
			actual[i] = decode(i);
	}

	InitMap(V - BITS - 2, edge_ttl);

	for (int i = 0; i < V; i++)
		for (auto j : adj_list[i]) {
			if (!banned[i] && !banned[j] && actual[i] < actual[j])
				MakeMap(actual[i], actual[j]);
		}
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:54:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for (int i = 0; i < C.size(); i++)
      |                  ~~^~~~~~~~~~

Bob.cpp: In function 'int inside(int, std::vector<int>&)':
Bob.cpp:26:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  if (p != v.size() && v[p] == a)
      |      ~~^~~~~~~~~~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:78:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |   if (adj_list[i].size() == V - 2)
      |       ~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	15616 KB	Output is correct
2	Correct	3 ms	15616 KB	Output is correct
3	Correct	3 ms	15612 KB	Output is correct
4	Correct	2 ms	13568 KB	Output is correct
5	Correct	2 ms	15620 KB	Output is correct
6	Correct	3 ms	15616 KB	Output is correct
7	Correct	2 ms	15616 KB	Output is correct
8	Correct	3 ms	15616 KB	Output is correct
9	Correct	2 ms	15616 KB	Output is correct
10	Correct	2 ms	13576 KB	Output is correct
11	Correct	2 ms	15616 KB	Output is correct
12	Correct	2 ms	15612 KB	Output is correct
13	Correct	2 ms	15616 KB	Output is correct
14	Correct	3 ms	15640 KB	Output is correct
15	Correct	2 ms	15616 KB	Output is correct
16	Correct	2 ms	15616 KB	Output is correct
17	Correct	3 ms	15616 KB	Output is correct
18	Correct	2 ms	15612 KB	Output is correct
19	Correct	2 ms	15616 KB	Output is correct
20	Correct	2 ms	15616 KB	Output is correct
21	Correct	2 ms	15860 KB	Output is correct
22	Correct	2 ms	15616 KB	Output is correct
23	Correct	2 ms	15620 KB	Output is correct
24	Correct	3 ms	13568 KB	Output is correct
25	Correct	2 ms	15612 KB	Output is correct
26	Correct	2 ms	15620 KB	Output is correct
27	Correct	2 ms	15616 KB	Output is correct
28	Correct	2 ms	15616 KB	Output is correct
29	Correct	3 ms	15616 KB	Output is correct
30	Correct	2 ms	13572 KB	Output is correct
31	Correct	3 ms	13568 KB	Output is correct
32	Correct	3 ms	13568 KB	Output is correct
33	Correct	3 ms	13568 KB	Output is correct
34	Correct	2 ms	13568 KB	Output is correct
35	Correct	2 ms	13572 KB	Output is correct
36	Correct	2 ms	15616 KB	Output is correct
37	Correct	3 ms	15616 KB	Output is correct
38	Correct	2 ms	15616 KB	Output is correct
39	Correct	2 ms	15612 KB	Output is correct
40	Correct	2 ms	15616 KB	Output is correct
41	Correct	3 ms	15616 KB	Output is correct
42	Correct	3 ms	15616 KB	Output is correct
43	Correct	2 ms	15616 KB	Output is correct
44	Correct	2 ms	13408 KB	Output is correct
45	Correct	2 ms	13568 KB	Output is correct
46	Correct	2 ms	15616 KB	Output is correct
47	Correct	3 ms	15616 KB	Output is correct
48	Correct	3 ms	15616 KB	Output is correct
49	Correct	2 ms	15616 KB	Output is correct
50	Correct	2 ms	13568 KB	Output is correct
51	Correct	2 ms	13568 KB	Output is correct
52	Correct	3 ms	15616 KB	Output is correct
53	Correct	2 ms	13568 KB	Output is correct
54	Correct	2 ms	15616 KB	Output is correct
55	Correct	3 ms	15616 KB	Output is correct
56	Correct	2 ms	15624 KB	Output is correct
57	Correct	2 ms	15620 KB	Output is correct
58	Correct	2 ms	15616 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	15616 KB	Output is correct
2	Correct	3 ms	15616 KB	Output is correct
3	Correct	3 ms	15612 KB	Output is correct
4	Correct	2 ms	13568 KB	Output is correct
5	Correct	2 ms	15620 KB	Output is correct
6	Correct	3 ms	15616 KB	Output is correct
7	Correct	2 ms	15616 KB	Output is correct
8	Correct	3 ms	15616 KB	Output is correct
9	Correct	2 ms	15616 KB	Output is correct
10	Correct	2 ms	13576 KB	Output is correct
11	Correct	2 ms	15616 KB	Output is correct
12	Correct	2 ms	15612 KB	Output is correct
13	Correct	2 ms	15616 KB	Output is correct
14	Correct	3 ms	15640 KB	Output is correct
15	Correct	2 ms	15616 KB	Output is correct
16	Correct	2 ms	15616 KB	Output is correct
17	Correct	3 ms	15616 KB	Output is correct
18	Correct	2 ms	15612 KB	Output is correct
19	Correct	2 ms	15616 KB	Output is correct
20	Correct	2 ms	15616 KB	Output is correct
21	Correct	2 ms	15860 KB	Output is correct
22	Correct	2 ms	15616 KB	Output is correct
23	Correct	2 ms	15620 KB	Output is correct
24	Correct	3 ms	13568 KB	Output is correct
25	Correct	2 ms	15612 KB	Output is correct
26	Correct	2 ms	15620 KB	Output is correct
27	Correct	2 ms	15616 KB	Output is correct
28	Correct	2 ms	15616 KB	Output is correct
29	Correct	3 ms	15616 KB	Output is correct
30	Correct	2 ms	13572 KB	Output is correct
31	Correct	3 ms	13568 KB	Output is correct
32	Correct	3 ms	13568 KB	Output is correct
33	Correct	3 ms	13568 KB	Output is correct
34	Correct	2 ms	13568 KB	Output is correct
35	Correct	2 ms	13572 KB	Output is correct
36	Correct	2 ms	15616 KB	Output is correct
37	Correct	3 ms	15616 KB	Output is correct
38	Correct	2 ms	15616 KB	Output is correct
39	Correct	2 ms	15612 KB	Output is correct
40	Correct	2 ms	15616 KB	Output is correct
41	Correct	3 ms	15616 KB	Output is correct
42	Correct	3 ms	15616 KB	Output is correct
43	Correct	2 ms	15616 KB	Output is correct
44	Correct	2 ms	13408 KB	Output is correct
45	Correct	2 ms	13568 KB	Output is correct
46	Correct	2 ms	15616 KB	Output is correct
47	Correct	3 ms	15616 KB	Output is correct
48	Correct	3 ms	15616 KB	Output is correct
49	Correct	2 ms	15616 KB	Output is correct
50	Correct	2 ms	13568 KB	Output is correct
51	Correct	2 ms	13568 KB	Output is correct
52	Correct	3 ms	15616 KB	Output is correct
53	Correct	2 ms	13568 KB	Output is correct
54	Correct	2 ms	15616 KB	Output is correct
55	Correct	3 ms	15616 KB	Output is correct
56	Correct	2 ms	15624 KB	Output is correct
57	Correct	2 ms	15620 KB	Output is correct
58	Correct	2 ms	15616 KB	Output is correct
59	Correct	3 ms	15616 KB	Output is correct
60	Correct	3 ms	15616 KB	Output is correct
61	Correct	3 ms	15616 KB	Output is correct
62	Correct	2 ms	15612 KB	Output is correct
63	Correct	2 ms	15616 KB	Output is correct
64	Correct	2 ms	15616 KB	Output is correct
65	Correct	2 ms	15616 KB	Output is correct
66	Correct	3 ms	15616 KB	Output is correct
67	Correct	3 ms	15616 KB	Output is correct
68	Correct	3 ms	15616 KB	Output is correct
69	Correct	3 ms	15616 KB	Output is correct
70	Correct	3 ms	15616 KB	Output is correct
71	Correct	3 ms	15616 KB	Output is correct
72	Correct	2 ms	15620 KB	Output is correct
73	Correct	3 ms	15616 KB	Output is correct
74	Correct	2 ms	15616 KB	Output is correct
75	Correct	3 ms	15612 KB	Output is correct
76	Correct	3 ms	15616 KB	Output is correct
77	Correct	3 ms	15616 KB	Output is correct
78	Correct	3 ms	15616 KB	Output is correct
79	Correct	3 ms	15616 KB	Output is correct
80	Correct	3 ms	15616 KB	Output is correct
81	Correct	2 ms	15616 KB	Output is correct
82	Correct	2 ms	15616 KB	Output is correct
83	Correct	3 ms	15616 KB	Output is correct
84	Correct	3 ms	15612 KB	Output is correct
85	Correct	2 ms	15620 KB	Output is correct
86	Correct	2 ms	15616 KB	Output is correct
87	Correct	2 ms	15612 KB	Output is correct
88	Correct	2 ms	15628 KB	Output is correct
89	Correct	2 ms	13568 KB	Output is correct
90	Correct	2 ms	13572 KB	Output is correct
91	Correct	2 ms	13568 KB	Output is correct
92	Correct	2 ms	13568 KB	Output is correct
93	Correct	2 ms	13568 KB	Output is correct
94	Correct	3 ms	15616 KB	Output is correct
95	Correct	3 ms	15616 KB	Output is correct
96	Correct	3 ms	15616 KB	Output is correct
97	Correct	2 ms	15616 KB	Output is correct
98	Correct	3 ms	15616 KB	Output is correct
99	Correct	3 ms	15616 KB	Output is correct
100	Correct	2 ms	15616 KB	Output is correct
101	Correct	3 ms	15616 KB	Output is correct
102	Correct	2 ms	13568 KB	Output is correct
103	Correct	2 ms	15616 KB	Output is correct
104	Correct	2 ms	15616 KB	Output is correct
105	Correct	3 ms	15620 KB	Output is correct
106	Correct	3 ms	15616 KB	Output is correct
107	Correct	2 ms	15616 KB	Output is correct
108	Correct	2 ms	15616 KB	Output is correct
109	Correct	2 ms	15616 KB	Output is correct
110	Correct	2 ms	15616 KB	Output is correct
111	Correct	3 ms	15616 KB	Output is correct
112	Correct	3 ms	15616 KB	Output is correct
113	Correct	2 ms	15616 KB	Output is correct
114	Correct	3 ms	15616 KB	Output is correct
115	Correct	3 ms	15620 KB	Output is correct
116	Correct	3 ms	15616 KB	Output is correct
117	Correct	3 ms	15616 KB	Output is correct
118	Correct	2 ms	15620 KB	Output is correct

Subtask #3
63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	562 ms	31944 KB	Output is correct : V - N = 12
2	Correct	431 ms	30692 KB	Output is correct : V - N = 12
3	Correct	152 ms	18876 KB	Output is correct : V - N = 12
4	Correct	7 ms	15808 KB	Output is correct : V - N = 12
5	Correct	87 ms	17676 KB	Output is correct : V - N = 12
6	Correct	361 ms	29716 KB	Output is correct : V - N = 12
7	Correct	437 ms	31512 KB	Output is correct : V - N = 12
8	Correct	491 ms	31176 KB	Output is correct : V - N = 12
9	Correct	215 ms	19452 KB	Output is correct : V - N = 12
10	Correct	26 ms	16756 KB	Output is correct : V - N = 12
11	Correct	41 ms	16744 KB	Output is correct : V - N = 12
12	Correct	276 ms	24480 KB	Output is correct : V - N = 12
13	Correct	475 ms	31368 KB	Output is correct : V - N = 12
14	Correct	444 ms	30920 KB	Output is correct : V - N = 12
15	Correct	276 ms	26188 KB	Output is correct : V - N = 12
16	Correct	73 ms	17316 KB	Output is correct : V - N = 12
17	Correct	12 ms	16488 KB	Output is correct : V - N = 12
18	Correct	195 ms	19096 KB	Output is correct : V - N = 12
19	Correct	411 ms	30776 KB	Output is correct : V - N = 12
20	Correct	439 ms	30308 KB	Output is correct : V - N = 12
21	Correct	147 ms	18100 KB	Output is correct : V - N = 12
22	Correct	103 ms	17340 KB	Output is correct : V - N = 12
23	Correct	34 ms	16892 KB	Output is correct : V - N = 12
24	Correct	5 ms	15616 KB	Output is correct : V - N = 12
25	Correct	17 ms	16120 KB	Output is correct : V - N = 12
26	Correct	74 ms	17680 KB	Output is correct : V - N = 12
27	Correct	151 ms	17160 KB	Output is correct : V - N = 12
28	Correct	97 ms	17176 KB	Output is correct : V - N = 12
29	Correct	46 ms	16788 KB	Output is correct : V - N = 12
30	Correct	7 ms	15772 KB	Output is correct : V - N = 12
31	Correct	5 ms	13568 KB	Output is correct : V - N = 12
32	Correct	5 ms	13568 KB	Output is correct : V - N = 12
33	Correct	5 ms	13576 KB	Output is correct : V - N = 12
34	Correct	5 ms	13568 KB	Output is correct : V - N = 12
35	Correct	5 ms	13652 KB	Output is correct : V - N = 12
36	Correct	514 ms	30972 KB	Output is correct : V - N = 12
37	Correct	607 ms	30916 KB	Output is correct : V - N = 12
38	Correct	423 ms	31652 KB	Output is correct : V - N = 12
39	Correct	448 ms	30576 KB	Output is correct : V - N = 12
40	Correct	502 ms	30504 KB	Output is correct : V - N = 12
41	Correct	74 ms	17756 KB	Output is correct : V - N = 12
42	Correct	59 ms	17640 KB	Output is correct : V - N = 12
43	Correct	82 ms	17452 KB	Output is correct : V - N = 12
44	Correct	7 ms	15612 KB	Output is correct : V - N = 12
45	Correct	40 ms	16704 KB	Output is correct : V - N = 12
46	Correct	192 ms	18864 KB	Output is correct : V - N = 12
47	Correct	75 ms	17712 KB	Output is correct : V - N = 12
48	Correct	181 ms	19284 KB	Output is correct : V - N = 12
49	Correct	41 ms	16940 KB	Output is correct : V - N = 12
50	Correct	13 ms	16388 KB	Output is correct : V - N = 12
51	Correct	344 ms	30156 KB	Output is correct : V - N = 12
52	Correct	7 ms	15804 KB	Output is correct : V - N = 12
53	Correct	282 ms	29684 KB	Output is correct : V - N = 12
54	Correct	359 ms	31040 KB	Output is correct : V - N = 12
55	Correct	20 ms	16388 KB	Output is correct : V - N = 12
56	Correct	330 ms	24388 KB	Output is correct : V - N = 12
57	Correct	424 ms	31164 KB	Output is correct : V - N = 12
58	Correct	71 ms	17492 KB	Output is correct : V - N = 12
59	Correct	182 ms	19544 KB	Output is correct : V - N = 12
60	Correct	583 ms	30648 KB	Output is correct : V - N = 12
61	Correct	3 ms	15616 KB	Output is correct : V - N = 12
62	Correct	2 ms	15616 KB	Output is correct : V - N = 12
63	Correct	2 ms	15616 KB	Output is correct : V - N = 12
64	Correct	3 ms	15616 KB	Output is correct : V - N = 12
65	Correct	3 ms	15612 KB	Output is correct : V - N = 12
66	Correct	3 ms	15616 KB	Output is correct : V - N = 12
67	Correct	2 ms	15616 KB	Output is correct : V - N = 12
68	Correct	3 ms	15616 KB	Output is correct : V - N = 12
69	Correct	2 ms	15616 KB	Output is correct : V - N = 12
70	Correct	3 ms	15616 KB	Output is correct : V - N = 12
71	Correct	2 ms	15616 KB	Output is correct : V - N = 12
72	Correct	2 ms	15616 KB	Output is correct : V - N = 12
73	Correct	3 ms	15612 KB	Output is correct : V - N = 12
74	Correct	3 ms	15616 KB	Output is correct : V - N = 12
75	Correct	3 ms	15616 KB	Output is correct : V - N = 12
76	Correct	3 ms	15620 KB	Output is correct : V - N = 12
77	Correct	2 ms	15616 KB	Output is correct : V - N = 12
78	Correct	2 ms	15616 KB	Output is correct : V - N = 12
79	Correct	2 ms	15616 KB	Output is correct : V - N = 12
80	Correct	3 ms	15616 KB	Output is correct : V - N = 12
81	Correct	2 ms	15616 KB	Output is correct : V - N = 12
82	Correct	3 ms	15616 KB	Output is correct : V - N = 12
83	Correct	3 ms	15840 KB	Output is correct : V - N = 12
84	Correct	2 ms	15620 KB	Output is correct : V - N = 12
85	Correct	2 ms	15616 KB	Output is correct : V - N = 12
86	Correct	3 ms	15768 KB	Output is correct : V - N = 12
87	Correct	3 ms	15616 KB	Output is correct : V - N = 12
88	Correct	2 ms	15628 KB	Output is correct : V - N = 12
89	Correct	2 ms	15616 KB	Output is correct : V - N = 12
90	Correct	2 ms	15620 KB	Output is correct : V - N = 12
91	Correct	2 ms	13568 KB	Output is correct : V - N = 12
92	Correct	2 ms	13360 KB	Output is correct : V - N = 12
93	Correct	2 ms	13820 KB	Output is correct : V - N = 12
94	Correct	2 ms	13568 KB	Output is correct : V - N = 12
95	Correct	2 ms	13568 KB	Output is correct : V - N = 12
96	Correct	3 ms	15616 KB	Output is correct : V - N = 12
97	Correct	3 ms	15552 KB	Output is correct : V - N = 12
98	Correct	3 ms	15616 KB	Output is correct : V - N = 12
99	Correct	2 ms	15616 KB	Output is correct : V - N = 12
100	Correct	3 ms	15616 KB	Output is correct : V - N = 12
101	Correct	3 ms	15616 KB	Output is correct : V - N = 12
102	Correct	2 ms	15616 KB	Output is correct : V - N = 12
103	Correct	2 ms	15616 KB	Output is correct : V - N = 12
104	Correct	2 ms	13568 KB	Output is correct : V - N = 12
105	Correct	2 ms	15472 KB	Output is correct : V - N = 12
106	Correct	2 ms	15616 KB	Output is correct : V - N = 12
107	Correct	2 ms	15620 KB	Output is correct : V - N = 12
108	Correct	3 ms	15588 KB	Output is correct : V - N = 12
109	Correct	2 ms	15616 KB	Output is correct : V - N = 12
110	Correct	3 ms	15616 KB	Output is correct : V - N = 12
111	Correct	3 ms	15764 KB	Output is correct : V - N = 12
112	Correct	2 ms	15868 KB	Output is correct : V - N = 12
113	Correct	3 ms	15616 KB	Output is correct : V - N = 12
114	Correct	2 ms	15616 KB	Output is correct : V - N = 12
115	Correct	2 ms	15616 KB	Output is correct : V - N = 12
116	Correct	3 ms	15616 KB	Output is correct : V - N = 12
117	Correct	3 ms	15616 KB	Output is correct : V - N = 12
118	Correct	3 ms	15612 KB	Output is correct : V - N = 12
119	Correct	3 ms	15616 KB	Output is correct : V - N = 12
120	Correct	3 ms	15616 KB	Output is correct : V - N = 12
121	Correct	2 ms	15616 KB	Output is correct : V - N = 12
122	Correct	2 ms	15616 KB	Output is correct : V - N = 12
123	Correct	2 ms	15616 KB	Output is correct : V - N = 12
124	Correct	2 ms	13568 KB	Output is correct : V - N = 12
125	Correct	2 ms	15620 KB	Output is correct : V - N = 12
126	Correct	2 ms	15620 KB	Output is correct : V - N = 12
127	Correct	3 ms	15616 KB	Output is correct : V - N = 12
128	Correct	3 ms	15616 KB	Output is correct : V - N = 12
129	Correct	3 ms	15612 KB	Output is correct : V - N = 12
130	Correct	2 ms	13568 KB	Output is correct : V - N = 12
131	Correct	2 ms	15616 KB	Output is correct : V - N = 12
132	Correct	3 ms	15616 KB	Output is correct : V - N = 12
133	Correct	3 ms	15616 KB	Output is correct : V - N = 12
134	Correct	2 ms	15616 KB	Output is correct : V - N = 12
135	Correct	2 ms	15872 KB	Output is correct : V - N = 12
136	Correct	2 ms	15868 KB	Output is correct : V - N = 12
137	Correct	2 ms	15616 KB	Output is correct : V - N = 12
138	Correct	2 ms	15620 KB	Output is correct : V - N = 12
139	Correct	2 ms	15616 KB	Output is correct : V - N = 12
140	Correct	3 ms	15616 KB	Output is correct : V - N = 12
141	Correct	2 ms	15616 KB	Output is correct : V - N = 12
142	Correct	2 ms	15616 KB	Output is correct : V - N = 12
143	Correct	2 ms	15616 KB	Output is correct : V - N = 12
144	Correct	2 ms	13568 KB	Output is correct : V - N = 12
145	Correct	2 ms	15616 KB	Output is correct : V - N = 12
146	Correct	2 ms	15820 KB	Output is correct : V - N = 12
147	Correct	1 ms	15616 KB	Output is correct : V - N = 12
148	Correct	2 ms	15616 KB	Output is correct : V - N = 12
149	Correct	3 ms	15868 KB	Output is correct : V - N = 12
150	Correct	2 ms	13568 KB	Output is correct : V - N = 12
151	Correct	2 ms	13572 KB	Output is correct : V - N = 12
152	Correct	2 ms	13572 KB	Output is correct : V - N = 12
153	Correct	2 ms	13572 KB	Output is correct : V - N = 12
154	Correct	2 ms	13568 KB	Output is correct : V - N = 12
155	Correct	3 ms	13568 KB	Output is correct : V - N = 12
156	Correct	2 ms	15616 KB	Output is correct : V - N = 12
157	Correct	2 ms	15620 KB	Output is correct : V - N = 12
158	Correct	2 ms	15616 KB	Output is correct : V - N = 12
159	Correct	3 ms	15616 KB	Output is correct : V - N = 12
160	Correct	2 ms	15616 KB	Output is correct : V - N = 12
161	Correct	2 ms	15616 KB	Output is correct : V - N = 12
162	Correct	2 ms	15616 KB	Output is correct : V - N = 12
163	Correct	2 ms	15616 KB	Output is correct : V - N = 12
164	Correct	2 ms	13568 KB	Output is correct : V - N = 12
165	Correct	2 ms	13572 KB	Output is correct : V - N = 12
166	Correct	2 ms	15616 KB	Output is correct : V - N = 12
167	Correct	3 ms	15616 KB	Output is correct : V - N = 12
168	Correct	2 ms	15616 KB	Output is correct : V - N = 12
169	Correct	2 ms	15616 KB	Output is correct : V - N = 12
170	Correct	2 ms	13568 KB	Output is correct : V - N = 12
171	Correct	2 ms	13584 KB	Output is correct : V - N = 12
172	Correct	2 ms	15616 KB	Output is correct : V - N = 12
173	Correct	3 ms	13568 KB	Output is correct : V - N = 12
174	Correct	3 ms	15616 KB	Output is correct : V - N = 12
175	Correct	3 ms	15616 KB	Output is correct : V - N = 12
176	Correct	3 ms	15616 KB	Output is correct : V - N = 12
177	Correct	3 ms	15768 KB	Output is correct : V - N = 12
178	Correct	2 ms	15452 KB	Output is correct : V - N = 12

Submission #846568

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 15.0 / 15.0

Subtask #3 63.0 / 63.0

Subtask #1
22.0 / 22.0

Subtask #2
15.0 / 15.0

Subtask #3
63.0 / 63.0