답안 #61008 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
61008	2018-07-25T05:58:54 Z	Benq	항공 노선도 (JOI18_airline)	C++11	100 / 100	788 ms	30840 KB

Alice
Bob

#include "Alicelib.h"

#include <cassert>
#include <cstdio>

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;


void Alice( int N, int M, int A[], int B[] ){
	vpi ed;
	F0R(i,M) ed.pb({A[i],B[i]});
	F0R(i,N+10) ed.pb({i,N+11});
	F0R(i,10) ed.pb({N+i,N+10});
	F0R(i,9) ed.pb({N+i,N+i+1});
	ed.pb({N+1,N+3}); 
	F0R(i,N) F0R(j,10) if (i&(1<<j)) ed.pb({i,N+j});

	InitG(N+12,sz(ed));
	F0R(i,sz(ed)) MakeG(i,ed[i].f,ed[i].s);
}

#include "Boblib.h"

#include <cassert>
#include <cstdio>

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;


int key[1024], pos[1024], ST = -1, st = -1;
int zero, bad[1024];
vi adj[1024], adj2[1024];
bool ADJ[1024][1024];

void dfs(int cur, int ind, int pre) {
	key[ind] = cur;
	for (int i: adj2[cur]) if (i != pre) dfs(i,ind+1,cur);
}

void Bob( int V, int U, int C[], int D[] ){
	F0R(i,U) {
		adj[C[i]].pb(D[i]);
		adj[D[i]].pb(C[i]);
		ADJ[C[i]][D[i]] = ADJ[D[i]][C[i]] = 1;
	}
	F0R(i,V) key[i] = -1;
	F0R(i,V) if (sz(adj[i]) == V-2) ST = i;
	F0R(i,V) if (i != ST && !ADJ[ST][i]) st = i;

	vi posi;
	F0R(i,V) if (ADJ[st][i]) posi.pb(i);
	for (int i: posi) for (int j: posi) if (ADJ[i][j]) adj2[i].pb(j);
	for (int i: posi) if (sz(adj2[i]) == 1 && sz(adj2[adj2[i][0]]) == 3) zero = i;
	for (int i: posi) if (sz(adj2[i]) == 3) {
		for (int j: adj2[i]) if (sz(adj2[j]) == 3) {
			adj2[i].erase(find(all(adj2[i]),j));
			adj2[j].erase(find(all(adj2[j]),i));
			break;
		}
	}
	dfs(zero,0,-1);
	bad[st] = bad[ST] = 1;
	for (int i: posi) bad[i] = 1;
	F0R(i,V) if (!bad[i]) {
		int p = 0;
		F0R(j,10) if (ADJ[i][key[j]]) p ^= 1<<j;
		pos[p] = i;
	}

    vpi ed;
	F0R(i,V-12) FOR(j,i+1,V-12) if (ADJ[pos[i]][pos[j]]) ed.pb({i,j});
	InitMap( V-12, sz(ed));
	for (auto a: ed) MakeMap(a.f,a.s);
}

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6640 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6728 KB	Output is correct
4	Correct	8 ms	6640 KB	Output is correct
5	Correct	8 ms	6896 KB	Output is correct
6	Correct	8 ms	6896 KB	Output is correct
7	Correct	8 ms	6640 KB	Output is correct
8	Correct	7 ms	6728 KB	Output is correct
9	Correct	8 ms	6792 KB	Output is correct
10	Correct	8 ms	6896 KB	Output is correct
11	Correct	8 ms	6648 KB	Output is correct
12	Correct	8 ms	6896 KB	Output is correct
13	Correct	8 ms	6896 KB	Output is correct
14	Correct	8 ms	6640 KB	Output is correct
15	Correct	8 ms	6728 KB	Output is correct
16	Correct	8 ms	6728 KB	Output is correct
17	Correct	8 ms	6640 KB	Output is correct
18	Correct	8 ms	6640 KB	Output is correct
19	Correct	8 ms	6896 KB	Output is correct
20	Correct	8 ms	6648 KB	Output is correct
21	Correct	8 ms	6640 KB	Output is correct
22	Correct	8 ms	6640 KB	Output is correct
23	Correct	8 ms	6736 KB	Output is correct
24	Correct	8 ms	6896 KB	Output is correct
25	Correct	8 ms	6640 KB	Output is correct
26	Correct	8 ms	6640 KB	Output is correct
27	Correct	8 ms	6648 KB	Output is correct
28	Correct	8 ms	6904 KB	Output is correct
29	Correct	8 ms	6896 KB	Output is correct
30	Correct	8 ms	6640 KB	Output is correct
31	Correct	8 ms	6640 KB	Output is correct
32	Correct	8 ms	6640 KB	Output is correct
33	Correct	8 ms	6736 KB	Output is correct
34	Correct	7 ms	6640 KB	Output is correct
35	Correct	8 ms	6896 KB	Output is correct
36	Correct	8 ms	6640 KB	Output is correct
37	Correct	8 ms	6640 KB	Output is correct
38	Correct	7 ms	6896 KB	Output is correct
39	Correct	8 ms	6896 KB	Output is correct
40	Correct	8 ms	6736 KB	Output is correct
41	Correct	8 ms	6640 KB	Output is correct
42	Correct	8 ms	6640 KB	Output is correct
43	Correct	8 ms	6640 KB	Output is correct
44	Correct	7 ms	6576 KB	Output is correct
45	Correct	6 ms	6648 KB	Output is correct
46	Correct	7 ms	6816 KB	Output is correct
47	Correct	19 ms	6896 KB	Output is correct
48	Correct	7 ms	6896 KB	Output is correct
49	Correct	7 ms	6640 KB	Output is correct
50	Correct	6 ms	6640 KB	Output is correct
51	Correct	6 ms	6640 KB	Output is correct
52	Correct	7 ms	6896 KB	Output is correct
53	Correct	7 ms	6896 KB	Output is correct
54	Correct	7 ms	6896 KB	Output is correct
55	Correct	8 ms	6640 KB	Output is correct
56	Correct	8 ms	6904 KB	Output is correct
57	Correct	8 ms	6896 KB	Output is correct
58	Correct	8 ms	6896 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6640 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6728 KB	Output is correct
4	Correct	8 ms	6640 KB	Output is correct
5	Correct	8 ms	6896 KB	Output is correct
6	Correct	8 ms	6896 KB	Output is correct
7	Correct	8 ms	6640 KB	Output is correct
8	Correct	7 ms	6728 KB	Output is correct
9	Correct	8 ms	6792 KB	Output is correct
10	Correct	8 ms	6896 KB	Output is correct
11	Correct	8 ms	6648 KB	Output is correct
12	Correct	8 ms	6896 KB	Output is correct
13	Correct	8 ms	6896 KB	Output is correct
14	Correct	8 ms	6640 KB	Output is correct
15	Correct	8 ms	6728 KB	Output is correct
16	Correct	8 ms	6728 KB	Output is correct
17	Correct	8 ms	6640 KB	Output is correct
18	Correct	8 ms	6640 KB	Output is correct
19	Correct	8 ms	6896 KB	Output is correct
20	Correct	8 ms	6648 KB	Output is correct
21	Correct	8 ms	6640 KB	Output is correct
22	Correct	8 ms	6640 KB	Output is correct
23	Correct	8 ms	6736 KB	Output is correct
24	Correct	8 ms	6896 KB	Output is correct
25	Correct	8 ms	6640 KB	Output is correct
26	Correct	8 ms	6640 KB	Output is correct
27	Correct	8 ms	6648 KB	Output is correct
28	Correct	8 ms	6904 KB	Output is correct
29	Correct	8 ms	6896 KB	Output is correct
30	Correct	8 ms	6640 KB	Output is correct
31	Correct	8 ms	6640 KB	Output is correct
32	Correct	8 ms	6640 KB	Output is correct
33	Correct	8 ms	6736 KB	Output is correct
34	Correct	7 ms	6640 KB	Output is correct
35	Correct	8 ms	6896 KB	Output is correct
36	Correct	8 ms	6640 KB	Output is correct
37	Correct	8 ms	6640 KB	Output is correct
38	Correct	7 ms	6896 KB	Output is correct
39	Correct	8 ms	6896 KB	Output is correct
40	Correct	8 ms	6736 KB	Output is correct
41	Correct	8 ms	6640 KB	Output is correct
42	Correct	8 ms	6640 KB	Output is correct
43	Correct	8 ms	6640 KB	Output is correct
44	Correct	7 ms	6576 KB	Output is correct
45	Correct	6 ms	6648 KB	Output is correct
46	Correct	7 ms	6816 KB	Output is correct
47	Correct	19 ms	6896 KB	Output is correct
48	Correct	7 ms	6896 KB	Output is correct
49	Correct	7 ms	6640 KB	Output is correct
50	Correct	6 ms	6640 KB	Output is correct
51	Correct	6 ms	6640 KB	Output is correct
52	Correct	7 ms	6896 KB	Output is correct
53	Correct	7 ms	6896 KB	Output is correct
54	Correct	7 ms	6896 KB	Output is correct
55	Correct	8 ms	6640 KB	Output is correct
56	Correct	8 ms	6904 KB	Output is correct
57	Correct	8 ms	6896 KB	Output is correct
58	Correct	8 ms	6896 KB	Output is correct
59	Correct	8 ms	6640 KB	Output is correct
60	Correct	8 ms	6896 KB	Output is correct
61	Correct	8 ms	6640 KB	Output is correct
62	Correct	7 ms	6896 KB	Output is correct
63	Correct	8 ms	6640 KB	Output is correct
64	Correct	7 ms	6896 KB	Output is correct
65	Correct	8 ms	6640 KB	Output is correct
66	Correct	8 ms	6640 KB	Output is correct
67	Correct	8 ms	6640 KB	Output is correct
68	Correct	8 ms	6736 KB	Output is correct
69	Correct	8 ms	6760 KB	Output is correct
70	Correct	8 ms	6896 KB	Output is correct
71	Correct	8 ms	6904 KB	Output is correct
72	Correct	9 ms	7152 KB	Output is correct
73	Correct	8 ms	6640 KB	Output is correct
74	Correct	8 ms	6640 KB	Output is correct
75	Correct	8 ms	6648 KB	Output is correct
76	Correct	8 ms	6640 KB	Output is correct
77	Correct	8 ms	6640 KB	Output is correct
78	Correct	8 ms	6640 KB	Output is correct
79	Correct	10 ms	6640 KB	Output is correct
80	Correct	8 ms	6640 KB	Output is correct
81	Correct	8 ms	6640 KB	Output is correct
82	Correct	8 ms	6904 KB	Output is correct
83	Correct	8 ms	6752 KB	Output is correct
84	Correct	8 ms	6640 KB	Output is correct
85	Correct	8 ms	6640 KB	Output is correct
86	Correct	7 ms	6896 KB	Output is correct
87	Correct	8 ms	6736 KB	Output is correct
88	Correct	8 ms	6736 KB	Output is correct
89	Correct	8 ms	6736 KB	Output is correct
90	Correct	8 ms	6640 KB	Output is correct
91	Correct	8 ms	6656 KB	Output is correct
92	Correct	8 ms	6640 KB	Output is correct
93	Correct	8 ms	6640 KB	Output is correct
94	Correct	8 ms	6640 KB	Output is correct
95	Correct	8 ms	6640 KB	Output is correct
96	Correct	8 ms	6896 KB	Output is correct
97	Correct	8 ms	6896 KB	Output is correct
98	Correct	8 ms	6640 KB	Output is correct
99	Correct	8 ms	6640 KB	Output is correct
100	Correct	8 ms	6640 KB	Output is correct
101	Correct	8 ms	6640 KB	Output is correct
102	Correct	8 ms	6640 KB	Output is correct
103	Correct	8 ms	6896 KB	Output is correct
104	Correct	8 ms	6896 KB	Output is correct
105	Correct	8 ms	6696 KB	Output is correct
106	Correct	8 ms	6640 KB	Output is correct
107	Correct	7 ms	6736 KB	Output is correct
108	Correct	8 ms	6640 KB	Output is correct
109	Correct	8 ms	6640 KB	Output is correct
110	Correct	8 ms	6768 KB	Output is correct
111	Correct	8 ms	6896 KB	Output is correct
112	Correct	8 ms	6896 KB	Output is correct
113	Correct	8 ms	6896 KB	Output is correct
114	Correct	8 ms	6640 KB	Output is correct
115	Correct	8 ms	6640 KB	Output is correct
116	Correct	8 ms	6632 KB	Output is correct
117	Correct	8 ms	6640 KB	Output is correct
118	Correct	8 ms	6640 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	666 ms	30504 KB	Output is correct : V - N = 12
2	Correct	487 ms	26724 KB	Output is correct : V - N = 12
3	Correct	197 ms	14964 KB	Output is correct : V - N = 12
4	Correct	15 ms	7304 KB	Output is correct : V - N = 12
5	Correct	133 ms	11240 KB	Output is correct : V - N = 12
6	Correct	460 ms	24704 KB	Output is correct : V - N = 12
7	Correct	788 ms	30136 KB	Output is correct : V - N = 12
8	Correct	628 ms	28424 KB	Output is correct : V - N = 12
9	Correct	325 ms	17320 KB	Output is correct : V - N = 12
10	Correct	44 ms	8168 KB	Output is correct : V - N = 12
11	Correct	88 ms	9312 KB	Output is correct : V - N = 12
12	Correct	391 ms	19256 KB	Output is correct : V - N = 12
13	Correct	640 ms	29076 KB	Output is correct : V - N = 12
14	Correct	710 ms	29708 KB	Output is correct : V - N = 12
15	Correct	490 ms	23372 KB	Output is correct : V - N = 12
16	Correct	96 ms	9864 KB	Output is correct : V - N = 12
17	Correct	28 ms	7664 KB	Output is correct : V - N = 12
18	Correct	280 ms	16144 KB	Output is correct : V - N = 12
19	Correct	596 ms	27776 KB	Output is correct : V - N = 12
20	Correct	725 ms	30464 KB	Output is correct : V - N = 12
21	Correct	177 ms	13048 KB	Output is correct : V - N = 12
22	Correct	134 ms	11632 KB	Output is correct : V - N = 12
23	Correct	61 ms	8928 KB	Output is correct : V - N = 12
24	Correct	10 ms	6896 KB	Output is correct : V - N = 12
25	Correct	35 ms	8080 KB	Output is correct : V - N = 12
26	Correct	127 ms	11056 KB	Output is correct : V - N = 12
27	Correct	155 ms	13064 KB	Output is correct : V - N = 12
28	Correct	183 ms	12328 KB	Output is correct : V - N = 12
29	Correct	74 ms	9720 KB	Output is correct : V - N = 12
30	Correct	13 ms	7504 KB	Output is correct : V - N = 12
31	Correct	13 ms	7152 KB	Output is correct : V - N = 12
32	Correct	13 ms	7152 KB	Output is correct : V - N = 12
33	Correct	13 ms	7192 KB	Output is correct : V - N = 12
34	Correct	13 ms	7152 KB	Output is correct : V - N = 12
35	Correct	13 ms	6992 KB	Output is correct : V - N = 12
36	Correct	706 ms	30704 KB	Output is correct : V - N = 12
37	Correct	712 ms	30568 KB	Output is correct : V - N = 12
38	Correct	739 ms	30608 KB	Output is correct : V - N = 12
39	Correct	710 ms	30840 KB	Output is correct : V - N = 12
40	Correct	649 ms	30544 KB	Output is correct : V - N = 12
41	Correct	148 ms	11032 KB	Output is correct : V - N = 12
42	Correct	104 ms	10048 KB	Output is correct : V - N = 12
43	Correct	131 ms	10616 KB	Output is correct : V - N = 12
44	Correct	13 ms	7152 KB	Output is correct : V - N = 12
45	Correct	72 ms	9184 KB	Output is correct : V - N = 12
46	Correct	228 ms	15488 KB	Output is correct : V - N = 12
47	Correct	129 ms	10968 KB	Output is correct : V - N = 12
48	Correct	314 ms	17344 KB	Output is correct : V - N = 12
49	Correct	65 ms	8896 KB	Output is correct : V - N = 12
50	Correct	23 ms	7920 KB	Output is correct : V - N = 12
51	Correct	521 ms	26720 KB	Output is correct : V - N = 12
52	Correct	15 ms	7408 KB	Output is correct : V - N = 12
53	Correct	439 ms	24552 KB	Output is correct : V - N = 12
54	Correct	587 ms	28056 KB	Output is correct : V - N = 12
55	Correct	41 ms	8176 KB	Output is correct : V - N = 12
56	Correct	332 ms	18960 KB	Output is correct : V - N = 12
57	Correct	659 ms	29264 KB	Output is correct : V - N = 12
58	Correct	101 ms	10048 KB	Output is correct : V - N = 12
59	Correct	268 ms	15968 KB	Output is correct : V - N = 12
60	Correct	681 ms	29880 KB	Output is correct : V - N = 12
61	Correct	8 ms	6720 KB	Output is correct : V - N = 12
62	Correct	8 ms	6896 KB	Output is correct : V - N = 12
63	Correct	8 ms	6640 KB	Output is correct : V - N = 12
64	Correct	8 ms	6640 KB	Output is correct : V - N = 12
65	Correct	8 ms	6896 KB	Output is correct : V - N = 12
66	Correct	8 ms	6640 KB	Output is correct : V - N = 12
67	Correct	8 ms	6640 KB	Output is correct : V - N = 12
68	Correct	8 ms	6640 KB	Output is correct : V - N = 12
69	Correct	8 ms	6896 KB	Output is correct : V - N = 12
70	Correct	7 ms	6896 KB	Output is correct : V - N = 12
71	Correct	8 ms	6688 KB	Output is correct : V - N = 12
72	Correct	8 ms	6896 KB	Output is correct : V - N = 12
73	Correct	8 ms	6640 KB	Output is correct : V - N = 12
74	Correct	7 ms	6648 KB	Output is correct : V - N = 12
75	Correct	8 ms	6640 KB	Output is correct : V - N = 12
76	Correct	7 ms	6640 KB	Output is correct : V - N = 12
77	Correct	6 ms	6640 KB	Output is correct : V - N = 12
78	Correct	7 ms	6640 KB	Output is correct : V - N = 12
79	Correct	9 ms	6768 KB	Output is correct : V - N = 12
80	Correct	8 ms	6896 KB	Output is correct : V - N = 12
81	Correct	8 ms	6640 KB	Output is correct : V - N = 12
82	Correct	8 ms	6640 KB	Output is correct : V - N = 12
83	Correct	6 ms	6640 KB	Output is correct : V - N = 12
84	Correct	7 ms	6896 KB	Output is correct : V - N = 12
85	Correct	7 ms	6640 KB	Output is correct : V - N = 12
86	Correct	7 ms	6896 KB	Output is correct : V - N = 12
87	Correct	8 ms	6672 KB	Output is correct : V - N = 12
88	Correct	8 ms	6640 KB	Output is correct : V - N = 12
89	Correct	8 ms	6640 KB	Output is correct : V - N = 12
90	Correct	8 ms	6640 KB	Output is correct : V - N = 12
91	Correct	8 ms	6736 KB	Output is correct : V - N = 12
92	Correct	8 ms	6904 KB	Output is correct : V - N = 12
93	Correct	8 ms	6640 KB	Output is correct : V - N = 12
94	Correct	8 ms	6640 KB	Output is correct : V - N = 12
95	Correct	8 ms	6896 KB	Output is correct : V - N = 12
96	Correct	8 ms	6736 KB	Output is correct : V - N = 12
97	Correct	8 ms	6784 KB	Output is correct : V - N = 12
98	Correct	8 ms	6640 KB	Output is correct : V - N = 12
99	Correct	8 ms	6896 KB	Output is correct : V - N = 12
100	Correct	8 ms	6744 KB	Output is correct : V - N = 12
101	Correct	8 ms	6736 KB	Output is correct : V - N = 12
102	Correct	8 ms	6896 KB	Output is correct : V - N = 12
103	Correct	8 ms	6784 KB	Output is correct : V - N = 12
104	Correct	8 ms	6640 KB	Output is correct : V - N = 12
105	Correct	8 ms	6640 KB	Output is correct : V - N = 12
106	Correct	8 ms	6640 KB	Output is correct : V - N = 12
107	Correct	8 ms	6904 KB	Output is correct : V - N = 12
108	Correct	8 ms	6896 KB	Output is correct : V - N = 12
109	Correct	8 ms	6648 KB	Output is correct : V - N = 12
110	Correct	8 ms	6736 KB	Output is correct : V - N = 12
111	Correct	8 ms	6904 KB	Output is correct : V - N = 12
112	Correct	7 ms	6640 KB	Output is correct : V - N = 12
113	Correct	8 ms	6736 KB	Output is correct : V - N = 12
114	Correct	8 ms	6592 KB	Output is correct : V - N = 12
115	Correct	8 ms	6640 KB	Output is correct : V - N = 12
116	Correct	8 ms	6736 KB	Output is correct : V - N = 12
117	Correct	8 ms	6736 KB	Output is correct : V - N = 12
118	Correct	8 ms	6720 KB	Output is correct : V - N = 12
119	Correct	8 ms	6736 KB	Output is correct : V - N = 12
120	Correct	8 ms	6640 KB	Output is correct : V - N = 12
121	Correct	8 ms	6640 KB	Output is correct : V - N = 12
122	Correct	8 ms	6896 KB	Output is correct : V - N = 12
123	Correct	8 ms	6736 KB	Output is correct : V - N = 12
124	Correct	8 ms	6736 KB	Output is correct : V - N = 12
125	Correct	8 ms	6896 KB	Output is correct : V - N = 12
126	Correct	8 ms	6640 KB	Output is correct : V - N = 12
127	Correct	6 ms	6640 KB	Output is correct : V - N = 12
128	Correct	6 ms	6896 KB	Output is correct : V - N = 12
129	Correct	6 ms	6640 KB	Output is correct : V - N = 12
130	Correct	7 ms	6640 KB	Output is correct : V - N = 12
131	Correct	7 ms	6640 KB	Output is correct : V - N = 12
132	Correct	7 ms	6896 KB	Output is correct : V - N = 12
133	Correct	8 ms	6768 KB	Output is correct : V - N = 12
134	Correct	9 ms	6640 KB	Output is correct : V - N = 12
135	Correct	6 ms	6736 KB	Output is correct : V - N = 12
136	Correct	7 ms	6608 KB	Output is correct : V - N = 12
137	Correct	7 ms	6640 KB	Output is correct : V - N = 12
138	Correct	7 ms	6896 KB	Output is correct : V - N = 12
139	Correct	6 ms	6896 KB	Output is correct : V - N = 12
140	Correct	6 ms	6640 KB	Output is correct : V - N = 12
141	Correct	6 ms	6640 KB	Output is correct : V - N = 12
142	Correct	8 ms	6736 KB	Output is correct : V - N = 12
143	Correct	8 ms	6640 KB	Output is correct : V - N = 12
144	Correct	7 ms	6896 KB	Output is correct : V - N = 12
145	Correct	8 ms	6640 KB	Output is correct : V - N = 12
146	Correct	8 ms	6640 KB	Output is correct : V - N = 12
147	Correct	8 ms	6896 KB	Output is correct : V - N = 12
148	Correct	8 ms	6896 KB	Output is correct : V - N = 12
149	Correct	8 ms	6640 KB	Output is correct : V - N = 12
150	Correct	8 ms	6640 KB	Output is correct : V - N = 12
151	Correct	8 ms	6640 KB	Output is correct : V - N = 12
152	Correct	8 ms	6640 KB	Output is correct : V - N = 12
153	Correct	8 ms	6640 KB	Output is correct : V - N = 12
154	Correct	8 ms	6896 KB	Output is correct : V - N = 12
155	Correct	8 ms	6736 KB	Output is correct : V - N = 12
156	Correct	8 ms	6640 KB	Output is correct : V - N = 12
157	Correct	7 ms	6896 KB	Output is correct : V - N = 12
158	Correct	8 ms	6640 KB	Output is correct : V - N = 12
159	Correct	8 ms	6640 KB	Output is correct : V - N = 12
160	Correct	8 ms	6896 KB	Output is correct : V - N = 12
161	Correct	8 ms	6896 KB	Output is correct : V - N = 12
162	Correct	8 ms	6640 KB	Output is correct : V - N = 12
163	Correct	8 ms	6640 KB	Output is correct : V - N = 12
164	Correct	8 ms	6640 KB	Output is correct : V - N = 12
165	Correct	8 ms	6640 KB	Output is correct : V - N = 12
166	Correct	8 ms	6896 KB	Output is correct : V - N = 12
167	Correct	8 ms	6896 KB	Output is correct : V - N = 12
168	Correct	8 ms	6896 KB	Output is correct : V - N = 12
169	Correct	7 ms	6904 KB	Output is correct : V - N = 12
170	Correct	8 ms	6896 KB	Output is correct : V - N = 12
171	Correct	9 ms	6576 KB	Output is correct : V - N = 12
172	Correct	8 ms	6640 KB	Output is correct : V - N = 12
173	Correct	8 ms	6640 KB	Output is correct : V - N = 12
174	Correct	7 ms	6712 KB	Output is correct : V - N = 12
175	Correct	8 ms	6640 KB	Output is correct : V - N = 12
176	Correct	8 ms	6896 KB	Output is correct : V - N = 12
177	Correct	8 ms	6896 KB	Output is correct : V - N = 12
178	Correct	8 ms	6904 KB	Output is correct : V - N = 12

답안 #61008

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