oj.uz

답안 #130203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
130203 2019-07-14T08:48:06 Z BThero 항공 노선도 (JOI18_airline) C++17
100 / 100
 1029 ms 38760 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 buildGood() {
    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 < 10; ++j) {
            if (i & (1 << j)) {
                _e.pb(mp(i, n + j));
            }
        }
    }

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

        _e.pb(mp(n + i, n + 10));
    }

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

    InitG(n + 12, _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]);
    }

    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;

    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;
            }
            else {
                tp[i] = 1;
            }
        }
    }

    pii meshok = mp(INF, -1);

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

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

            if (cnt < meshok.fi) {
                meshok = mp(cnt, i);
            }
            else if (cnt == meshok.fi && deg[meshok.se] < deg[i]) {
                meshok.se = i;
            } 
        }
    }

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

    queue<int> q;
    q.push(meshok.se);
    dep[meshok.se] = 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 - 12, _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 buildGood()':
Alice.cpp:62: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:146: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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6896 KB Output is correct
2 Correct 8 ms 6640 KB Output is correct
3 Correct 8 ms 6640 KB Output is correct
4 Correct 9 ms 6640 KB Output is correct
5 Correct 8 ms 6640 KB Output is correct
6 Correct 9 ms 6640 KB Output is correct
7 Correct 8 ms 6640 KB Output is correct
8 Correct 8 ms 6640 KB Output is correct
9 Correct 9 ms 6896 KB Output is correct
10 Correct 8 ms 6896 KB Output is correct
11 Correct 8 ms 6640 KB Output is correct
12 Correct 9 ms 6896 KB Output is correct
13 Correct 9 ms 6640 KB Output is correct
14 Correct 9 ms 6968 KB Output is correct
15 Correct 9 ms 6896 KB Output is correct
16 Correct 8 ms 6640 KB Output is correct
17 Correct 9 ms 6896 KB Output is correct
18 Correct 9 ms 7152 KB Output is correct
19 Correct 8 ms 6640 KB Output is correct
20 Correct 9 ms 6640 KB Output is correct
21 Correct 9 ms 6888 KB Output is correct
22 Correct 9 ms 6640 KB Output is correct
23 Correct 9 ms 6896 KB Output is correct
24 Correct 9 ms 6640 KB Output is correct
25 Correct 9 ms 6640 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 8 ms 6640 KB Output is correct
28 Correct 9 ms 6640 KB Output is correct
29 Correct 9 ms 6640 KB Output is correct
30 Correct 9 ms 6640 KB Output is correct
31 Correct 8 ms 6640 KB Output is correct
32 Correct 8 ms 6640 KB Output is correct
33 Correct 9 ms 6640 KB Output is correct
34 Correct 9 ms 6896 KB Output is correct
35 Correct 9 ms 6640 KB Output is correct
36 Correct 9 ms 6640 KB Output is correct
37 Correct 9 ms 6896 KB Output is correct
38 Correct 8 ms 6648 KB Output is correct
39 Correct 8 ms 6896 KB Output is correct
40 Correct 9 ms 6640 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 6896 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 6640 KB Output is correct
49 Correct 8 ms 6640 KB Output is correct
50 Correct 9 ms 6640 KB Output is correct
51 Correct 9 ms 6896 KB Output is correct
52 Correct 9 ms 6640 KB Output is correct
53 Correct 8 ms 6736 KB Output is correct
54 Correct 8 ms 6640 KB Output is correct
55 Correct 9 ms 6896 KB Output is correct
56 Correct 9 ms 6640 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 9 ms 6896 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6896 KB Output is correct
2 Correct 8 ms 6640 KB Output is correct
3 Correct 8 ms 6640 KB Output is correct
4 Correct 9 ms 6640 KB Output is correct
5 Correct 8 ms 6640 KB Output is correct
6 Correct 9 ms 6640 KB Output is correct
7 Correct 8 ms 6640 KB Output is correct
8 Correct 8 ms 6640 KB Output is correct
9 Correct 9 ms 6896 KB Output is correct
10 Correct 8 ms 6896 KB Output is correct
11 Correct 8 ms 6640 KB Output is correct
12 Correct 9 ms 6896 KB Output is correct
13 Correct 9 ms 6640 KB Output is correct
14 Correct 9 ms 6968 KB Output is correct
15 Correct 9 ms 6896 KB Output is correct
16 Correct 8 ms 6640 KB Output is correct
17 Correct 9 ms 6896 KB Output is correct
18 Correct 9 ms 7152 KB Output is correct
19 Correct 8 ms 6640 KB Output is correct
20 Correct 9 ms 6640 KB Output is correct
21 Correct 9 ms 6888 KB Output is correct
22 Correct 9 ms 6640 KB Output is correct
23 Correct 9 ms 6896 KB Output is correct
24 Correct 9 ms 6640 KB Output is correct
25 Correct 9 ms 6640 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 8 ms 6640 KB Output is correct
28 Correct 9 ms 6640 KB Output is correct
29 Correct 9 ms 6640 KB Output is correct
30 Correct 9 ms 6640 KB Output is correct
31 Correct 8 ms 6640 KB Output is correct
32 Correct 8 ms 6640 KB Output is correct
33 Correct 9 ms 6640 KB Output is correct
34 Correct 9 ms 6896 KB Output is correct
35 Correct 9 ms 6640 KB Output is correct
36 Correct 9 ms 6640 KB Output is correct
37 Correct 9 ms 6896 KB Output is correct
38 Correct 8 ms 6648 KB Output is correct
39 Correct 8 ms 6896 KB Output is correct
40 Correct 9 ms 6640 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 6896 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 6640 KB Output is correct
49 Correct 8 ms 6640 KB Output is correct
50 Correct 9 ms 6640 KB Output is correct
51 Correct 9 ms 6896 KB Output is correct
52 Correct 9 ms 6640 KB Output is correct
53 Correct 8 ms 6736 KB Output is correct
54 Correct 8 ms 6640 KB Output is correct
55 Correct 9 ms 6896 KB Output is correct
56 Correct 9 ms 6640 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 9 ms 6896 KB Output is correct
59 Correct 9 ms 6904 KB Output is correct
60 Correct 9 ms 6640 KB Output is correct
61 Correct 9 ms 6640 KB Output is correct
62 Correct 9 ms 6640 KB Output is correct
63 Correct 9 ms 6728 KB Output is correct
64 Correct 9 ms 6640 KB Output is correct
65 Correct 9 ms 6896 KB Output is correct
66 Correct 9 ms 6896 KB Output is correct
67 Correct 23 ms 6896 KB Output is correct
68 Correct 9 ms 6640 KB Output is correct
69 Correct 9 ms 6896 KB Output is correct
70 Correct 9 ms 6640 KB Output is correct
71 Correct 9 ms 6896 KB Output is correct
72 Correct 9 ms 6896 KB Output is correct
73 Correct 9 ms 6896 KB Output is correct
74 Correct 9 ms 6896 KB Output is correct
75 Correct 8 ms 6640 KB Output is correct
76 Correct 9 ms 6640 KB Output is correct
77 Correct 9 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 9 ms 6896 KB Output is correct
81 Correct 9 ms 6904 KB Output is correct
82 Correct 8 ms 6640 KB Output is correct
83 Correct 9 ms 6640 KB Output is correct
84 Correct 9 ms 6648 KB Output is correct
85 Correct 9 ms 6648 KB Output is correct
86 Correct 9 ms 6640 KB Output is correct
87 Correct 9 ms 6640 KB Output is correct
88 Correct 9 ms 6896 KB Output is correct
89 Correct 9 ms 6640 KB Output is correct
90 Correct 8 ms 6640 KB Output is correct
91 Correct 9 ms 6952 KB Output is correct
92 Correct 10 ms 6896 KB Output is correct
93 Correct 9 ms 6728 KB Output is correct
94 Correct 10 ms 6640 KB Output is correct
95 Correct 9 ms 6640 KB Output is correct
96 Correct 10 ms 6640 KB Output is correct
97 Correct 10 ms 6904 KB Output is correct
98 Correct 9 ms 6640 KB Output is correct
99 Correct 9 ms 6640 KB Output is correct
100 Correct 9 ms 6896 KB Output is correct
101 Correct 9 ms 6640 KB Output is correct
102 Correct 9 ms 6896 KB Output is correct
103 Correct 9 ms 6896 KB Output is correct
104 Correct 8 ms 6896 KB Output is correct
105 Correct 9 ms 6896 KB Output is correct
106 Correct 9 ms 6640 KB Output is correct
107 Correct 9 ms 6640 KB Output is correct
108 Correct 9 ms 6640 KB Output is correct
109 Correct 9 ms 6640 KB Output is correct
110 Correct 9 ms 6640 KB Output is correct
111 Correct 8 ms 6640 KB Output is correct
112 Correct 9 ms 6640 KB Output is correct
113 Correct 9 ms 6736 KB Output is correct
114 Correct 9 ms 6640 KB Output is correct
115 Correct 9 ms 6640 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 6896 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 976 ms 38544 KB Output is correct : V - N = 12
2 Correct 759 ms 31368 KB Output is correct : V - N = 12
3 Correct 315 ms 16328 KB Output is correct : V - N = 12
4 Correct 18 ms 7408 KB Output is correct : V - N = 12
5 Correct 177 ms 12664 KB Output is correct : V - N = 12
6 Correct 689 ms 27536 KB Output is correct : V - N = 12
7 Correct 961 ms 37992 KB Output is correct : V - N = 12
8 Correct 873 ms 34568 KB Output is correct : V - N = 12
9 Correct 450 ms 20432 KB Output is correct : V - N = 12
10 Correct 60 ms 8516 KB Output is correct : V - N = 12
11 Correct 97 ms 9624 KB Output is correct : V - N = 12
12 Correct 514 ms 22936 KB Output is correct : V - N = 12
13 Correct 937 ms 36368 KB Output is correct : V - N = 12
14 Correct 952 ms 37048 KB Output is correct : V - N = 12
15 Correct 589 ms 24872 KB Output is correct : V - N = 12
16 Correct 142 ms 10856 KB Output is correct : V - N = 12
17 Correct 33 ms 8176 KB Output is correct : V - N = 12
18 Correct 369 ms 18576 KB Output is correct : V - N = 12
19 Correct 848 ms 33464 KB Output is correct : V - N = 12
20 Correct 984 ms 38472 KB Output is correct : V - N = 12
21 Correct 252 ms 15320 KB Output is correct : V - N = 12
22 Correct 196 ms 13408 KB Output is correct : V - N = 12
23 Correct 88 ms 9440 KB Output is correct : V - N = 12
24 Correct 11 ms 6896 KB Output is correct : V - N = 12
25 Correct 54 ms 8432 KB Output is correct : V - N = 12
26 Correct 174 ms 12184 KB Output is correct : V - N = 12
27 Correct 256 ms 15144 KB Output is correct : V - N = 12
28 Correct 235 ms 14184 KB Output is correct : V - N = 12
29 Correct 118 ms 10720 KB Output is correct : V - N = 12
30 Correct 20 ms 7408 KB Output is correct : V - N = 12
31 Correct 16 ms 7128 KB Output is correct : V - N = 12
32 Correct 15 ms 7152 KB Output is correct : V - N = 12
33 Correct 16 ms 7152 KB Output is correct : V - N = 12
34 Correct 16 ms 7120 KB Output is correct : V - N = 12
35 Correct 16 ms 7152 KB Output is correct : V - N = 12
36 Correct 991 ms 38504 KB Output is correct : V - N = 12
37 Correct 973 ms 38464 KB Output is correct : V - N = 12
38 Correct 976 ms 38760 KB Output is correct : V - N = 12
39 Correct 977 ms 38480 KB Output is correct : V - N = 12
40 Correct 1029 ms 38392 KB Output is correct : V - N = 12
41 Correct 176 ms 12488 KB Output is correct : V - N = 12
42 Correct 142 ms 11416 KB Output is correct : V - N = 12
43 Correct 162 ms 11728 KB Output is correct : V - N = 12
44 Correct 16 ms 7408 KB Output is correct : V - N = 12
45 Correct 124 ms 9824 KB Output is correct : V - N = 12
46 Correct 330 ms 17248 KB Output is correct : V - N = 12
47 Correct 173 ms 12184 KB Output is correct : V - N = 12
48 Correct 456 ms 20896 KB Output is correct : V - N = 12
49 Correct 88 ms 9696 KB Output is correct : V - N = 12
50 Correct 34 ms 7920 KB Output is correct : V - N = 12
51 Correct 748 ms 31296 KB Output is correct : V - N = 12
52 Correct 19 ms 7336 KB Output is correct : V - N = 12
53 Correct 694 ms 27400 KB Output is correct : V - N = 12
54 Correct 858 ms 34080 KB Output is correct : V - N = 12
55 Correct 69 ms 8672 KB Output is correct : V - N = 12
56 Correct 498 ms 22720 KB Output is correct : V - N = 12
57 Correct 900 ms 36168 KB Output is correct : V - N = 12
58 Correct 133 ms 10976 KB Output is correct : V - N = 12
59 Correct 372 ms 18432 KB Output is correct : V - N = 12
60 Correct 944 ms 37760 KB Output is correct : V - N = 12
61 Correct 9 ms 6640 KB Output is correct : V - N = 12
62 Correct 9 ms 6640 KB Output is correct : V - N = 12
63 Correct 9 ms 6728 KB Output is correct : V - N = 12
64 Correct 9 ms 6896 KB Output is correct : V - N = 12
65 Correct 9 ms 6640 KB Output is correct : V - N = 12
66 Correct 9 ms 6904 KB Output is correct : V - N = 12
67 Correct 9 ms 6640 KB Output is correct : V - N = 12
68 Correct 9 ms 6640 KB Output is correct : V - N = 12
69 Correct 9 ms 6648 KB Output is correct : V - N = 12
70 Correct 9 ms 6640 KB Output is correct : V - N = 12
71 Correct 10 ms 6640 KB Output is correct : V - N = 12
72 Correct 9 ms 6896 KB Output is correct : V - N = 12
73 Correct 10 ms 6896 KB Output is correct : V - N = 12
74 Correct 11 ms 6856 KB Output is correct : V - N = 12
75 Correct 9 ms 6640 KB Output is correct : V - N = 12
76 Correct 8 ms 6640 KB Output is correct : V - N = 12
77 Correct 9 ms 6896 KB Output is correct : V - N = 12
78 Correct 9 ms 6640 KB Output is correct : V - N = 12
79 Correct 9 ms 6896 KB Output is correct : V - N = 12
80 Correct 9 ms 6640 KB Output is correct : V - N = 12
81 Correct 9 ms 6640 KB Output is correct : V - N = 12
82 Correct 10 ms 6896 KB Output is correct : V - N = 12
83 Correct 9 ms 6640 KB Output is correct : V - N = 12
84 Correct 9 ms 6896 KB Output is correct : V - N = 12
85 Correct 9 ms 6896 KB Output is correct : V - N = 12
86 Correct 9 ms 6640 KB Output is correct : V - N = 12
87 Correct 10 ms 6896 KB Output is correct : V - N = 12
88 Correct 9 ms 6640 KB Output is correct : V - N = 12
89 Correct 9 ms 6896 KB Output is correct : V - N = 12
90 Correct 9 ms 6640 KB Output is correct : V - N = 12
91 Correct 8 ms 6640 KB Output is correct : V - N = 12
92 Correct 8 ms 6640 KB Output is correct : V - N = 12
93 Correct 8 ms 6640 KB Output is correct : V - N = 12
94 Correct 9 ms 6736 KB Output is correct : V - N = 12
95 Correct 9 ms 6904 KB Output is correct : V - N = 12
96 Correct 9 ms 6640 KB Output is correct : V - N = 12
97 Correct 9 ms 6648 KB Output is correct : V - N = 12
98 Correct 9 ms 6896 KB Output is correct : V - N = 12
99 Correct 9 ms 6640 KB Output is correct : V - N = 12
100 Correct 9 ms 6640 KB Output is correct : V - N = 12
101 Correct 9 ms 6728 KB Output is correct : V - N = 12
102 Correct 9 ms 6896 KB Output is correct : V - N = 12
103 Correct 9 ms 6736 KB Output is correct : V - N = 12
104 Correct 9 ms 6640 KB Output is correct : V - N = 12
105 Correct 9 ms 6696 KB Output is correct : V - N = 12
106 Correct 10 ms 6640 KB Output is correct : V - N = 12
107 Correct 11 ms 6640 KB Output is correct : V - N = 12
108 Correct 11 ms 6896 KB Output is correct : V - N = 12
109 Correct 9 ms 6640 KB Output is correct : V - N = 12
110 Correct 9 ms 6896 KB Output is correct : V - N = 12
111 Correct 9 ms 6640 KB Output is correct : V - N = 12
112 Correct 9 ms 6640 KB Output is correct : V - N = 12
113 Correct 10 ms 6640 KB Output is correct : V - N = 12
114 Correct 10 ms 6640 KB Output is correct : V - N = 12
115 Correct 9 ms 6896 KB Output is correct : V - N = 12
116 Correct 9 ms 6640 KB Output is correct : V - N = 12
117 Correct 10 ms 6696 KB Output is correct : V - N = 12
118 Correct 9 ms 6640 KB Output is correct : V - N = 12
119 Correct 9 ms 6896 KB Output is correct : V - N = 12
120 Correct 10 ms 6640 KB Output is correct : V - N = 12
121 Correct 10 ms 6896 KB Output is correct : V - N = 12
122 Correct 9 ms 6904 KB Output is correct : V - N = 12
123 Correct 9 ms 6896 KB Output is correct : V - N = 12
124 Correct 9 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 6640 KB Output is correct : V - N = 12
127 Correct 9 ms 6960 KB Output is correct : V - N = 12
128 Correct 9 ms 6640 KB Output is correct : V - N = 12
129 Correct 8 ms 6640 KB Output is correct : V - N = 12
130 Correct 9 ms 6640 KB Output is correct : V - N = 12
131 Correct 9 ms 6896 KB Output is correct : V - N = 12
132 Correct 9 ms 6640 KB Output is correct : V - N = 12
133 Correct 9 ms 6640 KB Output is correct : V - N = 12
134 Correct 8 ms 6640 KB Output is correct : V - N = 12
135 Correct 9 ms 6896 KB Output is correct : V - N = 12
136 Correct 8 ms 6640 KB Output is correct : V - N = 12
137 Correct 8 ms 6640 KB Output is correct : V - N = 12
138 Correct 9 ms 6896 KB Output is correct : V - N = 12
139 Correct 8 ms 6640 KB Output is correct : V - N = 12
140 Correct 9 ms 6896 KB Output is correct : V - N = 12
141 Correct 9 ms 6640 KB Output is correct : V - N = 12
142 Correct 9 ms 6896 KB Output is correct : V - N = 12
143 Correct 8 ms 6640 KB Output is correct : V - N = 12
144 Correct 9 ms 6640 KB Output is correct : V - N = 12
145 Correct 10 ms 6640 KB Output is correct : V - N = 12
146 Correct 9 ms 6640 KB Output is correct : V - N = 12
147 Correct 10 ms 6896 KB Output is correct : V - N = 12
148 Correct 8 ms 6640 KB Output is correct : V - N = 12
149 Correct 9 ms 6640 KB Output is correct : V - N = 12
150 Correct 9 ms 6896 KB Output is correct : V - N = 12
151 Correct 9 ms 6896 KB Output is correct : V - N = 12
152 Correct 10 ms 6640 KB Output is correct : V - N = 12
153 Correct 9 ms 6640 KB Output is correct : V - N = 12
154 Correct 9 ms 6640 KB Output is correct : V - N = 12
155 Correct 9 ms 6640 KB Output is correct : V - N = 12
156 Correct 9 ms 6640 KB Output is correct : V - N = 12
157 Correct 9 ms 6640 KB Output is correct : V - N = 12
158 Correct 9 ms 6736 KB Output is correct : V - N = 12
159 Correct 9 ms 6896 KB Output is correct : V - N = 12
160 Correct 9 ms 6896 KB Output is correct : V - N = 12
161 Correct 9 ms 6896 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 6896 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 9 ms 6640 KB Output is correct : V - N = 12
168 Correct 9 ms 6896 KB Output is correct : V - N = 12
169 Correct 9 ms 6896 KB Output is correct : V - N = 12
170 Correct 10 ms 6640 KB Output is correct : V - N = 12
171 Correct 8 ms 6640 KB Output is correct : V - N = 12
172 Correct 9 ms 6736 KB Output is correct : V - N = 12
173 Correct 8 ms 6640 KB Output is correct : V - N = 12
174 Correct 8 ms 6896 KB Output is correct : V - N = 12
175 Correct 9 ms 6896 KB Output is correct : V - N = 12
176 Correct 9 ms 6896 KB Output is correct : V - N = 12
177 Correct 8 ms 6640 KB Output is correct : V - N = 12
178 Correct 9 ms 6640 KB Output is correct : V - N = 12