oj.uz

Submission #130162

# Submission time Handle Problem Language Result Execution time Memory
130162 2019-07-14T06:08:24 Z BThero Airline Route Map (JOI18_airline) C++17
91 / 100
 1004 ms 38712 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include "Alicelib.h"

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef pair<int, int> pii;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

static const int MAXN = (int)2e3 + 5;

static pii e[MAXN * MAXN];

static int n, m;

void buildBad() {
    vector<pii> _e;

    for (int i = 0; i < m; ++i) {
        _e.pb(e[i]);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            _e.pb(mp(i, n + j));
        }
    }

    for (int i = 0; i < n; ++i) {
        _e.pb(mp(n + i, n + n));
    }

    for (int i = 0; i < n + n; ++i) {
        _e.pb(mp(i, n + n + 1));
    }

    InitG(n + n + 2, _e.size());

    for (int i = 0; i < _e.size(); ++i) {
        MakeG(i, _e[i].fi, _e[i].se);
    }
}

void buildGood() {
    int k = 0;

    while ((1 << k) < n) {
        ++k;
    }

    vector<pii> _e;

    for (int i = 0; i < m; ++i) {
        _e.pb(e[i]);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) {
            if (i & (1 << j)) {
                _e.pb(mp(i, n + j));
            }
        }
    }

    for (int i = 0; i < k; ++i) {
        _e.pb(mp(n + i, n + i + 1));
        _e.pb(mp(n + i, n + k + 1));
    }

    _e.pb(mp(n + k, n + k + 1));
    _e.pb(mp(n + k - 2, n + k));

    for (int i = 0; i <= n + k; ++i) {
        _e.pb(mp(i, n + k + 2));
    }

    InitG(n + k + 3, _e.size());

    for (int i = 0; i < _e.size(); ++i) {
        MakeG(i, _e[i].fi, _e[i].se);
    }
}

void Alice(int _n, int _m, int A[], int B[]) {
    n = _n;
    m = _m;

    for (int i = 0; i < m; ++i) {
        e[i] = mp(A[i], B[i]);
    }

    if (n <= 10) {
        buildBad();
    }
    else {
        buildGood();
    }
}


// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include "Boblib.h"

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;   
typedef pair<int, int> pii;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

static const int MAXN = (int)2e3 + 5;
static const int INF = (int)1e9;

static int id[MAXN], deg[MAXN], tp[MAXN];

static bool adj[MAXN][MAXN];

static pii e[MAXN * MAXN];

static int dep[MAXN];

static int n, m;

void solve() {
    vector<pii> _e;

    for (int i = 0; i < m; ++i) {
        int u = e[i].fi;
        int v = e[i].se;
        ++deg[u];
        ++deg[v];
        adj[u][v] = 1;
        adj[v][u] = 1;
    }

    int boss = 0, me = 0, cnt = 0;

    while (deg[boss] != n - 2) {
        ++boss;
    }

    while (me == boss || adj[boss][me]) {
        ++me;
    }

    for (int i = 0; i < n; ++i) {
        if (i == me) {
            tp[i] = 2;
        }
        else if (i == boss) {
            tp[i] = 3;
        }
        else {
            if (adj[i][me]) {
                tp[i] = 0;
                ++cnt;
            }
            else {
                tp[i] = 1;
            }
        }
    }

    int _n = 0;

    if (cnt * 2 + 2 == n) {
        _n = cnt;

        for (int i = 0; i < n; ++i) {
            if (tp[i] == 0) {
                for (int j = 0; j < n; ++j) {
                    if (tp[j] == 1 && adj[i][j]) {
                        ++id[j];
                    }
                }
            }
        }

        for (int i = 0; i < n; ++i) {
            if (tp[i] == 1) {
                for (int j = i + 1; j < n; ++j) {
                    if (tp[j] == 1 && adj[i][j]) {
                        _e.pb(mp(id[i], id[j]));
                    }
                }
            }
        }

        InitMap(_n, _e.size());

        for (int i = 0; i < _e.size(); ++i) {
            MakeMap(_e[i].fi, _e[i].se);
        }

        return;
    }

    fill(deg, deg + n, 0);

    for (int i = 0; i < n; ++i) {
        if (tp[i] == 1) {
            ++_n;
        }                
    }

    for (int i = 0; i < m; ++i) {
        int u = e[i].fi;
        int v = e[i].se;

        if (tp[u] == 0 && tp[v] == 0) {
            ++deg[u];
            ++deg[v];
        }
    }

    int meshok = -1;

    for (int i = 0; i < n; ++i) {
        if (tp[i] == 0) {
            if (meshok == -1 || deg[i] < deg[meshok]) {
                meshok = i;
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        if (tp[i] == 0) {
            dep[i] = INF;
        }
    }

    queue<int> q;
    q.push(meshok);
    dep[meshok] = 0;

    while (!q.empty()) {
        int v = q.front();
        q.pop();

        for (int to = 0; to < n; ++to) {
            if (tp[to] == 0 && adj[v][to] && dep[to] > dep[v] + 1) {
                dep[to] = dep[v] + 1;
                q.push(to);
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        if (tp[i] == 0) {
            for (int j = 0; j < n; ++j) {
                if (tp[j] == 1 && adj[i][j]) {
                    id[j] += (1 << dep[i]);
                }
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        if (tp[i] == 1) {
            for (int j = i + 1; j < n; ++j) {
                if (tp[j] == 1) {
                    if (adj[i][j]) {
                        _e.pb(mp(id[i], id[j]));
                    }
                }
            }
        }
    }

    InitMap(_n, _e.size());

    for (int i = 0; i < _e.size(); ++i) {
        MakeMap(_e[i].fi, _e[i].se);
    }
}

void Bob(int _n, int _m, int A[], int B[]) {
    n = _n;
    m = _m;

    for (int i = 0; i < m; ++i) {
        e[i] = mp(A[i], B[i]);
    }    

    solve();
}

Compilation message

Alice.cpp: In function 'void buildBad()':
Alice.cpp:56:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < _e.size(); ++i) {
                     ~~^~~~~~~~~~~
Alice.cpp: In function 'void buildGood()':
Alice.cpp:96:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < _e.size(); ++i) {
                     ~~^~~~~~~~~~~

Bob.cpp: In function 'void solve()':
Bob.cpp:107:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < _e.size(); ++i) {
                         ~~^~~~~~~~~~~
Bob.cpp:188:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < _e.size(); ++i) {
                     ~~^~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #3
54.0 / 63.0

# Verdict Execution time Memory Grader output
1 Partially correct 960 ms 38488 KB Output is partially correct : V - N = 13
2 Partially correct 789 ms 31544 KB Output is partially correct : V - N = 13
3 Partially correct 294 ms 16312 KB Output is partially correct : V - N = 13
4 Partially correct 18 ms 7408 KB Output is partially correct : V - N = 13
5 Partially correct 194 ms 12600 KB Output is partially correct : V - N = 13
6 Partially correct 647 ms 27168 KB Output is partially correct : V - N = 13
7 Partially correct 965 ms 38040 KB Output is partially correct : V - N = 13
8 Partially correct 871 ms 34560 KB Output is partially correct : V - N = 13
9 Partially correct 437 ms 20424 KB Output is partially correct : V - N = 13
10 Partially correct 61 ms 8464 KB Output is partially correct : V - N = 13
11 Partially correct 96 ms 9984 KB Output is partially correct : V - N = 13
12 Partially correct 541 ms 23056 KB Output is partially correct : V - N = 13
13 Partially correct 908 ms 35936 KB Output is partially correct : V - N = 13
14 Partially correct 933 ms 37096 KB Output is partially correct : V - N = 13
15 Partially correct 566 ms 24864 KB Output is partially correct : V - N = 13
16 Partially correct 131 ms 11040 KB Output is partially correct : V - N = 13
17 Partially correct 33 ms 7812 KB Output is partially correct : V - N = 13
18 Partially correct 361 ms 18400 KB Output is partially correct : V - N = 13
19 Partially correct 908 ms 33208 KB Output is partially correct : V - N = 13
20 Partially correct 964 ms 38400 KB Output is partially correct : V - N = 13
21 Correct 238 ms 15304 KB Output is correct : V - N = 12
22 Correct 199 ms 13272 KB Output is correct : V - N = 12
23 Correct 89 ms 9440 KB Output is correct : V - N = 12
24 Partially correct 12 ms 6896 KB Output is partially correct : V - N = 13
25 Partially correct 56 ms 8424 KB Output is partially correct : V - N = 13
26 Correct 176 ms 12248 KB Output is correct : V - N = 12
27 Correct 264 ms 15056 KB Output is correct : V - N = 12
28 Partially correct 251 ms 14312 KB Output is partially correct : V - N = 13
29 Partially correct 108 ms 10600 KB Output is partially correct : V - N = 13
30 Correct 17 ms 7496 KB Output is correct : V - N = 12
31 Partially correct 16 ms 7152 KB Output is partially correct : V - N = 13
32 Partially correct 16 ms 7152 KB Output is partially correct : V - N = 13
33 Partially correct 16 ms 7152 KB Output is partially correct : V - N = 13
34 Partially correct 17 ms 7152 KB Output is partially correct : V - N = 13
35 Partially correct 16 ms 7160 KB Output is partially correct : V - N = 13
36 Partially correct 939 ms 38368 KB Output is partially correct : V - N = 13
37 Partially correct 1000 ms 38352 KB Output is partially correct : V - N = 13
38 Partially correct 1004 ms 38504 KB Output is partially correct : V - N = 13
39 Partially correct 981 ms 38712 KB Output is partially correct : V - N = 13
40 Partially correct 993 ms 38344 KB Output is partially correct : V - N = 13
41 Partially correct 177 ms 12696 KB Output is partially correct : V - N = 13
42 Partially correct 152 ms 11648 KB Output is partially correct : V - N = 13
43 Partially correct 158 ms 11872 KB Output is partially correct : V - N = 13
44 Partially correct 18 ms 7152 KB Output is partially correct : V - N = 13
45 Partially correct 101 ms 9992 KB Output is partially correct : V - N = 13
46 Partially correct 335 ms 17192 KB Output is partially correct : V - N = 13
47 Partially correct 177 ms 12184 KB Output is partially correct : V - N = 13
48 Partially correct 447 ms 21064 KB Output is partially correct : V - N = 13
49 Partially correct 86 ms 9696 KB Output is partially correct : V - N = 13
50 Partially correct 34 ms 7976 KB Output is partially correct : V - N = 13
51 Partially correct 774 ms 31312 KB Output is partially correct : V - N = 13
52 Partially correct 18 ms 7504 KB Output is partially correct : V - N = 13
53 Partially correct 649 ms 27216 KB Output is partially correct : V - N = 13
54 Partially correct 864 ms 34144 KB Output is partially correct : V - N = 13
55 Partially correct 61 ms 8512 KB Output is partially correct : V - N = 13
56 Partially correct 492 ms 22576 KB Output is partially correct : V - N = 13
57 Partially correct 912 ms 36248 KB Output is partially correct : V - N = 13
58 Partially correct 138 ms 10968 KB Output is partially correct : V - N = 13
59 Partially correct 369 ms 18344 KB Output is partially correct : V - N = 13
60 Partially correct 941 ms 37288 KB Output is partially correct : V - N = 13
61 Correct 9 ms 6744 KB Output is correct : V - N = 9
62 Correct 9 ms 6992 KB Output is correct : V - N = 9
63 Correct 9 ms 6736 KB Output is correct : V - N = 9
64 Correct 8 ms 6640 KB Output is correct : V - N = 9
65 Correct 10 ms 6736 KB Output is correct : V - N = 9
66 Correct 10 ms 6640 KB Output is correct : V - N = 9
67 Correct 9 ms 6784 KB Output is correct : V - N = 9
68 Correct 9 ms 6736 KB Output is correct : V - N = 9
69 Correct 10 ms 6744 KB Output is correct : V - N = 9
70 Correct 9 ms 6640 KB Output is correct : V - N = 9
71 Correct 8 ms 6728 KB Output is correct : V - N = 9
72 Correct 9 ms 6808 KB Output is correct : V - N = 9
73 Correct 10 ms 6640 KB Output is correct : V - N = 9
74 Correct 9 ms 6896 KB Output is correct : V - N = 9
75 Correct 9 ms 6896 KB Output is correct : V - N = 9
76 Correct 8 ms 6896 KB Output is correct : V - N = 9
77 Correct 9 ms 6640 KB Output is correct : V - N = 9
78 Correct 9 ms 6640 KB Output is correct : V - N = 9
79 Correct 9 ms 6640 KB Output is correct : V - N = 9
80 Correct 9 ms 6640 KB Output is correct : V - N = 9
81 Correct 9 ms 6896 KB Output is correct : V - N = 8
82 Correct 9 ms 6896 KB Output is correct : V - N = 8
83 Correct 9 ms 6896 KB Output is correct : V - N = 9
84 Correct 9 ms 6736 KB Output is correct : V - N = 8
85 Correct 9 ms 6896 KB Output is correct : V - N = 8
86 Correct 9 ms 6736 KB Output is correct : V - N = 9
87 Correct 9 ms 6896 KB Output is correct : V - N = 9
88 Correct 10 ms 6640 KB Output is correct : V - N = 8
89 Correct 9 ms 6648 KB Output is correct : V - N = 8
90 Correct 9 ms 6640 KB Output is correct : V - N = 8
91 Correct 9 ms 6736 KB Output is correct : V - N = 9
92 Correct 9 ms 6896 KB Output is correct : V - N = 9
93 Correct 9 ms 6896 KB Output is correct : V - N = 9
94 Correct 9 ms 6640 KB Output is correct : V - N = 9
95 Correct 9 ms 6736 KB Output is correct : V - N = 9
96 Correct 10 ms 6640 KB Output is correct : V - N = 9
97 Correct 9 ms 6896 KB Output is correct : V - N = 9
98 Correct 10 ms 6640 KB Output is correct : V - N = 9
99 Correct 9 ms 6896 KB Output is correct : V - N = 9
100 Correct 9 ms 6640 KB Output is correct : V - N = 9
101 Correct 9 ms 6640 KB Output is correct : V - N = 9
102 Correct 9 ms 6648 KB Output is correct : V - N = 9
103 Correct 10 ms 6640 KB Output is correct : V - N = 9
104 Correct 8 ms 6640 KB Output is correct : V - N = 9
105 Correct 9 ms 6640 KB Output is correct : V - N = 9
106 Correct 9 ms 6896 KB Output is correct : V - N = 9
107 Correct 9 ms 6896 KB Output is correct : V - N = 9
108 Correct 9 ms 6896 KB Output is correct : V - N = 9
109 Correct 9 ms 6640 KB Output is correct : V - N = 9
110 Correct 8 ms 6640 KB Output is correct : V - N = 9
111 Correct 9 ms 6896 KB Output is correct : V - N = 9
112 Correct 9 ms 6896 KB Output is correct : V - N = 8
113 Correct 8 ms 6640 KB Output is correct : V - N = 8
114 Correct 9 ms 6640 KB Output is correct : V - N = 8
115 Correct 9 ms 6640 KB Output is correct : V - N = 8
116 Correct 9 ms 6640 KB Output is correct : V - N = 8
117 Correct 9 ms 6640 KB Output is correct : V - N = 9
118 Correct 9 ms 6640 KB Output is correct : V - N = 8
119 Correct 9 ms 6896 KB Output is correct : V - N = 9
120 Correct 9 ms 6648 KB Output is correct : V - N = 8
121 Correct 9 ms 6640 KB Output is correct : V - N = 12
122 Correct 8 ms 6672 KB Output is correct : V - N = 12
123 Correct 8 ms 6640 KB Output is correct : V - N = 12
124 Correct 8 ms 6640 KB Output is correct : V - N = 12
125 Correct 8 ms 6640 KB Output is correct : V - N = 12
126 Correct 9 ms 6608 KB Output is correct : V - N = 12
127 Correct 9 ms 6896 KB Output is correct : V - N = 12
128 Correct 9 ms 6736 KB Output is correct : V - N = 12
129 Correct 9 ms 6640 KB Output is correct : V - N = 12
130 Correct 9 ms 6736 KB Output is correct : V - N = 12
131 Correct 9 ms 6992 KB Output is correct : V - N = 12
132 Correct 8 ms 6568 KB Output is correct : V - N = 12
133 Correct 8 ms 6896 KB Output is correct : V - N = 12
134 Correct 9 ms 6752 KB Output is correct : V - N = 12
135 Correct 9 ms 6640 KB Output is correct : V - N = 12
136 Correct 8 ms 6648 KB Output is correct : V - N = 12
137 Correct 8 ms 6736 KB Output is correct : V - N = 12
138 Correct 8 ms 6736 KB Output is correct : V - N = 12
139 Correct 9 ms 6640 KB Output is correct : V - N = 12
140 Correct 9 ms 6728 KB Output is correct : V - N = 12
141 Correct 8 ms 6640 KB Output is correct : V - N = 11
142 Correct 9 ms 6696 KB Output is correct : V - N = 10
143 Correct 8 ms 6640 KB Output is correct : V - N = 11
144 Correct 8 ms 6648 KB Output is correct : V - N = 9
145 Correct 9 ms 6896 KB Output is correct : V - N = 8
146 Correct 9 ms 6640 KB Output is correct : V - N = 8
147 Correct 10 ms 6640 KB Output is correct : V - N = 9
148 Correct 9 ms 6736 KB Output is correct : V - N = 11
149 Correct 8 ms 6640 KB Output is correct : V - N = 10
150 Correct 9 ms 6640 KB Output is correct : V - N = 10
151 Correct 9 ms 6896 KB Output is correct : V - N = 12
152 Correct 9 ms 6784 KB Output is correct : V - N = 12
153 Correct 8 ms 6640 KB Output is correct : V - N = 12
154 Correct 9 ms 6736 KB Output is correct : V - N = 12
155 Correct 9 ms 6640 KB Output is correct : V - N = 12
156 Correct 9 ms 6736 KB Output is correct : V - N = 12
157 Correct 8 ms 6640 KB Output is correct : V - N = 12
158 Correct 9 ms 6896 KB Output is correct : V - N = 12
159 Correct 9 ms 6832 KB Output is correct : V - N = 12
160 Correct 9 ms 6768 KB Output is correct : V - N = 12
161 Correct 9 ms 6640 KB Output is correct : V - N = 12
162 Correct 9 ms 6896 KB Output is correct : V - N = 12
163 Correct 9 ms 6640 KB Output is correct : V - N = 12
164 Correct 9 ms 6640 KB Output is correct : V - N = 12
165 Correct 9 ms 6896 KB Output is correct : V - N = 12
166 Correct 9 ms 6640 KB Output is correct : V - N = 12
167 Correct 8 ms 6640 KB Output is correct : V - N = 12
168 Correct 9 ms 6736 KB Output is correct : V - N = 12
169 Correct 8 ms 6640 KB Output is correct : V - N = 12
170 Correct 9 ms 6640 KB Output is correct : V - N = 12
171 Correct 9 ms 6896 KB Output is correct : V - N = 3
172 Correct 9 ms 6896 KB Output is correct : V - N = 4
173 Correct 10 ms 6896 KB Output is correct : V - N = 4
174 Correct 9 ms 6896 KB Output is correct : V - N = 5
175 Correct 10 ms 6896 KB Output is correct : V - N = 5
176 Correct 9 ms 6640 KB Output is correct : V - N = 6
177 Correct 9 ms 6640 KB Output is correct : V - N = 6
178 Correct 9 ms 6640 KB Output is correct : V - N = 7