oj.uz

Submission #420430

# Submission time Handle Problem Language Result Execution time Memory
420430 2021-06-08T11:09:49 Z ACmachine Airline Route Map (JOI18_airline) C++17
100 / 100
 838 ms 33476 KB 
#include <bits/stdc++.h>
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
using namespace std;
#define pb push_back
#define FOR(i, j, k, l) for(int i = (j); i < (k); i+=(l))
#define FORD(i, j, k, l) for(int i = (j); i >= (k); i -= (l))
#define REP(i, n) FOR(i, 0, n, 1)
#define REPD(i, n) FORD(i, n, 0, 1)


void Alice( int N, int M, int A[], int B[] ){ 
    vector<array<int, 2>> edges;
    REP(i, M){
        edges.pb({A[i], B[i]});
    }
    int curr = N;
    REP(i, 10){
        REP(j, N){
            if((j & (1 << i))){ // degrees of indicators will be non_increasing;       
                edges.pb({curr + i, j});
            }
        }
        if(i > 0){
            edges.pb({curr + i - 1, curr + i});
        }
    }
    // when I add one to everything but 1 other vertex, it means that it will have the biggest degree and it creates a pointer to the vertex without added edge;
    // use instead of the deg >= 2 trick
    curr += 10;
    REP(i, N + 10){
        edges.pb({curr, i});
    }
    curr++;
    REP(i, N){
        edges.pb({curr, i});
    }
    InitG(N + 12, (int)edges.size());
	REP(i, edges.size()){
        MakeG(i, edges[i][0], edges[i][1]);
    }
}

#include <bits/stdc++.h>
#include "Boblib.h"
#include <cassert>
#include <cstdio>
using namespace std;
#define pb push_back
#define FOR(i, j, k, l) for(int i = (j); i < (k); i+=(l))
#define FORD(i, j, k, l) for(int i = (j); i >= (k); i -= (l))
#define REP(i, n) FOR(i, 0, n, 1)
#define REPD(i, n) FORD(i, n, 0, 1)
void Bob( int V, int U, int C[], int D[] ){
    vector<array<int, 2>> edges;
    vector<vector<int>> g(V);
    vector<int> deg(V, 0);
    vector<vector<int>> mat(V, vector<int>(V, 0));
    REP(i, U){
        deg[C[i]]++;
        deg[D[i]]++;
        g[C[i]].pb(D[i]);
        g[D[i]].pb(C[i]);
        mat[C[i]][D[i]] = mat[D[i]][C[i]] = 1;
    }
    int f = -1, s = -1;
    REP(i, V){
        if(deg[i] == V - 2){
            REP(j, V){
                if(j == i) continue;
                if(mat[i][j] == 0){
                    s = j;
                }
            }
            if(deg[s] == V - 12){
                f = i;
                break;
            }
        } 
    } 
    vector<bool> ograph(V, false);
    vector<bool> indicator(V, true);
    for(int x : g[s])
        ograph[x] = true;
    ograph[f] = ograph[s] = false;
    for(int x : g[s])
        indicator[x] = false;
    indicator[f] = indicator[s] = false;
    vector<int> indicators;
    REP(i, V){
        if(indicator[i])
            indicators.pb(i);
    } 
    
    int start = indicators[0];
    vector<int> new_indicators; // in a chain order
    int pv = -1;
    int nstart = -1;
    REP(i, 9){
        nstart = -1;
        for(int x : g[start]){
            if(indicator[x] && x != pv){
                nstart = x;
                break;
            }
        }
        if(nstart != -1){
            pv = start;
            start = nstart; 
        }
        else
            break;
    }
    pv = -1;
    REP(i, 9){
        nstart = -1;
        new_indicators.pb(start);
        for(int x : g[start]){
            if(indicator[x] && x != pv){
                nstart = x;
                break;
            }
        }
        pv = start; 
        start = nstart; 
    }
    new_indicators.pb(start);
    indicators.swap(new_indicators);
    if(deg[indicators[0]] < deg[indicators.back()]){
        reverse(indicators.begin(), indicators.end()); 
    }  
    vector<int> mark(V, 0);
    REP(i, 10){
        int v = indicators[i];
        for(int x : g[v]){
            mark[x] |= (1 << i);
        }
    }
    REP(i, U){
        if(ograph[C[i]] && ograph[D[i]]){
            edges.pb({mark[C[i]], mark[D[i]]});
        }
    }
    InitMap( V - 12, (int)edges.size() );
    REP(i, edges.size()){
        MakeMap(edges[i][0], edges[i][1]);
    }	
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:7:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define FOR(i, j, k, l) for(int i = (j); i < (k); i+=(l))
      |                                            ^
Alice.cpp:9:19: note: in expansion of macro 'FOR'
    9 | #define REP(i, n) FOR(i, 0, n, 1)
      |                   ^~~
Alice.cpp:40:2: note: in expansion of macro 'REP'
   40 |  REP(i, edges.size()){
      |  ^~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:7:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define FOR(i, j, k, l) for(int i = (j); i < (k); i+=(l))
      |                                            ^
Bob.cpp:9:19: note: in expansion of macro 'FOR'
    9 | #define REP(i, n) FOR(i, 0, n, 1)
      |                   ^~~
Bob.cpp:102:5: note: in expansion of macro 'REP'
  102 |     REP(i, edges.size()){
      |     ^~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 33272 KB Output is correct : V - N = 12
2 Correct 492 ms 29644 KB Output is correct : V - N = 12
3 Correct 288 ms 17848 KB Output is correct : V - N = 12
4 Correct 12 ms 9232 KB Output is correct : V - N = 12
5 Correct 157 ms 13948 KB Output is correct : V - N = 12
6 Correct 548 ms 27712 KB Output is correct : V - N = 12
7 Correct 637 ms 32972 KB Output is correct : V - N = 12
8 Correct 765 ms 31292 KB Output is correct : V - N = 12
9 Correct 393 ms 20048 KB Output is correct : V - N = 12
10 Correct 43 ms 10376 KB Output is correct : V - N = 12
11 Correct 81 ms 11484 KB Output is correct : V - N = 12
12 Correct 423 ms 22372 KB Output is correct : V - N = 12
13 Correct 627 ms 32248 KB Output is correct : V - N = 12
14 Correct 822 ms 32628 KB Output is correct : V - N = 12
15 Correct 478 ms 26500 KB Output is correct : V - N = 12
16 Correct 83 ms 12292 KB Output is correct : V - N = 12
17 Correct 26 ms 9656 KB Output is correct : V - N = 12
18 Correct 273 ms 19020 KB Output is correct : V - N = 12
19 Correct 523 ms 30908 KB Output is correct : V - N = 12
20 Correct 738 ms 33260 KB Output is correct : V - N = 12
21 Correct 237 ms 13376 KB Output is correct : V - N = 12
22 Correct 146 ms 11256 KB Output is correct : V - N = 12
23 Correct 51 ms 8324 KB Output is correct : V - N = 12
24 Correct 6 ms 5996 KB Output is correct : V - N = 12
25 Correct 46 ms 7276 KB Output is correct : V - N = 12
26 Correct 99 ms 10752 KB Output is correct : V - N = 12
27 Correct 203 ms 12372 KB Output is correct : V - N = 12
28 Correct 148 ms 11720 KB Output is correct : V - N = 12
29 Correct 111 ms 8928 KB Output is correct : V - N = 12
30 Correct 10 ms 6380 KB Output is correct : V - N = 12
31 Correct 10 ms 8920 KB Output is correct : V - N = 12
32 Correct 11 ms 9036 KB Output is correct : V - N = 12
33 Correct 12 ms 9064 KB Output is correct : V - N = 12
34 Correct 10 ms 9004 KB Output is correct : V - N = 12
35 Correct 12 ms 8968 KB Output is correct : V - N = 12
36 Correct 838 ms 33272 KB Output is correct : V - N = 12
37 Correct 656 ms 33464 KB Output is correct : V - N = 12
38 Correct 634 ms 33316 KB Output is correct : V - N = 12
39 Correct 800 ms 33328 KB Output is correct : V - N = 12
40 Correct 824 ms 33476 KB Output is correct : V - N = 12
41 Correct 114 ms 13936 KB Output is correct : V - N = 12
42 Correct 132 ms 12660 KB Output is correct : V - N = 12
43 Correct 139 ms 13580 KB Output is correct : V - N = 12
44 Correct 12 ms 9336 KB Output is correct : V - N = 12
45 Correct 73 ms 11468 KB Output is correct : V - N = 12
46 Correct 257 ms 18348 KB Output is correct : V - N = 12
47 Correct 144 ms 13812 KB Output is correct : V - N = 12
48 Correct 315 ms 20084 KB Output is correct : V - N = 12
49 Correct 61 ms 11324 KB Output is correct : V - N = 12
50 Correct 24 ms 9888 KB Output is correct : V - N = 12
51 Correct 652 ms 29684 KB Output is correct : V - N = 12
52 Correct 13 ms 9312 KB Output is correct : V - N = 12
53 Correct 496 ms 27504 KB Output is correct : V - N = 12
54 Correct 528 ms 30956 KB Output is correct : V - N = 12
55 Correct 49 ms 10244 KB Output is correct : V - N = 12
56 Correct 405 ms 21684 KB Output is correct : V - N = 12
57 Correct 822 ms 32000 KB Output is correct : V - N = 12
58 Correct 83 ms 12228 KB Output is correct : V - N = 12
59 Correct 319 ms 18748 KB Output is correct : V - N = 12
60 Correct 734 ms 32568 KB Output is correct : V - N = 12
61 Correct 3 ms 4696 KB Output is correct : V - N = 12
62 Correct 3 ms 4624 KB Output is correct : V - N = 12
63 Correct 4 ms 4568 KB Output is correct : V - N = 12
64 Correct 3 ms 4496 KB Output is correct : V - N = 12
65 Correct 3 ms 4588 KB Output is correct : V - N = 12
66 Correct 4 ms 4716 KB Output is correct : V - N = 12
67 Correct 3 ms 4644 KB Output is correct : V - N = 12
68 Correct 4 ms 4716 KB Output is correct : V - N = 12
69 Correct 4 ms 4696 KB Output is correct : V - N = 12
70 Correct 3 ms 4588 KB Output is correct : V - N = 12
71 Correct 3 ms 4588 KB Output is correct : V - N = 12
72 Correct 3 ms 4508 KB Output is correct : V - N = 12
73 Correct 3 ms 4716 KB Output is correct : V - N = 12
74 Correct 3 ms 4668 KB Output is correct : V - N = 12
75 Correct 3 ms 4588 KB Output is correct : V - N = 12
76 Correct 3 ms 4596 KB Output is correct : V - N = 12
77 Correct 3 ms 4588 KB Output is correct : V - N = 12
78 Correct 3 ms 4584 KB Output is correct : V - N = 12
79 Correct 3 ms 4712 KB Output is correct : V - N = 12
80 Correct 3 ms 4716 KB Output is correct : V - N = 12
81 Correct 4 ms 4724 KB Output is correct : V - N = 12
82 Correct 3 ms 4588 KB Output is correct : V - N = 12
83 Correct 3 ms 4588 KB Output is correct : V - N = 12
84 Correct 3 ms 4584 KB Output is correct : V - N = 12
85 Correct 3 ms 4600 KB Output is correct : V - N = 12
86 Correct 3 ms 4716 KB Output is correct : V - N = 12
87 Correct 3 ms 4588 KB Output is correct : V - N = 12
88 Correct 4 ms 4676 KB Output is correct : V - N = 12
89 Correct 4 ms 4568 KB Output is correct : V - N = 12
90 Correct 3 ms 4588 KB Output is correct : V - N = 12
91 Correct 3 ms 4516 KB Output is correct : V - N = 12
92 Correct 3 ms 4496 KB Output is correct : V - N = 12
93 Correct 3 ms 4496 KB Output is correct : V - N = 12
94 Correct 4 ms 4512 KB Output is correct : V - N = 12
95 Correct 3 ms 4516 KB Output is correct : V - N = 12
96 Correct 3 ms 4716 KB Output is correct : V - N = 12
97 Correct 3 ms 4624 KB Output is correct : V - N = 12
98 Correct 4 ms 4696 KB Output is correct : V - N = 12
99 Correct 3 ms 4716 KB Output is correct : V - N = 12
100 Correct 3 ms 4716 KB Output is correct : V - N = 12
101 Correct 3 ms 4636 KB Output is correct : V - N = 12
102 Correct 3 ms 4588 KB Output is correct : V - N = 12
103 Correct 3 ms 4588 KB Output is correct : V - N = 12
104 Correct 3 ms 4584 KB Output is correct : V - N = 12
105 Correct 3 ms 4568 KB Output is correct : V - N = 12
106 Correct 3 ms 4660 KB Output is correct : V - N = 12
107 Correct 3 ms 4568 KB Output is correct : V - N = 12
108 Correct 4 ms 4624 KB Output is correct : V - N = 12
109 Correct 3 ms 4596 KB Output is correct : V - N = 12
110 Correct 3 ms 4588 KB Output is correct : V - N = 12
111 Correct 3 ms 4696 KB Output is correct : V - N = 12
112 Correct 3 ms 4568 KB Output is correct : V - N = 12
113 Correct 3 ms 4592 KB Output is correct : V - N = 12
114 Correct 3 ms 4588 KB Output is correct : V - N = 12
115 Correct 3 ms 4496 KB Output is correct : V - N = 12
116 Correct 3 ms 4588 KB Output is correct : V - N = 12
117 Correct 3 ms 4584 KB Output is correct : V - N = 12
118 Correct 3 ms 4588 KB Output is correct : V - N = 12
119 Correct 3 ms 4516 KB Output is correct : V - N = 12
120 Correct 3 ms 4716 KB Output is correct : V - N = 12
121 Correct 3 ms 4588 KB Output is correct : V - N = 12
122 Correct 3 ms 4588 KB Output is correct : V - N = 12
123 Correct 3 ms 4516 KB Output is correct : V - N = 12
124 Correct 3 ms 4520 KB Output is correct : V - N = 12
125 Correct 3 ms 4568 KB Output is correct : V - N = 12
126 Correct 3 ms 4588 KB Output is correct : V - N = 12
127 Correct 3 ms 4588 KB Output is correct : V - N = 12
128 Correct 3 ms 4588 KB Output is correct : V - N = 12
129 Correct 3 ms 4516 KB Output is correct : V - N = 12
130 Correct 3 ms 4516 KB Output is correct : V - N = 12
131 Correct 3 ms 4496 KB Output is correct : V - N = 12
132 Correct 3 ms 4528 KB Output is correct : V - N = 12
133 Correct 3 ms 4760 KB Output is correct : V - N = 12
134 Correct 3 ms 4588 KB Output is correct : V - N = 12
135 Correct 3 ms 4588 KB Output is correct : V - N = 12
136 Correct 3 ms 4568 KB Output is correct : V - N = 12
137 Correct 3 ms 4584 KB Output is correct : V - N = 12
138 Correct 3 ms 4696 KB Output is correct : V - N = 12
139 Correct 3 ms 4496 KB Output is correct : V - N = 12
140 Correct 3 ms 4588 KB Output is correct : V - N = 12
141 Correct 3 ms 4588 KB Output is correct : V - N = 12
142 Correct 3 ms 4568 KB Output is correct : V - N = 12
143 Correct 3 ms 4588 KB Output is correct : V - N = 12
144 Correct 3 ms 4528 KB Output is correct : V - N = 12
145 Correct 3 ms 4592 KB Output is correct : V - N = 12
146 Correct 3 ms 4588 KB Output is correct : V - N = 12
147 Correct 3 ms 4584 KB Output is correct : V - N = 12
148 Correct 3 ms 4588 KB Output is correct : V - N = 12
149 Correct 3 ms 4568 KB Output is correct : V - N = 12
150 Correct 3 ms 4584 KB Output is correct : V - N = 12
151 Correct 3 ms 4564 KB Output is correct : V - N = 12
152 Correct 3 ms 4584 KB Output is correct : V - N = 12
153 Correct 3 ms 4528 KB Output is correct : V - N = 12
154 Correct 3 ms 4584 KB Output is correct : V - N = 12
155 Correct 3 ms 4584 KB Output is correct : V - N = 12
156 Correct 4 ms 4592 KB Output is correct : V - N = 12
157 Correct 3 ms 4516 KB Output is correct : V - N = 12
158 Correct 3 ms 4588 KB Output is correct : V - N = 12
159 Correct 3 ms 4540 KB Output is correct : V - N = 12
160 Correct 3 ms 4584 KB Output is correct : V - N = 12
161 Correct 3 ms 4568 KB Output is correct : V - N = 12
162 Correct 3 ms 4568 KB Output is correct : V - N = 12
163 Correct 3 ms 4588 KB Output is correct : V - N = 12
164 Correct 3 ms 4512 KB Output is correct : V - N = 12
165 Correct 3 ms 4588 KB Output is correct : V - N = 12
166 Correct 3 ms 4568 KB Output is correct : V - N = 12
167 Correct 4 ms 4628 KB Output is correct : V - N = 12
168 Correct 3 ms 4516 KB Output is correct : V - N = 12
169 Correct 3 ms 4528 KB Output is correct : V - N = 12
170 Correct 3 ms 4576 KB Output is correct : V - N = 12
171 Correct 3 ms 4584 KB Output is correct : V - N = 12
172 Correct 3 ms 4584 KB Output is correct : V - N = 12
173 Correct 3 ms 4592 KB Output is correct : V - N = 12
174 Correct 3 ms 4592 KB Output is correct : V - N = 12
175 Correct 3 ms 4512 KB Output is correct : V - N = 12
176 Correct 3 ms 4588 KB Output is correct : V - N = 12
177 Correct 3 ms 4588 KB Output is correct : V - N = 12
178 Correct 3 ms 4584 KB Output is correct : V - N = 12