답안 #891407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891407	2023-12-22T21:55:34 Z	boris_mihov	항공 노선도 (JOI18_airline)	C++17	91 / 100	399 ms	45796 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 = 0 ; bit < log ; ++bit)
    {
        newG.push_back({N + log, N + bit});
    }

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

    if (N >= 512) 
    {
        newG.push_back({N + log + 1, N + log - 1});
        newG.push_back({N + log + 1, N + log});
        for (int i = 0 ; i < N + log ; ++i)
        {
            newG.push_back({N + log + 2, i});
        }

        newG.push_back({N + log + 2, N + log + 1});

        InitG(N + log + 3, newG.size());
        for (int i = 0 ; i < newG.size() ; ++i)
        {
            MakeG(i, newG[i].first, newG[i].second);
        }
    } else
    {
        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)
{
    logs.push_back(node);
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

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

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 - 3 + (V < 525);
    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 + 1 - (n < 512))
        {
            while (source != -1);
            source = i;
        }
    }

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

    // std::cout << "poiting is: " << pointing << ' ' << source << '\n' << std::flush;
    assert(pointing != -1);
    if (isLog[g[pointing][0]]) dfs(g[pointing][0], -1);
    else if (isLog[g[pointing][1]]) dfs(g[pointing][1], -1);
    else dfs(g[pointing][2], -1);
    
    // std::cout << "logs are: " << log << ' ' << logs.size() << "\n";
    std::reverse(logs.begin(), logs.end());
    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:65: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]
   65 |         for (int i = 0 ; i < newG.size() ; ++i)
      |                          ~~^~~~~~~~~~~~~
Alice.cpp:77: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]
   77 |         for (int i = 0 ; i < newG.size() ; ++i)
      |                          ~~^~~~~~~~~~~~~

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

Subtask #1

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	20992 KB	Output is correct
2	Correct	3 ms	21000 KB	Output is correct
3	Correct	3 ms	20996 KB	Output is correct
4	Correct	3 ms	18944 KB	Output is correct
5	Correct	3 ms	20992 KB	Output is correct
6	Correct	3 ms	21012 KB	Output is correct
7	Correct	4 ms	20996 KB	Output is correct
8	Correct	4 ms	21080 KB	Output is correct
9	Correct	3 ms	21004 KB	Output is correct
10	Correct	3 ms	18944 KB	Output is correct
11	Correct	3 ms	20996 KB	Output is correct
12	Correct	3 ms	21000 KB	Output is correct
13	Correct	3 ms	20996 KB	Output is correct
14	Correct	4 ms	20996 KB	Output is correct
15	Correct	2 ms	20996 KB	Output is correct
16	Correct	4 ms	20996 KB	Output is correct
17	Correct	3 ms	21084 KB	Output is correct
18	Correct	3 ms	21388 KB	Output is correct
19	Correct	3 ms	20996 KB	Output is correct
20	Correct	3 ms	20996 KB	Output is correct
21	Correct	3 ms	21084 KB	Output is correct
22	Correct	3 ms	20996 KB	Output is correct
23	Correct	4 ms	20996 KB	Output is correct
24	Correct	3 ms	18944 KB	Output is correct
25	Correct	3 ms	20988 KB	Output is correct
26	Correct	4 ms	21244 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	18908 KB	Output is correct
31	Correct	3 ms	18948 KB	Output is correct
32	Correct	3 ms	18952 KB	Output is correct
33	Correct	3 ms	18948 KB	Output is correct
34	Correct	3 ms	18948 KB	Output is correct
35	Correct	3 ms	18948 KB	Output is correct
36	Correct	7 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	3 ms	20996 KB	Output is correct
40	Correct	3 ms	20992 KB	Output is correct
41	Correct	4 ms	20908 KB	Output is correct
42	Correct	3 ms	20836 KB	Output is correct
43	Correct	4 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	3 ms	20996 KB	Output is correct
47	Correct	4 ms	20992 KB	Output is correct
48	Correct	4 ms	20996 KB	Output is correct
49	Correct	4 ms	20996 KB	Output is correct
50	Correct	3 ms	18964 KB	Output is correct
51	Correct	2 ms	11524 KB	Output is correct
52	Correct	2 ms	17916 KB	Output is correct
53	Correct	2 ms	11524 KB	Output is correct
54	Correct	3 ms	20996 KB	Output is correct
55	Correct	3 ms	20992 KB	Output is correct
56	Correct	3 ms	21248 KB	Output is correct
57	Correct	4 ms	20996 KB	Output is correct
58	Correct	3 ms	20992 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	20992 KB	Output is correct
2	Correct	3 ms	21000 KB	Output is correct
3	Correct	3 ms	20996 KB	Output is correct
4	Correct	3 ms	18944 KB	Output is correct
5	Correct	3 ms	20992 KB	Output is correct
6	Correct	3 ms	21012 KB	Output is correct
7	Correct	4 ms	20996 KB	Output is correct
8	Correct	4 ms	21080 KB	Output is correct
9	Correct	3 ms	21004 KB	Output is correct
10	Correct	3 ms	18944 KB	Output is correct
11	Correct	3 ms	20996 KB	Output is correct
12	Correct	3 ms	21000 KB	Output is correct
13	Correct	3 ms	20996 KB	Output is correct
14	Correct	4 ms	20996 KB	Output is correct
15	Correct	2 ms	20996 KB	Output is correct
16	Correct	4 ms	20996 KB	Output is correct
17	Correct	3 ms	21084 KB	Output is correct
18	Correct	3 ms	21388 KB	Output is correct
19	Correct	3 ms	20996 KB	Output is correct
20	Correct	3 ms	20996 KB	Output is correct
21	Correct	3 ms	21084 KB	Output is correct
22	Correct	3 ms	20996 KB	Output is correct
23	Correct	4 ms	20996 KB	Output is correct
24	Correct	3 ms	18944 KB	Output is correct
25	Correct	3 ms	20988 KB	Output is correct
26	Correct	4 ms	21244 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	18908 KB	Output is correct
31	Correct	3 ms	18948 KB	Output is correct
32	Correct	3 ms	18952 KB	Output is correct
33	Correct	3 ms	18948 KB	Output is correct
34	Correct	3 ms	18948 KB	Output is correct
35	Correct	3 ms	18948 KB	Output is correct
36	Correct	7 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	3 ms	20996 KB	Output is correct
40	Correct	3 ms	20992 KB	Output is correct
41	Correct	4 ms	20908 KB	Output is correct
42	Correct	3 ms	20836 KB	Output is correct
43	Correct	4 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	3 ms	20996 KB	Output is correct
47	Correct	4 ms	20992 KB	Output is correct
48	Correct	4 ms	20996 KB	Output is correct
49	Correct	4 ms	20996 KB	Output is correct
50	Correct	3 ms	18964 KB	Output is correct
51	Correct	2 ms	11524 KB	Output is correct
52	Correct	2 ms	17916 KB	Output is correct
53	Correct	2 ms	11524 KB	Output is correct
54	Correct	3 ms	20996 KB	Output is correct
55	Correct	3 ms	20992 KB	Output is correct
56	Correct	3 ms	21248 KB	Output is correct
57	Correct	4 ms	20996 KB	Output is correct
58	Correct	3 ms	20992 KB	Output is correct
59	Correct	4 ms	20992 KB	Output is correct
60	Correct	4 ms	20992 KB	Output is correct
61	Correct	4 ms	20992 KB	Output is correct
62	Correct	3 ms	20996 KB	Output is correct
63	Correct	3 ms	20996 KB	Output is correct
64	Correct	3 ms	20992 KB	Output is correct
65	Correct	4 ms	20988 KB	Output is correct
66	Correct	4 ms	20996 KB	Output is correct
67	Correct	4 ms	20996 KB	Output is correct
68	Correct	4 ms	20996 KB	Output is correct
69	Correct	4 ms	20996 KB	Output is correct
70	Correct	4 ms	20996 KB	Output is correct
71	Correct	4 ms	20996 KB	Output is correct
72	Correct	4 ms	21000 KB	Output is correct
73	Correct	4 ms	20992 KB	Output is correct
74	Correct	4 ms	20996 KB	Output is correct
75	Correct	4 ms	20996 KB	Output is correct
76	Correct	4 ms	20996 KB	Output is correct
77	Correct	4 ms	20956 KB	Output is correct
78	Correct	4 ms	20996 KB	Output is correct
79	Correct	4 ms	20996 KB	Output is correct
80	Correct	4 ms	20996 KB	Output is correct
81	Correct	3 ms	20996 KB	Output is correct
82	Correct	4 ms	20992 KB	Output is correct
83	Correct	4 ms	20996 KB	Output is correct
84	Correct	3 ms	21248 KB	Output is correct
85	Correct	3 ms	20996 KB	Output is correct
86	Correct	4 ms	21244 KB	Output is correct
87	Correct	3 ms	20996 KB	Output is correct
88	Correct	3 ms	20996 KB	Output is correct
89	Correct	3 ms	18940 KB	Output is correct
90	Correct	4 ms	19252 KB	Output is correct
91	Correct	5 ms	18948 KB	Output is correct
92	Correct	4 ms	18948 KB	Output is correct
93	Correct	3 ms	19248 KB	Output is correct
94	Correct	4 ms	20968 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	20996 KB	Output is correct
98	Correct	4 ms	21068 KB	Output is correct
99	Correct	4 ms	21064 KB	Output is correct
100	Correct	4 ms	21244 KB	Output is correct
101	Correct	4 ms	20996 KB	Output is correct
102	Correct	3 ms	18948 KB	Output is correct
103	Correct	3 ms	21268 KB	Output is correct
104	Correct	3 ms	20992 KB	Output is correct
105	Correct	4 ms	20992 KB	Output is correct
106	Correct	4 ms	20996 KB	Output is correct
107	Correct	3 ms	20996 KB	Output is correct
108	Correct	4 ms	20996 KB	Output is correct
109	Correct	4 ms	20992 KB	Output is correct
110	Correct	3 ms	21020 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	20992 KB	Output is correct
114	Correct	3 ms	20996 KB	Output is correct
115	Correct	3 ms	20996 KB	Output is correct
116	Correct	3 ms	20996 KB	Output is correct
117	Correct	3 ms	20992 KB	Output is correct
118	Correct	3 ms	20992 KB	Output is correct

Subtask #3

54.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	362 ms	45472 KB	Output is partially correct : V - N = 13
2	Partially correct	309 ms	43348 KB	Output is partially correct : V - N = 13
3	Partially correct	113 ms	27612 KB	Output is partially correct : V - N = 13
4	Partially correct	10 ms	21772 KB	Output is partially correct : V - N = 13
5	Partially correct	76 ms	24332 KB	Output is partially correct : V - N = 13
6	Partially correct	254 ms	43676 KB	Output is partially correct : V - N = 13
7	Partially correct	389 ms	44040 KB	Output is partially correct : V - N = 13
8	Partially correct	333 ms	45104 KB	Output is partially correct : V - N = 13
9	Partially correct	165 ms	28492 KB	Output is partially correct : V - N = 13
10	Partially correct	23 ms	22204 KB	Output is partially correct : V - N = 13
11	Partially correct	38 ms	23260 KB	Output is partially correct : V - N = 13
12	Partially correct	198 ms	33976 KB	Output is partially correct : V - N = 13
13	Partially correct	352 ms	44820 KB	Output is partially correct : V - N = 13
14	Partially correct	370 ms	44804 KB	Output is partially correct : V - N = 13
15	Partially correct	211 ms	39972 KB	Output is partially correct : V - N = 13
16	Partially correct	51 ms	23456 KB	Output is partially correct : V - N = 13
17	Partially correct	13 ms	22412 KB	Output is partially correct : V - N = 13
18	Partially correct	141 ms	27248 KB	Output is partially correct : V - N = 13
19	Partially correct	330 ms	42628 KB	Output is partially correct : V - N = 13
20	Partially correct	399 ms	45240 KB	Output is partially correct : V - N = 13
21	Correct	105 ms	26448 KB	Output is correct : V - N = 12
22	Correct	74 ms	24536 KB	Output is correct : V - N = 12
23	Partially correct	32 ms	23252 KB	Output is partially correct : V - N = 13
24	Partially correct	5 ms	20992 KB	Output is partially correct : V - N = 13
25	Partially correct	19 ms	22192 KB	Output is partially correct : V - N = 13
26	Correct	64 ms	25172 KB	Output is correct : V - N = 12
27	Correct	104 ms	25196 KB	Output is correct : V - N = 12
28	Partially correct	84 ms	24740 KB	Output is partially correct : V - N = 13
29	Partially correct	49 ms	23592 KB	Output is partially correct : V - N = 13
30	Correct	7 ms	21772 KB	Output is correct : V - N = 12
31	Partially correct	7 ms	19140 KB	Output is partially correct : V - N = 13
32	Partially correct	7 ms	18948 KB	Output is partially correct : V - N = 13
33	Partially correct	7 ms	19204 KB	Output is partially correct : V - N = 13
34	Partially correct	7 ms	18948 KB	Output is partially correct : V - N = 13
35	Partially correct	7 ms	18948 KB	Output is partially correct : V - N = 13
36	Partially correct	386 ms	45332 KB	Output is partially correct : V - N = 13
37	Partially correct	384 ms	44868 KB	Output is partially correct : V - N = 13
38	Partially correct	393 ms	44496 KB	Output is partially correct : V - N = 13
39	Partially correct	353 ms	45796 KB	Output is partially correct : V - N = 13
40	Partially correct	380 ms	44904 KB	Output is partially correct : V - N = 13
41	Partially correct	68 ms	24620 KB	Output is partially correct : V - N = 13
42	Partially correct	56 ms	24404 KB	Output is partially correct : V - N = 13
43	Partially correct	73 ms	24736 KB	Output is partially correct : V - N = 13
44	Partially correct	8 ms	21248 KB	Output is partially correct : V - N = 13
45	Partially correct	38 ms	22784 KB	Output is partially correct : V - N = 13
46	Partially correct	123 ms	27140 KB	Output is partially correct : V - N = 13
47	Partially correct	67 ms	24468 KB	Output is partially correct : V - N = 13
48	Partially correct	228 ms	28116 KB	Output is partially correct : V - N = 13
49	Partially correct	35 ms	23040 KB	Output is partially correct : V - N = 13
50	Partially correct	13 ms	22328 KB	Output is partially correct : V - N = 13
51	Partially correct	283 ms	44476 KB	Output is partially correct : V - N = 13
52	Partially correct	8 ms	21780 KB	Output is partially correct : V - N = 13
53	Partially correct	239 ms	43296 KB	Output is partially correct : V - N = 13
54	Partially correct	328 ms	44816 KB	Output is partially correct : V - N = 13
55	Partially correct	22 ms	22564 KB	Output is partially correct : V - N = 13
56	Partially correct	302 ms	33812 KB	Output is partially correct : V - N = 13
57	Partially correct	387 ms	44824 KB	Output is partially correct : V - N = 13
58	Partially correct	74 ms	23288 KB	Output is partially correct : V - N = 13
59	Partially correct	147 ms	27824 KB	Output is partially correct : V - N = 13
60	Partially correct	394 ms	45792 KB	Output is partially correct : V - N = 13
61	Correct	4 ms	20992 KB	Output is correct : V - N = 12
62	Correct	3 ms	21240 KB	Output is correct : V - N = 12
63	Correct	3 ms	20996 KB	Output is correct : V - N = 12
64	Correct	2 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	20992 KB	Output is correct : V - N = 12
67	Correct	4 ms	20996 KB	Output is correct : V - N = 12
68	Correct	4 ms	20996 KB	Output is correct : V - N = 12
69	Correct	5 ms	20996 KB	Output is correct : V - N = 12
70	Correct	4 ms	20996 KB	Output is correct : V - N = 12
71	Correct	4 ms	20996 KB	Output is correct : V - N = 12
72	Correct	3 ms	20996 KB	Output is correct : V - N = 12
73	Correct	4 ms	20992 KB	Output is correct : V - N = 12
74	Correct	3 ms	20996 KB	Output is correct : V - N = 12
75	Correct	4 ms	20996 KB	Output is correct : V - N = 12
76	Correct	3 ms	20992 KB	Output is correct : V - N = 12
77	Correct	3 ms	20992 KB	Output is correct : V - N = 12
78	Correct	3 ms	20996 KB	Output is correct : V - N = 12
79	Correct	4 ms	20992 KB	Output is correct : V - N = 12
80	Correct	4 ms	20996 KB	Output is correct : V - N = 12
81	Correct	4 ms	20996 KB	Output is correct : V - N = 12
82	Correct	4 ms	20996 KB	Output is correct : V - N = 12
83	Correct	3 ms	20996 KB	Output is correct : V - N = 12
84	Correct	3 ms	20992 KB	Output is correct : V - N = 12
85	Correct	3 ms	20996 KB	Output is correct : V - N = 12
86	Correct	4 ms	21172 KB	Output is correct : V - N = 12
87	Correct	4 ms	20996 KB	Output is correct : V - N = 12
88	Correct	4 ms	20996 KB	Output is correct : V - N = 12
89	Correct	3 ms	20996 KB	Output is correct : V - N = 12
90	Correct	3 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	18944 KB	Output is correct : V - N = 12
93	Correct	3 ms	18948 KB	Output is correct : V - N = 12
94	Correct	3 ms	18944 KB	Output is correct : V - N = 12
95	Correct	3 ms	18944 KB	Output is correct : V - N = 12
96	Correct	4 ms	20996 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	20992 KB	Output is correct : V - N = 12
103	Correct	4 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	21000 KB	Output is correct : V - N = 12
106	Correct	3 ms	20996 KB	Output is correct : V - N = 12
107	Correct	4 ms	20984 KB	Output is correct : V - N = 12
108	Correct	4 ms	20992 KB	Output is correct : V - N = 12
109	Correct	4 ms	20992 KB	Output is correct : V - N = 12
110	Correct	3 ms	20996 KB	Output is correct : V - N = 12
111	Correct	4 ms	20928 KB	Output is correct : V - N = 12
112	Correct	3 ms	20988 KB	Output is correct : V - N = 12
113	Correct	3 ms	20996 KB	Output is correct : V - N = 12
114	Correct	3 ms	21000 KB	Output is correct : V - N = 12
115	Correct	3 ms	20996 KB	Output is correct : V - N = 12
116	Correct	3 ms	20996 KB	Output is correct : V - N = 12
117	Correct	4 ms	20996 KB	Output is correct : V - N = 12
118	Correct	3 ms	20992 KB	Output is correct : V - N = 12
119	Correct	3 ms	21112 KB	Output is correct : V - N = 12
120	Correct	4 ms	20992 KB	Output is correct : V - N = 12
121	Correct	4 ms	20996 KB	Output is correct : V - N = 12
122	Correct	3 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	18948 KB	Output is correct : V - N = 12
125	Correct	3 ms	20996 KB	Output is correct : V - N = 12
126	Correct	3 ms	20996 KB	Output is correct : V - N = 12
127	Correct	4 ms	20992 KB	Output is correct : V - N = 12
128	Correct	4 ms	21152 KB	Output is correct : V - N = 12
129	Correct	4 ms	20996 KB	Output is correct : V - N = 12
130	Correct	3 ms	18948 KB	Output is correct : V - N = 12
131	Correct	3 ms	20992 KB	Output is correct : V - N = 12
132	Correct	3 ms	20996 KB	Output is correct : V - N = 12
133	Correct	3 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	20996 KB	Output is correct : V - N = 12
136	Correct	3 ms	20996 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	20996 KB	Output is correct : V - N = 12
140	Correct	3 ms	20996 KB	Output is correct : V - N = 12
141	Correct	3 ms	20996 KB	Output is correct : V - N = 12
142	Correct	3 ms	20996 KB	Output is correct : V - N = 12
143	Correct	3 ms	21012 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	4 ms	20996 KB	Output is correct : V - N = 12
148	Correct	4 ms	20992 KB	Output is correct : V - N = 12
149	Correct	3 ms	20996 KB	Output is correct : V - N = 12
150	Correct	3 ms	18948 KB	Output is correct : V - N = 12
151	Correct	3 ms	18944 KB	Output is correct : V - N = 12
152	Correct	3 ms	18944 KB	Output is correct : V - N = 12
153	Correct	3 ms	18944 KB	Output is correct : V - N = 12
154	Correct	3 ms	18948 KB	Output is correct : V - N = 12
155	Correct	3 ms	18948 KB	Output is correct : V - N = 12
156	Correct	3 ms	20992 KB	Output is correct : V - N = 12
157	Correct	3 ms	20992 KB	Output is correct : V - N = 12
158	Correct	3 ms	20992 KB	Output is correct : V - N = 12
159	Correct	4 ms	20996 KB	Output is correct : V - N = 12
160	Correct	3 ms	20996 KB	Output is correct : V - N = 12
161	Correct	4 ms	20988 KB	Output is correct : V - N = 12
162	Correct	4 ms	20996 KB	Output is correct : V - N = 12
163	Correct	4 ms	20996 KB	Output is correct : V - N = 12
164	Correct	3 ms	19216 KB	Output is correct : V - N = 12
165	Correct	3 ms	18944 KB	Output is correct : V - N = 12
166	Correct	3 ms	20996 KB	Output is correct : V - N = 12
167	Correct	3 ms	20996 KB	Output is correct : V - N = 12
168	Correct	3 ms	20996 KB	Output is correct : V - N = 12
169	Correct	3 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	20996 KB	Output is correct : V - N = 12
175	Correct	3 ms	20996 KB	Output is correct : V - N = 12
176	Correct	3 ms	20996 KB	Output is correct : V - N = 12
177	Correct	3 ms	20996 KB	Output is correct : V - N = 12
178	Correct	3 ms	20996 KB	Output is correct : V - N = 12