oj.uz

Submission #991851

# Submission time Handle Problem Language Result Execution time Memory
991851 2024-06-03T08:52:02 Z danikoynov Airline Route Map (JOI18_airline) C++14
100 / 100
 518 ms 72516 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include<bits/stdc++.h>

using namespace std;

const int maxn = 2e3 + 10;
const int maxbit = 10;
const int fict = 2;
/**
from 0 to N - 1 : normal vertexes
from N to N + maxbit - 1 : binary powers
from N + maxbit to N + maxbit + fict - 1 : fictitious vertexes
vertex N + maxbit is connected to all except the binary powers

*/
int dd[maxn];
void Alice( int N, int M, int A[], int B[] )
{
    if (N == 1 && M == 0)
    {
        InitG(1, 0);
        return;
    }
    vector < pair < int, int > > edges;
    for (int i = 0; i < M; i ++)
    {
        dd[A[i]] ++;
        dd[B[i]] ++;
        edges.push_back({A[i], B[i]});
    }
    for (int i = 0; i < N; i ++)
    {
        for (int bit = 0; bit < maxbit; bit ++)
        {
            if ((i & (1 << bit)) > 0)
            {
                edges.push_back({i, N + bit});
                dd[i] ++;
            }
        }


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




    for (int i = N + 1; i < N + maxbit; i ++)
        edges.push_back({i - 1, i});

    InitG(N + maxbit + fict, edges.size());
    int cnt = 0;
    for (pair < int, int > cur : edges)
    {
        MakeG(cnt ++, cur.first, cur.second);
    }
}

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

using namespace std;

const int MAXN = 2e3 + 10;
struct edge
{
    int v, u;

    edge(int _v = 0, int _u = 0)
    {
        v = _v;
        u = _u;
    }
}edges[MAXN * MAXN];

int deg[MAXN], non_bin[MAXN];
vector < int > adj[MAXN];
int value[MAXN], ridx[MAXN];
vector < int > path;
void dfs(int v, int p)
{
    path.push_back(v);
    for (int u : adj[v])
    {
        if (u == p)
            continue;
        dfs(u, v);
    }
}

const int MAXBIT = 10;
const int FICT = 2;

int tf[MAXN];
void Bob( int V, int U, int C[], int D[] )
{
    if (V == 1 && U == 0)
    {
        InitMap(1, 0);
        return;
    }
    for (int i = 0; i < U; i ++)
    {
        edges[i] = edge(C[i], D[i]);
        deg[C[i]] ++;
        deg[D[i]] ++;
        //cout << C[i] << " " << D[i] << endl;

    }
    ///exit(0);

    int mx = 0;
    for (int i = 0; i < V; i ++)
        if (deg[i] > deg[mx])
        mx = i;

    int c = 0;
    for (int i = 0; i < V; i ++)
        if (deg[i] == deg[mx])
        c ++;
    if (c > 1)
        while(true);

    for (int i = 0; i < U; i ++)
    {
        if (C[i] == mx)
            tf[D[i]] = 1;
        else
        if (D[i] == mx)
            tf[C[i]] = 1;
    }

    tf[mx] = 1;
    int fx = 0;
    while(tf[fx] == 1)
        fx ++;


        for (int i = 0; i < V; i ++)
            non_bin[i] = 1;

        for (int i = 0; i < U; i ++)
    {
        if (C[i] == fx)
            non_bin[D[i]] = 0;
        else
        if (D[i] == fx)
            non_bin[C[i]] = 0;
    }


    int cnt = 0;
    for (int i = 0; i < U; i ++)
    {
        if (non_bin[C[i]] || non_bin[D[i]])
            continue;

        adj[C[i]].push_back(D[i]);
        adj[D[i]].push_back(C[i]);
        cnt ++;
    }


    int ver = -1;
    for (int i = 0; i < V; i ++)
    {
        ///cout << "non bin " << i << " : " << non_bin[i] << " " << deg[i] << endl;
        if (non_bin[i] == 0 && adj[i].size() == 1)
            ver = i;
    }
    ///assert(ver != -1);

    ///cout << "ver " << ver << endl;
    dfs(ver, - 1);
    ///reverse(path.begin(), path.end());
    //for (int p : path)
      //  cout << p << " ";
      //  cout << endl;
    for (int i = 0; i < V; i ++)
        adj[i].clear();
    for (int i = 0; i < U; i ++)
    {
                adj[C[i]].push_back(D[i]);
        adj[D[i]].push_back(C[i]);
    }vector < pair < int, int > > ls;
    for (int i = 0; i < path.size(); i ++)
    {
        value[path[i]] = (1 << i);
    }


    int N = V - MAXBIT - FICT;
    for (int i = 0; i < V; i ++)
    {
        for (int u : adj[i])
        {
            if (non_bin[u] == 0)
            ridx[i] += value[u];
        }
    }
    bool sw = false;
    for (int i = 0; i < V; i ++)
    {
        if (non_bin[i] == 0 || i == mx || i == fx)
        continue;
        if (ridx[i] >= N)
            sw = true;
    }

    if (sw)
    {
        reverse(path.begin(), path.end());
for (int i = 0; i < path.size(); i ++)
    {
        value[path[i]] = (1 << i);
    }
    for (int i = 0; i < V; i ++)
        ridx[i] = 0;

    for (int i = 0; i < V; i ++)
    {
        for (int u : adj[i])
        {
            if (non_bin[u] == 0)
            ridx[i] += value[u];
        }
    }
    }


    for (int i = 0; i < U; i ++)
    {
        if (C[i] == mx || D[i] == mx)
            continue;
            if (C[i] == fx || D[i] == fx)
            continue;
        if (non_bin[C[i]] == 0 || non_bin[D[i]] == 0)
            continue;
        ls.push_back({ridx[C[i]], ridx[D[i]]});
        ///cout << "edge " << ls.back().first << " " << ls.back().second << endl;

    }

    InitMap(V - FICT - MAXBIT, ls.size());
    for (pair < int, int > cur : ls)
        MakeMap(cur.first, cur.second);




}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:79:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   79 |     while(tf[fx] == 1)
      |     ^~~~~
Bob.cpp:83:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   83 |         for (int i = 0; i < V; i ++)
      |         ^~~
Bob.cpp:130:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |     for (int i = 0; i < path.size(); i ++)
      |                     ~~^~~~~~~~~~~~~
Bob.cpp:157:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 | for (int i = 0; i < path.size(); i ++)
      |                 ~~^~~~~~~~~~~~~
Bob.cpp:177:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  177 |         if (C[i] == mx || D[i] == mx)
      |         ^~
Bob.cpp:179:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  179 |             if (C[i] == fx || D[i] == fx)
      |             ^~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 48560 KB Output is correct
2 Correct 7 ms 48648 KB Output is correct
3 Correct 6 ms 48512 KB Output is correct
4 Correct 6 ms 46592 KB Output is correct
5 Correct 6 ms 48644 KB Output is correct
6 Correct 8 ms 48640 KB Output is correct
7 Correct 8 ms 48644 KB Output is correct
8 Correct 9 ms 48652 KB Output is correct
9 Correct 7 ms 48636 KB Output is correct
10 Correct 7 ms 46592 KB Output is correct
11 Correct 8 ms 48640 KB Output is correct
12 Correct 8 ms 48644 KB Output is correct
13 Correct 7 ms 48644 KB Output is correct
14 Correct 10 ms 48604 KB Output is correct
15 Correct 7 ms 48640 KB Output is correct
16 Correct 8 ms 48500 KB Output is correct
17 Correct 8 ms 48644 KB Output is correct
18 Correct 6 ms 48644 KB Output is correct
19 Correct 6 ms 48640 KB Output is correct
20 Correct 7 ms 48644 KB Output is correct
21 Correct 7 ms 48576 KB Output is correct
22 Correct 7 ms 48652 KB Output is correct
23 Correct 7 ms 48640 KB Output is correct
24 Correct 6 ms 46596 KB Output is correct
25 Correct 6 ms 48644 KB Output is correct
26 Correct 7 ms 48644 KB Output is correct
27 Correct 8 ms 48644 KB Output is correct
28 Correct 8 ms 48452 KB Output is correct
29 Correct 8 ms 48644 KB Output is correct
30 Correct 7 ms 46596 KB Output is correct
31 Correct 7 ms 46596 KB Output is correct
32 Correct 8 ms 46592 KB Output is correct
33 Correct 7 ms 46568 KB Output is correct
34 Correct 7 ms 46596 KB Output is correct
35 Correct 9 ms 46596 KB Output is correct
36 Correct 7 ms 48644 KB Output is correct
37 Correct 8 ms 48476 KB Output is correct
38 Correct 8 ms 48644 KB Output is correct
39 Correct 7 ms 48644 KB Output is correct
40 Correct 7 ms 48644 KB Output is correct
41 Correct 6 ms 48636 KB Output is correct
42 Correct 7 ms 48644 KB Output is correct
43 Correct 6 ms 48644 KB Output is correct
44 Correct 7 ms 46584 KB Output is correct
45 Correct 7 ms 46596 KB Output is correct
46 Correct 8 ms 48640 KB Output is correct
47 Correct 7 ms 48644 KB Output is correct
48 Correct 8 ms 48604 KB Output is correct
49 Correct 6 ms 48640 KB Output is correct
50 Correct 6 ms 46692 KB Output is correct
51 Correct 6 ms 42500 KB Output is correct
52 Correct 8 ms 48652 KB Output is correct
53 Correct 6 ms 46604 KB Output is correct
54 Correct 7 ms 48644 KB Output is correct
55 Correct 6 ms 48644 KB Output is correct
56 Correct 7 ms 48640 KB Output is correct
57 Correct 6 ms 48640 KB Output is correct
58 Correct 8 ms 48620 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 48560 KB Output is correct
2 Correct 7 ms 48648 KB Output is correct
3 Correct 6 ms 48512 KB Output is correct
4 Correct 6 ms 46592 KB Output is correct
5 Correct 6 ms 48644 KB Output is correct
6 Correct 8 ms 48640 KB Output is correct
7 Correct 8 ms 48644 KB Output is correct
8 Correct 9 ms 48652 KB Output is correct
9 Correct 7 ms 48636 KB Output is correct
10 Correct 7 ms 46592 KB Output is correct
11 Correct 8 ms 48640 KB Output is correct
12 Correct 8 ms 48644 KB Output is correct
13 Correct 7 ms 48644 KB Output is correct
14 Correct 10 ms 48604 KB Output is correct
15 Correct 7 ms 48640 KB Output is correct
16 Correct 8 ms 48500 KB Output is correct
17 Correct 8 ms 48644 KB Output is correct
18 Correct 6 ms 48644 KB Output is correct
19 Correct 6 ms 48640 KB Output is correct
20 Correct 7 ms 48644 KB Output is correct
21 Correct 7 ms 48576 KB Output is correct
22 Correct 7 ms 48652 KB Output is correct
23 Correct 7 ms 48640 KB Output is correct
24 Correct 6 ms 46596 KB Output is correct
25 Correct 6 ms 48644 KB Output is correct
26 Correct 7 ms 48644 KB Output is correct
27 Correct 8 ms 48644 KB Output is correct
28 Correct 8 ms 48452 KB Output is correct
29 Correct 8 ms 48644 KB Output is correct
30 Correct 7 ms 46596 KB Output is correct
31 Correct 7 ms 46596 KB Output is correct
32 Correct 8 ms 46592 KB Output is correct
33 Correct 7 ms 46568 KB Output is correct
34 Correct 7 ms 46596 KB Output is correct
35 Correct 9 ms 46596 KB Output is correct
36 Correct 7 ms 48644 KB Output is correct
37 Correct 8 ms 48476 KB Output is correct
38 Correct 8 ms 48644 KB Output is correct
39 Correct 7 ms 48644 KB Output is correct
40 Correct 7 ms 48644 KB Output is correct
41 Correct 6 ms 48636 KB Output is correct
42 Correct 7 ms 48644 KB Output is correct
43 Correct 6 ms 48644 KB Output is correct
44 Correct 7 ms 46584 KB Output is correct
45 Correct 7 ms 46596 KB Output is correct
46 Correct 8 ms 48640 KB Output is correct
47 Correct 7 ms 48644 KB Output is correct
48 Correct 8 ms 48604 KB Output is correct
49 Correct 6 ms 48640 KB Output is correct
50 Correct 6 ms 46692 KB Output is correct
51 Correct 6 ms 42500 KB Output is correct
52 Correct 8 ms 48652 KB Output is correct
53 Correct 6 ms 46604 KB Output is correct
54 Correct 7 ms 48644 KB Output is correct
55 Correct 6 ms 48644 KB Output is correct
56 Correct 7 ms 48640 KB Output is correct
57 Correct 6 ms 48640 KB Output is correct
58 Correct 8 ms 48620 KB Output is correct
59 Correct 6 ms 48644 KB Output is correct
60 Correct 7 ms 48640 KB Output is correct
61 Correct 8 ms 48612 KB Output is correct
62 Correct 6 ms 48552 KB Output is correct
63 Correct 7 ms 48640 KB Output is correct
64 Correct 7 ms 48644 KB Output is correct
65 Correct 10 ms 48648 KB Output is correct
66 Correct 9 ms 48984 KB Output is correct
67 Correct 7 ms 48616 KB Output is correct
68 Correct 7 ms 48560 KB Output is correct
69 Correct 6 ms 48644 KB Output is correct
70 Correct 7 ms 48640 KB Output is correct
71 Correct 7 ms 48648 KB Output is correct
72 Correct 6 ms 48640 KB Output is correct
73 Correct 7 ms 48576 KB Output is correct
74 Correct 7 ms 48640 KB Output is correct
75 Correct 7 ms 48640 KB Output is correct
76 Correct 8 ms 48644 KB Output is correct
77 Correct 6 ms 48644 KB Output is correct
78 Correct 8 ms 48644 KB Output is correct
79 Correct 8 ms 48648 KB Output is correct
80 Correct 8 ms 48644 KB Output is correct
81 Correct 6 ms 48644 KB Output is correct
82 Correct 7 ms 48640 KB Output is correct
83 Correct 7 ms 48644 KB Output is correct
84 Correct 7 ms 48640 KB Output is correct
85 Correct 7 ms 48644 KB Output is correct
86 Correct 6 ms 48652 KB Output is correct
87 Correct 6 ms 48644 KB Output is correct
88 Correct 7 ms 48652 KB Output is correct
89 Correct 6 ms 46592 KB Output is correct
90 Correct 6 ms 46592 KB Output is correct
91 Correct 7 ms 46592 KB Output is correct
92 Correct 6 ms 46596 KB Output is correct
93 Correct 7 ms 46604 KB Output is correct
94 Correct 6 ms 48644 KB Output is correct
95 Correct 7 ms 48640 KB Output is correct
96 Correct 7 ms 48644 KB Output is correct
97 Correct 8 ms 48644 KB Output is correct
98 Correct 8 ms 48520 KB Output is correct
99 Correct 8 ms 48644 KB Output is correct
100 Correct 7 ms 48644 KB Output is correct
101 Correct 6 ms 48652 KB Output is correct
102 Correct 6 ms 46596 KB Output is correct
103 Correct 7 ms 48608 KB Output is correct
104 Correct 7 ms 48644 KB Output is correct
105 Correct 8 ms 48640 KB Output is correct
106 Correct 9 ms 48728 KB Output is correct
107 Correct 7 ms 48640 KB Output is correct
108 Correct 6 ms 48644 KB Output is correct
109 Correct 10 ms 48612 KB Output is correct
110 Correct 7 ms 48640 KB Output is correct
111 Correct 7 ms 48644 KB Output is correct
112 Correct 9 ms 48644 KB Output is correct
113 Correct 7 ms 48644 KB Output is correct
114 Correct 7 ms 48644 KB Output is correct
115 Correct 9 ms 48644 KB Output is correct
116 Correct 6 ms 48640 KB Output is correct
117 Correct 8 ms 48588 KB Output is correct
118 Correct 7 ms 48616 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 72096 KB Output is correct : V - N = 12
2 Correct 290 ms 70524 KB Output is correct : V - N = 12
3 Correct 120 ms 54660 KB Output is correct : V - N = 12
4 Correct 11 ms 49080 KB Output is correct : V - N = 12
5 Correct 67 ms 51636 KB Output is correct : V - N = 12
6 Correct 332 ms 70284 KB Output is correct : V - N = 12
7 Correct 365 ms 71244 KB Output is correct : V - N = 12
8 Correct 325 ms 71596 KB Output is correct : V - N = 12
9 Correct 165 ms 54912 KB Output is correct : V - N = 12
10 Correct 22 ms 49708 KB Output is correct : V - N = 12
11 Correct 35 ms 50148 KB Output is correct : V - N = 12
12 Correct 204 ms 60544 KB Output is correct : V - N = 12
13 Correct 340 ms 71208 KB Output is correct : V - N = 12
14 Correct 363 ms 70872 KB Output is correct : V - N = 12
15 Correct 223 ms 67040 KB Output is correct : V - N = 12
16 Correct 47 ms 50584 KB Output is correct : V - N = 12
17 Correct 19 ms 49220 KB Output is correct : V - N = 12
18 Correct 158 ms 54252 KB Output is correct : V - N = 12
19 Correct 357 ms 70536 KB Output is correct : V - N = 12
20 Correct 407 ms 72364 KB Output is correct : V - N = 12
21 Correct 101 ms 52980 KB Output is correct : V - N = 12
22 Correct 87 ms 51848 KB Output is correct : V - N = 12
23 Correct 38 ms 50080 KB Output is correct : V - N = 12
24 Correct 10 ms 48604 KB Output is correct : V - N = 12
25 Correct 27 ms 49480 KB Output is correct : V - N = 12
26 Correct 90 ms 51608 KB Output is correct : V - N = 12
27 Correct 96 ms 52380 KB Output is correct : V - N = 12
28 Correct 100 ms 51956 KB Output is correct : V - N = 12
29 Correct 56 ms 50080 KB Output is correct : V - N = 12
30 Correct 10 ms 49100 KB Output is correct : V - N = 12
31 Correct 13 ms 46644 KB Output is correct : V - N = 12
32 Correct 13 ms 46596 KB Output is correct : V - N = 12
33 Correct 10 ms 46596 KB Output is correct : V - N = 12
34 Correct 9 ms 46604 KB Output is correct : V - N = 12
35 Correct 10 ms 46536 KB Output is correct : V - N = 12
36 Correct 386 ms 72136 KB Output is correct : V - N = 12
37 Correct 387 ms 71140 KB Output is correct : V - N = 12
38 Correct 396 ms 72516 KB Output is correct : V - N = 12
39 Correct 389 ms 71172 KB Output is correct : V - N = 12
40 Correct 518 ms 71148 KB Output is correct : V - N = 12
41 Correct 66 ms 51448 KB Output is correct : V - N = 12
42 Correct 63 ms 50844 KB Output is correct : V - N = 12
43 Correct 57 ms 51608 KB Output is correct : V - N = 12
44 Correct 13 ms 48900 KB Output is correct : V - N = 12
45 Correct 43 ms 50176 KB Output is correct : V - N = 12
46 Correct 168 ms 54516 KB Output is correct : V - N = 12
47 Correct 67 ms 51620 KB Output is correct : V - N = 12
48 Correct 166 ms 54936 KB Output is correct : V - N = 12
49 Correct 43 ms 50080 KB Output is correct : V - N = 12
50 Correct 15 ms 49376 KB Output is correct : V - N = 12
51 Correct 277 ms 70356 KB Output is correct : V - N = 12
52 Correct 11 ms 49100 KB Output is correct : V - N = 12
53 Correct 243 ms 68808 KB Output is correct : V - N = 12
54 Correct 332 ms 71556 KB Output is correct : V - N = 12
55 Correct 25 ms 49704 KB Output is correct : V - N = 12
56 Correct 205 ms 59892 KB Output is correct : V - N = 12
57 Correct 346 ms 70336 KB Output is correct : V - N = 12
58 Correct 51 ms 50600 KB Output is correct : V - N = 12
59 Correct 133 ms 54400 KB Output is correct : V - N = 12
60 Correct 348 ms 72488 KB Output is correct : V - N = 12
61 Correct 7 ms 48640 KB Output is correct : V - N = 12
62 Correct 7 ms 48604 KB Output is correct : V - N = 12
63 Correct 6 ms 48640 KB Output is correct : V - N = 12
64 Correct 6 ms 48648 KB Output is correct : V - N = 12
65 Correct 7 ms 48640 KB Output is correct : V - N = 12
66 Correct 8 ms 48644 KB Output is correct : V - N = 12
67 Correct 7 ms 48644 KB Output is correct : V - N = 12
68 Correct 7 ms 48644 KB Output is correct : V - N = 12
69 Correct 7 ms 48644 KB Output is correct : V - N = 12
70 Correct 7 ms 48648 KB Output is correct : V - N = 12
71 Correct 7 ms 48644 KB Output is correct : V - N = 12
72 Correct 7 ms 48892 KB Output is correct : V - N = 12
73 Correct 7 ms 48640 KB Output is correct : V - N = 12
74 Correct 7 ms 48652 KB Output is correct : V - N = 12
75 Correct 7 ms 48640 KB Output is correct : V - N = 12
76 Correct 6 ms 48644 KB Output is correct : V - N = 12
77 Correct 7 ms 48636 KB Output is correct : V - N = 12
78 Correct 8 ms 48736 KB Output is correct : V - N = 12
79 Correct 7 ms 48640 KB Output is correct : V - N = 12
80 Correct 7 ms 48640 KB Output is correct : V - N = 12
81 Correct 7 ms 48644 KB Output is correct : V - N = 12
82 Correct 6 ms 48652 KB Output is correct : V - N = 12
83 Correct 7 ms 48644 KB Output is correct : V - N = 12
84 Correct 7 ms 48644 KB Output is correct : V - N = 12
85 Correct 7 ms 48640 KB Output is correct : V - N = 12
86 Correct 7 ms 48644 KB Output is correct : V - N = 12
87 Correct 8 ms 48640 KB Output is correct : V - N = 12
88 Correct 6 ms 48640 KB Output is correct : V - N = 12
89 Correct 7 ms 48456 KB Output is correct : V - N = 12
90 Correct 9 ms 48428 KB Output is correct : V - N = 12
91 Correct 6 ms 46592 KB Output is correct : V - N = 12
92 Correct 7 ms 46680 KB Output is correct : V - N = 12
93 Correct 6 ms 46596 KB Output is correct : V - N = 12
94 Correct 7 ms 46596 KB Output is correct : V - N = 12
95 Correct 6 ms 46592 KB Output is correct : V - N = 12
96 Correct 6 ms 48640 KB Output is correct : V - N = 12
97 Correct 8 ms 48652 KB Output is correct : V - N = 12
98 Correct 6 ms 48644 KB Output is correct : V - N = 12
99 Correct 7 ms 48532 KB Output is correct : V - N = 12
100 Correct 8 ms 48644 KB Output is correct : V - N = 12
101 Correct 7 ms 48652 KB Output is correct : V - N = 12
102 Correct 7 ms 48644 KB Output is correct : V - N = 12
103 Correct 8 ms 48644 KB Output is correct : V - N = 12
104 Correct 6 ms 46596 KB Output is correct : V - N = 12
105 Correct 7 ms 48644 KB Output is correct : V - N = 12
106 Correct 7 ms 48644 KB Output is correct : V - N = 12
107 Correct 6 ms 48640 KB Output is correct : V - N = 12
108 Correct 6 ms 48644 KB Output is correct : V - N = 12
109 Correct 7 ms 48640 KB Output is correct : V - N = 12
110 Correct 7 ms 48648 KB Output is correct : V - N = 12
111 Correct 6 ms 48644 KB Output is correct : V - N = 12
112 Correct 7 ms 48652 KB Output is correct : V - N = 12
113 Correct 7 ms 48652 KB Output is correct : V - N = 12
114 Correct 6 ms 48640 KB Output is correct : V - N = 12
115 Correct 7 ms 48644 KB Output is correct : V - N = 12
116 Correct 6 ms 48648 KB Output is correct : V - N = 12
117 Correct 7 ms 48644 KB Output is correct : V - N = 12
118 Correct 6 ms 48640 KB Output is correct : V - N = 12
119 Correct 7 ms 48644 KB Output is correct : V - N = 12
120 Correct 7 ms 48644 KB Output is correct : V - N = 12
121 Correct 6 ms 48644 KB Output is correct : V - N = 12
122 Correct 6 ms 48640 KB Output is correct : V - N = 12
123 Correct 6 ms 48640 KB Output is correct : V - N = 12
124 Correct 6 ms 46596 KB Output is correct : V - N = 12
125 Correct 6 ms 48516 KB Output is correct : V - N = 12
126 Correct 7 ms 48652 KB Output is correct : V - N = 12
127 Correct 8 ms 48640 KB Output is correct : V - N = 12
128 Correct 6 ms 48644 KB Output is correct : V - N = 12
129 Correct 8 ms 48652 KB Output is correct : V - N = 12
130 Correct 7 ms 46596 KB Output is correct : V - N = 12
131 Correct 6 ms 48644 KB Output is correct : V - N = 12
132 Correct 7 ms 48652 KB Output is correct : V - N = 12
133 Correct 7 ms 48644 KB Output is correct : V - N = 12
134 Correct 6 ms 48640 KB Output is correct : V - N = 12
135 Correct 7 ms 48652 KB Output is correct : V - N = 12
136 Correct 6 ms 48640 KB Output is correct : V - N = 12
137 Correct 7 ms 48492 KB Output is correct : V - N = 12
138 Correct 6 ms 48644 KB Output is correct : V - N = 12
139 Correct 6 ms 48640 KB Output is correct : V - N = 12
140 Correct 7 ms 48644 KB Output is correct : V - N = 12
141 Correct 7 ms 48644 KB Output is correct : V - N = 12
142 Correct 9 ms 48656 KB Output is correct : V - N = 12
143 Correct 7 ms 48644 KB Output is correct : V - N = 12
144 Correct 6 ms 46444 KB Output is correct : V - N = 12
145 Correct 7 ms 48456 KB Output is correct : V - N = 12
146 Correct 7 ms 48644 KB Output is correct : V - N = 12
147 Correct 7 ms 48640 KB Output is correct : V - N = 12
148 Correct 7 ms 48564 KB Output is correct : V - N = 12
149 Correct 6 ms 48644 KB Output is correct : V - N = 12
150 Correct 7 ms 46432 KB Output is correct : V - N = 12
151 Correct 6 ms 46604 KB Output is correct : V - N = 12
152 Correct 7 ms 46604 KB Output is correct : V - N = 12
153 Correct 6 ms 46512 KB Output is correct : V - N = 12
154 Correct 7 ms 46592 KB Output is correct : V - N = 12
155 Correct 7 ms 46608 KB Output is correct : V - N = 12
156 Correct 6 ms 48644 KB Output is correct : V - N = 12
157 Correct 6 ms 48636 KB Output is correct : V - N = 12
158 Correct 8 ms 48644 KB Output is correct : V - N = 12
159 Correct 7 ms 48604 KB Output is correct : V - N = 12
160 Correct 6 ms 48592 KB Output is correct : V - N = 12
161 Correct 7 ms 48644 KB Output is correct : V - N = 12
162 Correct 6 ms 48564 KB Output is correct : V - N = 12
163 Correct 7 ms 48456 KB Output is correct : V - N = 12
164 Correct 6 ms 46568 KB Output is correct : V - N = 12
165 Correct 6 ms 46596 KB Output is correct : V - N = 12
166 Correct 7 ms 48644 KB Output is correct : V - N = 12
167 Correct 6 ms 48640 KB Output is correct : V - N = 12
168 Correct 9 ms 48644 KB Output is correct : V - N = 12
169 Correct 8 ms 48644 KB Output is correct : V - N = 12
170 Correct 6 ms 46592 KB Output is correct : V - N = 12
171 Correct 6 ms 42500 KB Output is correct : V - N = 0
172 Correct 6 ms 48644 KB Output is correct : V - N = 12
173 Correct 6 ms 46620 KB Output is correct : V - N = 12
174 Correct 6 ms 48644 KB Output is correct : V - N = 12
175 Correct 6 ms 48644 KB Output is correct : V - N = 12
176 Correct 6 ms 48640 KB Output is correct : V - N = 12
177 Correct 7 ms 48648 KB Output is correct : V - N = 12
178 Correct 6 ms 48740 KB Output is correct : V - N = 12