답안 #732110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732110	2023-04-28T12:26:50 Z	sentheta	항공 노선도 (JOI18_airline)	C++17	100 / 100	1192 ms	69136 KB

Alice

#include "Alicelib.h"
#include <cstdio>
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;

static const int k = 10;

set<pii> AliceAns;
void AliceMake(int u,int v){
	if(u>v) swap(u,v);
	AliceAns.insert({u,v});
}
void AliceFinish(int n){
	// dbg("ALICE DONE");
	InitG(1+n+k+1, (int)AliceAns.size());
	int i = 0;
	for(auto[u,v] : AliceAns){
		// cout << u _ v << endl;
		MakeG(i++, u,v);
	}
	// cout << endl << endl;
}

void Alice(int n,int m,int u[],int v[]){
	rep(i,0,m){
		u[i]++; v[i]++;
		AliceMake(u[i],v[i]);
	}

	int a = 0;
	// connect 2^i to a and nodes with ith-bit ON
	AliceMake(n+1, n+3);
	AliceMake(n+1, n+4);
	rep(i,0,k){
		int vtx = n+1+i;
		AliceMake(a,vtx);
		if(i>=2) AliceMake(vtx-1, vtx);

		for(int j=1; j<=n; j++) if(j&1<<i){
			AliceMake(vtx, j);
		}
	}

	// connect b to all except a
	int b = n+k+1;
	for(int i=0; i<=n+k; i++) if(i!=a){
		AliceMake(b, i);
	}

	AliceFinish(n);
	rep(i,0,m){
		u[i]--; v[i]--;
	}
	return; InitG(3,2); MakeG(0,1,2); MakeG(1,1,3);
}

Bob

#include "Boblib.h"
#include <cstdio>
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;

static const int k = 10;

set<pii> BobAns;
void BobMake(int u,int v){
	if(u>v) swap(u,v);
	BobAns.insert({u,v});
}
void BobFinish(int n){
	// dbg(BobAns.size());
	InitMap(n, (int)BobAns.size());
	for(auto[u,v] : BobAns){
		MakeMap(u-1, v-1);
	}
}

const int N = 1069;
V<int> adj[N];
bool g[N][N];

int two[k];
int ori[N];

V<int> aadj[N];

void Bob(int ntot,int m,int u[],int v[]){

	int n = ntot-k-2;
	// dbg(n);
	rep(i,0,N){
		adj[i].clear();
		rep(j,0,N) g[i][j] = 0;
	}
	rep(i,0,m){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
		g[u[i]][v[i]] = g[v[i]][u[i]] = 1;

		// cout << u[i] _ v[i] << nl;
	}

	// dbg("BOB0");

	// find node with degree n+k
	int b = 0;
	while((int)adj[b].size()!=n+k) b++;
	rep(i,0,ntot) if(i!=b) assert((int)adj[i].size()!=n+k);
	// dbg(b);

	// dbg("BOB1");

	// find the node disconnected from b
	int a;
	rep(i,0,ntot) if(i!=b && !g[i][b]){
		a = i; break;
	}
	rep(i,0,ntot) if(i!=b && !g[i][b]) assert(i==a);
	assert(adj[a].size()==k);
	// dbg("BOB2");
	// dbg(a);

	// determine two[], take a subgraph
	V<int>&vec = adj[a];
	for(int x : vec){
		for(int y : adj[x]){
			bool ok = 0;
			for(int z : vec) ok |= y==z;
			if(ok){
				// cout << x _ y << nl;
				aadj[x].push_back(y);
			}
		}
	}

	int p;
	rep(i,0,k){
		p = adj[a][i];

		bool ok = 1;
		ok &= aadj[p].size()==2;
		if(!ok) continue;
		// dbg(i);
		// dbg(p);

		int q = aadj[p][0], r = aadj[p][1];
		// dbg(q); dbg(r);
		ok &= aadj[q].size()==3;
		ok &= aadj[r].size()==3;
		ok &= g[q][r];
		// dbg(ok);
		if(ok) break;
	}
	// dbg(p);
	// dbg(aadj[p].size());
	// cout << nl << nl;

	int q = aadj[p][0], r = aadj[p][1];
	bool ok = 0;
	for(int x : aadj[q]) if(x!=p && x!=r && g[a][x]){
		ok = aadj[x].size()==1;
	}
	if(!ok) swap(q, r);

	two[0] = p;
	two[2] = q;
	two[3] = r;
	for(int x : aadj[q]) if(x!=p && x!=r){
		two[1] = x;
	}

	// find the rest of two[]
	rep(i,4,k){
		for(int y : aadj[two[i-1]]) if(y!=two[i-2] && y!=two[i-4] && g[a][y]){
			two[i] = y;
		}
	}

	// dbg("BOB3");
	// rep(i,0,k) cout << i _ two[i] << nl;

	// recover nodes
	rep(i,0,ntot){
		// check importance
		bool flag = 0;
		flag |= i==a || i==b;
		rep(j,0,k) flag |= i==two[j];
		if(flag) continue;
		ori[i] = 0;

		// dbg(i);

		rep(j,0,k) if(g[i][two[j]]){
			ori[i] ^= 1<<j;
		}
	}
	// dbg("BOB4");

	// recover edges
	rep(i,0,m){
		// check importance
		bool flag = 0;
		flag = u[i]==a || u[i]==b || v[i]==a || v[i]==b;
		rep(j,0,k) flag |= u[i]==two[j] || v[i]==two[j];
		if(flag) continue;

		// cout << u[i] _ v[i] << nl;
		// cout << ori[u[i]] _ ori[v[i]] << nl;
		BobMake(ori[u[i]],ori[v[i]]);
	}

	BobFinish(n);
	return; InitMap(3,2); MakeMap(1,2); MakeMap(1,3);
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:176:29: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
  176 |   flag = u[i]==a || u[i]==b || v[i]==a || v[i]==b;
      |          ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5704 KB	Output is correct
2	Correct	2 ms	5764 KB	Output is correct
3	Correct	3 ms	5772 KB	Output is correct
4	Correct	3 ms	5764 KB	Output is correct
5	Correct	3 ms	5764 KB	Output is correct
6	Correct	3 ms	5780 KB	Output is correct
7	Correct	4 ms	5664 KB	Output is correct
8	Correct	2 ms	5668 KB	Output is correct
9	Correct	3 ms	5772 KB	Output is correct
10	Correct	3 ms	5760 KB	Output is correct
11	Correct	2 ms	5740 KB	Output is correct
12	Correct	3 ms	5764 KB	Output is correct
13	Correct	3 ms	5764 KB	Output is correct
14	Correct	4 ms	5764 KB	Output is correct
15	Correct	3 ms	5664 KB	Output is correct
16	Correct	3 ms	5692 KB	Output is correct
17	Correct	3 ms	5772 KB	Output is correct
18	Correct	3 ms	5776 KB	Output is correct
19	Correct	3 ms	5764 KB	Output is correct
20	Correct	3 ms	5764 KB	Output is correct
21	Correct	3 ms	5768 KB	Output is correct
22	Correct	3 ms	5772 KB	Output is correct
23	Correct	3 ms	5760 KB	Output is correct
24	Correct	3 ms	5760 KB	Output is correct
25	Correct	3 ms	5752 KB	Output is correct
26	Correct	4 ms	5708 KB	Output is correct
27	Correct	2 ms	5740 KB	Output is correct
28	Correct	3 ms	5764 KB	Output is correct
29	Correct	3 ms	5760 KB	Output is correct
30	Correct	3 ms	5892 KB	Output is correct
31	Correct	3 ms	5692 KB	Output is correct
32	Correct	3 ms	5896 KB	Output is correct
33	Correct	3 ms	5732 KB	Output is correct
34	Correct	3 ms	5760 KB	Output is correct
35	Correct	3 ms	5668 KB	Output is correct
36	Correct	4 ms	5740 KB	Output is correct
37	Correct	3 ms	5692 KB	Output is correct
38	Correct	3 ms	5692 KB	Output is correct
39	Correct	3 ms	5744 KB	Output is correct
40	Correct	3 ms	5772 KB	Output is correct
41	Correct	4 ms	5768 KB	Output is correct
42	Correct	3 ms	5744 KB	Output is correct
43	Correct	2 ms	5716 KB	Output is correct
44	Correct	3 ms	5756 KB	Output is correct
45	Correct	2 ms	5760 KB	Output is correct
46	Correct	3 ms	5764 KB	Output is correct
47	Correct	2 ms	5764 KB	Output is correct
48	Correct	3 ms	5744 KB	Output is correct
49	Correct	3 ms	5744 KB	Output is correct
50	Correct	3 ms	5760 KB	Output is correct
51	Correct	3 ms	5752 KB	Output is correct
52	Correct	3 ms	5764 KB	Output is correct
53	Correct	3 ms	5664 KB	Output is correct
54	Correct	3 ms	5692 KB	Output is correct
55	Correct	3 ms	5764 KB	Output is correct
56	Correct	3 ms	5692 KB	Output is correct
57	Correct	4 ms	5768 KB	Output is correct
58	Correct	3 ms	5740 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5704 KB	Output is correct
2	Correct	2 ms	5764 KB	Output is correct
3	Correct	3 ms	5772 KB	Output is correct
4	Correct	3 ms	5764 KB	Output is correct
5	Correct	3 ms	5764 KB	Output is correct
6	Correct	3 ms	5780 KB	Output is correct
7	Correct	4 ms	5664 KB	Output is correct
8	Correct	2 ms	5668 KB	Output is correct
9	Correct	3 ms	5772 KB	Output is correct
10	Correct	3 ms	5760 KB	Output is correct
11	Correct	2 ms	5740 KB	Output is correct
12	Correct	3 ms	5764 KB	Output is correct
13	Correct	3 ms	5764 KB	Output is correct
14	Correct	4 ms	5764 KB	Output is correct
15	Correct	3 ms	5664 KB	Output is correct
16	Correct	3 ms	5692 KB	Output is correct
17	Correct	3 ms	5772 KB	Output is correct
18	Correct	3 ms	5776 KB	Output is correct
19	Correct	3 ms	5764 KB	Output is correct
20	Correct	3 ms	5764 KB	Output is correct
21	Correct	3 ms	5768 KB	Output is correct
22	Correct	3 ms	5772 KB	Output is correct
23	Correct	3 ms	5760 KB	Output is correct
24	Correct	3 ms	5760 KB	Output is correct
25	Correct	3 ms	5752 KB	Output is correct
26	Correct	4 ms	5708 KB	Output is correct
27	Correct	2 ms	5740 KB	Output is correct
28	Correct	3 ms	5764 KB	Output is correct
29	Correct	3 ms	5760 KB	Output is correct
30	Correct	3 ms	5892 KB	Output is correct
31	Correct	3 ms	5692 KB	Output is correct
32	Correct	3 ms	5896 KB	Output is correct
33	Correct	3 ms	5732 KB	Output is correct
34	Correct	3 ms	5760 KB	Output is correct
35	Correct	3 ms	5668 KB	Output is correct
36	Correct	4 ms	5740 KB	Output is correct
37	Correct	3 ms	5692 KB	Output is correct
38	Correct	3 ms	5692 KB	Output is correct
39	Correct	3 ms	5744 KB	Output is correct
40	Correct	3 ms	5772 KB	Output is correct
41	Correct	4 ms	5768 KB	Output is correct
42	Correct	3 ms	5744 KB	Output is correct
43	Correct	2 ms	5716 KB	Output is correct
44	Correct	3 ms	5756 KB	Output is correct
45	Correct	2 ms	5760 KB	Output is correct
46	Correct	3 ms	5764 KB	Output is correct
47	Correct	2 ms	5764 KB	Output is correct
48	Correct	3 ms	5744 KB	Output is correct
49	Correct	3 ms	5744 KB	Output is correct
50	Correct	3 ms	5760 KB	Output is correct
51	Correct	3 ms	5752 KB	Output is correct
52	Correct	3 ms	5764 KB	Output is correct
53	Correct	3 ms	5664 KB	Output is correct
54	Correct	3 ms	5692 KB	Output is correct
55	Correct	3 ms	5764 KB	Output is correct
56	Correct	3 ms	5692 KB	Output is correct
57	Correct	4 ms	5768 KB	Output is correct
58	Correct	3 ms	5740 KB	Output is correct
59	Correct	4 ms	6068 KB	Output is correct
60	Correct	4 ms	6020 KB	Output is correct
61	Correct	5 ms	5892 KB	Output is correct
62	Correct	3 ms	5744 KB	Output is correct
63	Correct	4 ms	5780 KB	Output is correct
64	Correct	3 ms	6020 KB	Output is correct
65	Correct	3 ms	6020 KB	Output is correct
66	Correct	3 ms	6020 KB	Output is correct
67	Correct	4 ms	5816 KB	Output is correct
68	Correct	3 ms	5764 KB	Output is correct
69	Correct	3 ms	5764 KB	Output is correct
70	Correct	3 ms	5900 KB	Output is correct
71	Correct	3 ms	6032 KB	Output is correct
72	Correct	4 ms	6020 KB	Output is correct
73	Correct	4 ms	5892 KB	Output is correct
74	Correct	3 ms	5764 KB	Output is correct
75	Correct	3 ms	5692 KB	Output is correct
76	Correct	3 ms	5892 KB	Output is correct
77	Correct	4 ms	6020 KB	Output is correct
78	Correct	4 ms	6020 KB	Output is correct
79	Correct	3 ms	6004 KB	Output is correct
80	Correct	3 ms	5900 KB	Output is correct
81	Correct	3 ms	5764 KB	Output is correct
82	Correct	4 ms	5760 KB	Output is correct
83	Correct	3 ms	5692 KB	Output is correct
84	Correct	3 ms	5796 KB	Output is correct
85	Correct	4 ms	5948 KB	Output is correct
86	Correct	3 ms	5868 KB	Output is correct
87	Correct	3 ms	5704 KB	Output is correct
88	Correct	3 ms	5772 KB	Output is correct
89	Correct	3 ms	5760 KB	Output is correct
90	Correct	4 ms	5760 KB	Output is correct
91	Correct	3 ms	5764 KB	Output is correct
92	Correct	4 ms	5728 KB	Output is correct
93	Correct	4 ms	5760 KB	Output is correct
94	Correct	4 ms	6024 KB	Output is correct
95	Correct	3 ms	6000 KB	Output is correct
96	Correct	4 ms	6020 KB	Output is correct
97	Correct	4 ms	6020 KB	Output is correct
98	Correct	4 ms	5948 KB	Output is correct
99	Correct	3 ms	5900 KB	Output is correct
100	Correct	3 ms	5780 KB	Output is correct
101	Correct	3 ms	5744 KB	Output is correct
102	Correct	4 ms	5768 KB	Output is correct
103	Correct	4 ms	5668 KB	Output is correct
104	Correct	3 ms	5740 KB	Output is correct
105	Correct	3 ms	5872 KB	Output is correct
106	Correct	3 ms	5892 KB	Output is correct
107	Correct	3 ms	5772 KB	Output is correct
108	Correct	3 ms	5740 KB	Output is correct
109	Correct	3 ms	6020 KB	Output is correct
110	Correct	3 ms	5764 KB	Output is correct
111	Correct	3 ms	5892 KB	Output is correct
112	Correct	3 ms	5892 KB	Output is correct
113	Correct	3 ms	5688 KB	Output is correct
114	Correct	4 ms	5892 KB	Output is correct
115	Correct	3 ms	6020 KB	Output is correct
116	Correct	4 ms	5764 KB	Output is correct
117	Correct	3 ms	5832 KB	Output is correct
118	Correct	4 ms	5820 KB	Output is correct

Subtask #3

63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1103 ms	69076 KB	Output is correct : V - N = 12
2	Correct	897 ms	55532 KB	Output is correct : V - N = 12
3	Correct	280 ms	25492 KB	Output is correct : V - N = 12
4	Correct	11 ms	6760 KB	Output is correct : V - N = 12
5	Correct	156 ms	17504 KB	Output is correct : V - N = 12
6	Correct	679 ms	48040 KB	Output is correct : V - N = 12
7	Correct	1112 ms	68196 KB	Output is correct : V - N = 12
8	Correct	971 ms	61744 KB	Output is correct : V - N = 12
9	Correct	503 ms	33404 KB	Output is correct : V - N = 12
10	Correct	46 ms	9336 KB	Output is correct : V - N = 12
11	Correct	80 ms	11572 KB	Output is correct : V - N = 12
12	Correct	513 ms	38660 KB	Output is correct : V - N = 12
13	Correct	1071 ms	64540 KB	Output is correct : V - N = 12
14	Correct	1076 ms	66380 KB	Output is correct : V - N = 12
15	Correct	598 ms	43948 KB	Output is correct : V - N = 12
16	Correct	107 ms	14108 KB	Output is correct : V - N = 12
17	Correct	24 ms	7724 KB	Output is correct : V - N = 12
18	Correct	390 ms	29856 KB	Output is correct : V - N = 12
19	Correct	872 ms	59180 KB	Output is correct : V - N = 12
20	Correct	1192 ms	68696 KB	Output is correct : V - N = 12
21	Correct	237 ms	23356 KB	Output is correct : V - N = 12
22	Correct	191 ms	18872 KB	Output is correct : V - N = 12
23	Correct	64 ms	11060 KB	Output is correct : V - N = 12
24	Correct	6 ms	6148 KB	Output is correct : V - N = 12
25	Correct	40 ms	8988 KB	Output is correct : V - N = 12
26	Correct	133 ms	17088 KB	Output is correct : V - N = 12
27	Correct	221 ms	22168 KB	Output is correct : V - N = 12
28	Correct	263 ms	20664 KB	Output is correct : V - N = 12
29	Correct	90 ms	13348 KB	Output is correct : V - N = 12
30	Correct	10 ms	6916 KB	Output is correct : V - N = 12
31	Correct	11 ms	6180 KB	Output is correct : V - N = 12
32	Correct	11 ms	6400 KB	Output is correct : V - N = 12
33	Correct	8 ms	6392 KB	Output is correct : V - N = 12
34	Correct	8 ms	6284 KB	Output is correct : V - N = 12
35	Correct	8 ms	6456 KB	Output is correct : V - N = 12
36	Correct	1065 ms	69020 KB	Output is correct : V - N = 12
37	Correct	1120 ms	69136 KB	Output is correct : V - N = 12
38	Correct	1140 ms	69124 KB	Output is correct : V - N = 12
39	Correct	1039 ms	69116 KB	Output is correct : V - N = 12
40	Correct	1060 ms	69048 KB	Output is correct : V - N = 12
41	Correct	183 ms	17116 KB	Output is correct : V - N = 12
42	Correct	119 ms	14856 KB	Output is correct : V - N = 12
43	Correct	146 ms	16008 KB	Output is correct : V - N = 12
44	Correct	10 ms	6448 KB	Output is correct : V - N = 12
45	Correct	83 ms	11896 KB	Output is correct : V - N = 12
46	Correct	313 ms	27132 KB	Output is correct : V - N = 12
47	Correct	169 ms	16872 KB	Output is correct : V - N = 12
48	Correct	444 ms	34060 KB	Output is correct : V - N = 12
49	Correct	63 ms	11048 KB	Output is correct : V - N = 12
50	Correct	25 ms	7712 KB	Output is correct : V - N = 12
51	Correct	764 ms	55484 KB	Output is correct : V - N = 12
52	Correct	10 ms	6712 KB	Output is correct : V - N = 12
53	Correct	646 ms	47468 KB	Output is correct : V - N = 12
54	Correct	948 ms	60884 KB	Output is correct : V - N = 12
55	Correct	45 ms	9172 KB	Output is correct : V - N = 12
56	Correct	565 ms	37552 KB	Output is correct : V - N = 12
57	Correct	985 ms	65136 KB	Output is correct : V - N = 12
58	Correct	122 ms	13928 KB	Output is correct : V - N = 12
59	Correct	351 ms	29152 KB	Output is correct : V - N = 12
60	Correct	1015 ms	66904 KB	Output is correct : V - N = 12
61	Correct	3 ms	6020 KB	Output is correct : V - N = 12
62	Correct	4 ms	5996 KB	Output is correct : V - N = 12
63	Correct	3 ms	5892 KB	Output is correct : V - N = 12
64	Correct	3 ms	5764 KB	Output is correct : V - N = 12
65	Correct	2 ms	5772 KB	Output is correct : V - N = 12
66	Correct	3 ms	5832 KB	Output is correct : V - N = 12
67	Correct	3 ms	5996 KB	Output is correct : V - N = 12
68	Correct	5 ms	6000 KB	Output is correct : V - N = 12
69	Correct	3 ms	5892 KB	Output is correct : V - N = 12
70	Correct	3 ms	5744 KB	Output is correct : V - N = 12
71	Correct	3 ms	5704 KB	Output is correct : V - N = 12
72	Correct	3 ms	5884 KB	Output is correct : V - N = 12
73	Correct	4 ms	6020 KB	Output is correct : V - N = 12
74	Correct	4 ms	6020 KB	Output is correct : V - N = 12
75	Correct	3 ms	5792 KB	Output is correct : V - N = 12
76	Correct	3 ms	5760 KB	Output is correct : V - N = 12
77	Correct	3 ms	5764 KB	Output is correct : V - N = 12
78	Correct	3 ms	5872 KB	Output is correct : V - N = 12
79	Correct	3 ms	6000 KB	Output is correct : V - N = 12
80	Correct	3 ms	5964 KB	Output is correct : V - N = 12
81	Correct	6 ms	6020 KB	Output is correct : V - N = 12
82	Correct	3 ms	5872 KB	Output is correct : V - N = 12
83	Correct	3 ms	5892 KB	Output is correct : V - N = 12
84	Correct	2 ms	5764 KB	Output is correct : V - N = 12
85	Correct	3 ms	5900 KB	Output is correct : V - N = 12
86	Correct	3 ms	5872 KB	Output is correct : V - N = 12
87	Correct	3 ms	5948 KB	Output is correct : V - N = 12
88	Correct	3 ms	5892 KB	Output is correct : V - N = 12
89	Correct	3 ms	5760 KB	Output is correct : V - N = 12
90	Correct	3 ms	5704 KB	Output is correct : V - N = 12
91	Correct	2 ms	5772 KB	Output is correct : V - N = 12
92	Correct	3 ms	5664 KB	Output is correct : V - N = 12
93	Correct	4 ms	5760 KB	Output is correct : V - N = 12
94	Correct	3 ms	5756 KB	Output is correct : V - N = 12
95	Correct	3 ms	5692 KB	Output is correct : V - N = 12
96	Correct	4 ms	6024 KB	Output is correct : V - N = 12
97	Correct	3 ms	6020 KB	Output is correct : V - N = 12
98	Correct	3 ms	6004 KB	Output is correct : V - N = 12
99	Correct	4 ms	6020 KB	Output is correct : V - N = 12
100	Correct	3 ms	6028 KB	Output is correct : V - N = 12
101	Correct	3 ms	5892 KB	Output is correct : V - N = 12
102	Correct	4 ms	5888 KB	Output is correct : V - N = 12
103	Correct	3 ms	5744 KB	Output is correct : V - N = 12
104	Correct	2 ms	5736 KB	Output is correct : V - N = 12
105	Correct	2 ms	5772 KB	Output is correct : V - N = 12
106	Correct	3 ms	5748 KB	Output is correct : V - N = 12
107	Correct	3 ms	5868 KB	Output is correct : V - N = 12
108	Correct	3 ms	5836 KB	Output is correct : V - N = 12
109	Correct	4 ms	5764 KB	Output is correct : V - N = 12
110	Correct	3 ms	5740 KB	Output is correct : V - N = 12
111	Correct	3 ms	5920 KB	Output is correct : V - N = 12
112	Correct	3 ms	5764 KB	Output is correct : V - N = 12
113	Correct	3 ms	5892 KB	Output is correct : V - N = 12
114	Correct	3 ms	5892 KB	Output is correct : V - N = 12
115	Correct	2 ms	5764 KB	Output is correct : V - N = 12
116	Correct	3 ms	5892 KB	Output is correct : V - N = 12
117	Correct	3 ms	5924 KB	Output is correct : V - N = 12
118	Correct	3 ms	5764 KB	Output is correct : V - N = 12
119	Correct	3 ms	5892 KB	Output is correct : V - N = 12
120	Correct	4 ms	5868 KB	Output is correct : V - N = 12
121	Correct	3 ms	5752 KB	Output is correct : V - N = 12
122	Correct	3 ms	5768 KB	Output is correct : V - N = 12
123	Correct	3 ms	5692 KB	Output is correct : V - N = 12
124	Correct	3 ms	5760 KB	Output is correct : V - N = 12
125	Correct	3 ms	5764 KB	Output is correct : V - N = 12
126	Correct	3 ms	5764 KB	Output is correct : V - N = 12
127	Correct	3 ms	5740 KB	Output is correct : V - N = 12
128	Correct	4 ms	5756 KB	Output is correct : V - N = 12
129	Correct	3 ms	5764 KB	Output is correct : V - N = 12
130	Correct	3 ms	5712 KB	Output is correct : V - N = 12
131	Correct	3 ms	5764 KB	Output is correct : V - N = 12
132	Correct	3 ms	5764 KB	Output is correct : V - N = 12
133	Correct	4 ms	5716 KB	Output is correct : V - N = 12
134	Correct	3 ms	5772 KB	Output is correct : V - N = 12
135	Correct	4 ms	5704 KB	Output is correct : V - N = 12
136	Correct	4 ms	5740 KB	Output is correct : V - N = 12
137	Correct	3 ms	5764 KB	Output is correct : V - N = 12
138	Correct	3 ms	5764 KB	Output is correct : V - N = 12
139	Correct	3 ms	5692 KB	Output is correct : V - N = 12
140	Correct	4 ms	5716 KB	Output is correct : V - N = 12
141	Correct	3 ms	5764 KB	Output is correct : V - N = 12
142	Correct	3 ms	5744 KB	Output is correct : V - N = 12
143	Correct	2 ms	5664 KB	Output is correct : V - N = 12
144	Correct	4 ms	5760 KB	Output is correct : V - N = 12
145	Correct	3 ms	5768 KB	Output is correct : V - N = 12
146	Correct	3 ms	5744 KB	Output is correct : V - N = 12
147	Correct	2 ms	5764 KB	Output is correct : V - N = 12
148	Correct	2 ms	5764 KB	Output is correct : V - N = 12
149	Correct	3 ms	5764 KB	Output is correct : V - N = 12
150	Correct	3 ms	5708 KB	Output is correct : V - N = 12
151	Correct	2 ms	5760 KB	Output is correct : V - N = 12
152	Correct	3 ms	5760 KB	Output is correct : V - N = 12
153	Correct	3 ms	5820 KB	Output is correct : V - N = 12
154	Correct	3 ms	5724 KB	Output is correct : V - N = 12
155	Correct	3 ms	5760 KB	Output is correct : V - N = 12
156	Correct	3 ms	5764 KB	Output is correct : V - N = 12
157	Correct	3 ms	5768 KB	Output is correct : V - N = 12
158	Correct	3 ms	5664 KB	Output is correct : V - N = 12
159	Correct	3 ms	5784 KB	Output is correct : V - N = 12
160	Correct	3 ms	5688 KB	Output is correct : V - N = 12
161	Correct	3 ms	5764 KB	Output is correct : V - N = 12
162	Correct	2 ms	5764 KB	Output is correct : V - N = 12
163	Correct	3 ms	5764 KB	Output is correct : V - N = 12
164	Correct	3 ms	5704 KB	Output is correct : V - N = 12
165	Correct	3 ms	5760 KB	Output is correct : V - N = 12
166	Correct	3 ms	5764 KB	Output is correct : V - N = 12
167	Correct	3 ms	5764 KB	Output is correct : V - N = 12
168	Correct	3 ms	5692 KB	Output is correct : V - N = 12
169	Correct	3 ms	5764 KB	Output is correct : V - N = 12
170	Correct	3 ms	5760 KB	Output is correct : V - N = 12
171	Correct	2 ms	5760 KB	Output is correct : V - N = 12
172	Correct	3 ms	5704 KB	Output is correct : V - N = 12
173	Correct	2 ms	5752 KB	Output is correct : V - N = 12
174	Correct	3 ms	5704 KB	Output is correct : V - N = 12
175	Correct	2 ms	5764 KB	Output is correct : V - N = 12
176	Correct	2 ms	5776 KB	Output is correct : V - N = 12
177	Correct	3 ms	5756 KB	Output is correct : V - N = 12
178	Correct	3 ms	5868 KB	Output is correct : V - N = 12