oj.uz

Submission #211166

# Submission time Handle Problem Language Result Execution time Memory
211166 2020-03-19T10:46:28 Z Alexa2001 Airline Route Map (JOI18_airline) C++17
100 / 100
 717 ms 31256 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>

using namespace std;

/// 11:18


static vector<pair<int,int>> edges;

static void add_edge(int x, int y)
{
    edges.push_back({x, y});
}

void Alice( int N, int M, int A[], int B[] )
{
    int S1, S2;

    S1 = N+10;
    S2 = N+11;

    add_edge(S1, S2);

    int i, j;
    for(i=0; i<M; ++i)
        add_edge(A[i], B[i]);

    for(i=0; i<N; ++i)
        for(j=0; j<10; ++j)
            if(i & (1<<j))
                add_edge(i, N+j);

    for(i=0; i<10; ++i)
    {
        add_edge(N+i, S1);
        add_edge(N+i, S2);

        if(i) add_edge(N+i, N+i-1);
    }
    add_edge(N+1, N+3);

    InitG(N+12, edges.size());
    int nr = 0;
    for(auto it : edges) MakeG(nr++, it.first, it.second);
}

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

using namespace std;

static int n, V, P[1205];
static vector<pair<int,int>> edges;
static vector<vector<int>> v;
static bitset<1205> bad;


static void add_edge(int x, int y)
{
    edges.push_back({x, y});
}

bool sortt(vector<int> &p)
{
    vector<vector<int>> gr(V);

    for(auto it : p)
        for(auto it2 : p)
            if(find(v[it].begin(), v[it].end(), it2) != v[it].end())
                gr[it].push_back(it2);

    vector<int> sp;
    for(auto it : p)
        if(gr[it].size() == 3) sp.push_back(it);

    if(sp.size() != 2) return 0;

    for(auto it : p)
        if(gr[it].size() != 2 && gr[it].size() != 3 && gr[it].size() != 1) return 0;

    int node = sp[0];
    gr[node].erase(find(gr[node].begin(), gr[node].end(), sp[1]));
    node = sp[1];
    gr[node].erase(find(gr[node].begin(), gr[node].end(), sp[0]));

    vector<int> vec[2];

    for(int step = 0; step < 2; ++step)
    {
        int prv = sp[0];
        node = gr[sp[0]][step];

        while(gr[node].size() == 2)
        {
            vec[step].push_back(node);
            int prr = node;
            node = gr[node][0] ^ gr[node][1] ^ prv;
            prv = prr;
        }

        vec[step].push_back(node);
    }

    if(vec[0].size() > vec[1].size()) swap(vec[0], vec[1]);
    reverse(vec[0].begin(), vec[0].end());

    p.clear();
    p.insert(p.end(), vec[0].begin(), vec[0].end());
    p.insert(p.end(), sp[0]);
    p.insert(p.end(), vec[1].begin(), vec[1].end());

    return 1;
}

bool Try(int A, int B)
{
    if(v[A].size() != 11 || v[B].size() != 11) return 0;

    vector<int> p = v[A];
    p.erase(find(p.begin(), p.end(), B));

    for(auto it : p)
        if(find(v[B].begin(), v[B].end(), it) == v[B].end()) return 0;

    int sum = 0, i, j;
    for(i=0; i<n; ++i)
        for(j=0; j<10; ++j)
            if(i & (1<<j))
                ++sum;

    sum += 20 + 20;

    int sum2 = 0;

    for(auto it : p)
        sum2 += v[it].size();

    if(sum != sum2)  return 0;

    bad.reset();
    edges.clear();

    bad[A] = bad[B] = 1;
    for(auto it : p) bad[it] = 1;

    for(i=0; i<V; ++i)
        for(auto it : v[i])
            if(!bad[i] && !bad[it] && i < it)
                add_edge(i, it);

    if(!sortt(p)) return 0;

    vector<int> where(V);

    for(i=0; i<10; ++i)
        where[p[i]] = i;

    vector<int> all;

    for(i=0; i<V; ++i)
        if(!bad[i])
        {
            P[i] = 0;
            for(auto it : v[i])
                if(bad[it])
                    P[i] ^= (1<<where[it]);
            all.push_back(P[i]);
        }

    sort(all.begin(), all.end());
    assert(all.size() == n);

    for(i=0; i<n; ++i)
        if(all[i] != i) return 0;

    InitMap(n, edges.size());
    for(auto it : edges)
        MakeMap(P[it.first], P[it.second]);
    return 1;
}

void Bob( int _V, int U, int C[], int D[] )
{
    V = _V;
    n = V - 12;

    int i;
    v.resize(V);
    for(i=0; i<U; ++i)
    {
        v[C[i]].push_back(D[i]);
        v[D[i]].push_back(C[i]);
    }

    for(i=0; i<V; ++i)
        for(auto it : v[i])
            if(Try(i, it)) return;
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from Bob.cpp:2:
Bob.cpp: In function 'bool Try(int, int)':
Bob.cpp:125:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(all.size() == n);
            ~~~~~~~~~~~^~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 678 ms 31040 KB Output is correct : V - N = 12
2 Correct 525 ms 26212 KB Output is correct : V - N = 12
3 Correct 207 ms 14200 KB Output is correct : V - N = 12
4 Correct 23 ms 7168 KB Output is correct : V - N = 12
5 Correct 148 ms 11472 KB Output is correct : V - N = 12
6 Correct 480 ms 23852 KB Output is correct : V - N = 12
7 Correct 694 ms 30344 KB Output is correct : V - N = 12
8 Correct 593 ms 28336 KB Output is correct : V - N = 12
9 Correct 310 ms 17760 KB Output is correct : V - N = 12
10 Correct 50 ms 8432 KB Output is correct : V - N = 12
11 Correct 71 ms 9176 KB Output is correct : V - N = 12
12 Correct 356 ms 19232 KB Output is correct : V - N = 12
13 Correct 690 ms 29056 KB Output is correct : V - N = 12
14 Correct 663 ms 29744 KB Output is correct : V - N = 12
15 Correct 385 ms 22852 KB Output is correct : V - N = 12
16 Correct 103 ms 10528 KB Output is correct : V - N = 12
17 Correct 32 ms 7936 KB Output is correct : V - N = 12
18 Correct 270 ms 15992 KB Output is correct : V - N = 12
19 Correct 584 ms 26992 KB Output is correct : V - N = 12
20 Correct 689 ms 30960 KB Output is correct : V - N = 12
21 Correct 193 ms 13536 KB Output is correct : V - N = 12
22 Correct 153 ms 12088 KB Output is correct : V - N = 12
23 Correct 63 ms 9264 KB Output is correct : V - N = 12
24 Correct 16 ms 7168 KB Output is correct : V - N = 12
25 Correct 47 ms 8336 KB Output is correct : V - N = 12
26 Correct 117 ms 11192 KB Output is correct : V - N = 12
27 Correct 197 ms 13440 KB Output is correct : V - N = 12
28 Correct 161 ms 12696 KB Output is correct : V - N = 12
29 Correct 106 ms 10072 KB Output is correct : V - N = 12
30 Correct 19 ms 7424 KB Output is correct : V - N = 12
31 Correct 19 ms 6912 KB Output is correct : V - N = 12
32 Correct 20 ms 6912 KB Output is correct : V - N = 12
33 Correct 18 ms 7168 KB Output is correct : V - N = 12
34 Correct 19 ms 6912 KB Output is correct : V - N = 12
35 Correct 19 ms 6912 KB Output is correct : V - N = 12
36 Correct 706 ms 30792 KB Output is correct : V - N = 12
37 Correct 717 ms 30856 KB Output is correct : V - N = 12
38 Correct 678 ms 30792 KB Output is correct : V - N = 12
39 Correct 707 ms 31048 KB Output is correct : V - N = 12
40 Correct 672 ms 31256 KB Output is correct : V - N = 12
41 Correct 161 ms 11280 KB Output is correct : V - N = 12
42 Correct 103 ms 10376 KB Output is correct : V - N = 12
43 Correct 128 ms 10848 KB Output is correct : V - N = 12
44 Correct 22 ms 7168 KB Output is correct : V - N = 12
45 Correct 77 ms 9344 KB Output is correct : V - N = 12
46 Correct 236 ms 14880 KB Output is correct : V - N = 12
47 Correct 131 ms 11368 KB Output is correct : V - N = 12
48 Correct 336 ms 17656 KB Output is correct : V - N = 12
49 Correct 69 ms 9048 KB Output is correct : V - N = 12
50 Correct 30 ms 7936 KB Output is correct : V - N = 12
51 Correct 528 ms 25828 KB Output is correct : V - N = 12
52 Correct 22 ms 7168 KB Output is correct : V - N = 12
53 Correct 425 ms 23588 KB Output is correct : V - N = 12
54 Correct 587 ms 27536 KB Output is correct : V - N = 12
55 Correct 47 ms 8376 KB Output is correct : V - N = 12
56 Correct 353 ms 18888 KB Output is correct : V - N = 12
57 Correct 617 ms 29424 KB Output is correct : V - N = 12
58 Correct 105 ms 10160 KB Output is correct : V - N = 12
59 Correct 263 ms 15800 KB Output is correct : V - N = 12
60 Correct 657 ms 30136 KB Output is correct : V - N = 12
61 Correct 13 ms 6656 KB Output is correct : V - N = 12
62 Correct 14 ms 6912 KB Output is correct : V - N = 12
63 Correct 13 ms 6656 KB Output is correct : V - N = 12
64 Correct 13 ms 6656 KB Output is correct : V - N = 12
65 Correct 15 ms 6912 KB Output is correct : V - N = 12
66 Correct 13 ms 6912 KB Output is correct : V - N = 12
67 Correct 15 ms 6912 KB Output is correct : V - N = 12
68 Correct 14 ms 6656 KB Output is correct : V - N = 12
69 Correct 13 ms 6656 KB Output is correct : V - N = 12
70 Correct 13 ms 6912 KB Output is correct : V - N = 12
71 Correct 14 ms 6656 KB Output is correct : V - N = 12
72 Correct 13 ms 6656 KB Output is correct : V - N = 12
73 Correct 13 ms 6656 KB Output is correct : V - N = 12
74 Correct 14 ms 6656 KB Output is correct : V - N = 12
75 Correct 13 ms 6656 KB Output is correct : V - N = 12
76 Correct 15 ms 6912 KB Output is correct : V - N = 12
77 Correct 15 ms 6656 KB Output is correct : V - N = 12
78 Correct 13 ms 6656 KB Output is correct : V - N = 12
79 Correct 13 ms 6656 KB Output is correct : V - N = 12
80 Correct 13 ms 6656 KB Output is correct : V - N = 12
81 Correct 13 ms 6656 KB Output is correct : V - N = 12
82 Correct 13 ms 6656 KB Output is correct : V - N = 12
83 Correct 13 ms 6912 KB Output is correct : V - N = 12
84 Correct 13 ms 6912 KB Output is correct : V - N = 12
85 Correct 13 ms 6656 KB Output is correct : V - N = 12
86 Correct 13 ms 6656 KB Output is correct : V - N = 12
87 Correct 14 ms 6912 KB Output is correct : V - N = 12
88 Correct 13 ms 6656 KB Output is correct : V - N = 12
89 Correct 13 ms 6656 KB Output is correct : V - N = 12
90 Correct 13 ms 6656 KB Output is correct : V - N = 12
91 Correct 13 ms 6656 KB Output is correct : V - N = 12
92 Correct 13 ms 6656 KB Output is correct : V - N = 12
93 Correct 13 ms 7168 KB Output is correct : V - N = 12
94 Correct 13 ms 6912 KB Output is correct : V - N = 12
95 Correct 13 ms 6656 KB Output is correct : V - N = 12
96 Correct 14 ms 6656 KB Output is correct : V - N = 12
97 Correct 14 ms 6912 KB Output is correct : V - N = 12
98 Correct 14 ms 6656 KB Output is correct : V - N = 12
99 Correct 13 ms 6656 KB Output is correct : V - N = 12
100 Correct 14 ms 6656 KB Output is correct : V - N = 12
101 Correct 14 ms 6656 KB Output is correct : V - N = 12
102 Correct 13 ms 6912 KB Output is correct : V - N = 12
103 Correct 13 ms 6656 KB Output is correct : V - N = 12
104 Correct 13 ms 6912 KB Output is correct : V - N = 12
105 Correct 14 ms 6912 KB Output is correct : V - N = 12
106 Correct 13 ms 6912 KB Output is correct : V - N = 12
107 Correct 13 ms 6912 KB Output is correct : V - N = 12
108 Correct 13 ms 6656 KB Output is correct : V - N = 12
109 Correct 13 ms 6656 KB Output is correct : V - N = 12
110 Correct 13 ms 6656 KB Output is correct : V - N = 12
111 Correct 14 ms 6656 KB Output is correct : V - N = 12
112 Correct 13 ms 6912 KB Output is correct : V - N = 12
113 Correct 13 ms 6656 KB Output is correct : V - N = 12
114 Correct 13 ms 6656 KB Output is correct : V - N = 12
115 Correct 13 ms 6656 KB Output is correct : V - N = 12
116 Correct 14 ms 6912 KB Output is correct : V - N = 12
117 Correct 14 ms 6656 KB Output is correct : V - N = 12
118 Correct 13 ms 6656 KB Output is correct : V - N = 12
119 Correct 13 ms 6656 KB Output is correct : V - N = 12
120 Correct 13 ms 6656 KB Output is correct : V - N = 12
121 Correct 13 ms 6656 KB Output is correct : V - N = 12
122 Correct 13 ms 6656 KB Output is correct : V - N = 12
123 Correct 13 ms 6656 KB Output is correct : V - N = 12
124 Correct 18 ms 6912 KB Output is correct : V - N = 12
125 Correct 13 ms 6656 KB Output is correct : V - N = 12
126 Correct 13 ms 6656 KB Output is correct : V - N = 12
127 Correct 14 ms 6912 KB Output is correct : V - N = 12
128 Correct 14 ms 6656 KB Output is correct : V - N = 12
129 Correct 13 ms 6656 KB Output is correct : V - N = 12
130 Correct 13 ms 6656 KB Output is correct : V - N = 12
131 Correct 13 ms 6656 KB Output is correct : V - N = 12
132 Correct 13 ms 6656 KB Output is correct : V - N = 12
133 Correct 13 ms 6656 KB Output is correct : V - N = 12
134 Correct 13 ms 6656 KB Output is correct : V - N = 12
135 Correct 15 ms 6912 KB Output is correct : V - N = 12
136 Correct 16 ms 6912 KB Output is correct : V - N = 12
137 Correct 12 ms 6656 KB Output is correct : V - N = 12
138 Correct 17 ms 6656 KB Output is correct : V - N = 12
139 Correct 13 ms 6912 KB Output is correct : V - N = 12
140 Correct 13 ms 6656 KB Output is correct : V - N = 12
141 Correct 13 ms 6656 KB Output is correct : V - N = 12
142 Correct 13 ms 6656 KB Output is correct : V - N = 12
143 Correct 13 ms 6656 KB Output is correct : V - N = 12
144 Correct 13 ms 6656 KB Output is correct : V - N = 12
145 Correct 13 ms 6912 KB Output is correct : V - N = 12
146 Correct 13 ms 6656 KB Output is correct : V - N = 12
147 Correct 13 ms 6656 KB Output is correct : V - N = 12
148 Correct 13 ms 6912 KB Output is correct : V - N = 12
149 Correct 13 ms 6656 KB Output is correct : V - N = 12
150 Correct 15 ms 6656 KB Output is correct : V - N = 12
151 Correct 13 ms 6656 KB Output is correct : V - N = 12
152 Correct 13 ms 6656 KB Output is correct : V - N = 12
153 Correct 13 ms 6656 KB Output is correct : V - N = 12
154 Correct 13 ms 6656 KB Output is correct : V - N = 12
155 Correct 16 ms 6656 KB Output is correct : V - N = 12
156 Correct 13 ms 6656 KB Output is correct : V - N = 12
157 Correct 14 ms 6912 KB Output is correct : V - N = 12
158 Correct 13 ms 6656 KB Output is correct : V - N = 12
159 Correct 16 ms 6656 KB Output is correct : V - N = 12
160 Correct 13 ms 6912 KB Output is correct : V - N = 12
161 Correct 13 ms 6656 KB Output is correct : V - N = 12
162 Correct 13 ms 6912 KB Output is correct : V - N = 12
163 Correct 14 ms 6912 KB Output is correct : V - N = 12
164 Correct 13 ms 6656 KB Output is correct : V - N = 12
165 Correct 13 ms 6656 KB Output is correct : V - N = 12
166 Correct 13 ms 6656 KB Output is correct : V - N = 12
167 Correct 13 ms 6912 KB Output is correct : V - N = 12
168 Correct 13 ms 6656 KB Output is correct : V - N = 12
169 Correct 13 ms 6656 KB Output is correct : V - N = 12
170 Correct 14 ms 6912 KB Output is correct : V - N = 12
171 Correct 13 ms 6912 KB Output is correct : V - N = 12
172 Correct 13 ms 6656 KB Output is correct : V - N = 12
173 Correct 13 ms 6656 KB Output is correct : V - N = 12
174 Correct 13 ms 6656 KB Output is correct : V - N = 12
175 Correct 14 ms 6912 KB Output is correct : V - N = 12
176 Correct 13 ms 6656 KB Output is correct : V - N = 12
177 Correct 13 ms 6912 KB Output is correct : V - N = 12
178 Correct 14 ms 6656 KB Output is correct : V - N = 12