답안 #995023

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995023	2024-06-08T10:46:12 Z	maomao90	항공 노선도 (JOI18_airline)	C++17	54 / 100	479 ms	40796 KB

Alice

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Alicelib.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1100;

namespace {
    int n, m;
    bool g[MAXN][MAXN], h[MAXN][MAXN];

    inline void add(int u, int v) {
        h[u][v] = h[v][u] = 1;
    }
    inline void answer() {
        vii eg;
        REP (i, 0, m) {
            REP (j, i + 1, m) {
                if (h[i][j]) {
                    eg.pb({i, j});
                }
            }
        }
        InitG(m, SZ(eg));
        REP (i, 0, SZ(eg)) {
            MakeG(i, eg[i].FI, eg[i].SE);
        }
    }
}

void Alice(int N, int E, int A[], int B[]) {
    n = N;
    if (n == 1) {
        InitG(1, 0);
        return;
    }
    int lg = 32 - __builtin_clz(n - 1);
    m = n + lg + 3;
    REP (i, 0, E) {
        g[A[i]][B[i]] = g[B[i]][A[i]] = 1;
    }
    REP (i, 0, n) {
        REP (j, 0, n) {
            h[i][j] = g[i][j];
        }
    }
    REP (l, 0, lg) {
        REP (i, 0, n) {
            if (i >> l & 1) {
                add(n + l, i);
            }
        }
        if (l) {
            add(n + l, n + l - 1);
        }
    }
    add(n + lg, n + lg - 1);
    REP (i, n, n + lg + 1) {
        add(n + lg + 1, i);
    }
    REP (i, 0, n + lg + 1) {
        add(n + lg + 2, i);
    }
    answer();
}

Bob

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Boblib.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1100;

namespace {
    int n, m;
    bool g[MAXN][MAXN], h[MAXN][MAXN];

    inline void add(int u, int v) {
        h[u][v] = h[v][u] = 1;
    }

    int deg[MAXN];
    bool isb[MAXN], vis[MAXN];
    int id[MAXN];
    inline bool rmv(int u, int v) {
        if (!g[u][v]) {
            return 0;
        }
        g[u][v] = g[v][u] = 0;
        deg[u]--; deg[v]--;
        return 1;
    }
    inline void answer() {
        vii eg;
        REP (i, 0, m) {
            REP (j, i + 1, m) {
                if (h[i][j]) {
                    eg.pb({i, j});
                }
            }
        }
        InitMap(m, SZ(eg));
        REP (i, 0, SZ(eg)) {
            MakeMap(eg[i].FI, eg[i].SE);
        }
    }
}

void Bob(int V, int U, int C[], int D[]) {
    n = V;
    if (n == 1) {
        InitMap(1, 0);
        return;
    }
    REP (x, 1, MAXN) {
        int lg = 32 - __builtin_clz(x - 1);
        if (x + lg + 3 == n) {
            m = x;
            break;
        }
    }
    assert(m);
    int lg = abs(n - m) - 3;
    REP (i, 0, U) {
        g[C[i]][D[i]] = g[D[i]][C[i]] = 1;
    }
    ii mx = {0, 0};
    REP (i, 0, n) {
        REP (j, 0, n) {
            deg[i] += g[i][j];
        }
        mxto(mx, {deg[i], i});
    }
    assert(mx.FI == n - 2);
    int r = -1;
    REP (i, 0, n) {
        if (i == mx.SE) {
            continue;
        }
        if (!rmv(mx.SE, i)) {
            assert(r == -1);
            r = i;
        }
    }
    assert(deg[r] == lg + 1);
    REP (i, 0, n) {
        isb[i] = rmv(r, i);
    }
    int e = -1;
    REP (i, 0, n) {
        if (isb[i] && deg[i] == 1) {
            REP (j, 0, n) {
                if (isb[j] && g[i][j]) {
                    e = i;
                    break;
                }
            }
            if (e != -1) {
                break;
            }
        }
    }
    assert(e != -1);
    assert(deg[e] == 1);
    vi bits;
    REP (i, 0, n) {
        if (rmv(e, i)) {
            bits.pb(i);
            vis[i] = 1;
        }
    }
    while (SZ(bits) < lg) {
        REP (i, 0, n) {
            if (vis[i] || !isb[i]) {
                continue;
            }
            if (rmv(bits.back(), i)) {
                vis[i] = 1;
                bits.pb(i);
                break;
            }
        }
    }
    reverse(ALL(bits));
    REP (l, 0, lg) {
        REP (i, 0, n) {
            id[i] |= rmv(bits[l], i) << l;
        }
    }
    REP (i, 0, n) {
        REP (j, 0, n) {
            if (g[i][j]) {
                assert(id[i] < m && id[j] < m);
                add(id[i], id[j]);
            }
        }
    }
    answer();
}

Subtask #1

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	19712 KB	Output is correct
2	Correct	2 ms	19716 KB	Output is correct
3	Correct	3 ms	19716 KB	Output is correct
4	Correct	2 ms	17680 KB	Output is correct
5	Correct	2 ms	19712 KB	Output is correct
6	Correct	3 ms	19712 KB	Output is correct
7	Correct	2 ms	19712 KB	Output is correct
8	Correct	3 ms	19712 KB	Output is correct
9	Correct	2 ms	19716 KB	Output is correct
10	Correct	2 ms	17668 KB	Output is correct
11	Correct	2 ms	19720 KB	Output is correct
12	Correct	4 ms	19712 KB	Output is correct
13	Correct	2 ms	19716 KB	Output is correct
14	Correct	3 ms	19724 KB	Output is correct
15	Correct	2 ms	19712 KB	Output is correct
16	Correct	2 ms	19720 KB	Output is correct
17	Correct	3 ms	19712 KB	Output is correct
18	Correct	3 ms	19712 KB	Output is correct
19	Correct	3 ms	19716 KB	Output is correct
20	Correct	2 ms	19716 KB	Output is correct
21	Correct	3 ms	19708 KB	Output is correct
22	Correct	3 ms	19712 KB	Output is correct
23	Correct	3 ms	19716 KB	Output is correct
24	Correct	2 ms	17668 KB	Output is correct
25	Correct	2 ms	19716 KB	Output is correct
26	Correct	3 ms	19712 KB	Output is correct
27	Correct	3 ms	19720 KB	Output is correct
28	Correct	3 ms	19716 KB	Output is correct
29	Correct	2 ms	19716 KB	Output is correct
30	Correct	2 ms	17676 KB	Output is correct
31	Correct	2 ms	17668 KB	Output is correct
32	Correct	2 ms	17668 KB	Output is correct
33	Correct	2 ms	17660 KB	Output is correct
34	Correct	2 ms	17664 KB	Output is correct
35	Correct	3 ms	17668 KB	Output is correct
36	Correct	2 ms	19720 KB	Output is correct
37	Correct	3 ms	19712 KB	Output is correct
38	Correct	3 ms	19724 KB	Output is correct
39	Correct	3 ms	19724 KB	Output is correct
40	Correct	3 ms	19716 KB	Output is correct
41	Correct	2 ms	19712 KB	Output is correct
42	Correct	3 ms	19716 KB	Output is correct
43	Correct	3 ms	19716 KB	Output is correct
44	Correct	2 ms	17932 KB	Output is correct
45	Correct	2 ms	17668 KB	Output is correct
46	Correct	2 ms	19768 KB	Output is correct
47	Correct	3 ms	19716 KB	Output is correct
48	Correct	3 ms	19712 KB	Output is correct
49	Correct	2 ms	19712 KB	Output is correct
50	Correct	2 ms	17668 KB	Output is correct
51	Correct	2 ms	13572 KB	Output is correct
52	Correct	2 ms	19716 KB	Output is correct
53	Runtime error	6 ms	24324 KB	Execution killed with signal 6
54	Halted	0 ms	0 KB	-

Subtask #2

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	19712 KB	Output is correct
2	Correct	2 ms	19716 KB	Output is correct
3	Correct	3 ms	19716 KB	Output is correct
4	Correct	2 ms	17680 KB	Output is correct
5	Correct	2 ms	19712 KB	Output is correct
6	Correct	3 ms	19712 KB	Output is correct
7	Correct	2 ms	19712 KB	Output is correct
8	Correct	3 ms	19712 KB	Output is correct
9	Correct	2 ms	19716 KB	Output is correct
10	Correct	2 ms	17668 KB	Output is correct
11	Correct	2 ms	19720 KB	Output is correct
12	Correct	4 ms	19712 KB	Output is correct
13	Correct	2 ms	19716 KB	Output is correct
14	Correct	3 ms	19724 KB	Output is correct
15	Correct	2 ms	19712 KB	Output is correct
16	Correct	2 ms	19720 KB	Output is correct
17	Correct	3 ms	19712 KB	Output is correct
18	Correct	3 ms	19712 KB	Output is correct
19	Correct	3 ms	19716 KB	Output is correct
20	Correct	2 ms	19716 KB	Output is correct
21	Correct	3 ms	19708 KB	Output is correct
22	Correct	3 ms	19712 KB	Output is correct
23	Correct	3 ms	19716 KB	Output is correct
24	Correct	2 ms	17668 KB	Output is correct
25	Correct	2 ms	19716 KB	Output is correct
26	Correct	3 ms	19712 KB	Output is correct
27	Correct	3 ms	19720 KB	Output is correct
28	Correct	3 ms	19716 KB	Output is correct
29	Correct	2 ms	19716 KB	Output is correct
30	Correct	2 ms	17676 KB	Output is correct
31	Correct	2 ms	17668 KB	Output is correct
32	Correct	2 ms	17668 KB	Output is correct
33	Correct	2 ms	17660 KB	Output is correct
34	Correct	2 ms	17664 KB	Output is correct
35	Correct	3 ms	17668 KB	Output is correct
36	Correct	2 ms	19720 KB	Output is correct
37	Correct	3 ms	19712 KB	Output is correct
38	Correct	3 ms	19724 KB	Output is correct
39	Correct	3 ms	19724 KB	Output is correct
40	Correct	3 ms	19716 KB	Output is correct
41	Correct	2 ms	19712 KB	Output is correct
42	Correct	3 ms	19716 KB	Output is correct
43	Correct	3 ms	19716 KB	Output is correct
44	Correct	2 ms	17932 KB	Output is correct
45	Correct	2 ms	17668 KB	Output is correct
46	Correct	2 ms	19768 KB	Output is correct
47	Correct	3 ms	19716 KB	Output is correct
48	Correct	3 ms	19712 KB	Output is correct
49	Correct	2 ms	19712 KB	Output is correct
50	Correct	2 ms	17668 KB	Output is correct
51	Correct	2 ms	13572 KB	Output is correct
52	Correct	2 ms	19716 KB	Output is correct
53	Runtime error	6 ms	24324 KB	Execution killed with signal 6
54	Halted	0 ms	0 KB	-

Subtask #3

54.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	352 ms	39560 KB	Output is partially correct : V - N = 13
2	Partially correct	284 ms	39560 KB	Output is partially correct : V - N = 13
3	Partially correct	108 ms	25988 KB	Output is partially correct : V - N = 13
4	Partially correct	10 ms	22872 KB	Output is partially correct : V - N = 13
5	Partially correct	65 ms	24476 KB	Output is partially correct : V - N = 13
6	Partially correct	238 ms	37512 KB	Output is partially correct : V - N = 13
7	Partially correct	355 ms	39832 KB	Output is partially correct : V - N = 13
8	Partially correct	287 ms	40072 KB	Output is partially correct : V - N = 13
9	Partially correct	215 ms	26400 KB	Output is partially correct : V - N = 13
10	Partially correct	20 ms	23160 KB	Output is partially correct : V - N = 13
11	Partially correct	34 ms	23560 KB	Output is partially correct : V - N = 13
12	Partially correct	241 ms	30868 KB	Output is partially correct : V - N = 13
13	Partially correct	327 ms	38788 KB	Output is partially correct : V - N = 13
14	Partially correct	460 ms	40316 KB	Output is partially correct : V - N = 13
15	Partially correct	223 ms	34196 KB	Output is partially correct : V - N = 13
16	Partially correct	48 ms	23968 KB	Output is partially correct : V - N = 13
17	Partially correct	15 ms	22916 KB	Output is partially correct : V - N = 13
18	Partially correct	163 ms	26256 KB	Output is partially correct : V - N = 13
19	Partially correct	343 ms	40308 KB	Output is partially correct : V - N = 13
20	Partially correct	385 ms	40592 KB	Output is partially correct : V - N = 13
21	Correct	112 ms	22948 KB	Output is correct : V - N = 12
22	Correct	78 ms	22704 KB	Output is correct : V - N = 12
23	Correct	27 ms	21664 KB	Output is correct : V - N = 12
24	Partially correct	5 ms	20736 KB	Output is partially correct : V - N = 13
25	Partially correct	20 ms	21412 KB	Output is partially correct : V - N = 13
26	Correct	51 ms	22420 KB	Output is correct : V - N = 12
27	Correct	107 ms	23204 KB	Output is correct : V - N = 12
28	Partially correct	93 ms	22684 KB	Output is partially correct : V - N = 13
29	Partially correct	42 ms	21924 KB	Output is partially correct : V - N = 13
30	Correct	9 ms	21012 KB	Output is correct : V - N = 12
31	Partially correct	8 ms	19048 KB	Output is partially correct : V - N = 13
32	Partially correct	8 ms	18948 KB	Output is partially correct : V - N = 13
33	Partially correct	9 ms	18948 KB	Output is partially correct : V - N = 13
34	Partially correct	9 ms	19032 KB	Output is partially correct : V - N = 13
35	Partially correct	10 ms	18948 KB	Output is partially correct : V - N = 13
36	Partially correct	479 ms	40584 KB	Output is partially correct : V - N = 13
37	Partially correct	369 ms	40796 KB	Output is partially correct : V - N = 13
38	Partially correct	351 ms	39308 KB	Output is partially correct : V - N = 13
39	Partially correct	358 ms	40328 KB	Output is partially correct : V - N = 13
40	Partially correct	367 ms	39768 KB	Output is partially correct : V - N = 13
41	Partially correct	65 ms	24468 KB	Output is partially correct : V - N = 13
42	Partially correct	53 ms	24108 KB	Output is partially correct : V - N = 13
43	Partially correct	80 ms	24464 KB	Output is partially correct : V - N = 13
44	Partially correct	8 ms	22788 KB	Output is partially correct : V - N = 13
45	Partially correct	37 ms	23712 KB	Output is partially correct : V - N = 13
46	Partially correct	119 ms	25984 KB	Output is partially correct : V - N = 13
47	Partially correct	64 ms	24464 KB	Output is partially correct : V - N = 13
48	Partially correct	153 ms	26528 KB	Output is partially correct : V - N = 13
49	Partially correct	31 ms	23460 KB	Output is partially correct : V - N = 13
50	Partially correct	13 ms	22948 KB	Output is partially correct : V - N = 13
51	Partially correct	287 ms	38220 KB	Output is partially correct : V - N = 13
52	Partially correct	11 ms	22768 KB	Output is partially correct : V - N = 13
53	Partially correct	214 ms	38632 KB	Output is partially correct : V - N = 13
54	Partially correct	339 ms	40224 KB	Output is partially correct : V - N = 13
55	Partially correct	25 ms	23128 KB	Output is partially correct : V - N = 13
56	Partially correct	208 ms	30608 KB	Output is partially correct : V - N = 13
57	Partially correct	332 ms	40324 KB	Output is partially correct : V - N = 13
58	Partially correct	48 ms	23716 KB	Output is partially correct : V - N = 13
59	Partially correct	160 ms	25996 KB	Output is partially correct : V - N = 13
60	Partially correct	371 ms	38956 KB	Output is partially correct : V - N = 13
61	Correct	3 ms	19712 KB	Output is correct : V - N = 9
62	Correct	3 ms	19712 KB	Output is correct : V - N = 9
63	Correct	3 ms	19712 KB	Output is correct : V - N = 9
64	Correct	3 ms	19560 KB	Output is correct : V - N = 9
65	Correct	3 ms	19708 KB	Output is correct : V - N = 9
66	Correct	3 ms	19724 KB	Output is correct : V - N = 9
67	Correct	3 ms	19724 KB	Output is correct : V - N = 9
68	Correct	3 ms	19716 KB	Output is correct : V - N = 9
69	Correct	3 ms	19716 KB	Output is correct : V - N = 9
70	Correct	3 ms	19716 KB	Output is correct : V - N = 9
71	Correct	3 ms	19712 KB	Output is correct : V - N = 9
72	Correct	3 ms	19712 KB	Output is correct : V - N = 9
73	Correct	3 ms	19716 KB	Output is correct : V - N = 9
74	Correct	3 ms	19728 KB	Output is correct : V - N = 9
75	Correct	3 ms	19712 KB	Output is correct : V - N = 9
76	Correct	2 ms	19716 KB	Output is correct : V - N = 9
77	Correct	2 ms	19716 KB	Output is correct : V - N = 9
78	Correct	3 ms	19724 KB	Output is correct : V - N = 9
79	Correct	3 ms	19716 KB	Output is correct : V - N = 9
80	Correct	3 ms	19716 KB	Output is correct : V - N = 9
81	Correct	3 ms	19724 KB	Output is correct : V - N = 8
82	Correct	3 ms	19716 KB	Output is correct : V - N = 8
83	Correct	2 ms	19716 KB	Output is correct : V - N = 9
84	Correct	3 ms	19716 KB	Output is correct : V - N = 8
85	Correct	2 ms	19716 KB	Output is correct : V - N = 8
86	Correct	3 ms	19716 KB	Output is correct : V - N = 9
87	Correct	3 ms	19708 KB	Output is correct : V - N = 9
88	Correct	3 ms	19720 KB	Output is correct : V - N = 8
89	Correct	2 ms	19964 KB	Output is correct : V - N = 8
90	Correct	2 ms	19720 KB	Output is correct : V - N = 8
91	Correct	3 ms	17668 KB	Output is correct : V - N = 9
92	Correct	2 ms	17676 KB	Output is correct : V - N = 9
93	Correct	2 ms	17492 KB	Output is correct : V - N = 9
94	Correct	2 ms	17668 KB	Output is correct : V - N = 9
95	Correct	2 ms	17664 KB	Output is correct : V - N = 9
96	Correct	3 ms	19716 KB	Output is correct : V - N = 9
97	Correct	3 ms	19716 KB	Output is correct : V - N = 9
98	Correct	3 ms	19712 KB	Output is correct : V - N = 9
99	Correct	3 ms	19716 KB	Output is correct : V - N = 9
100	Correct	3 ms	19712 KB	Output is correct : V - N = 9
101	Correct	3 ms	19548 KB	Output is correct : V - N = 9
102	Correct	3 ms	19716 KB	Output is correct : V - N = 9
103	Correct	3 ms	19712 KB	Output is correct : V - N = 9
104	Correct	2 ms	17668 KB	Output is correct : V - N = 9
105	Correct	3 ms	19716 KB	Output is correct : V - N = 9
106	Correct	3 ms	19712 KB	Output is correct : V - N = 9
107	Correct	3 ms	19712 KB	Output is correct : V - N = 9
108	Correct	3 ms	19716 KB	Output is correct : V - N = 9
109	Correct	2 ms	19728 KB	Output is correct : V - N = 9
110	Correct	3 ms	19716 KB	Output is correct : V - N = 9
111	Correct	2 ms	19712 KB	Output is correct : V - N = 9
112	Correct	3 ms	19716 KB	Output is correct : V - N = 8
113	Correct	3 ms	19716 KB	Output is correct : V - N = 8
114	Correct	3 ms	19716 KB	Output is correct : V - N = 8
115	Correct	3 ms	19716 KB	Output is correct : V - N = 8
116	Correct	3 ms	19716 KB	Output is correct : V - N = 8
117	Correct	3 ms	19712 KB	Output is correct : V - N = 9
118	Correct	3 ms	19716 KB	Output is correct : V - N = 8
119	Correct	3 ms	19716 KB	Output is correct : V - N = 9
120	Correct	3 ms	19724 KB	Output is correct : V - N = 8
121	Correct	3 ms	19712 KB	Output is correct : V - N = 7
122	Correct	3 ms	19724 KB	Output is correct : V - N = 7
123	Correct	3 ms	19716 KB	Output is correct : V - N = 7
124	Correct	2 ms	17668 KB	Output is correct : V - N = 7
125	Correct	3 ms	19712 KB	Output is correct : V - N = 7
126	Correct	2 ms	19712 KB	Output is correct : V - N = 7
127	Correct	3 ms	19716 KB	Output is correct : V - N = 7
128	Correct	3 ms	19716 KB	Output is correct : V - N = 7
129	Correct	2 ms	19716 KB	Output is correct : V - N = 7
130	Correct	3 ms	17668 KB	Output is correct : V - N = 7
131	Correct	3 ms	19680 KB	Output is correct : V - N = 7
132	Correct	3 ms	19716 KB	Output is correct : V - N = 7
133	Correct	2 ms	19712 KB	Output is correct : V - N = 7
134	Correct	3 ms	19712 KB	Output is correct : V - N = 7
135	Correct	3 ms	19716 KB	Output is correct : V - N = 7
136	Correct	3 ms	19724 KB	Output is correct : V - N = 7
137	Correct	3 ms	19716 KB	Output is correct : V - N = 7
138	Correct	3 ms	19720 KB	Output is correct : V - N = 7
139	Correct	3 ms	19724 KB	Output is correct : V - N = 7
140	Correct	3 ms	19716 KB	Output is correct : V - N = 7
141	Correct	3 ms	19724 KB	Output is correct : V - N = 7
142	Correct	3 ms	19724 KB	Output is correct : V - N = 6
143	Correct	2 ms	19724 KB	Output is correct : V - N = 7
144	Correct	2 ms	17668 KB	Output is correct : V - N = 6
145	Correct	3 ms	19716 KB	Output is correct : V - N = 6
146	Correct	3 ms	19712 KB	Output is correct : V - N = 6
147	Correct	3 ms	19724 KB	Output is correct : V - N = 6
148	Correct	3 ms	19724 KB	Output is correct : V - N = 7
149	Correct	3 ms	19720 KB	Output is correct : V - N = 6
150	Correct	2 ms	17668 KB	Output is correct : V - N = 6
151	Correct	2 ms	17668 KB	Output is correct : V - N = 7
152	Correct	3 ms	17664 KB	Output is correct : V - N = 7
153	Correct	2 ms	17664 KB	Output is correct : V - N = 7
154	Correct	2 ms	17664 KB	Output is correct : V - N = 7
155	Correct	3 ms	17668 KB	Output is correct : V - N = 7
156	Correct	3 ms	19716 KB	Output is correct : V - N = 7
157	Correct	2 ms	19724 KB	Output is correct : V - N = 7
158	Correct	3 ms	19716 KB	Output is correct : V - N = 7
159	Correct	3 ms	19716 KB	Output is correct : V - N = 7
160	Correct	3 ms	19732 KB	Output is correct : V - N = 7
161	Correct	3 ms	19716 KB	Output is correct : V - N = 7
162	Correct	3 ms	19712 KB	Output is correct : V - N = 7
163	Correct	2 ms	19716 KB	Output is correct : V - N = 7
164	Correct	3 ms	17668 KB	Output is correct : V - N = 7
165	Correct	3 ms	17676 KB	Output is correct : V - N = 7
166	Correct	3 ms	19728 KB	Output is correct : V - N = 7
167	Correct	3 ms	19716 KB	Output is correct : V - N = 7
168	Correct	2 ms	19716 KB	Output is correct : V - N = 7
169	Correct	3 ms	19716 KB	Output is correct : V - N = 7
170	Correct	2 ms	17668 KB	Output is correct : V - N = 7
171	Correct	2 ms	13572 KB	Output is correct : V - N = 0
172	Correct	2 ms	19712 KB	Output is correct : V - N = 4
173	Correct	2 ms	17668 KB	Output is correct : V - N = 4
174	Correct	2 ms	19640 KB	Output is correct : V - N = 5
175	Correct	3 ms	19716 KB	Output is correct : V - N = 5
176	Correct	3 ms	19716 KB	Output is correct : V - N = 5
177	Correct	2 ms	19716 KB	Output is correct : V - N = 5
178	Correct	3 ms	19716 KB	Output is correct : V - N = 6