oj.uz

Submission #719137

# Submission time Handle Problem Language Result Execution time Memory
719137 2023-04-05T11:53:58 Z lam Airline Route Map (JOI18_airline) C++14
100 / 100
 654 ms 29320 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
#define ff first
#define ss second
inline bool checkbit(int i, int j)
{
    return i>>j&1;
}
void Alice( int N, int M, int A[], int B[] ){
    int n,m;
    n=N; m=M;
    vector <ii> edges;
    for (int i=0; i<m; i++) edges.push_back({A[i],B[i]});
    for (int i=0; i<10; i++)
    {
        for (int j=0; j<n; j++) if (checkbit(j,i)) edges.push_back({n+i,j});
        if (i>0) edges.push_back({n+i,n+i-1});
    }
    for (int i=0; i<n; i++) edges.push_back({n+10,i});
    edges.push_back({n+10,n+11});
    InitG(n+12,edges.size());
    int cnt=0;
    for (ii i:edges) MakeG(cnt++,i.ff,i.ss);
}

#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;

void Bob( int V, int U, int C[], int D[] ){
    int n,m;
    n=V - 12;
    vector <vector<int>> adj(V);
    for (int i=0; i<U; i++)
    {
        adj[C[i]].push_back(D[i]);
        adj[D[i]].push_back(C[i]);
    }
//    cerr<<V<<endl;
//    for (int i=0; i<V; i++)
//    {
//        cerr<<i<<" := ";
//        for (int j:adj[i]) cerr<<j<<' '; cerr<<endl;
//    }
    int type1,type2;
    for (int i=0; i<V; i++) if (adj[i].size()==1&&adj[adj[i][0]].size()==n+1)
    {
        type2 = i;
        type1 = adj[i][0];
    }
    vector <int> type(V,0);
    type[type2] = type[type1] = 2;
    for (int i:adj[type1]) if (i!=type2) type[i] = 1;
    vector <int> nodes;
    vector <vector<int>> sub_adj(V);
    for (int i=0; i<V; i++) if (type[i]==0) nodes.push_back(i);
    for (int i:nodes)
        for (int j:adj[i])
            if (type[j]==0) sub_adj[i].push_back(j);
//    for (int i=0; i<V; i++)
//    {
//        cerr<<i<<" := ";
//        for (int j:sub_adj[i]) cerr<<j<<' '; cerr<<endl;
//    }
    int it = -1;
    for (int i:nodes)
        if (sub_adj[i].size()==1)
    {
        if (it==-1||adj[it].size() < adj[i].size()) it = i;
    }
    vector <int> path;
    path.push_back(it);
    int p=-1;
    for (int i=1; i<10; i++)
        for (int j:sub_adj[it]) if (j!=p)
        {
            p = it;
            it = j;
            path.push_back(it);
            break;
        }
//    for (int i:nodes) cerr<<i<<' '; cerr<<"!!"<<endl;
//    cerr<<type1<<' '<<type2<<" = "; for (int i:path) cerr<<i<<' '; cerr<<endl;
    vector <int> inv_path(V);
    for (int i=0; i<10; i++) inv_path[path[i]] = i;
    vector <int> final_id(V);
    vector <vector<bool>> has_edge;
    has_edge.assign(10,vector<bool>(V,0));
    for (int i=0; i<U; i++)
    {
        int u=C[i]; int v=D[i];
        if (type[u] == 0 && type[v] == 1)
            has_edge[inv_path[u]][v] = 1;
        swap(u,v);
        if (type[u] == 0 && type[v] == 1)
            has_edge[inv_path[u]][v] = 1;
    }
    for (int i=0; i<V; i++) if (type[i] == 1)
    {
        for (int j=0; j<10; j++) if (has_edge[j][i]) final_id[i] |= (1<<j);
    }
    vector <pair<int,int>> edges;
    for (int i=0; i<U; i++)
    {
        int u=C[i]; int v=D[i];
        if (type[u]==1&&type[v]==1)
        {
            edges.push_back({final_id[u],final_id[v]});
        }
    }
    InitMap(n,edges.size());
    for (pair<int,int> i:edges) MakeMap(i.first,i.second);
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:24:72: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |     for (int i=0; i<V; i++) if (adj[i].size()==1&&adj[adj[i][0]].size()==n+1)
      |                                                   ~~~~~~~~~~~~~~~~~~~~~^~~~~
Bob.cpp:9:11: warning: unused variable 'm' [-Wunused-variable]
    9 |     int n,m;
      |           ^
Bob.cpp:30:15: warning: 'type2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |     type[type2] = type[type1] = 2;
      |               ^
Bob.cpp:30:29: warning: 'type1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |     type[type2] = type[type1] = 2;
      |                             ^

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 619 ms 29244 KB Output is correct : V - N = 12
2 Correct 415 ms 25632 KB Output is correct : V - N = 12
3 Correct 178 ms 14052 KB Output is correct : V - N = 12
4 Correct 10 ms 5284 KB Output is correct : V - N = 12
5 Correct 83 ms 9832 KB Output is correct : V - N = 12
6 Correct 341 ms 23828 KB Output is correct : V - N = 12
7 Correct 654 ms 28920 KB Output is correct : V - N = 12
8 Correct 468 ms 27392 KB Output is correct : V - N = 12
9 Correct 264 ms 16004 KB Output is correct : V - N = 12
10 Correct 40 ms 6336 KB Output is correct : V - N = 12
11 Correct 69 ms 7400 KB Output is correct : V - N = 12
12 Correct 293 ms 18348 KB Output is correct : V - N = 12
13 Correct 507 ms 28148 KB Output is correct : V - N = 12
14 Correct 522 ms 28612 KB Output is correct : V - N = 12
15 Correct 332 ms 22536 KB Output is correct : V - N = 12
16 Correct 76 ms 8568 KB Output is correct : V - N = 12
17 Correct 19 ms 5716 KB Output is correct : V - N = 12
18 Correct 217 ms 14984 KB Output is correct : V - N = 12
19 Correct 516 ms 26592 KB Output is correct : V - N = 12
20 Correct 530 ms 29164 KB Output is correct : V - N = 12
21 Correct 170 ms 12168 KB Output is correct : V - N = 12
22 Correct 134 ms 10196 KB Output is correct : V - N = 12
23 Correct 45 ms 7332 KB Output is correct : V - N = 12
24 Correct 6 ms 4940 KB Output is correct : V - N = 12
25 Correct 28 ms 6136 KB Output is correct : V - N = 12
26 Correct 86 ms 9864 KB Output is correct : V - N = 12
27 Correct 135 ms 11184 KB Output is correct : V - N = 12
28 Correct 153 ms 10836 KB Output is correct : V - N = 12
29 Correct 68 ms 7808 KB Output is correct : V - N = 12
30 Correct 12 ms 5308 KB Output is correct : V - N = 12
31 Correct 8 ms 5040 KB Output is correct : V - N = 12
32 Correct 7 ms 5128 KB Output is correct : V - N = 12
33 Correct 7 ms 5120 KB Output is correct : V - N = 12
34 Correct 7 ms 5040 KB Output is correct : V - N = 12
35 Correct 11 ms 5076 KB Output is correct : V - N = 12
36 Correct 468 ms 29228 KB Output is correct : V - N = 12
37 Correct 563 ms 29176 KB Output is correct : V - N = 12
38 Correct 576 ms 29320 KB Output is correct : V - N = 12
39 Correct 556 ms 29288 KB Output is correct : V - N = 12
40 Correct 622 ms 29232 KB Output is correct : V - N = 12
41 Correct 125 ms 9816 KB Output is correct : V - N = 12
42 Correct 87 ms 8696 KB Output is correct : V - N = 12
43 Correct 107 ms 9608 KB Output is correct : V - N = 12
44 Correct 7 ms 5124 KB Output is correct : V - N = 12
45 Correct 61 ms 7432 KB Output is correct : V - N = 12
46 Correct 202 ms 14432 KB Output is correct : V - N = 12
47 Correct 119 ms 9700 KB Output is correct : V - N = 12
48 Correct 288 ms 16112 KB Output is correct : V - N = 12
49 Correct 41 ms 7348 KB Output is correct : V - N = 12
50 Correct 23 ms 5752 KB Output is correct : V - N = 12
51 Correct 488 ms 25580 KB Output is correct : V - N = 12
52 Correct 8 ms 5392 KB Output is correct : V - N = 12
53 Correct 420 ms 23540 KB Output is correct : V - N = 12
54 Correct 501 ms 26952 KB Output is correct : V - N = 12
55 Correct 34 ms 6296 KB Output is correct : V - N = 12
56 Correct 277 ms 17624 KB Output is correct : V - N = 12
57 Correct 507 ms 28196 KB Output is correct : V - N = 12
58 Correct 88 ms 8200 KB Output is correct : V - N = 12
59 Correct 227 ms 14844 KB Output is correct : V - N = 12
60 Correct 521 ms 28508 KB Output is correct : V - N = 12
61 Correct 3 ms 4740 KB Output is correct : V - N = 12
62 Correct 3 ms 4580 KB Output is correct : V - N = 12
63 Correct 3 ms 4612 KB Output is correct : V - N = 12
64 Correct 3 ms 4612 KB Output is correct : V - N = 12
65 Correct 3 ms 4588 KB Output is correct : V - N = 12
66 Correct 5 ms 4736 KB Output is correct : V - N = 12
67 Correct 4 ms 4668 KB Output is correct : V - N = 12
68 Correct 3 ms 4740 KB Output is correct : V - N = 12
69 Correct 3 ms 4540 KB Output is correct : V - N = 12
70 Correct 3 ms 4512 KB Output is correct : V - N = 12
71 Correct 3 ms 4608 KB Output is correct : V - N = 12
72 Correct 3 ms 4612 KB Output is correct : V - N = 12
73 Correct 3 ms 4740 KB Output is correct : V - N = 12
74 Correct 3 ms 4736 KB Output is correct : V - N = 12
75 Correct 3 ms 4512 KB Output is correct : V - N = 12
76 Correct 3 ms 4512 KB Output is correct : V - N = 12
77 Correct 3 ms 4616 KB Output is correct : V - N = 12
78 Correct 3 ms 4536 KB Output is correct : V - N = 12
79 Correct 3 ms 4528 KB Output is correct : V - N = 12
80 Correct 3 ms 4724 KB Output is correct : V - N = 12
81 Correct 3 ms 4620 KB Output is correct : V - N = 12
82 Correct 3 ms 4540 KB Output is correct : V - N = 12
83 Correct 2 ms 4612 KB Output is correct : V - N = 12
84 Correct 2 ms 4592 KB Output is correct : V - N = 12
85 Correct 3 ms 4612 KB Output is correct : V - N = 12
86 Correct 3 ms 4612 KB Output is correct : V - N = 12
87 Correct 4 ms 4752 KB Output is correct : V - N = 12
88 Correct 4 ms 4748 KB Output is correct : V - N = 12
89 Correct 3 ms 4716 KB Output is correct : V - N = 12
90 Correct 3 ms 4624 KB Output is correct : V - N = 12
91 Correct 3 ms 4608 KB Output is correct : V - N = 12
92 Correct 3 ms 4608 KB Output is correct : V - N = 12
93 Correct 3 ms 4612 KB Output is correct : V - N = 12
94 Correct 3 ms 4608 KB Output is correct : V - N = 12
95 Correct 3 ms 4608 KB Output is correct : V - N = 12
96 Correct 4 ms 4560 KB Output is correct : V - N = 12
97 Correct 3 ms 4740 KB Output is correct : V - N = 12
98 Correct 3 ms 4740 KB Output is correct : V - N = 12
99 Correct 3 ms 4740 KB Output is correct : V - N = 12
100 Correct 4 ms 4680 KB Output is correct : V - N = 12
101 Correct 3 ms 4612 KB Output is correct : V - N = 12
102 Correct 4 ms 4620 KB Output is correct : V - N = 12
103 Correct 3 ms 4592 KB Output is correct : V - N = 12
104 Correct 3 ms 4512 KB Output is correct : V - N = 12
105 Correct 3 ms 4540 KB Output is correct : V - N = 12
106 Correct 3 ms 4620 KB Output is correct : V - N = 12
107 Correct 3 ms 4708 KB Output is correct : V - N = 12
108 Correct 3 ms 4612 KB Output is correct : V - N = 12
109 Correct 3 ms 4656 KB Output is correct : V - N = 12
110 Correct 3 ms 4608 KB Output is correct : V - N = 12
111 Correct 3 ms 4608 KB Output is correct : V - N = 12
112 Correct 3 ms 4516 KB Output is correct : V - N = 12
113 Correct 3 ms 4612 KB Output is correct : V - N = 12
114 Correct 3 ms 4636 KB Output is correct : V - N = 12
115 Correct 3 ms 4620 KB Output is correct : V - N = 12
116 Correct 3 ms 4612 KB Output is correct : V - N = 12
117 Correct 3 ms 4640 KB Output is correct : V - N = 12
118 Correct 2 ms 4516 KB Output is correct : V - N = 12
119 Correct 3 ms 4552 KB Output is correct : V - N = 12
120 Correct 3 ms 4592 KB Output is correct : V - N = 12
121 Correct 3 ms 4596 KB Output is correct : V - N = 12
122 Correct 3 ms 4620 KB Output is correct : V - N = 12
123 Correct 3 ms 4620 KB Output is correct : V - N = 12
124 Correct 3 ms 4608 KB Output is correct : V - N = 12
125 Correct 3 ms 4612 KB Output is correct : V - N = 12
126 Correct 3 ms 4540 KB Output is correct : V - N = 12
127 Correct 3 ms 4552 KB Output is correct : V - N = 12
128 Correct 3 ms 4612 KB Output is correct : V - N = 12
129 Correct 3 ms 4540 KB Output is correct : V - N = 12
130 Correct 2 ms 4584 KB Output is correct : V - N = 12
131 Correct 3 ms 4612 KB Output is correct : V - N = 12
132 Correct 2 ms 4528 KB Output is correct : V - N = 12
133 Correct 4 ms 4612 KB Output is correct : V - N = 12
134 Correct 3 ms 4612 KB Output is correct : V - N = 12
135 Correct 3 ms 4612 KB Output is correct : V - N = 12
136 Correct 3 ms 4616 KB Output is correct : V - N = 12
137 Correct 3 ms 4516 KB Output is correct : V - N = 12
138 Correct 2 ms 4612 KB Output is correct : V - N = 12
139 Correct 3 ms 4600 KB Output is correct : V - N = 12
140 Correct 3 ms 4612 KB Output is correct : V - N = 12
141 Correct 3 ms 4612 KB Output is correct : V - N = 12
142 Correct 3 ms 4612 KB Output is correct : V - N = 12
143 Correct 3 ms 4612 KB Output is correct : V - N = 12
144 Correct 3 ms 4588 KB Output is correct : V - N = 12
145 Correct 3 ms 4620 KB Output is correct : V - N = 12
146 Correct 3 ms 4596 KB Output is correct : V - N = 12
147 Correct 3 ms 4612 KB Output is correct : V - N = 12
148 Correct 3 ms 4552 KB Output is correct : V - N = 12
149 Correct 4 ms 4612 KB Output is correct : V - N = 12
150 Correct 2 ms 4596 KB Output is correct : V - N = 12
151 Correct 2 ms 4588 KB Output is correct : V - N = 12
152 Correct 3 ms 4540 KB Output is correct : V - N = 12
153 Correct 3 ms 4608 KB Output is correct : V - N = 12
154 Correct 3 ms 4552 KB Output is correct : V - N = 12
155 Correct 3 ms 4672 KB Output is correct : V - N = 12
156 Correct 3 ms 4604 KB Output is correct : V - N = 12
157 Correct 2 ms 4608 KB Output is correct : V - N = 12
158 Correct 3 ms 4612 KB Output is correct : V - N = 12
159 Correct 3 ms 4516 KB Output is correct : V - N = 12
160 Correct 3 ms 4612 KB Output is correct : V - N = 12
161 Correct 3 ms 4612 KB Output is correct : V - N = 12
162 Correct 3 ms 4592 KB Output is correct : V - N = 12
163 Correct 3 ms 4540 KB Output is correct : V - N = 12
164 Correct 3 ms 4608 KB Output is correct : V - N = 12
165 Correct 3 ms 4616 KB Output is correct : V - N = 12
166 Correct 3 ms 4608 KB Output is correct : V - N = 12
167 Correct 3 ms 4612 KB Output is correct : V - N = 12
168 Correct 3 ms 4612 KB Output is correct : V - N = 12
169 Correct 3 ms 4540 KB Output is correct : V - N = 12
170 Correct 3 ms 4616 KB Output is correct : V - N = 12
171 Correct 3 ms 4616 KB Output is correct : V - N = 12
172 Correct 3 ms 4612 KB Output is correct : V - N = 12
173 Correct 2 ms 4588 KB Output is correct : V - N = 12
174 Correct 3 ms 4588 KB Output is correct : V - N = 12
175 Correct 3 ms 4612 KB Output is correct : V - N = 12
176 Correct 3 ms 4620 KB Output is correct : V - N = 12
177 Correct 3 ms 4620 KB Output is correct : V - N = 12
178 Correct 3 ms 4612 KB Output is correct : V - N = 12