oj.uz

답안 #747664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747664 2023-05-24T12:53:22 Z finn__ 항공 노선도 (JOI18_airline) C++17
100 / 100
 654 ms 29344 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;

void Alice(int N, int M, int A[], int B[])
{
    if (N == 1)
    {
        InitG(1, 0);
        return;
    }
    vector<pair<int, int>> edges;
    for (size_t i = 0; i < M; ++i)
        edges.emplace_back(A[i], B[i]);
    for (size_t i = 0; i < N; ++i)
        for (size_t j = 0; j < 10; ++j)
            if (i & (1 << j))
                edges.emplace_back(i, N + j);
    for (size_t i = 0; i < 10; ++i)
    {
        edges.emplace_back(N + i, N + 10);
        if (i < 9)
            edges.emplace_back(N + i, N + i + 1);
        if (i)
            edges.emplace_back(N + i, N + 11);
    }
    InitG(N + 12, edges.size());
    for (size_t i = 0; i < edges.size(); ++i)
        MakeG(i, edges[i].first, edges[i].second);
}

#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;

void Bob(int V, int U, int C[], int D[])
{
    if (V == 1)
    {
        InitMap(1, 0);
        return;
    }
    vector<vector<int>> G(V);
    for (size_t i = 0; i < U; ++i)
        G[C[i]].push_back(D[i]), G[D[i]].push_back(C[i]);

    int x = -1, y = -1;
    vector<int> d(V);
    for (size_t i = 0; i < V; ++i)
        if (G[i].size() == 10)
        {
            fill(d.begin(), d.end(), 0);
            int e[2] = {0, 0};
            bool possible = 1;
            for (auto const &j : G[i])
            {
                for (auto const &v : G[j])
                    if (find(G[i].begin(), G[i].end(), v) != G[i].end())
                        d[j]++;
                if (d[j] != 1 && d[j] != 2)
                {
                    possible = 0;
                    break;
                }
                e[d[j] - 1]++;
            }
            if (!possible || e[0] != 2 || e[1] != 8)
                continue;
            x = i;
            break;
        }
    vector<int> bit_vertices;
    for (size_t i = 0; i < V; ++i)
        if (G[i].size() == 9)
        {
            int v0 = -1;
            bool possible = 1;
            for (auto const &j : G[x])
                if (find(G[i].begin(), G[i].end(), j) == G[i].end())
                {
                    if (v0 != -1)
                        possible = 0;
                    v0 = j;
                }
            if (v0 == -1 || !possible || d[v0] != 1)
                continue;
            bit_vertices.clear();
            bit_vertices.push_back(v0);
            int last = -1;
            for (size_t k = 0; k < 9; ++k)
            {
                int v1 = -1;
                for (auto const &j : G[v0])
                    if (j != last && find(G[i].begin(), G[i].end(), j) != G[i].end())
                    {
                        if (v1 != -1)
                            possible = 0;
                        v1 = j;
                    }
                if (v1 == -1)
                {
                    possible = 0;
                    break;
                }
                last = v0;
                v0 = v1;
                bit_vertices.push_back(v0);
            }
            if (!possible || bit_vertices.size() != 10)
                continue;
            y = i;
            break;
        }

    vector<int> p(V);
    for (size_t i = 0; i < V; ++i)
        if (i != x && i != y && find(bit_vertices.begin(), bit_vertices.end(), i) == bit_vertices.end())
            for (auto const &v : G[i])
            {
                size_t const k = find(bit_vertices.begin(), bit_vertices.end(), v) - bit_vertices.begin();
                if (k != 10)
                    p[i] |= 1 << k;
            }
    vector<pair<int, int>> edges;
    for (size_t i = 0; i < V; ++i)
        if (i != x && i != y && find(bit_vertices.begin(), bit_vertices.end(), i) == bit_vertices.end())
            for (auto const &v : G[i])
                if (find(bit_vertices.begin(), bit_vertices.end(), v) == bit_vertices.end() && i < v)
                    edges.emplace_back(p[i], p[v]);
    InitMap(V - 12, edges.size());
    for (auto const &[u, v] : edges)
        MakeMap(u, v);
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:13:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     for (size_t i = 0; i < M; ++i)
      |                        ~~^~~
Alice.cpp:15:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |     for (size_t i = 0; i < N; ++i)
      |                        ~~^~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:13:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     for (size_t i = 0; i < U; ++i)
      |                        ~~^~~
Bob.cpp:18:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |     for (size_t i = 0; i < V; ++i)
      |                        ~~^~~
Bob.cpp:42:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |     for (size_t i = 0; i < V; ++i)
      |                        ~~^~~
Bob.cpp:85:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |     for (size_t i = 0; i < V; ++i)
      |                        ~~^~~
Bob.cpp:86:15: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |         if (i != x && i != y && find(bit_vertices.begin(), bit_vertices.end(), i) == bit_vertices.end())
      |             ~~^~~~
Bob.cpp:86:25: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |         if (i != x && i != y && find(bit_vertices.begin(), bit_vertices.end(), i) == bit_vertices.end())
      |                       ~~^~~~
Bob.cpp:94:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   94 |     for (size_t i = 0; i < V; ++i)
      |                        ~~^~~
Bob.cpp:95:15: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |         if (i != x && i != y && find(bit_vertices.begin(), bit_vertices.end(), i) == bit_vertices.end())
      |             ~~^~~~
Bob.cpp:95:25: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |         if (i != x && i != y && find(bit_vertices.begin(), bit_vertices.end(), i) == bit_vertices.end())
      |                       ~~^~~~
Bob.cpp:97:98: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   97 |                 if (find(bit_vertices.begin(), bit_vertices.end(), v) == bit_vertices.end() && i < v)
      |                                                                                                ~~^~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4592 KB Output is correct
2 Correct 3 ms 4612 KB Output is correct
3 Correct 3 ms 4612 KB Output is correct
4 Correct 3 ms 4600 KB Output is correct
5 Correct 3 ms 4708 KB Output is correct
6 Correct 3 ms 4612 KB Output is correct
7 Correct 3 ms 4612 KB Output is correct
8 Correct 3 ms 4620 KB Output is correct
9 Correct 3 ms 4612 KB Output is correct
10 Correct 3 ms 4608 KB Output is correct
11 Correct 2 ms 4596 KB Output is correct
12 Correct 3 ms 4620 KB Output is correct
13 Correct 3 ms 4612 KB Output is correct
14 Correct 3 ms 4620 KB Output is correct
15 Correct 2 ms 4612 KB Output is correct
16 Correct 3 ms 4612 KB Output is correct
17 Correct 3 ms 4612 KB Output is correct
18 Correct 2 ms 4612 KB Output is correct
19 Correct 2 ms 4612 KB Output is correct
20 Correct 3 ms 4608 KB Output is correct
21 Correct 3 ms 4612 KB Output is correct
22 Correct 2 ms 4620 KB Output is correct
23 Correct 3 ms 4516 KB Output is correct
24 Correct 3 ms 4608 KB Output is correct
25 Correct 3 ms 4576 KB Output is correct
26 Correct 3 ms 4612 KB Output is correct
27 Correct 3 ms 4612 KB Output is correct
28 Correct 3 ms 4612 KB Output is correct
29 Correct 3 ms 4612 KB Output is correct
30 Correct 2 ms 4616 KB Output is correct
31 Correct 2 ms 4540 KB Output is correct
32 Correct 3 ms 4588 KB Output is correct
33 Correct 2 ms 4608 KB Output is correct
34 Correct 2 ms 4608 KB Output is correct
35 Correct 3 ms 4608 KB Output is correct
36 Correct 2 ms 4612 KB Output is correct
37 Correct 3 ms 4604 KB Output is correct
38 Correct 3 ms 4612 KB Output is correct
39 Correct 3 ms 4612 KB Output is correct
40 Correct 2 ms 4612 KB Output is correct
41 Correct 3 ms 4620 KB Output is correct
42 Correct 3 ms 4696 KB Output is correct
43 Correct 3 ms 4516 KB Output is correct
44 Correct 2 ms 4616 KB Output is correct
45 Correct 3 ms 4564 KB Output is correct
46 Correct 3 ms 4620 KB Output is correct
47 Correct 3 ms 4624 KB Output is correct
48 Correct 3 ms 4540 KB Output is correct
49 Correct 3 ms 4588 KB Output is correct
50 Correct 2 ms 4608 KB Output is correct
51 Correct 2 ms 4668 KB Output is correct
52 Correct 2 ms 4612 KB Output is correct
53 Correct 3 ms 4608 KB Output is correct
54 Correct 2 ms 4612 KB Output is correct
55 Correct 2 ms 4592 KB Output is correct
56 Correct 3 ms 4612 KB Output is correct
57 Correct 2 ms 4612 KB Output is correct
58 Correct 3 ms 4608 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4592 KB Output is correct
2 Correct 3 ms 4612 KB Output is correct
3 Correct 3 ms 4612 KB Output is correct
4 Correct 3 ms 4600 KB Output is correct
5 Correct 3 ms 4708 KB Output is correct
6 Correct 3 ms 4612 KB Output is correct
7 Correct 3 ms 4612 KB Output is correct
8 Correct 3 ms 4620 KB Output is correct
9 Correct 3 ms 4612 KB Output is correct
10 Correct 3 ms 4608 KB Output is correct
11 Correct 2 ms 4596 KB Output is correct
12 Correct 3 ms 4620 KB Output is correct
13 Correct 3 ms 4612 KB Output is correct
14 Correct 3 ms 4620 KB Output is correct
15 Correct 2 ms 4612 KB Output is correct
16 Correct 3 ms 4612 KB Output is correct
17 Correct 3 ms 4612 KB Output is correct
18 Correct 2 ms 4612 KB Output is correct
19 Correct 2 ms 4612 KB Output is correct
20 Correct 3 ms 4608 KB Output is correct
21 Correct 3 ms 4612 KB Output is correct
22 Correct 2 ms 4620 KB Output is correct
23 Correct 3 ms 4516 KB Output is correct
24 Correct 3 ms 4608 KB Output is correct
25 Correct 3 ms 4576 KB Output is correct
26 Correct 3 ms 4612 KB Output is correct
27 Correct 3 ms 4612 KB Output is correct
28 Correct 3 ms 4612 KB Output is correct
29 Correct 3 ms 4612 KB Output is correct
30 Correct 2 ms 4616 KB Output is correct
31 Correct 2 ms 4540 KB Output is correct
32 Correct 3 ms 4588 KB Output is correct
33 Correct 2 ms 4608 KB Output is correct
34 Correct 2 ms 4608 KB Output is correct
35 Correct 3 ms 4608 KB Output is correct
36 Correct 2 ms 4612 KB Output is correct
37 Correct 3 ms 4604 KB Output is correct
38 Correct 3 ms 4612 KB Output is correct
39 Correct 3 ms 4612 KB Output is correct
40 Correct 2 ms 4612 KB Output is correct
41 Correct 3 ms 4620 KB Output is correct
42 Correct 3 ms 4696 KB Output is correct
43 Correct 3 ms 4516 KB Output is correct
44 Correct 2 ms 4616 KB Output is correct
45 Correct 3 ms 4564 KB Output is correct
46 Correct 3 ms 4620 KB Output is correct
47 Correct 3 ms 4624 KB Output is correct
48 Correct 3 ms 4540 KB Output is correct
49 Correct 3 ms 4588 KB Output is correct
50 Correct 2 ms 4608 KB Output is correct
51 Correct 2 ms 4668 KB Output is correct
52 Correct 2 ms 4612 KB Output is correct
53 Correct 3 ms 4608 KB Output is correct
54 Correct 2 ms 4612 KB Output is correct
55 Correct 2 ms 4592 KB Output is correct
56 Correct 3 ms 4612 KB Output is correct
57 Correct 2 ms 4612 KB Output is correct
58 Correct 3 ms 4608 KB Output is correct
59 Correct 3 ms 4748 KB Output is correct
60 Correct 3 ms 4612 KB Output is correct
61 Correct 3 ms 4624 KB Output is correct
62 Correct 3 ms 4612 KB Output is correct
63 Correct 3 ms 4612 KB Output is correct
64 Correct 3 ms 4740 KB Output is correct
65 Correct 3 ms 4712 KB Output is correct
66 Correct 3 ms 4612 KB Output is correct
67 Correct 3 ms 4616 KB Output is correct
68 Correct 3 ms 4612 KB Output is correct
69 Correct 3 ms 4620 KB Output is correct
70 Correct 3 ms 4612 KB Output is correct
71 Correct 3 ms 4720 KB Output is correct
72 Correct 3 ms 4748 KB Output is correct
73 Correct 3 ms 4740 KB Output is correct
74 Correct 3 ms 4612 KB Output is correct
75 Correct 3 ms 4620 KB Output is correct
76 Correct 3 ms 4596 KB Output is correct
77 Correct 3 ms 4740 KB Output is correct
78 Correct 3 ms 4752 KB Output is correct
79 Correct 3 ms 4748 KB Output is correct
80 Correct 3 ms 4612 KB Output is correct
81 Correct 3 ms 4516 KB Output is correct
82 Correct 3 ms 4592 KB Output is correct
83 Correct 3 ms 4612 KB Output is correct
84 Correct 3 ms 4592 KB Output is correct
85 Correct 4 ms 4592 KB Output is correct
86 Correct 3 ms 4720 KB Output is correct
87 Correct 3 ms 4608 KB Output is correct
88 Correct 3 ms 4608 KB Output is correct
89 Correct 3 ms 4672 KB Output is correct
90 Correct 3 ms 4608 KB Output is correct
91 Correct 3 ms 4540 KB Output is correct
92 Correct 3 ms 4608 KB Output is correct
93 Correct 4 ms 4608 KB Output is correct
94 Correct 3 ms 4740 KB Output is correct
95 Correct 4 ms 4740 KB Output is correct
96 Correct 3 ms 4740 KB Output is correct
97 Correct 6 ms 4780 KB Output is correct
98 Correct 3 ms 4760 KB Output is correct
99 Correct 4 ms 4552 KB Output is correct
100 Correct 3 ms 4612 KB Output is correct
101 Correct 3 ms 4612 KB Output is correct
102 Correct 3 ms 4584 KB Output is correct
103 Correct 4 ms 4516 KB Output is correct
104 Correct 3 ms 4612 KB Output is correct
105 Correct 3 ms 4620 KB Output is correct
106 Correct 3 ms 4696 KB Output is correct
107 Correct 3 ms 4612 KB Output is correct
108 Correct 3 ms 4644 KB Output is correct
109 Correct 3 ms 4596 KB Output is correct
110 Correct 3 ms 4612 KB Output is correct
111 Correct 3 ms 4612 KB Output is correct
112 Correct 3 ms 4612 KB Output is correct
113 Correct 3 ms 4552 KB Output is correct
114 Correct 3 ms 4612 KB Output is correct
115 Correct 3 ms 4640 KB Output is correct
116 Correct 3 ms 4608 KB Output is correct
117 Correct 3 ms 4612 KB Output is correct
118 Correct 3 ms 4536 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 613 ms 29120 KB Output is correct : V - N = 12
2 Correct 410 ms 25592 KB Output is correct : V - N = 12
3 Correct 227 ms 13776 KB Output is correct : V - N = 12
4 Correct 10 ms 5128 KB Output is correct : V - N = 12
5 Correct 94 ms 9960 KB Output is correct : V - N = 12
6 Correct 337 ms 23616 KB Output is correct : V - N = 12
7 Correct 630 ms 28880 KB Output is correct : V - N = 12
8 Correct 554 ms 27248 KB Output is correct : V - N = 12
9 Correct 242 ms 16052 KB Output is correct : V - N = 12
10 Correct 39 ms 6300 KB Output is correct : V - N = 12
11 Correct 66 ms 7392 KB Output is correct : V - N = 12
12 Correct 327 ms 18152 KB Output is correct : V - N = 12
13 Correct 526 ms 28064 KB Output is correct : V - N = 12
14 Correct 569 ms 28524 KB Output is correct : V - N = 12
15 Correct 308 ms 22440 KB Output is correct : V - N = 12
16 Correct 88 ms 8172 KB Output is correct : V - N = 12
17 Correct 19 ms 5668 KB Output is correct : V - N = 12
18 Correct 234 ms 14848 KB Output is correct : V - N = 12
19 Correct 437 ms 26628 KB Output is correct : V - N = 12
20 Correct 510 ms 29128 KB Output is correct : V - N = 12
21 Correct 206 ms 12068 KB Output is correct : V - N = 12
22 Correct 107 ms 10328 KB Output is correct : V - N = 12
23 Correct 47 ms 7328 KB Output is correct : V - N = 12
24 Correct 5 ms 4872 KB Output is correct : V - N = 12
25 Correct 28 ms 6272 KB Output is correct : V - N = 12
26 Correct 128 ms 9796 KB Output is correct : V - N = 12
27 Correct 189 ms 11236 KB Output is correct : V - N = 12
28 Correct 146 ms 10756 KB Output is correct : V - N = 12
29 Correct 90 ms 7808 KB Output is correct : V - N = 12
30 Correct 11 ms 5352 KB Output is correct : V - N = 12
31 Correct 6 ms 4924 KB Output is correct : V - N = 12
32 Correct 7 ms 4992 KB Output is correct : V - N = 12
33 Correct 8 ms 4924 KB Output is correct : V - N = 12
34 Correct 6 ms 4968 KB Output is correct : V - N = 12
35 Correct 8 ms 5000 KB Output is correct : V - N = 12
36 Correct 573 ms 29144 KB Output is correct : V - N = 12
37 Correct 597 ms 29132 KB Output is correct : V - N = 12
38 Correct 637 ms 29244 KB Output is correct : V - N = 12
39 Correct 613 ms 29152 KB Output is correct : V - N = 12
40 Correct 654 ms 29344 KB Output is correct : V - N = 12
41 Correct 96 ms 9788 KB Output is correct : V - N = 12
42 Correct 76 ms 8612 KB Output is correct : V - N = 12
43 Correct 77 ms 9476 KB Output is correct : V - N = 12
44 Correct 9 ms 5076 KB Output is correct : V - N = 12
45 Correct 53 ms 7440 KB Output is correct : V - N = 12
46 Correct 177 ms 14220 KB Output is correct : V - N = 12
47 Correct 99 ms 9784 KB Output is correct : V - N = 12
48 Correct 241 ms 16288 KB Output is correct : V - N = 12
49 Correct 45 ms 7184 KB Output is correct : V - N = 12
50 Correct 20 ms 5664 KB Output is correct : V - N = 12
51 Correct 411 ms 25536 KB Output is correct : V - N = 12
52 Correct 9 ms 5052 KB Output is correct : V - N = 12
53 Correct 388 ms 23508 KB Output is correct : V - N = 12
54 Correct 500 ms 27028 KB Output is correct : V - N = 12
55 Correct 40 ms 6384 KB Output is correct : V - N = 12
56 Correct 327 ms 17604 KB Output is correct : V - N = 12
57 Correct 490 ms 28332 KB Output is correct : V - N = 12
58 Correct 97 ms 8236 KB Output is correct : V - N = 12
59 Correct 223 ms 14828 KB Output is correct : V - N = 12
60 Correct 550 ms 28652 KB Output is correct : V - N = 12
61 Correct 3 ms 4740 KB Output is correct : V - N = 12
62 Correct 4 ms 4608 KB Output is correct : V - N = 12
63 Correct 3 ms 4612 KB Output is correct : V - N = 12
64 Correct 3 ms 4612 KB Output is correct : V - N = 12
65 Correct 3 ms 4612 KB Output is correct : V - N = 12
66 Correct 3 ms 4612 KB Output is correct : V - N = 12
67 Correct 3 ms 4620 KB Output is correct : V - N = 12
68 Correct 3 ms 4740 KB Output is correct : V - N = 12
69 Correct 3 ms 4612 KB Output is correct : V - N = 12
70 Correct 3 ms 4564 KB Output is correct : V - N = 12
71 Correct 3 ms 4592 KB Output is correct : V - N = 12
72 Correct 3 ms 4516 KB Output is correct : V - N = 12
73 Correct 3 ms 4640 KB Output is correct : V - N = 12
74 Correct 3 ms 4620 KB Output is correct : V - N = 12
75 Correct 3 ms 4624 KB Output is correct : V - N = 12
76 Correct 3 ms 4612 KB Output is correct : V - N = 12
77 Correct 3 ms 4676 KB Output is correct : V - N = 12
78 Correct 3 ms 4612 KB Output is correct : V - N = 12
79 Correct 3 ms 4552 KB Output is correct : V - N = 12
80 Correct 3 ms 4680 KB Output is correct : V - N = 12
81 Correct 3 ms 4612 KB Output is correct : V - N = 12
82 Correct 3 ms 4612 KB Output is correct : V - N = 12
83 Correct 3 ms 4620 KB Output is correct : V - N = 12
84 Correct 3 ms 4540 KB Output is correct : V - N = 12
85 Correct 3 ms 4592 KB Output is correct : V - N = 12
86 Correct 3 ms 4612 KB Output is correct : V - N = 12
87 Correct 4 ms 4640 KB Output is correct : V - N = 12
88 Correct 3 ms 4720 KB Output is correct : V - N = 12
89 Correct 3 ms 4620 KB Output is correct : V - N = 12
90 Correct 3 ms 4580 KB Output is correct : V - N = 12
91 Correct 3 ms 4516 KB Output is correct : V - N = 12
92 Correct 3 ms 4608 KB Output is correct : V - N = 12
93 Correct 3 ms 4608 KB Output is correct : V - N = 12
94 Correct 3 ms 4608 KB Output is correct : V - N = 12
95 Correct 2 ms 4608 KB Output is correct : V - N = 12
96 Correct 4 ms 4740 KB Output is correct : V - N = 12
97 Correct 4 ms 4744 KB Output is correct : V - N = 12
98 Correct 2 ms 4748 KB Output is correct : V - N = 12
99 Correct 3 ms 4740 KB Output is correct : V - N = 12
100 Correct 3 ms 4640 KB Output is correct : V - N = 12
101 Correct 3 ms 4516 KB Output is correct : V - N = 12
102 Correct 2 ms 4620 KB Output is correct : V - N = 12
103 Correct 2 ms 4612 KB Output is correct : V - N = 12
104 Correct 3 ms 4608 KB Output is correct : V - N = 12
105 Correct 2 ms 4612 KB Output is correct : V - N = 12
106 Correct 3 ms 4612 KB Output is correct : V - N = 12
107 Correct 3 ms 4608 KB Output is correct : V - N = 12
108 Correct 3 ms 4540 KB Output is correct : V - N = 12
109 Correct 3 ms 4612 KB Output is correct : V - N = 12
110 Correct 2 ms 4620 KB Output is correct : V - N = 12
111 Correct 3 ms 4748 KB Output is correct : V - N = 12
112 Correct 3 ms 4612 KB Output is correct : V - N = 12
113 Correct 2 ms 4612 KB Output is correct : V - N = 12
114 Correct 3 ms 4512 KB Output is correct : V - N = 12
115 Correct 3 ms 4612 KB Output is correct : V - N = 12
116 Correct 3 ms 4592 KB Output is correct : V - N = 12
117 Correct 3 ms 4740 KB Output is correct : V - N = 12
118 Correct 3 ms 4568 KB Output is correct : V - N = 12
119 Correct 4 ms 4540 KB Output is correct : V - N = 12
120 Correct 2 ms 4612 KB Output is correct : V - N = 12
121 Correct 3 ms 4612 KB Output is correct : V - N = 12
122 Correct 2 ms 4612 KB Output is correct : V - N = 12
123 Correct 3 ms 4612 KB Output is correct : V - N = 12
124 Correct 3 ms 4584 KB Output is correct : V - N = 12
125 Correct 3 ms 4596 KB Output is correct : V - N = 12
126 Correct 3 ms 4604 KB Output is correct : V - N = 12
127 Correct 3 ms 4612 KB Output is correct : V - N = 12
128 Correct 3 ms 4652 KB Output is correct : V - N = 12
129 Correct 3 ms 4612 KB Output is correct : V - N = 12
130 Correct 3 ms 4732 KB Output is correct : V - N = 12
131 Correct 3 ms 4668 KB Output is correct : V - N = 12
132 Correct 3 ms 4612 KB Output is correct : V - N = 12
133 Correct 3 ms 4552 KB Output is correct : V - N = 12
134 Correct 3 ms 4608 KB Output is correct : V - N = 12
135 Correct 3 ms 4612 KB Output is correct : V - N = 12
136 Correct 3 ms 4540 KB Output is correct : V - N = 12
137 Correct 3 ms 4540 KB Output is correct : V - N = 12
138 Correct 3 ms 4612 KB Output is correct : V - N = 12
139 Correct 3 ms 4612 KB Output is correct : V - N = 12
140 Correct 3 ms 4608 KB Output is correct : V - N = 12
141 Correct 3 ms 4620 KB Output is correct : V - N = 12
142 Correct 3 ms 4620 KB Output is correct : V - N = 12
143 Correct 2 ms 4620 KB Output is correct : V - N = 12
144 Correct 3 ms 4616 KB Output is correct : V - N = 12
145 Correct 3 ms 4612 KB Output is correct : V - N = 12
146 Correct 3 ms 4612 KB Output is correct : V - N = 12
147 Correct 2 ms 4612 KB Output is correct : V - N = 12
148 Correct 3 ms 4620 KB Output is correct : V - N = 12
149 Correct 3 ms 4612 KB Output is correct : V - N = 12
150 Correct 3 ms 4516 KB Output is correct : V - N = 12
151 Correct 3 ms 4540 KB Output is correct : V - N = 12
152 Correct 2 ms 4604 KB Output is correct : V - N = 12
153 Correct 3 ms 4608 KB Output is correct : V - N = 12
154 Correct 3 ms 4612 KB Output is correct : V - N = 12
155 Correct 3 ms 4552 KB Output is correct : V - N = 12
156 Correct 2 ms 4616 KB Output is correct : V - N = 12
157 Correct 3 ms 4612 KB Output is correct : V - N = 12
158 Correct 3 ms 4612 KB Output is correct : V - N = 12
159 Correct 3 ms 4612 KB Output is correct : V - N = 12
160 Correct 3 ms 4620 KB Output is correct : V - N = 12
161 Correct 3 ms 4608 KB Output is correct : V - N = 12
162 Correct 3 ms 4612 KB Output is correct : V - N = 12
163 Correct 3 ms 4612 KB Output is correct : V - N = 12
164 Correct 3 ms 4616 KB Output is correct : V - N = 12
165 Correct 3 ms 4608 KB Output is correct : V - N = 12
166 Correct 3 ms 4540 KB Output is correct : V - N = 12
167 Correct 2 ms 4612 KB Output is correct : V - N = 12
168 Correct 3 ms 4592 KB Output is correct : V - N = 12
169 Correct 3 ms 4516 KB Output is correct : V - N = 12
170 Correct 3 ms 4608 KB Output is correct : V - N = 12
171 Correct 3 ms 4592 KB Output is correct : V - N = 0
172 Correct 1 ms 4624 KB Output is correct : V - N = 12
173 Correct 2 ms 4616 KB Output is correct : V - N = 12
174 Correct 3 ms 4588 KB Output is correct : V - N = 12
175 Correct 4 ms 4516 KB Output is correct : V - N = 12
176 Correct 3 ms 4540 KB Output is correct : V - N = 12
177 Correct 2 ms 4592 KB Output is correct : V - N = 12
178 Correct 3 ms 4612 KB Output is correct : V - N = 12