답안 #891410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891410	2023-12-22T22:11:12 Z	boris_mihov	항공 노선도 (JOI18_airline)	C++17	100 / 100	394 ms	45424 KB

Alice

#include "Alicelib.h"
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 2000 + 10;
const int INF  = 1e9;

std::vector <std::pair <int,int>> newG;

void Alice (int N, int M, int A[], int B[] )
{
    for (int i = 0 ; i < M ; ++i)
    {
        newG.push_back({A[i], B[i]});
    }

    if (N <= 2)
    {
        InitG(N, newG.size());
        for (int i = 0 ; i < newG.size() ; ++i)
        {
            MakeG(i, newG[i].first, newG[i].second);
        }

        return;
    }
    
    int log = 10;
    for (int i = 0 ; i < N ; ++i)
    {
        for (int bit = 0 ; bit < log ; ++bit)
        {
            if ((i + 1) & (1 << bit))
            {
                newG.push_back({i, N + bit});
            }
        }
    }

    for (int bit = 2 ; bit < log ; ++bit)
    {
        newG.push_back({N, N + bit});
    }

    for (int bit = 0 ; bit < log ; ++bit)
    {
        newG.push_back({N + log, N + bit});
    }

    for (int bit = 1 ; bit + 1 < log ; ++bit)
    {
        newG.push_back({N + bit, N + bit + 1});
    }

    for (int i = 0 ; i < N + log ; ++i)
    {
        newG.push_back({N + log + 1, i});
    }

    InitG(N + log + 2, newG.size());
    for (int i = 0 ; i < newG.size() ; ++i)
    {
        MakeG(i, newG[i].first, newG[i].second);
    }

    return;
}

Bob

#include "Boblib.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <cstring>
#include <vector>

typedef long long llong;
const int MAXN = 2013 + 10;
const int INF  = 1e9;

int number[MAXN];
bool inReal[MAXN];
bool connected[MAXN][MAXN];
std::vector <std::pair <int,int>> edges;
std::vector <int> g[MAXN];
std::vector <int> logs;
int realLog[MAXN];
bool isLog[MAXN];
int deg[MAXN];

void dfs(int node, int par)
{
    // std::cout << "dfs: " << node << ' ' << par << '\n';
    logs.push_back(node);
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        if (isLog[u])
        {
            dfs(u, node);
        }
    }
}

void eraseEdge(int u, int v)
{
    deg[u]--; deg[v]--;
    connected[u][v] = false;
    connected[v][u] = false;
    for (int &x : g[u])
    {
        if (x == v)
        {
            std::swap(x, g[u].back());
            g[u].pop_back();
            break;
        }
    }

    for (int &x : g[v])
    {
        if (x == u)
        {
            std::swap(x, g[v].back());
            g[v].pop_back();
            break;
        }
    }
}

void Bob( int V, int U, int C[], int D[] )
{
    // std::cout << "call: " << V << ' ' << U << '\n';
    if (V <= 2)
    {
        if (U == 0)
        {
            InitMap(V, 0);
        } else
        {
            InitMap(V, 1);
            MakeMap(0, 1);
        }
        
        return;
    }
    
    memset(connected, 0, sizeof(connected));
    for (int i = 0 ; i < U ; ++i)
    {
        // if (C[i] == 0 || D[i] == 0) std::cout << "edge: " << C[i] << ' ' << D[i] << '\n';
        assert(C[i] < MAXN);
        assert(D[i] < MAXN);
        g[C[i]].push_back(D[i]);
        g[D[i]].push_back(C[i]);
        deg[C[i]]++; deg[D[i]]++;
        connected[C[i]][D[i]] = true;
        connected[D[i]][C[i]] = true;
    }

    for (int i = 0 ; i < V ; ++i)
    {
        inReal[i] = true;
    }

    int log = 10;
    int n = V - log - 2;
    int root = -1;

    for (int i = 0 ; i < V ; ++i)
    {
        if (deg[i] == V - 2)
        {
            root = i;
        }
    }

    assert(root != -1);
    int source = -1;
    int pointing = -1;

    for (int i = 0 ; i < V ; ++i)
    {
        // if (!connected[root][i]) std::cout << "size: " << i << ' ' << root << ' ' << deg[i] << ' ' << connected[i][root] << '\n';
        if (i != root && !connected[i][root] && deg[i] == log)
        {
            while (source != -1);
            source = i;
        }
    }
    

    assert(source != -1);
    for (const int &u : g[source])
    {
        // std::cout << "neighboor: " << u << ' ' << deg[u] << '\n';
        isLog[u] = true;
    }
    
    for (const int &u : g[source])
    {
        int cntLog = 0;
        for (const int &v : g[u])
        {
            if (isLog[v])
            {
                cntLog++;
            }
        }

        if (cntLog == log - 2)
        {
            pointing = u;
            break;
        }
    }

    // std::cout << "poiting is: " << pointing << ' ' << source << '\n' << std::flush;
    assert(pointing != -1);

    for (const int &u : g[source])
    {
        if (u == pointing) continue;
        if (connected[u][pointing])
        {
            eraseEdge(u, pointing);
        } else
        {
            int v = pointing;
            g[u].push_back(v);
            g[v].push_back(u);
            deg[u]++; deg[v]++;
            connected[u][v] = true;
            connected[v][u] = true;
        }
    }

    dfs(pointing, -1);
    // std::cout << "logs are: " << log << ' ' << logs.size() << "\n";
    if (logs.size() < log) logs.push_back(pointing);
    for (int i = 0 ; i < log ; ++i)
    {
        // std::cout << logs[i] << ' ';
        inReal[logs[i]] = false;
        realLog[logs[i]] = i;
    }

    // std::cout << '\n';
    assert(logs.size() == log);
    inReal[root] = false;
    inReal[source] = false;
    inReal[pointing] = false;

    for (int i = 0 ; i < V ; ++i)
    {
        if (!inReal[i])
        {
            continue;
        }

        for (int j = 0 ; j < log ; ++j)
        {
            if (connected[i][logs[j]])
            {
                // if (i == 0) std::cout << "connected: " << i << ' ' << logs[j] << ' ' << connected[i][logs[j]] << '\n';
                number[i] |= (1 << j);
            }
        }

        // if (number[i] == 0) std::cout << "interesting: " << number[i] << ' ' << i << '\n';
        assert(number[i] > 0);
        number[i]--;

    }

    for (int i = 0 ; i < V ; ++i)
    {
        for (int j = i + 1 ; j < V ; ++j)
        {
            if (!inReal[i] || !inReal[j] || !connected[i][j])
            {
                continue;
            }

            edges.push_back({number[i], number[j]});
        }
    }

    InitMap(n, edges.size());
    for (int i = 0 ; i < edges.size() ; ++i)
    {
        MakeMap(edges[i].first, edges[i].second);
    }

    return;
}

Compilation message

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

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:176:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  176 |     if (logs.size() < log) logs.push_back(pointing);
      |         ~~~~~~~~~~~~^~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from Bob.cpp:5:
Bob.cpp:185:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  185 |     assert(logs.size() == log);
      |            ~~~~~~~~~~~~^~~~~~
Bob.cpp:226:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  226 |     for (int i = 0 ; i < edges.size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~

Subtask #1

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	20996 KB	Output is correct
2	Correct	4 ms	20996 KB	Output is correct
3	Correct	3 ms	20992 KB	Output is correct
4	Correct	3 ms	18940 KB	Output is correct
5	Correct	3 ms	20996 KB	Output is correct
6	Correct	3 ms	20996 KB	Output is correct
7	Correct	3 ms	20996 KB	Output is correct
8	Correct	4 ms	20996 KB	Output is correct
9	Correct	3 ms	21000 KB	Output is correct
10	Correct	3 ms	18948 KB	Output is correct
11	Correct	4 ms	20996 KB	Output is correct
12	Correct	4 ms	20996 KB	Output is correct
13	Correct	4 ms	20988 KB	Output is correct
14	Correct	3 ms	20996 KB	Output is correct
15	Correct	4 ms	21112 KB	Output is correct
16	Correct	4 ms	20992 KB	Output is correct
17	Correct	3 ms	20996 KB	Output is correct
18	Correct	4 ms	21448 KB	Output is correct
19	Correct	4 ms	20996 KB	Output is correct
20	Correct	4 ms	20992 KB	Output is correct
21	Correct	3 ms	20992 KB	Output is correct
22	Correct	4 ms	20996 KB	Output is correct
23	Correct	3 ms	20996 KB	Output is correct
24	Correct	3 ms	18948 KB	Output is correct
25	Correct	3 ms	20996 KB	Output is correct
26	Correct	4 ms	20996 KB	Output is correct
27	Correct	3 ms	20996 KB	Output is correct
28	Correct	3 ms	20996 KB	Output is correct
29	Correct	4 ms	20996 KB	Output is correct
30	Correct	3 ms	18948 KB	Output is correct
31	Correct	3 ms	18948 KB	Output is correct
32	Correct	3 ms	19048 KB	Output is correct
33	Correct	3 ms	18948 KB	Output is correct
34	Correct	3 ms	18944 KB	Output is correct
35	Correct	3 ms	18944 KB	Output is correct
36	Correct	4 ms	20996 KB	Output is correct
37	Correct	3 ms	20992 KB	Output is correct
38	Correct	3 ms	20996 KB	Output is correct
39	Correct	4 ms	20996 KB	Output is correct
40	Correct	4 ms	20996 KB	Output is correct
41	Correct	3 ms	20996 KB	Output is correct
42	Correct	3 ms	20996 KB	Output is correct
43	Correct	3 ms	20996 KB	Output is correct
44	Correct	3 ms	18948 KB	Output is correct
45	Correct	3 ms	18948 KB	Output is correct
46	Correct	4 ms	20996 KB	Output is correct
47	Correct	4 ms	21000 KB	Output is correct
48	Correct	3 ms	20996 KB	Output is correct
49	Correct	3 ms	21000 KB	Output is correct
50	Correct	3 ms	18944 KB	Output is correct
51	Correct	2 ms	11524 KB	Output is correct
52	Correct	2 ms	17668 KB	Output is correct
53	Correct	2 ms	11524 KB	Output is correct
54	Correct	4 ms	20992 KB	Output is correct
55	Correct	4 ms	20996 KB	Output is correct
56	Correct	3 ms	20996 KB	Output is correct
57	Correct	3 ms	20996 KB	Output is correct
58	Correct	3 ms	20996 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	20996 KB	Output is correct
2	Correct	4 ms	20996 KB	Output is correct
3	Correct	3 ms	20992 KB	Output is correct
4	Correct	3 ms	18940 KB	Output is correct
5	Correct	3 ms	20996 KB	Output is correct
6	Correct	3 ms	20996 KB	Output is correct
7	Correct	3 ms	20996 KB	Output is correct
8	Correct	4 ms	20996 KB	Output is correct
9	Correct	3 ms	21000 KB	Output is correct
10	Correct	3 ms	18948 KB	Output is correct
11	Correct	4 ms	20996 KB	Output is correct
12	Correct	4 ms	20996 KB	Output is correct
13	Correct	4 ms	20988 KB	Output is correct
14	Correct	3 ms	20996 KB	Output is correct
15	Correct	4 ms	21112 KB	Output is correct
16	Correct	4 ms	20992 KB	Output is correct
17	Correct	3 ms	20996 KB	Output is correct
18	Correct	4 ms	21448 KB	Output is correct
19	Correct	4 ms	20996 KB	Output is correct
20	Correct	4 ms	20992 KB	Output is correct
21	Correct	3 ms	20992 KB	Output is correct
22	Correct	4 ms	20996 KB	Output is correct
23	Correct	3 ms	20996 KB	Output is correct
24	Correct	3 ms	18948 KB	Output is correct
25	Correct	3 ms	20996 KB	Output is correct
26	Correct	4 ms	20996 KB	Output is correct
27	Correct	3 ms	20996 KB	Output is correct
28	Correct	3 ms	20996 KB	Output is correct
29	Correct	4 ms	20996 KB	Output is correct
30	Correct	3 ms	18948 KB	Output is correct
31	Correct	3 ms	18948 KB	Output is correct
32	Correct	3 ms	19048 KB	Output is correct
33	Correct	3 ms	18948 KB	Output is correct
34	Correct	3 ms	18944 KB	Output is correct
35	Correct	3 ms	18944 KB	Output is correct
36	Correct	4 ms	20996 KB	Output is correct
37	Correct	3 ms	20992 KB	Output is correct
38	Correct	3 ms	20996 KB	Output is correct
39	Correct	4 ms	20996 KB	Output is correct
40	Correct	4 ms	20996 KB	Output is correct
41	Correct	3 ms	20996 KB	Output is correct
42	Correct	3 ms	20996 KB	Output is correct
43	Correct	3 ms	20996 KB	Output is correct
44	Correct	3 ms	18948 KB	Output is correct
45	Correct	3 ms	18948 KB	Output is correct
46	Correct	4 ms	20996 KB	Output is correct
47	Correct	4 ms	21000 KB	Output is correct
48	Correct	3 ms	20996 KB	Output is correct
49	Correct	3 ms	21000 KB	Output is correct
50	Correct	3 ms	18944 KB	Output is correct
51	Correct	2 ms	11524 KB	Output is correct
52	Correct	2 ms	17668 KB	Output is correct
53	Correct	2 ms	11524 KB	Output is correct
54	Correct	4 ms	20992 KB	Output is correct
55	Correct	4 ms	20996 KB	Output is correct
56	Correct	3 ms	20996 KB	Output is correct
57	Correct	3 ms	20996 KB	Output is correct
58	Correct	3 ms	20996 KB	Output is correct
59	Correct	4 ms	20992 KB	Output is correct
60	Correct	4 ms	20996 KB	Output is correct
61	Correct	4 ms	20996 KB	Output is correct
62	Correct	3 ms	20992 KB	Output is correct
63	Correct	4 ms	20996 KB	Output is correct
64	Correct	4 ms	21024 KB	Output is correct
65	Correct	4 ms	20996 KB	Output is correct
66	Correct	3 ms	21000 KB	Output is correct
67	Correct	3 ms	20996 KB	Output is correct
68	Correct	3 ms	20996 KB	Output is correct
69	Correct	3 ms	20996 KB	Output is correct
70	Correct	4 ms	21660 KB	Output is correct
71	Correct	4 ms	20996 KB	Output is correct
72	Correct	4 ms	21192 KB	Output is correct
73	Correct	4 ms	20996 KB	Output is correct
74	Correct	3 ms	20996 KB	Output is correct
75	Correct	3 ms	20996 KB	Output is correct
76	Correct	4 ms	20996 KB	Output is correct
77	Correct	4 ms	20996 KB	Output is correct
78	Correct	4 ms	20996 KB	Output is correct
79	Correct	4 ms	20988 KB	Output is correct
80	Correct	4 ms	21000 KB	Output is correct
81	Correct	4 ms	20996 KB	Output is correct
82	Correct	3 ms	21012 KB	Output is correct
83	Correct	4 ms	20992 KB	Output is correct
84	Correct	4 ms	20996 KB	Output is correct
85	Correct	4 ms	20992 KB	Output is correct
86	Correct	4 ms	20992 KB	Output is correct
87	Correct	4 ms	20956 KB	Output is correct
88	Correct	3 ms	20992 KB	Output is correct
89	Correct	3 ms	18944 KB	Output is correct
90	Correct	3 ms	18948 KB	Output is correct
91	Correct	3 ms	18948 KB	Output is correct
92	Correct	3 ms	18948 KB	Output is correct
93	Correct	3 ms	18948 KB	Output is correct
94	Correct	4 ms	20988 KB	Output is correct
95	Correct	4 ms	20996 KB	Output is correct
96	Correct	4 ms	20996 KB	Output is correct
97	Correct	4 ms	20988 KB	Output is correct
98	Correct	4 ms	20996 KB	Output is correct
99	Correct	3 ms	20992 KB	Output is correct
100	Correct	3 ms	20996 KB	Output is correct
101	Correct	3 ms	20996 KB	Output is correct
102	Correct	4 ms	18936 KB	Output is correct
103	Correct	3 ms	20996 KB	Output is correct
104	Correct	4 ms	21008 KB	Output is correct
105	Correct	4 ms	20996 KB	Output is correct
106	Correct	4 ms	20988 KB	Output is correct
107	Correct	3 ms	21000 KB	Output is correct
108	Correct	3 ms	20996 KB	Output is correct
109	Correct	4 ms	20996 KB	Output is correct
110	Correct	4 ms	20992 KB	Output is correct
111	Correct	4 ms	20996 KB	Output is correct
112	Correct	4 ms	20996 KB	Output is correct
113	Correct	3 ms	20996 KB	Output is correct
114	Correct	4 ms	20996 KB	Output is correct
115	Correct	4 ms	20996 KB	Output is correct
116	Correct	3 ms	20996 KB	Output is correct
117	Correct	3 ms	20996 KB	Output is correct
118	Correct	3 ms	20996 KB	Output is correct

Subtask #3

63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	385 ms	45424 KB	Output is correct : V - N = 12
2	Correct	318 ms	44724 KB	Output is correct : V - N = 12
3	Correct	113 ms	28072 KB	Output is correct : V - N = 12
4	Correct	9 ms	21540 KB	Output is correct : V - N = 12
5	Correct	82 ms	24736 KB	Output is correct : V - N = 12
6	Correct	258 ms	42892 KB	Output is correct : V - N = 12
7	Correct	385 ms	44824 KB	Output is correct : V - N = 12
8	Correct	350 ms	44812 KB	Output is correct : V - N = 12
9	Correct	182 ms	28592 KB	Output is correct : V - N = 12
10	Correct	24 ms	22712 KB	Output is correct : V - N = 12
11	Correct	36 ms	23332 KB	Output is correct : V - N = 12
12	Correct	186 ms	34152 KB	Output is correct : V - N = 12
13	Correct	348 ms	44728 KB	Output is correct : V - N = 12
14	Correct	390 ms	44412 KB	Output is correct : V - N = 12
15	Correct	234 ms	37816 KB	Output is correct : V - N = 12
16	Correct	47 ms	23728 KB	Output is correct : V - N = 12
17	Correct	12 ms	21892 KB	Output is correct : V - N = 12
18	Correct	155 ms	27784 KB	Output is correct : V - N = 12
19	Correct	332 ms	44392 KB	Output is correct : V - N = 12
20	Correct	387 ms	44968 KB	Output is correct : V - N = 12
21	Correct	107 ms	26680 KB	Output is correct : V - N = 12
22	Correct	82 ms	24800 KB	Output is correct : V - N = 12
23	Correct	31 ms	22900 KB	Output is correct : V - N = 12
24	Correct	5 ms	20992 KB	Output is correct : V - N = 12
25	Correct	22 ms	22804 KB	Output is correct : V - N = 12
26	Correct	72 ms	24448 KB	Output is correct : V - N = 12
27	Correct	110 ms	25156 KB	Output is correct : V - N = 12
28	Correct	90 ms	25420 KB	Output is correct : V - N = 12
29	Correct	48 ms	23132 KB	Output is correct : V - N = 12
30	Correct	7 ms	21560 KB	Output is correct : V - N = 12
31	Correct	7 ms	18948 KB	Output is correct : V - N = 12
32	Correct	7 ms	18948 KB	Output is correct : V - N = 12
33	Correct	8 ms	19084 KB	Output is correct : V - N = 12
34	Correct	7 ms	18948 KB	Output is correct : V - N = 12
35	Correct	7 ms	18944 KB	Output is correct : V - N = 12
36	Correct	374 ms	45040 KB	Output is correct : V - N = 12
37	Correct	387 ms	44948 KB	Output is correct : V - N = 12
38	Correct	394 ms	44940 KB	Output is correct : V - N = 12
39	Correct	392 ms	45328 KB	Output is correct : V - N = 12
40	Correct	392 ms	45112 KB	Output is correct : V - N = 12
41	Correct	80 ms	24640 KB	Output is correct : V - N = 12
42	Correct	58 ms	24032 KB	Output is correct : V - N = 12
43	Correct	62 ms	24576 KB	Output is correct : V - N = 12
44	Correct	10 ms	21248 KB	Output is correct : V - N = 12
45	Correct	37 ms	22836 KB	Output is correct : V - N = 12
46	Correct	138 ms	27656 KB	Output is correct : V - N = 12
47	Correct	71 ms	24568 KB	Output is correct : V - N = 12
48	Correct	165 ms	28124 KB	Output is correct : V - N = 12
49	Correct	35 ms	23056 KB	Output is correct : V - N = 12
50	Correct	13 ms	22632 KB	Output is correct : V - N = 12
51	Correct	324 ms	44888 KB	Output is correct : V - N = 12
52	Correct	9 ms	21548 KB	Output is correct : V - N = 12
53	Correct	257 ms	43592 KB	Output is correct : V - N = 12
54	Correct	346 ms	44692 KB	Output is correct : V - N = 12
55	Correct	26 ms	22736 KB	Output is correct : V - N = 12
56	Correct	211 ms	33152 KB	Output is correct : V - N = 12
57	Correct	368 ms	44988 KB	Output is correct : V - N = 12
58	Correct	55 ms	23584 KB	Output is correct : V - N = 12
59	Correct	140 ms	27824 KB	Output is correct : V - N = 12
60	Correct	365 ms	44072 KB	Output is correct : V - N = 12
61	Correct	4 ms	20996 KB	Output is correct : V - N = 12
62	Correct	4 ms	20996 KB	Output is correct : V - N = 12
63	Correct	4 ms	20996 KB	Output is correct : V - N = 12
64	Correct	4 ms	20996 KB	Output is correct : V - N = 12
65	Correct	3 ms	20996 KB	Output is correct : V - N = 12
66	Correct	4 ms	20996 KB	Output is correct : V - N = 12
67	Correct	4 ms	20996 KB	Output is correct : V - N = 12
68	Correct	4 ms	21248 KB	Output is correct : V - N = 12
69	Correct	4 ms	20996 KB	Output is correct : V - N = 12
70	Correct	3 ms	20992 KB	Output is correct : V - N = 12
71	Correct	4 ms	20996 KB	Output is correct : V - N = 12
72	Correct	4 ms	20996 KB	Output is correct : V - N = 12
73	Correct	4 ms	20996 KB	Output is correct : V - N = 12
74	Correct	4 ms	20964 KB	Output is correct : V - N = 12
75	Correct	3 ms	20996 KB	Output is correct : V - N = 12
76	Correct	4 ms	20992 KB	Output is correct : V - N = 12
77	Correct	3 ms	21016 KB	Output is correct : V - N = 12
78	Correct	4 ms	20992 KB	Output is correct : V - N = 12
79	Correct	4 ms	20996 KB	Output is correct : V - N = 12
80	Correct	4 ms	20992 KB	Output is correct : V - N = 12
81	Correct	4 ms	21004 KB	Output is correct : V - N = 12
82	Correct	4 ms	20996 KB	Output is correct : V - N = 12
83	Correct	4 ms	20992 KB	Output is correct : V - N = 12
84	Correct	3 ms	20996 KB	Output is correct : V - N = 12
85	Correct	4 ms	20996 KB	Output is correct : V - N = 12
86	Correct	4 ms	20992 KB	Output is correct : V - N = 12
87	Correct	4 ms	20992 KB	Output is correct : V - N = 12
88	Correct	4 ms	20996 KB	Output is correct : V - N = 12
89	Correct	6 ms	20996 KB	Output is correct : V - N = 12
90	Correct	4 ms	20996 KB	Output is correct : V - N = 12
91	Correct	3 ms	18948 KB	Output is correct : V - N = 12
92	Correct	3 ms	18948 KB	Output is correct : V - N = 12
93	Correct	3 ms	18952 KB	Output is correct : V - N = 12
94	Correct	3 ms	18948 KB	Output is correct : V - N = 12
95	Correct	4 ms	18948 KB	Output is correct : V - N = 12
96	Correct	4 ms	21000 KB	Output is correct : V - N = 12
97	Correct	4 ms	20996 KB	Output is correct : V - N = 12
98	Correct	4 ms	20996 KB	Output is correct : V - N = 12
99	Correct	4 ms	20992 KB	Output is correct : V - N = 12
100	Correct	4 ms	20996 KB	Output is correct : V - N = 12
101	Correct	4 ms	20996 KB	Output is correct : V - N = 12
102	Correct	4 ms	20988 KB	Output is correct : V - N = 12
103	Correct	3 ms	20996 KB	Output is correct : V - N = 12
104	Correct	3 ms	18948 KB	Output is correct : V - N = 12
105	Correct	3 ms	20996 KB	Output is correct : V - N = 12
106	Correct	4 ms	20992 KB	Output is correct : V - N = 12
107	Correct	4 ms	21756 KB	Output is correct : V - N = 12
108	Correct	4 ms	21000 KB	Output is correct : V - N = 12
109	Correct	3 ms	20996 KB	Output is correct : V - N = 12
110	Correct	3 ms	20988 KB	Output is correct : V - N = 12
111	Correct	4 ms	20996 KB	Output is correct : V - N = 12
112	Correct	3 ms	20996 KB	Output is correct : V - N = 12
113	Correct	4 ms	20996 KB	Output is correct : V - N = 12
114	Correct	3 ms	20996 KB	Output is correct : V - N = 12
115	Correct	3 ms	20992 KB	Output is correct : V - N = 12
116	Correct	4 ms	20996 KB	Output is correct : V - N = 12
117	Correct	3 ms	20996 KB	Output is correct : V - N = 12
118	Correct	3 ms	20996 KB	Output is correct : V - N = 12
119	Correct	3 ms	20996 KB	Output is correct : V - N = 12
120	Correct	3 ms	20992 KB	Output is correct : V - N = 12
121	Correct	3 ms	20996 KB	Output is correct : V - N = 12
122	Correct	4 ms	20996 KB	Output is correct : V - N = 12
123	Correct	3 ms	20996 KB	Output is correct : V - N = 12
124	Correct	3 ms	18944 KB	Output is correct : V - N = 12
125	Correct	4 ms	21204 KB	Output is correct : V - N = 12
126	Correct	4 ms	20988 KB	Output is correct : V - N = 12
127	Correct	3 ms	20996 KB	Output is correct : V - N = 12
128	Correct	3 ms	21248 KB	Output is correct : V - N = 12
129	Correct	3 ms	20992 KB	Output is correct : V - N = 12
130	Correct	3 ms	18948 KB	Output is correct : V - N = 12
131	Correct	3 ms	20996 KB	Output is correct : V - N = 12
132	Correct	3 ms	20988 KB	Output is correct : V - N = 12
133	Correct	4 ms	20996 KB	Output is correct : V - N = 12
134	Correct	3 ms	20996 KB	Output is correct : V - N = 12
135	Correct	3 ms	20968 KB	Output is correct : V - N = 12
136	Correct	4 ms	20992 KB	Output is correct : V - N = 12
137	Correct	4 ms	20992 KB	Output is correct : V - N = 12
138	Correct	3 ms	20992 KB	Output is correct : V - N = 12
139	Correct	3 ms	21004 KB	Output is correct : V - N = 12
140	Correct	4 ms	20992 KB	Output is correct : V - N = 12
141	Correct	3 ms	20996 KB	Output is correct : V - N = 12
142	Correct	3 ms	20992 KB	Output is correct : V - N = 12
143	Correct	4 ms	20992 KB	Output is correct : V - N = 12
144	Correct	3 ms	18948 KB	Output is correct : V - N = 12
145	Correct	3 ms	20996 KB	Output is correct : V - N = 12
146	Correct	4 ms	20996 KB	Output is correct : V - N = 12
147	Correct	3 ms	20992 KB	Output is correct : V - N = 12
148	Correct	3 ms	20988 KB	Output is correct : V - N = 12
149	Correct	3 ms	20996 KB	Output is correct : V - N = 12
150	Correct	3 ms	18952 KB	Output is correct : V - N = 12
151	Correct	3 ms	18948 KB	Output is correct : V - N = 12
152	Correct	3 ms	18944 KB	Output is correct : V - N = 12
153	Correct	4 ms	18948 KB	Output is correct : V - N = 12
154	Correct	4 ms	18948 KB	Output is correct : V - N = 12
155	Correct	3 ms	18948 KB	Output is correct : V - N = 12
156	Correct	4 ms	20996 KB	Output is correct : V - N = 12
157	Correct	4 ms	20996 KB	Output is correct : V - N = 12
158	Correct	3 ms	20996 KB	Output is correct : V - N = 12
159	Correct	3 ms	20996 KB	Output is correct : V - N = 12
160	Correct	3 ms	20996 KB	Output is correct : V - N = 12
161	Correct	3 ms	20996 KB	Output is correct : V - N = 12
162	Correct	3 ms	20908 KB	Output is correct : V - N = 12
163	Correct	3 ms	20996 KB	Output is correct : V - N = 12
164	Correct	3 ms	18948 KB	Output is correct : V - N = 12
165	Correct	3 ms	18948 KB	Output is correct : V - N = 12
166	Correct	3 ms	20996 KB	Output is correct : V - N = 12
167	Correct	4 ms	21192 KB	Output is correct : V - N = 12
168	Correct	4 ms	20992 KB	Output is correct : V - N = 12
169	Correct	4 ms	20996 KB	Output is correct : V - N = 12
170	Correct	3 ms	18944 KB	Output is correct : V - N = 12
171	Correct	2 ms	11524 KB	Output is correct : V - N = 0
172	Correct	2 ms	17668 KB	Output is correct : V - N = 0
173	Correct	2 ms	11524 KB	Output is correct : V - N = 0
174	Correct	3 ms	21000 KB	Output is correct : V - N = 12
175	Correct	4 ms	20908 KB	Output is correct : V - N = 12
176	Correct	3 ms	20996 KB	Output is correct : V - N = 12
177	Correct	3 ms	20872 KB	Output is correct : V - N = 12
178	Correct	3 ms	20996 KB	Output is correct : V - N = 12