oj.uz

Submission #67529

# Submission time Handle Problem Language Result Execution time Memory
67529 2018-08-14T16:19:59 Z Andrei1998 Airline Route Map (JOI18_airline) C++17
100 / 100
 762 ms 30752 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>

using namespace std;

void Alice(int N, int M, int A[], int B[]) {
    // Graph
    const int V = N + 11;
    vector <pair <int, int> > edges;
    for (int i = 0; i < M; ++ i)
        edges.emplace_back(A[i], B[i]);

    // Encode in binary
    for (int i = 0; i < 10; ++ i) {
        for (int j = 0; j < N; ++ j) {
            if (j & (1 << i)) {
                edges.emplace_back(N + i, j);
            }
        }
        // Add control node edges
        edges.emplace_back(N + 10, N + i);
    }

    // Generate random vector
    mt19937 mt(123);
    uniform_int_distribution <int> dist(0, 1);

    // Add clique
    for (int i = 0; i < 10; ++ i) {
        for (int j = 0; j < i; ++ j) {
            const bool val = dist(mt);
            if (val)
                edges.emplace_back(N + j, N + i);
        }
    }

    // Send graph
    const int U = edges.size();
    InitG(V, U);
    for (int i = 0; i < U; ++ i) {
        MakeG(i, edges[i].first, edges[i].second);
    }
}

#include "Boblib.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long int lint;

const int NMAX = 1100;
bool graphAdjMat[NMAX][NMAX];

void Bob(int V, int U, int C[], int D[]) {
    // Graph
    vector <vector <int> > graph(V, vector <int>());
    for (int i = 0; i < U; ++ i) {
        graph[C[i]].push_back(D[i]);
        graph[D[i]].push_back(C[i]);
        graphAdjMat[C[i]][D[i]] = graphAdjMat[D[i]][C[i]] = true;
    }

    // Map
    const int N = V - 11;
    vector <pair <int, int> > mapEdges;

    mt19937 mt(123);
    uniform_int_distribution <int> dist(0, 1);
    int labels[10][10];
    int degs[10] = {0};
    for (int i = 0; i < 10; ++ i) {
        ++ degs[i];
        for (int j = 0; j < N; ++ j)
            if (j & (1 << i))
                ++ degs[i];
    }

    for (int i = 0; i < 10; ++ i) {
        for (int j = 0; j < i; ++ j) {
            const bool val = dist(mt);
            labels[i][j] = val;
            if (val)
                ++ degs[i], ++ degs[j];
        }
    }

    // Identify helper node
    int node = -1;
    vector <int> v;
    for (int i = 0; i < V; ++ i) {
        if (graph[i].size() == 10) {
            bool found = false;
            function <void(int)> backtr = [&](int pos) {
                if (pos > 0) {
                    if (graph[v.back()].size() != degs[pos - 1])
                        return ;
                    for (int index = 0; index + 1 < pos; ++ index)
                        if (graphAdjMat[v[index]][v[pos - 1]] != labels[pos - 1][index])
                            return ;
                }

                if (pos == 10) {
                    found = true;
                    return ;
                }

                for (int index = 0; index < static_cast <int>(graph[i].size()); ++ index) {
                    if (found)
                        break;
                    const int nd = graph[i][index];
                    swap(graph[i][index], graph[i].back());
                    graph[i].pop_back();
                    v.push_back(nd);
                    backtr(pos + 1);
                    if (!found)
                        v.pop_back();
                    graph[i].push_back(nd);
                    swap(graph[i][index], graph[i].back());
                }
            };

            backtr(0);
            if (found) {
                node = i;
                break;
            }
        }
    }

    // Find shuffle used
    set <int> specials = {node};
    for (int i = 0; i < 10; ++ i) {
        const int node = v[i];
        specials.insert(node);
    }
    vector <int> perm(V);
    for (int i = 0; i < 10; ++ i) {
        const int node = v[i];
        for (auto it: graph[node]) {
            if (!specials.count(it)) {
                perm[it] += (1 << i);
            }
        }
    }
    // Reconstruct edges
    for (int i = 0; i < V; ++ i)
        if (!specials.count(i))
            for (auto it: graph[i])
                if (!specials.count(it) && i < it)
                    mapEdges.push_back(make_pair(perm[i], perm[it]));

    // Send graph
    const int M = mapEdges.size();
    InitMap(N, M);
    for (int i = 0; i < M; ++ i) {
        MakeMap(mapEdges[i].first, mapEdges[i].second);
    }
}

Compilation message

Bob.cpp: In lambda function:
Bob.cpp:52:48: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if (graph[v.back()].size() != degs[pos - 1])
                         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6640 KB Output is correct
2 Correct 7 ms 6640 KB Output is correct
3 Correct 8 ms 6640 KB Output is correct
4 Correct 8 ms 6640 KB Output is correct
5 Correct 8 ms 6640 KB Output is correct
6 Correct 8 ms 6640 KB Output is correct
7 Correct 8 ms 6896 KB Output is correct
8 Correct 8 ms 6896 KB Output is correct
9 Correct 8 ms 6896 KB Output is correct
10 Correct 7 ms 6640 KB Output is correct
11 Correct 8 ms 6736 KB Output is correct
12 Correct 8 ms 6640 KB Output is correct
13 Correct 8 ms 6640 KB Output is correct
14 Correct 7 ms 6640 KB Output is correct
15 Correct 8 ms 6736 KB Output is correct
16 Correct 7 ms 6640 KB Output is correct
17 Correct 8 ms 6736 KB Output is correct
18 Correct 7 ms 6640 KB Output is correct
19 Correct 8 ms 6896 KB Output is correct
20 Correct 8 ms 6896 KB Output is correct
21 Correct 8 ms 6936 KB Output is correct
22 Correct 8 ms 6640 KB Output is correct
23 Correct 8 ms 6640 KB Output is correct
24 Correct 8 ms 6640 KB Output is correct
25 Correct 8 ms 6896 KB Output is correct
26 Correct 8 ms 6640 KB Output is correct
27 Correct 8 ms 6904 KB Output is correct
28 Correct 8 ms 6896 KB Output is correct
29 Correct 8 ms 6896 KB Output is correct
30 Correct 8 ms 6640 KB Output is correct
31 Correct 8 ms 6640 KB Output is correct
32 Correct 7 ms 6640 KB Output is correct
33 Correct 8 ms 6640 KB Output is correct
34 Correct 7 ms 6640 KB Output is correct
35 Correct 8 ms 6896 KB Output is correct
36 Correct 8 ms 6640 KB Output is correct
37 Correct 9 ms 6896 KB Output is correct
38 Correct 8 ms 6640 KB Output is correct
39 Correct 7 ms 6904 KB Output is correct
40 Correct 8 ms 6736 KB Output is correct
41 Correct 7 ms 6896 KB Output is correct
42 Correct 7 ms 6640 KB Output is correct
43 Correct 7 ms 6896 KB Output is correct
44 Correct 6 ms 6640 KB Output is correct
45 Correct 7 ms 6736 KB Output is correct
46 Correct 7 ms 6736 KB Output is correct
47 Correct 7 ms 6736 KB Output is correct
48 Correct 7 ms 6744 KB Output is correct
49 Correct 6 ms 6640 KB Output is correct
50 Correct 8 ms 6632 KB Output is correct
51 Correct 6 ms 6640 KB Output is correct
52 Correct 7 ms 6640 KB Output is correct
53 Correct 6 ms 6640 KB Output is correct
54 Correct 6 ms 6648 KB Output is correct
55 Correct 7 ms 6640 KB Output is correct
56 Correct 7 ms 6576 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 7 ms 6640 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 688 ms 30536 KB Output is correct : V - N = 11
2 Correct 552 ms 26636 KB Output is correct : V - N = 11
3 Correct 199 ms 15028 KB Output is correct : V - N = 11
4 Correct 14 ms 7152 KB Output is correct : V - N = 11
5 Correct 145 ms 11124 KB Output is correct : V - N = 11
6 Correct 458 ms 24800 KB Output is correct : V - N = 11
7 Correct 762 ms 30200 KB Output is correct : V - N = 11
8 Correct 645 ms 28396 KB Output is correct : V - N = 11
9 Correct 285 ms 17172 KB Output is correct : V - N = 11
10 Correct 41 ms 8080 KB Output is correct : V - N = 11
11 Correct 65 ms 9184 KB Output is correct : V - N = 11
12 Correct 352 ms 19272 KB Output is correct : V - N = 11
13 Correct 671 ms 29224 KB Output is correct : V - N = 11
14 Correct 677 ms 29528 KB Output is correct : V - N = 11
15 Correct 370 ms 23676 KB Output is correct : V - N = 11
16 Correct 105 ms 9992 KB Output is correct : V - N = 11
17 Correct 19 ms 7504 KB Output is correct : V - N = 11
18 Correct 283 ms 16052 KB Output is correct : V - N = 11
19 Correct 544 ms 27724 KB Output is correct : V - N = 11
20 Correct 646 ms 30504 KB Output is correct : V - N = 11
21 Correct 193 ms 13016 KB Output is correct : V - N = 11
22 Correct 150 ms 11648 KB Output is correct : V - N = 11
23 Correct 56 ms 8776 KB Output is correct : V - N = 11
24 Correct 9 ms 6896 KB Output is correct : V - N = 11
25 Correct 37 ms 8200 KB Output is correct : V - N = 11
26 Correct 146 ms 10856 KB Output is correct : V - N = 11
27 Correct 175 ms 12944 KB Output is correct : V - N = 11
28 Correct 156 ms 12312 KB Output is correct : V - N = 11
29 Correct 95 ms 9696 KB Output is correct : V - N = 11
30 Correct 20 ms 7248 KB Output is correct : V - N = 11
31 Correct 11 ms 7088 KB Output is correct : V - N = 11
32 Correct 21 ms 6896 KB Output is correct : V - N = 11
33 Correct 11 ms 7152 KB Output is correct : V - N = 11
34 Correct 11 ms 7152 KB Output is correct : V - N = 11
35 Correct 11 ms 7088 KB Output is correct : V - N = 11
36 Correct 666 ms 30752 KB Output is correct : V - N = 11
37 Correct 743 ms 30656 KB Output is correct : V - N = 11
38 Correct 730 ms 30680 KB Output is correct : V - N = 11
39 Correct 755 ms 30648 KB Output is correct : V - N = 11
40 Correct 724 ms 30584 KB Output is correct : V - N = 11
41 Correct 142 ms 10992 KB Output is correct : V - N = 11
42 Correct 102 ms 10192 KB Output is correct : V - N = 11
43 Correct 118 ms 10552 KB Output is correct : V - N = 11
44 Correct 13 ms 6992 KB Output is correct : V - N = 11
45 Correct 81 ms 9152 KB Output is correct : V - N = 11
46 Correct 213 ms 15540 KB Output is correct : V - N = 11
47 Correct 146 ms 11040 KB Output is correct : V - N = 11
48 Correct 310 ms 17412 KB Output is correct : V - N = 11
49 Correct 68 ms 8808 KB Output is correct : V - N = 11
50 Correct 24 ms 7920 KB Output is correct : V - N = 11
51 Correct 526 ms 26812 KB Output is correct : V - N = 11
52 Correct 14 ms 7248 KB Output is correct : V - N = 11
53 Correct 466 ms 24532 KB Output is correct : V - N = 11
54 Correct 603 ms 28112 KB Output is correct : V - N = 11
55 Correct 41 ms 8272 KB Output is correct : V - N = 11
56 Correct 386 ms 18772 KB Output is correct : V - N = 11
57 Correct 646 ms 29272 KB Output is correct : V - N = 11
58 Correct 102 ms 9944 KB Output is correct : V - N = 11
59 Correct 261 ms 16008 KB Output is correct : V - N = 11
60 Correct 705 ms 29808 KB Output is correct : V - N = 11
61 Correct 8 ms 6896 KB Output is correct : V - N = 11
62 Correct 8 ms 6640 KB Output is correct : V - N = 11
63 Correct 8 ms 6744 KB Output is correct : V - N = 11
64 Correct 8 ms 6896 KB Output is correct : V - N = 11
65 Correct 8 ms 6736 KB Output is correct : V - N = 11
66 Correct 8 ms 6640 KB Output is correct : V - N = 11
67 Correct 8 ms 6640 KB Output is correct : V - N = 11
68 Correct 8 ms 6640 KB Output is correct : V - N = 11
69 Correct 8 ms 6640 KB Output is correct : V - N = 11
70 Correct 8 ms 6640 KB Output is correct : V - N = 11
71 Correct 8 ms 6736 KB Output is correct : V - N = 11
72 Correct 8 ms 6592 KB Output is correct : V - N = 11
73 Correct 8 ms 6736 KB Output is correct : V - N = 11
74 Correct 8 ms 6640 KB Output is correct : V - N = 11
75 Correct 8 ms 6640 KB Output is correct : V - N = 11
76 Correct 8 ms 6616 KB Output is correct : V - N = 11
77 Correct 8 ms 6840 KB Output is correct : V - N = 11
78 Correct 8 ms 6792 KB Output is correct : V - N = 11
79 Correct 8 ms 6640 KB Output is correct : V - N = 11
80 Correct 8 ms 6896 KB Output is correct : V - N = 11
81 Correct 8 ms 6640 KB Output is correct : V - N = 11
82 Correct 8 ms 7160 KB Output is correct : V - N = 11
83 Correct 8 ms 6728 KB Output is correct : V - N = 11
84 Correct 8 ms 6640 KB Output is correct : V - N = 11
85 Correct 8 ms 6640 KB Output is correct : V - N = 11
86 Correct 7 ms 6640 KB Output is correct : V - N = 11
87 Correct 9 ms 6896 KB Output is correct : V - N = 11
88 Correct 8 ms 6896 KB Output is correct : V - N = 11
89 Correct 8 ms 6640 KB Output is correct : V - N = 11
90 Correct 8 ms 6640 KB Output is correct : V - N = 11
91 Correct 8 ms 6640 KB Output is correct : V - N = 11
92 Correct 8 ms 6640 KB Output is correct : V - N = 11
93 Correct 8 ms 6896 KB Output is correct : V - N = 11
94 Correct 8 ms 6640 KB Output is correct : V - N = 11
95 Correct 8 ms 6640 KB Output is correct : V - N = 11
96 Correct 8 ms 6904 KB Output is correct : V - N = 11
97 Correct 8 ms 6640 KB Output is correct : V - N = 11
98 Correct 9 ms 6640 KB Output is correct : V - N = 11
99 Correct 8 ms 6896 KB Output is correct : V - N = 11
100 Correct 8 ms 6640 KB Output is correct : V - N = 11
101 Correct 8 ms 6640 KB Output is correct : V - N = 11
102 Correct 8 ms 6896 KB Output is correct : V - N = 11
103 Correct 8 ms 6784 KB Output is correct : V - N = 11
104 Correct 8 ms 6640 KB Output is correct : V - N = 11
105 Correct 8 ms 6640 KB Output is correct : V - N = 11
106 Correct 8 ms 6640 KB Output is correct : V - N = 11
107 Correct 8 ms 6640 KB Output is correct : V - N = 11
108 Correct 8 ms 6648 KB Output is correct : V - N = 11
109 Correct 8 ms 6736 KB Output is correct : V - N = 11
110 Correct 8 ms 6640 KB Output is correct : V - N = 11
111 Correct 8 ms 6736 KB Output is correct : V - N = 11
112 Correct 8 ms 6640 KB Output is correct : V - N = 11
113 Correct 8 ms 6648 KB Output is correct : V - N = 11
114 Correct 8 ms 6896 KB Output is correct : V - N = 11
115 Correct 8 ms 6736 KB Output is correct : V - N = 11
116 Correct 8 ms 6640 KB Output is correct : V - N = 11
117 Correct 7 ms 6696 KB Output is correct : V - N = 11
118 Correct 8 ms 6736 KB Output is correct : V - N = 11
119 Correct 8 ms 6896 KB Output is correct : V - N = 11
120 Correct 8 ms 6896 KB Output is correct : V - N = 11
121 Correct 8 ms 6896 KB Output is correct : V - N = 11
122 Correct 8 ms 6896 KB Output is correct : V - N = 11
123 Correct 7 ms 6640 KB Output is correct : V - N = 11
124 Correct 7 ms 6640 KB Output is correct : V - N = 11
125 Correct 8 ms 6640 KB Output is correct : V - N = 11
126 Correct 8 ms 6896 KB Output is correct : V - N = 11
127 Correct 8 ms 6896 KB Output is correct : V - N = 11
128 Correct 8 ms 6680 KB Output is correct : V - N = 11
129 Correct 7 ms 6896 KB Output is correct : V - N = 11
130 Correct 8 ms 6896 KB Output is correct : V - N = 11
131 Correct 8 ms 6640 KB Output is correct : V - N = 11
132 Correct 8 ms 6640 KB Output is correct : V - N = 11
133 Correct 7 ms 6640 KB Output is correct : V - N = 11
134 Correct 8 ms 6640 KB Output is correct : V - N = 11
135 Correct 8 ms 6640 KB Output is correct : V - N = 11
136 Correct 8 ms 6640 KB Output is correct : V - N = 11
137 Correct 8 ms 6640 KB Output is correct : V - N = 11
138 Correct 7 ms 6744 KB Output is correct : V - N = 11
139 Correct 7 ms 6768 KB Output is correct : V - N = 11
140 Correct 8 ms 6688 KB Output is correct : V - N = 11
141 Correct 8 ms 6896 KB Output is correct : V - N = 11
142 Correct 8 ms 6840 KB Output is correct : V - N = 11
143 Correct 8 ms 6640 KB Output is correct : V - N = 11
144 Correct 8 ms 6736 KB Output is correct : V - N = 11
145 Correct 7 ms 6640 KB Output is correct : V - N = 11
146 Correct 7 ms 6736 KB Output is correct : V - N = 11
147 Correct 8 ms 6736 KB Output is correct : V - N = 11
148 Correct 7 ms 6632 KB Output is correct : V - N = 11
149 Correct 8 ms 6640 KB Output is correct : V - N = 11
150 Correct 8 ms 6736 KB Output is correct : V - N = 11
151 Correct 8 ms 6640 KB Output is correct : V - N = 11
152 Correct 7 ms 6896 KB Output is correct : V - N = 11
153 Correct 8 ms 6640 KB Output is correct : V - N = 11
154 Correct 8 ms 6640 KB Output is correct : V - N = 11
155 Correct 8 ms 6640 KB Output is correct : V - N = 11
156 Correct 8 ms 6640 KB Output is correct : V - N = 11
157 Correct 8 ms 6896 KB Output is correct : V - N = 11
158 Correct 8 ms 6736 KB Output is correct : V - N = 11
159 Correct 8 ms 6624 KB Output is correct : V - N = 11
160 Correct 8 ms 6640 KB Output is correct : V - N = 11
161 Correct 7 ms 6680 KB Output is correct : V - N = 11
162 Correct 8 ms 6640 KB Output is correct : V - N = 11
163 Correct 8 ms 6896 KB Output is correct : V - N = 11
164 Correct 8 ms 6984 KB Output is correct : V - N = 11
165 Correct 8 ms 6672 KB Output is correct : V - N = 11
166 Correct 8 ms 6896 KB Output is correct : V - N = 11
167 Correct 7 ms 6896 KB Output is correct : V - N = 11
168 Correct 7 ms 6640 KB Output is correct : V - N = 11
169 Correct 8 ms 6632 KB Output is correct : V - N = 11
170 Correct 6 ms 6896 KB Output is correct : V - N = 11
171 Correct 8 ms 6928 KB Output is correct : V - N = 11
172 Correct 7 ms 6648 KB Output is correct : V - N = 11
173 Correct 7 ms 6736 KB Output is correct : V - N = 11
174 Correct 8 ms 6736 KB Output is correct : V - N = 11
175 Correct 9 ms 6896 KB Output is correct : V - N = 11
176 Correct 8 ms 6640 KB Output is correct : V - N = 11
177 Correct 7 ms 6640 KB Output is correct : V - N = 11
178 Correct 7 ms 6896 KB Output is correct : V - N = 11