oj.uz

Submission #969082

# Submission time Handle Problem Language Result Execution time Memory
969082 2024-04-24T13:20:22 Z steveonalex Airline Route Map (JOI18_airline) C++17
100 / 100
 558 ms 40156 KB 
#include <bits/stdc++.h>
#include "Alicelib.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

namespace Debug{
    void InitG(int n, int m){
        cerr << "Number of vertices and edges: " << n << " " << m << "\n";
    }

    void MakeG(int pos, int u, int v){
        cerr << u << " " << v << "\n";
    }
}
// using namespace Debug;

void Alice(int n, int m, int A[], int B[]){
    vector<pair<int, int>> edging;
    for(int i = 0; i<m; ++i) edging.push_back({A[i], B[i]});

    for(int j= 0; j < 10; ++j){
        for(int i = 0; i<n; ++i) if (GETBIT(i, j)){
            edging.push_back({i, n + j});
        }
    }

    for(int i = 0; i < n + 10; ++i) edging.push_back({i, n + 10});
    for(int i = n; i < n + 10; ++i) edging.push_back({i, n + 11});
    for(int j = 1; j < 10; ++j) edging.push_back({n + j - 1, n + j});

    InitG(n + 12, edging.size());
    for(int i = 0; i<edging.size(); ++i) MakeG(i, edging[i].first, edging[i].second);
}
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n, m; cin >> n >> m;
//     int a[n], b[n];
//     for(int i = 0; i<m; ++i){
//         cin >> a[i] >> b[i];
//     }

//     Alice(n, m, a, b);
 
//     return 0;
// }
#include <bits/stdc++.h>
#include "Boblib.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

namespace Debug{
    void InitMap(int n, int m){
        cerr << "Number of vertices and edges: " << n << " " << m << "\n";
    }

    void MakeMap(int u, int v){
        cerr << u << " " << v << "\n";
    }
}
// using namespace Debug;

int mex(vector<int> &A){
    for(int i = 0;; ++i) if (!binary_search(ALL(A), i))
        return i;
}

void dfs(int u, int p, vector<vector<int>> &graph, vector<int> &chain){
    chain.push_back(u);
    for(int v: graph[u]) if (v != p) dfs(v, u, graph, chain);
}

void Bob(int n, int m, int A[], int B[]){
    vector<vector<int>> graph(n);
    for(int i = 0; i<m; ++i){
        int u = A[i], v = B[i];
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    for(int i = 0; i<n; ++i) sort(ALL(graph[i]));

    pair<int, int> ma = {-1, -1};
    for(int i = 0; i<n; ++i) maximize(ma, make_pair((int)graph[i].size(), i) );

    int x = ma.second;
    graph[x].push_back(x);
    sort(ALL(graph[x]));

    int y = mex(graph[x]);

    vector<vector<int>> sigma(n);
    for(int u: graph[y]){
        for(int v: graph[u]) if (binary_search(ALL(graph[y]), v)){
            sigma[u].push_back(v);
        }
    }

    vector<int> chain;
    for(int u: graph[y]){
        if (sigma[u].size() == 1){
            dfs(u, u, sigma, chain);
            break;
        }
    }

    if (graph[chain[0]].size() < graph[chain.back()].size()) reverse(ALL(chain));

    vector<int> sum(n);
    for(int i = 0; i<n; ++i) if (i == x || i == y || binary_search(ALL(graph[y]), i)) sum[i] = -1;
    for(int j = 0; j < 10; ++j){
        for(int v: graph[chain[j]]) if (v != x && v != y && !binary_search(ALL(graph[y]), v)){
            sum[v] += MASK(j);
        }
    }

    vector<pair<int, int>> edging;
    for(int i = 0; i<n; ++i) if (sum[i] != -1){
        for(int j: graph[i]) if (sum[j] != -1 && i < j){
            edging.push_back({sum[i], sum[j]});
        }
    }

    InitMap(n - 12, edging.size());
    for(pair<int, int> i: edging) MakeMap(i.first, i.second);
}
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n, m; cin >> n >> m;
//     int a[m], b[m];
//     for(int i = 0; i<m; ++i){
//         cin >> a[i] >> b[i];
//     }

//     Bob(n, m, a, b);
 
//     return 0;
// }

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i = 0; i<edging.size(); ++i) MakeG(i, edging[i].first, edging[i].second);
      |                    ~^~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 40036 KB Output is correct : V - N = 12
2 Correct 340 ms 37764 KB Output is correct : V - N = 12
3 Correct 187 ms 21140 KB Output is correct : V - N = 12
4 Correct 7 ms 16328 KB Output is correct : V - N = 12
5 Correct 73 ms 18816 KB Output is correct : V - N = 12
6 Correct 342 ms 37384 KB Output is correct : V - N = 12
7 Correct 412 ms 38436 KB Output is correct : V - N = 12
8 Correct 425 ms 37104 KB Output is correct : V - N = 12
9 Correct 204 ms 22436 KB Output is correct : V - N = 12
10 Correct 23 ms 16852 KB Output is correct : V - N = 12
11 Correct 40 ms 17324 KB Output is correct : V - N = 12
12 Correct 230 ms 27784 KB Output is correct : V - N = 12
13 Correct 462 ms 38704 KB Output is correct : V - N = 12
14 Correct 418 ms 38936 KB Output is correct : V - N = 12
15 Correct 250 ms 32908 KB Output is correct : V - N = 12
16 Correct 79 ms 18084 KB Output is correct : V - N = 12
17 Correct 12 ms 16676 KB Output is correct : V - N = 12
18 Correct 166 ms 21424 KB Output is correct : V - N = 12
19 Correct 423 ms 38176 KB Output is correct : V - N = 12
20 Correct 471 ms 38488 KB Output is correct : V - N = 12
21 Correct 112 ms 20268 KB Output is correct : V - N = 12
22 Correct 88 ms 19032 KB Output is correct : V - N = 12
23 Correct 44 ms 17468 KB Output is correct : V - N = 12
24 Correct 4 ms 15620 KB Output is correct : V - N = 12
25 Correct 24 ms 16724 KB Output is correct : V - N = 12
26 Correct 83 ms 18992 KB Output is correct : V - N = 12
27 Correct 114 ms 19104 KB Output is correct : V - N = 12
28 Correct 129 ms 18732 KB Output is correct : V - N = 12
29 Correct 68 ms 17884 KB Output is correct : V - N = 12
30 Correct 6 ms 16324 KB Output is correct : V - N = 12
31 Correct 5 ms 13680 KB Output is correct : V - N = 12
32 Correct 5 ms 13568 KB Output is correct : V - N = 12
33 Correct 7 ms 13572 KB Output is correct : V - N = 12
34 Correct 5 ms 13572 KB Output is correct : V - N = 12
35 Correct 5 ms 13572 KB Output is correct : V - N = 12
36 Correct 464 ms 38128 KB Output is correct : V - N = 12
37 Correct 446 ms 38776 KB Output is correct : V - N = 12
38 Correct 486 ms 38932 KB Output is correct : V - N = 12
39 Correct 558 ms 40156 KB Output is correct : V - N = 12
40 Correct 459 ms 37808 KB Output is correct : V - N = 12
41 Correct 92 ms 18332 KB Output is correct : V - N = 12
42 Correct 64 ms 17864 KB Output is correct : V - N = 12
43 Correct 82 ms 18524 KB Output is correct : V - N = 12
44 Correct 8 ms 15596 KB Output is correct : V - N = 12
45 Correct 44 ms 17320 KB Output is correct : V - N = 12
46 Correct 167 ms 21428 KB Output is correct : V - N = 12
47 Correct 78 ms 19316 KB Output is correct : V - N = 12
48 Correct 229 ms 22000 KB Output is correct : V - N = 12
49 Correct 39 ms 17420 KB Output is correct : V - N = 12
50 Correct 12 ms 16808 KB Output is correct : V - N = 12
51 Correct 377 ms 37164 KB Output is correct : V - N = 12
52 Correct 7 ms 16328 KB Output is correct : V - N = 12
53 Correct 316 ms 36360 KB Output is correct : V - N = 12
54 Correct 442 ms 37820 KB Output is correct : V - N = 12
55 Correct 23 ms 16724 KB Output is correct : V - N = 12
56 Correct 207 ms 26892 KB Output is correct : V - N = 12
57 Correct 540 ms 38320 KB Output is correct : V - N = 12
58 Correct 68 ms 17768 KB Output is correct : V - N = 12
59 Correct 192 ms 21640 KB Output is correct : V - N = 12
60 Correct 451 ms 38800 KB Output is correct : V - N = 12
61 Correct 3 ms 15616 KB Output is correct : V - N = 12
62 Correct 3 ms 15620 KB Output is correct : V - N = 12
63 Correct 3 ms 15612 KB Output is correct : V - N = 12
64 Correct 3 ms 15620 KB Output is correct : V - N = 12
65 Correct 3 ms 15620 KB Output is correct : V - N = 12
66 Correct 3 ms 15620 KB Output is correct : V - N = 12
67 Correct 3 ms 15620 KB Output is correct : V - N = 12
68 Correct 3 ms 15620 KB Output is correct : V - N = 12
69 Correct 3 ms 15620 KB Output is correct : V - N = 12
70 Correct 2 ms 15620 KB Output is correct : V - N = 12
71 Correct 3 ms 15616 KB Output is correct : V - N = 12
72 Correct 3 ms 15620 KB Output is correct : V - N = 12
73 Correct 3 ms 15620 KB Output is correct : V - N = 12
74 Correct 3 ms 15620 KB Output is correct : V - N = 12
75 Correct 3 ms 15620 KB Output is correct : V - N = 12
76 Correct 3 ms 15624 KB Output is correct : V - N = 12
77 Correct 3 ms 15620 KB Output is correct : V - N = 12
78 Correct 3 ms 15620 KB Output is correct : V - N = 12
79 Correct 3 ms 15620 KB Output is correct : V - N = 12
80 Correct 3 ms 15620 KB Output is correct : V - N = 12
81 Correct 3 ms 15620 KB Output is correct : V - N = 12
82 Correct 3 ms 15620 KB Output is correct : V - N = 12
83 Correct 3 ms 15616 KB Output is correct : V - N = 12
84 Correct 3 ms 15616 KB Output is correct : V - N = 12
85 Correct 3 ms 15620 KB Output is correct : V - N = 12
86 Correct 3 ms 15660 KB Output is correct : V - N = 12
87 Correct 3 ms 15620 KB Output is correct : V - N = 12
88 Correct 3 ms 15620 KB Output is correct : V - N = 12
89 Correct 3 ms 15624 KB Output is correct : V - N = 12
90 Correct 3 ms 15620 KB Output is correct : V - N = 12
91 Correct 2 ms 13572 KB Output is correct : V - N = 12
92 Correct 2 ms 13568 KB Output is correct : V - N = 12
93 Correct 2 ms 13572 KB Output is correct : V - N = 12
94 Correct 3 ms 13572 KB Output is correct : V - N = 12
95 Correct 2 ms 13572 KB Output is correct : V - N = 12
96 Correct 3 ms 15624 KB Output is correct : V - N = 12
97 Correct 3 ms 15616 KB Output is correct : V - N = 12
98 Correct 3 ms 15620 KB Output is correct : V - N = 12
99 Correct 3 ms 15620 KB Output is correct : V - N = 12
100 Correct 3 ms 15612 KB Output is correct : V - N = 12
101 Correct 3 ms 15620 KB Output is correct : V - N = 12
102 Correct 3 ms 15616 KB Output is correct : V - N = 12
103 Correct 3 ms 15616 KB Output is correct : V - N = 12
104 Correct 2 ms 13568 KB Output is correct : V - N = 12
105 Correct 3 ms 15624 KB Output is correct : V - N = 12
106 Correct 3 ms 15616 KB Output is correct : V - N = 12
107 Correct 3 ms 15620 KB Output is correct : V - N = 12
108 Correct 2 ms 15620 KB Output is correct : V - N = 12
109 Correct 3 ms 15620 KB Output is correct : V - N = 12
110 Correct 3 ms 15620 KB Output is correct : V - N = 12
111 Correct 3 ms 15616 KB Output is correct : V - N = 12
112 Correct 3 ms 15620 KB Output is correct : V - N = 12
113 Correct 3 ms 15616 KB Output is correct : V - N = 12
114 Correct 3 ms 15620 KB Output is correct : V - N = 12
115 Correct 3 ms 15620 KB Output is correct : V - N = 12
116 Correct 3 ms 15616 KB Output is correct : V - N = 12
117 Correct 3 ms 15620 KB Output is correct : V - N = 12
118 Correct 3 ms 15616 KB Output is correct : V - N = 12
119 Correct 3 ms 15616 KB Output is correct : V - N = 12
120 Correct 3 ms 15616 KB Output is correct : V - N = 12
121 Correct 3 ms 15620 KB Output is correct : V - N = 12
122 Correct 3 ms 15620 KB Output is correct : V - N = 12
123 Correct 3 ms 15452 KB Output is correct : V - N = 12
124 Correct 2 ms 13820 KB Output is correct : V - N = 12
125 Correct 3 ms 15616 KB Output is correct : V - N = 12
126 Correct 2 ms 15568 KB Output is correct : V - N = 12
127 Correct 3 ms 15628 KB Output is correct : V - N = 12
128 Correct 3 ms 15620 KB Output is correct : V - N = 12
129 Correct 3 ms 15620 KB Output is correct : V - N = 12
130 Correct 2 ms 13572 KB Output is correct : V - N = 12
131 Correct 2 ms 15620 KB Output is correct : V - N = 12
132 Correct 3 ms 15620 KB Output is correct : V - N = 12
133 Correct 3 ms 15620 KB Output is correct : V - N = 12
134 Correct 3 ms 15620 KB Output is correct : V - N = 12
135 Correct 2 ms 15616 KB Output is correct : V - N = 12
136 Correct 2 ms 15620 KB Output is correct : V - N = 12
137 Correct 3 ms 15620 KB Output is correct : V - N = 12
138 Correct 3 ms 15620 KB Output is correct : V - N = 12
139 Correct 3 ms 15620 KB Output is correct : V - N = 12
140 Correct 3 ms 15612 KB Output is correct : V - N = 12
141 Correct 2 ms 15624 KB Output is correct : V - N = 12
142 Correct 3 ms 15620 KB Output is correct : V - N = 12
143 Correct 3 ms 15620 KB Output is correct : V - N = 12
144 Correct 2 ms 13572 KB Output is correct : V - N = 12
145 Correct 3 ms 15612 KB Output is correct : V - N = 12
146 Correct 2 ms 15616 KB Output is correct : V - N = 12
147 Correct 3 ms 15620 KB Output is correct : V - N = 12
148 Correct 2 ms 15616 KB Output is correct : V - N = 12
149 Correct 3 ms 15620 KB Output is correct : V - N = 12
150 Correct 2 ms 13572 KB Output is correct : V - N = 12
151 Correct 2 ms 13564 KB Output is correct : V - N = 12
152 Correct 2 ms 13572 KB Output is correct : V - N = 12
153 Correct 3 ms 13568 KB Output is correct : V - N = 12
154 Correct 2 ms 13572 KB Output is correct : V - N = 12
155 Correct 2 ms 13568 KB Output is correct : V - N = 12
156 Correct 3 ms 15620 KB Output is correct : V - N = 12
157 Correct 3 ms 15620 KB Output is correct : V - N = 12
158 Correct 3 ms 15620 KB Output is correct : V - N = 12
159 Correct 2 ms 15620 KB Output is correct : V - N = 12
160 Correct 3 ms 15616 KB Output is correct : V - N = 12
161 Correct 3 ms 15620 KB Output is correct : V - N = 12
162 Correct 3 ms 15620 KB Output is correct : V - N = 12
163 Correct 2 ms 15616 KB Output is correct : V - N = 12
164 Correct 2 ms 13572 KB Output is correct : V - N = 12
165 Correct 2 ms 13572 KB Output is correct : V - N = 12
166 Correct 3 ms 15620 KB Output is correct : V - N = 12
167 Correct 3 ms 15616 KB Output is correct : V - N = 12
168 Correct 3 ms 15616 KB Output is correct : V - N = 12
169 Correct 3 ms 15620 KB Output is correct : V - N = 12
170 Correct 2 ms 13572 KB Output is correct : V - N = 12
171 Correct 2 ms 13572 KB Output is correct : V - N = 12
172 Correct 3 ms 15620 KB Output is correct : V - N = 12
173 Correct 3 ms 13572 KB Output is correct : V - N = 12
174 Correct 2 ms 15620 KB Output is correct : V - N = 12
175 Correct 3 ms 15620 KB Output is correct : V - N = 12
176 Correct 3 ms 15632 KB Output is correct : V - N = 12
177 Correct 3 ms 15620 KB Output is correct : V - N = 12
178 Correct 3 ms 15620 KB Output is correct : V - N = 12