Submission #573556

# Submission time Handle Problem Language Result Execution time Memory
573556 2022-06-06T19:36:40 Z MadokaMagicaFan Airline Route Map (JOI18_airline) C++14
100 / 100
725 ms 25412 KB
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
const ll inf = 1e9;
const int md1 = 1e9+7;
const int md2 = 998244353;

#define all(v)                      v.begin(), v.end()
#define rall(v)                     v.rbegin(), v.rend()
#define sz(v)                       ((int)v.size())

#define forn(i,n)                   for(int i = 0; i < n; ++i)
#define forbe(i,b,e)                for(int i = b; i < e; ++i)

#define pb                          push_back

#define pry                         puts("YES")
#define prn                         puts("NO")
#define endl                        '\n'

#define fst                         first
#define scn                         second

const int N = 1e3;

vector<int> adj[N+12];

void InitG(int v, int u);
void MakeG(int pos, int c, int d);

void
addadj(int a, int b)
{
    adj[a].pb(b);
    adj[b].pb(a);
    return;
}

void
Alice(int n, int m, int a[], int b[])
{
    for (int i = 0; i < m; ++i)
        addadj(a[i],b[i]);

    for (int i = 0; i < 9; ++i)
        addadj(n+i,n+i+1);

    for (int i = 0; i < 10; ++i)
        addadj(n+10,n+i);

    for (int i = 0; i < n+10; ++i)
        addadj(n+11,i);

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < 10; ++j)
            if (i&(1<<j))
                addadj(i, n+j);

    int u = 0;
    for (int i = 0; i < n+13; ++i)
        u += sz(adj[i]);
    u >>= 1;

    InitG(n+12,u);
    u = 0;

    for (int i = 0; i < n+13; ++i) {
        for (int x : adj[i]) {
            if (x > i) continue;
            assert(x!=i);
            MakeG(u,i,x);
            ++u;
        }
    }
}
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
const ll inf = 1e9;
const int md1 = 1e9+7;
const int md2 = 998244353;

#define all(v)                      v.begin(), v.end()
#define rall(v)                     v.rbegin(), v.rend()
#define sz(v)                       ((int)v.size())

#define forn(i,n)                   for(int i = 0; i < n; ++i)
#define forbe(i,b,e)                for(int i = b; i < e; ++i)

#define pb                          push_back

#define pry                         puts("YES")
#define prn                         puts("NO")
#define endl                        '\n'

#define fst                         first
#define scn                         second

const int N = 1e3;

vector<int> adj[N+12];

void
addadj(int a, int b)
{
    adj[a].pb(b);
    adj[b].pb(a);
    return;
}

void InitMap(int n, int m);
void MakeMap(int a, int b);

void
Bob(int v, int u, int c[], int d[])
{
    int n = v-12;
    if (n==1) {
        InitMap(1,0);
        return;
    }

    for (int i = 0; i < v; ++i)
        adj[i].clear();

    for (int i = 0; i < u; ++i) {
        addadj(c[i],d[i]);
    }

    int endnode = -1;
    int beginnode = -1;

    bitset<N+12> special;

    for (int i = 0; i < v; ++i)
        special[i] = 1;

    for (int i = 0; i < v; ++i) {
        if (sz(adj[i]) == v-2)
            endnode = i;
    }

    special[endnode] = 0;

    for (int x : adj[endnode])
        special[x] = 0;

    for (int i = 0; i < v; ++i)
        if(special[i])
            beginnode = i;


    special[beginnode] = 0;

    for (int x : adj[beginnode])
        special[x] = 1;

    vector<int> realval(v,0);

    vector<int> sval;
    for (int i = 0; i < v; ++i) {
        if (!special[i]) continue;
        int deg = 0;
        for (int x : adj[i]) {
            if (!special[x]) continue;
            ++deg;
        }
        if (deg==1)
            sval.pb(i);
    }

    int start = 0;

    assert(sz(sval)==2);
    if (sz(adj[sval[0]]) > sz(adj[sval[1]]))
        start = sval[1];
    else
        start = sval[0];


    int z = 9;
    while (1) {
        int nxt = -1;
        special[start]=0;
        for (int x : adj[start]) {
            if (special[x]) nxt=x;
            realval[x] += (1<<z);
        }
        if (nxt==-1) break;
        --z;
        start = nxt;
    }


    for (int x : adj[beginnode])
        special[x] = 1;
    special[endnode] = 1;
    special[beginnode] = 1;

    int m = 0;

    for (int i = 0; i < v; ++i) {
        if (special[i]) continue;
        for (int x : adj[i]) {
            if (!special[x])
                ++m;
        }
    }

    InitMap(n,m>>1);

    for (int i = 0; i < v; ++i) {
        if (special[i]) continue;
        for (int x : adj[i]) {
            if (special[x]) continue;
            if (x > i) continue;
            MakeMap(realval[i], realval[x]);
        }
    }


    return;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4740 KB Output is correct
2 Correct 3 ms 4736 KB Output is correct
3 Correct 2 ms 4748 KB Output is correct
4 Correct 2 ms 4608 KB Output is correct
5 Correct 3 ms 4740 KB Output is correct
6 Correct 3 ms 4760 KB Output is correct
7 Correct 3 ms 4644 KB Output is correct
8 Correct 3 ms 4720 KB Output is correct
9 Correct 3 ms 4740 KB Output is correct
10 Correct 3 ms 4608 KB Output is correct
11 Correct 3 ms 4740 KB Output is correct
12 Correct 2 ms 4668 KB Output is correct
13 Correct 2 ms 4668 KB Output is correct
14 Correct 3 ms 4748 KB Output is correct
15 Correct 3 ms 4736 KB Output is correct
16 Correct 2 ms 4748 KB Output is correct
17 Correct 3 ms 4668 KB Output is correct
18 Correct 3 ms 4744 KB Output is correct
19 Correct 2 ms 4664 KB Output is correct
20 Correct 3 ms 4740 KB Output is correct
21 Correct 3 ms 4608 KB Output is correct
22 Correct 2 ms 4740 KB Output is correct
23 Correct 2 ms 4748 KB Output is correct
24 Correct 1 ms 4608 KB Output is correct
25 Correct 3 ms 4740 KB Output is correct
26 Correct 3 ms 4740 KB Output is correct
27 Correct 2 ms 4740 KB Output is correct
28 Correct 3 ms 4740 KB Output is correct
29 Correct 3 ms 4748 KB Output is correct
30 Correct 2 ms 4708 KB Output is correct
31 Correct 3 ms 4612 KB Output is correct
32 Correct 3 ms 4608 KB Output is correct
33 Correct 3 ms 4648 KB Output is correct
34 Correct 3 ms 4608 KB Output is correct
35 Correct 3 ms 4612 KB Output is correct
36 Correct 2 ms 4740 KB Output is correct
37 Correct 3 ms 4740 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4740 KB Output is correct
40 Correct 3 ms 4736 KB Output is correct
41 Correct 3 ms 4680 KB Output is correct
42 Correct 2 ms 4736 KB Output is correct
43 Correct 2 ms 4668 KB Output is correct
44 Correct 3 ms 4608 KB Output is correct
45 Correct 3 ms 4608 KB Output is correct
46 Correct 4 ms 4740 KB Output is correct
47 Correct 3 ms 4740 KB Output is correct
48 Correct 3 ms 4748 KB Output is correct
49 Correct 2 ms 4740 KB Output is correct
50 Correct 3 ms 4560 KB Output is correct
51 Correct 3 ms 4736 KB Output is correct
52 Correct 3 ms 4748 KB Output is correct
53 Correct 3 ms 4608 KB Output is correct
54 Correct 3 ms 4748 KB Output is correct
55 Correct 3 ms 4740 KB Output is correct
56 Correct 2 ms 4740 KB Output is correct
57 Correct 3 ms 4740 KB Output is correct
58 Correct 3 ms 4748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4740 KB Output is correct
2 Correct 3 ms 4736 KB Output is correct
3 Correct 2 ms 4748 KB Output is correct
4 Correct 2 ms 4608 KB Output is correct
5 Correct 3 ms 4740 KB Output is correct
6 Correct 3 ms 4760 KB Output is correct
7 Correct 3 ms 4644 KB Output is correct
8 Correct 3 ms 4720 KB Output is correct
9 Correct 3 ms 4740 KB Output is correct
10 Correct 3 ms 4608 KB Output is correct
11 Correct 3 ms 4740 KB Output is correct
12 Correct 2 ms 4668 KB Output is correct
13 Correct 2 ms 4668 KB Output is correct
14 Correct 3 ms 4748 KB Output is correct
15 Correct 3 ms 4736 KB Output is correct
16 Correct 2 ms 4748 KB Output is correct
17 Correct 3 ms 4668 KB Output is correct
18 Correct 3 ms 4744 KB Output is correct
19 Correct 2 ms 4664 KB Output is correct
20 Correct 3 ms 4740 KB Output is correct
21 Correct 3 ms 4608 KB Output is correct
22 Correct 2 ms 4740 KB Output is correct
23 Correct 2 ms 4748 KB Output is correct
24 Correct 1 ms 4608 KB Output is correct
25 Correct 3 ms 4740 KB Output is correct
26 Correct 3 ms 4740 KB Output is correct
27 Correct 2 ms 4740 KB Output is correct
28 Correct 3 ms 4740 KB Output is correct
29 Correct 3 ms 4748 KB Output is correct
30 Correct 2 ms 4708 KB Output is correct
31 Correct 3 ms 4612 KB Output is correct
32 Correct 3 ms 4608 KB Output is correct
33 Correct 3 ms 4648 KB Output is correct
34 Correct 3 ms 4608 KB Output is correct
35 Correct 3 ms 4612 KB Output is correct
36 Correct 2 ms 4740 KB Output is correct
37 Correct 3 ms 4740 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4740 KB Output is correct
40 Correct 3 ms 4736 KB Output is correct
41 Correct 3 ms 4680 KB Output is correct
42 Correct 2 ms 4736 KB Output is correct
43 Correct 2 ms 4668 KB Output is correct
44 Correct 3 ms 4608 KB Output is correct
45 Correct 3 ms 4608 KB Output is correct
46 Correct 4 ms 4740 KB Output is correct
47 Correct 3 ms 4740 KB Output is correct
48 Correct 3 ms 4748 KB Output is correct
49 Correct 2 ms 4740 KB Output is correct
50 Correct 3 ms 4560 KB Output is correct
51 Correct 3 ms 4736 KB Output is correct
52 Correct 3 ms 4748 KB Output is correct
53 Correct 3 ms 4608 KB Output is correct
54 Correct 3 ms 4748 KB Output is correct
55 Correct 3 ms 4740 KB Output is correct
56 Correct 2 ms 4740 KB Output is correct
57 Correct 3 ms 4740 KB Output is correct
58 Correct 3 ms 4748 KB Output is correct
59 Correct 3 ms 4688 KB Output is correct
60 Correct 3 ms 4716 KB Output is correct
61 Correct 3 ms 4716 KB Output is correct
62 Correct 3 ms 4748 KB Output is correct
63 Correct 3 ms 4720 KB Output is correct
64 Correct 3 ms 4720 KB Output is correct
65 Correct 3 ms 4740 KB Output is correct
66 Correct 3 ms 4748 KB Output is correct
67 Correct 3 ms 4716 KB Output is correct
68 Correct 3 ms 4668 KB Output is correct
69 Correct 3 ms 4740 KB Output is correct
70 Correct 4 ms 4668 KB Output is correct
71 Correct 3 ms 4724 KB Output is correct
72 Correct 3 ms 4740 KB Output is correct
73 Correct 3 ms 4696 KB Output is correct
74 Correct 3 ms 4740 KB Output is correct
75 Correct 3 ms 4740 KB Output is correct
76 Correct 3 ms 4740 KB Output is correct
77 Correct 3 ms 4752 KB Output is correct
78 Correct 3 ms 4720 KB Output is correct
79 Correct 3 ms 4680 KB Output is correct
80 Correct 4 ms 4724 KB Output is correct
81 Correct 3 ms 4740 KB Output is correct
82 Correct 3 ms 4740 KB Output is correct
83 Correct 3 ms 4720 KB Output is correct
84 Correct 3 ms 4740 KB Output is correct
85 Correct 3 ms 4740 KB Output is correct
86 Correct 3 ms 4744 KB Output is correct
87 Correct 3 ms 4740 KB Output is correct
88 Correct 3 ms 4740 KB Output is correct
89 Correct 3 ms 4616 KB Output is correct
90 Correct 3 ms 4600 KB Output is correct
91 Correct 3 ms 4608 KB Output is correct
92 Correct 3 ms 4580 KB Output is correct
93 Correct 3 ms 4672 KB Output is correct
94 Correct 3 ms 4740 KB Output is correct
95 Correct 3 ms 4748 KB Output is correct
96 Correct 3 ms 4740 KB Output is correct
97 Correct 3 ms 4740 KB Output is correct
98 Correct 3 ms 4740 KB Output is correct
99 Correct 3 ms 4736 KB Output is correct
100 Correct 3 ms 4744 KB Output is correct
101 Correct 3 ms 4740 KB Output is correct
102 Correct 3 ms 4716 KB Output is correct
103 Correct 3 ms 4716 KB Output is correct
104 Correct 3 ms 4740 KB Output is correct
105 Correct 3 ms 4740 KB Output is correct
106 Correct 3 ms 4740 KB Output is correct
107 Correct 3 ms 4740 KB Output is correct
108 Correct 3 ms 4668 KB Output is correct
109 Correct 4 ms 4640 KB Output is correct
110 Correct 3 ms 4716 KB Output is correct
111 Correct 3 ms 4608 KB Output is correct
112 Correct 3 ms 4720 KB Output is correct
113 Correct 3 ms 4776 KB Output is correct
114 Correct 3 ms 4668 KB Output is correct
115 Correct 3 ms 4740 KB Output is correct
116 Correct 2 ms 4680 KB Output is correct
117 Correct 3 ms 4680 KB Output is correct
118 Correct 3 ms 4716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 583 ms 25232 KB Output is correct : V - N = 12
2 Correct 579 ms 22992 KB Output is correct : V - N = 12
3 Correct 175 ms 12928 KB Output is correct : V - N = 12
4 Correct 9 ms 5228 KB Output is correct : V - N = 12
5 Correct 102 ms 9364 KB Output is correct : V - N = 12
6 Correct 448 ms 21468 KB Output is correct : V - N = 12
7 Correct 615 ms 25368 KB Output is correct : V - N = 12
8 Correct 582 ms 24032 KB Output is correct : V - N = 12
9 Correct 265 ms 14652 KB Output is correct : V - N = 12
10 Correct 23 ms 6048 KB Output is correct : V - N = 12
11 Correct 67 ms 7200 KB Output is correct : V - N = 12
12 Correct 287 ms 17292 KB Output is correct : V - N = 12
13 Correct 670 ms 24632 KB Output is correct : V - N = 12
14 Correct 496 ms 24952 KB Output is correct : V - N = 12
15 Correct 399 ms 20720 KB Output is correct : V - N = 12
16 Correct 70 ms 8048 KB Output is correct : V - N = 12
17 Correct 23 ms 5560 KB Output is correct : V - N = 12
18 Correct 224 ms 13732 KB Output is correct : V - N = 12
19 Correct 558 ms 23724 KB Output is correct : V - N = 12
20 Correct 609 ms 25356 KB Output is correct : V - N = 12
21 Correct 213 ms 12112 KB Output is correct : V - N = 12
22 Correct 161 ms 9504 KB Output is correct : V - N = 12
23 Correct 50 ms 6972 KB Output is correct : V - N = 12
24 Correct 4 ms 4976 KB Output is correct : V - N = 12
25 Correct 32 ms 6196 KB Output is correct : V - N = 12
26 Correct 105 ms 9140 KB Output is correct : V - N = 12
27 Correct 198 ms 10176 KB Output is correct : V - N = 12
28 Correct 121 ms 9872 KB Output is correct : V - N = 12
29 Correct 60 ms 7384 KB Output is correct : V - N = 12
30 Correct 10 ms 5244 KB Output is correct : V - N = 12
31 Correct 8 ms 4992 KB Output is correct : V - N = 12
32 Correct 7 ms 4992 KB Output is correct : V - N = 12
33 Correct 8 ms 5000 KB Output is correct : V - N = 12
34 Correct 6 ms 5028 KB Output is correct : V - N = 12
35 Correct 6 ms 4920 KB Output is correct : V - N = 12
36 Correct 718 ms 25292 KB Output is correct : V - N = 12
37 Correct 700 ms 25316 KB Output is correct : V - N = 12
38 Correct 605 ms 25412 KB Output is correct : V - N = 12
39 Correct 683 ms 25356 KB Output is correct : V - N = 12
40 Correct 725 ms 25244 KB Output is correct : V - N = 12
41 Correct 92 ms 9152 KB Output is correct : V - N = 12
42 Correct 75 ms 8492 KB Output is correct : V - N = 12
43 Correct 107 ms 9004 KB Output is correct : V - N = 12
44 Correct 8 ms 5128 KB Output is correct : V - N = 12
45 Correct 74 ms 7188 KB Output is correct : V - N = 12
46 Correct 253 ms 13396 KB Output is correct : V - N = 12
47 Correct 133 ms 9160 KB Output is correct : V - N = 12
48 Correct 350 ms 14528 KB Output is correct : V - N = 12
49 Correct 52 ms 6924 KB Output is correct : V - N = 12
50 Correct 24 ms 5616 KB Output is correct : V - N = 12
51 Correct 593 ms 22892 KB Output is correct : V - N = 12
52 Correct 8 ms 5232 KB Output is correct : V - N = 12
53 Correct 335 ms 21256 KB Output is correct : V - N = 12
54 Correct 589 ms 23884 KB Output is correct : V - N = 12
55 Correct 34 ms 6060 KB Output is correct : V - N = 12
56 Correct 286 ms 16576 KB Output is correct : V - N = 12
57 Correct 674 ms 24600 KB Output is correct : V - N = 12
58 Correct 69 ms 8100 KB Output is correct : V - N = 12
59 Correct 207 ms 13648 KB Output is correct : V - N = 12
60 Correct 576 ms 24908 KB Output is correct : V - N = 12
61 Correct 3 ms 4668 KB Output is correct : V - N = 12
62 Correct 3 ms 4740 KB Output is correct : V - N = 12
63 Correct 3 ms 4744 KB Output is correct : V - N = 12
64 Correct 3 ms 4724 KB Output is correct : V - N = 12
65 Correct 3 ms 4668 KB Output is correct : V - N = 12
66 Correct 3 ms 4740 KB Output is correct : V - N = 12
67 Correct 3 ms 4680 KB Output is correct : V - N = 12
68 Correct 3 ms 4680 KB Output is correct : V - N = 12
69 Correct 3 ms 4716 KB Output is correct : V - N = 12
70 Correct 3 ms 4748 KB Output is correct : V - N = 12
71 Correct 3 ms 4740 KB Output is correct : V - N = 12
72 Correct 3 ms 4732 KB Output is correct : V - N = 12
73 Correct 3 ms 4748 KB Output is correct : V - N = 12
74 Correct 3 ms 4716 KB Output is correct : V - N = 12
75 Correct 3 ms 4676 KB Output is correct : V - N = 12
76 Correct 3 ms 4740 KB Output is correct : V - N = 12
77 Correct 3 ms 4740 KB Output is correct : V - N = 12
78 Correct 3 ms 4644 KB Output is correct : V - N = 12
79 Correct 3 ms 4736 KB Output is correct : V - N = 12
80 Correct 3 ms 4740 KB Output is correct : V - N = 12
81 Correct 3 ms 4644 KB Output is correct : V - N = 12
82 Correct 3 ms 4716 KB Output is correct : V - N = 12
83 Correct 2 ms 4748 KB Output is correct : V - N = 12
84 Correct 3 ms 4740 KB Output is correct : V - N = 12
85 Correct 3 ms 4652 KB Output is correct : V - N = 12
86 Correct 3 ms 4744 KB Output is correct : V - N = 12
87 Correct 2 ms 4740 KB Output is correct : V - N = 12
88 Correct 3 ms 4740 KB Output is correct : V - N = 12
89 Correct 2 ms 4740 KB Output is correct : V - N = 12
90 Correct 3 ms 4752 KB Output is correct : V - N = 12
91 Correct 3 ms 4736 KB Output is correct : V - N = 12
92 Correct 3 ms 4744 KB Output is correct : V - N = 12
93 Correct 3 ms 4616 KB Output is correct : V - N = 12
94 Correct 3 ms 4600 KB Output is correct : V - N = 12
95 Correct 2 ms 4744 KB Output is correct : V - N = 12
96 Correct 3 ms 4640 KB Output is correct : V - N = 12
97 Correct 3 ms 4748 KB Output is correct : V - N = 12
98 Correct 3 ms 4744 KB Output is correct : V - N = 12
99 Correct 3 ms 4668 KB Output is correct : V - N = 12
100 Correct 3 ms 4740 KB Output is correct : V - N = 12
101 Correct 3 ms 4740 KB Output is correct : V - N = 12
102 Correct 3 ms 4668 KB Output is correct : V - N = 12
103 Correct 3 ms 4720 KB Output is correct : V - N = 12
104 Correct 3 ms 4736 KB Output is correct : V - N = 12
105 Correct 2 ms 4740 KB Output is correct : V - N = 12
106 Correct 3 ms 4748 KB Output is correct : V - N = 12
107 Correct 2 ms 4740 KB Output is correct : V - N = 12
108 Correct 3 ms 4748 KB Output is correct : V - N = 12
109 Correct 2 ms 4740 KB Output is correct : V - N = 12
110 Correct 3 ms 4740 KB Output is correct : V - N = 12
111 Correct 3 ms 4644 KB Output is correct : V - N = 12
112 Correct 2 ms 4748 KB Output is correct : V - N = 12
113 Correct 3 ms 4740 KB Output is correct : V - N = 12
114 Correct 3 ms 4740 KB Output is correct : V - N = 12
115 Correct 2 ms 4812 KB Output is correct : V - N = 12
116 Correct 3 ms 4744 KB Output is correct : V - N = 12
117 Correct 3 ms 4740 KB Output is correct : V - N = 12
118 Correct 3 ms 4708 KB Output is correct : V - N = 12
119 Correct 3 ms 4740 KB Output is correct : V - N = 12
120 Correct 3 ms 4668 KB Output is correct : V - N = 12
121 Correct 3 ms 4644 KB Output is correct : V - N = 12
122 Correct 3 ms 4732 KB Output is correct : V - N = 12
123 Correct 3 ms 4736 KB Output is correct : V - N = 12
124 Correct 3 ms 4740 KB Output is correct : V - N = 12
125 Correct 2 ms 4740 KB Output is correct : V - N = 12
126 Correct 3 ms 4720 KB Output is correct : V - N = 12
127 Correct 2 ms 4740 KB Output is correct : V - N = 12
128 Correct 3 ms 4720 KB Output is correct : V - N = 12
129 Correct 3 ms 4740 KB Output is correct : V - N = 12
130 Correct 2 ms 4748 KB Output is correct : V - N = 12
131 Correct 3 ms 4740 KB Output is correct : V - N = 12
132 Correct 3 ms 4748 KB Output is correct : V - N = 12
133 Correct 3 ms 4748 KB Output is correct : V - N = 12
134 Correct 2 ms 4740 KB Output is correct : V - N = 12
135 Correct 3 ms 4608 KB Output is correct : V - N = 12
136 Correct 2 ms 4728 KB Output is correct : V - N = 12
137 Correct 3 ms 4740 KB Output is correct : V - N = 12
138 Correct 3 ms 4740 KB Output is correct : V - N = 12
139 Correct 3 ms 4748 KB Output is correct : V - N = 12
140 Correct 2 ms 4740 KB Output is correct : V - N = 12
141 Correct 2 ms 4740 KB Output is correct : V - N = 12
142 Correct 3 ms 4740 KB Output is correct : V - N = 12
143 Correct 3 ms 4740 KB Output is correct : V - N = 12
144 Correct 2 ms 4616 KB Output is correct : V - N = 12
145 Correct 3 ms 4740 KB Output is correct : V - N = 12
146 Correct 3 ms 4668 KB Output is correct : V - N = 12
147 Correct 3 ms 4748 KB Output is correct : V - N = 12
148 Correct 2 ms 4740 KB Output is correct : V - N = 12
149 Correct 2 ms 4660 KB Output is correct : V - N = 12
150 Correct 3 ms 4608 KB Output is correct : V - N = 12
151 Correct 2 ms 4608 KB Output is correct : V - N = 12
152 Correct 3 ms 4608 KB Output is correct : V - N = 12
153 Correct 3 ms 4608 KB Output is correct : V - N = 12
154 Correct 4 ms 4644 KB Output is correct : V - N = 12
155 Correct 3 ms 4680 KB Output is correct : V - N = 12
156 Correct 3 ms 4740 KB Output is correct : V - N = 12
157 Correct 3 ms 4716 KB Output is correct : V - N = 12
158 Correct 2 ms 4608 KB Output is correct : V - N = 12
159 Correct 2 ms 4668 KB Output is correct : V - N = 12
160 Correct 3 ms 4668 KB Output is correct : V - N = 12
161 Correct 2 ms 4668 KB Output is correct : V - N = 12
162 Correct 3 ms 4640 KB Output is correct : V - N = 12
163 Correct 3 ms 4736 KB Output is correct : V - N = 12
164 Correct 2 ms 4588 KB Output is correct : V - N = 12
165 Correct 2 ms 4592 KB Output is correct : V - N = 12
166 Correct 2 ms 4740 KB Output is correct : V - N = 12
167 Correct 2 ms 4740 KB Output is correct : V - N = 12
168 Correct 3 ms 4740 KB Output is correct : V - N = 12
169 Correct 2 ms 4752 KB Output is correct : V - N = 12
170 Correct 3 ms 4616 KB Output is correct : V - N = 12
171 Correct 3 ms 4736 KB Output is correct : V - N = 12
172 Correct 2 ms 4664 KB Output is correct : V - N = 12
173 Correct 3 ms 4616 KB Output is correct : V - N = 12
174 Correct 2 ms 4668 KB Output is correct : V - N = 12
175 Correct 2 ms 4740 KB Output is correct : V - N = 12
176 Correct 3 ms 4740 KB Output is correct : V - N = 12
177 Correct 2 ms 4748 KB Output is correct : V - N = 12
178 Correct 1 ms 4748 KB Output is correct : V - N = 12