oj.uz

답안 #111097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111097 2019-05-13T15:58:27 Z igzi 항공 노선도 (JOI18_airline) C++17
100 / 100
 865 ms 30960 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
 
using namespace std;
 
void Alice(int n, int m, int a[], int b[]){
vector <pair<int,int>> v;
int i,j,tmp;
for(i=0;i<m;i++){
    v.push_back({a[i],b[i]});
}
for(i=0;i<n;i++){
    tmp=i;
    j=0;
    while(tmp>0){
        if(tmp%2) v.push_back({i,n+j});
        tmp/=2;
        j++;
    }
}
for(i=0;i<n+10;i++){
    v.push_back({i,n+10});
}
for(i=n;i<n+10;i++){
v.push_back({i,n+11});
if(i!=n+9) v.push_back({i,i+1});
}
v.push_back({n,n+2});
v.push_back({n,n+3});
v.push_back({n,n+4});
InitG(n+12,v.size());
for(i=0;i<v.size();i++){
MakeG(i,v[i].first,v[i].second);
}
}
#include "Boblib.h"
#include <bits/stdc++.h>
#define maxN 1020
 
using namespace std;
 
static vector <int> v,adj[maxN];
static bool k[maxN];
 
void dfs(int n){
v.push_back(n);
k[n]=false;
int i;
for(i=0;i<adj[n].size();i++){
if(k[adj[n][i]]){
    dfs(adj[n][i]);
}
}
}
 
void Bob(int n, int m, int a[], int b[]){
int i,j,id,tmp,pom,p[maxN];
int ar[maxN],deg[maxN];
for(i=0;i<m;i++){
    adj[a[i]].push_back(b[i]);
    adj[b[i]].push_back(a[i]);
}
for(i=0;i<n;i++){
    if(adj[i].size()==n-2) id=i;
}
tmp=id;
for(i=0;i<n;i++){
    if(i==id) continue;
    bool x=false;
    for(j=0;j<adj[i].size();j++){
        if(adj[i][j]==id) {x=true; break;}
    }
    if(!x) break;
}
id=i;
for(i=0;i<adj[id].size();i++) k[adj[id][i]]=true;
for(i=0;i<adj[id].size();i++){
    pom=0;
    for(j=0;j<adj[adj[id][i]].size();j++){
        if(k[adj[adj[id][i]][j]]) pom++;
    }
    deg[adj[id][i]]=pom;
}
for(i=0;i<adj[id].size();i++){
    if(deg[adj[id][i]]==4){
        v.push_back(adj[id][i]);
        k[adj[id][i]]=false;
    }
    if(deg[adj[id][i]]==1) pom=adj[id][i];
}
dfs(pom);
reverse(v.begin()+1,v.end());
for(i=0;i<v.size();i++) {k[v[i]]=true; ar[v[i]]=i;}
for(i=0;i<n;i++){
    if(k[i] || i==id || i==tmp) continue;
    pom=0;
    for(j=0;j<adj[i].size();j++){
        if(k[adj[i][j]]){
            pom+=(1<<ar[adj[i][j]]);
        }
    }
    p[i]=pom;
}
vector <pair<int,int>> u;
for(i=0;i<m;i++){
    if(k[a[i]] || a[i]==id || a[i]==tmp || k[b[i]] || b[i]==id || b[i]==tmp) continue;
    u.push_back({p[a[i]],p[b[i]]});
}
InitMap(n-12,u.size());
for(i=0;i<u.size();i++) MakeMap(u[i].first,u[i].second);
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:32:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~

Bob.cpp: In function 'void dfs(int)':
Bob.cpp:14:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<adj[n].size();i++){
         ~^~~~~~~~~~~~~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:29:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(adj[i].size()==n-2) id=i;
        ~~~~~~~~~~~~~^~~~~
Bob.cpp:35:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<adj[i].size();j++){
             ~^~~~~~~~~~~~~~
Bob.cpp:41:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<adj[id].size();i++) k[adj[id][i]]=true;
         ~^~~~~~~~~~~~~~~
Bob.cpp:42:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<adj[id].size();i++){
         ~^~~~~~~~~~~~~~~
Bob.cpp:44:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<adj[adj[id][i]].size();j++){
             ~^~~~~~~~~~~~~~~~~~~~~~~
Bob.cpp:49:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<adj[id].size();i++){
         ~^~~~~~~~~~~~~~~
Bob.cpp:58:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++) {k[v[i]]=true; ar[v[i]]=i;}
         ~^~~~~~~~~
Bob.cpp:62:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<adj[i].size();j++){
             ~^~~~~~~~~~~~~~
Bob.cpp:75:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<u.size();i++) MakeMap(u[i].first,u[i].second);
         ~^~~~~~~~~
Bob.cpp:56:4: warning: 'pom' may be used uninitialized in this function [-Wmaybe-uninitialized]
 dfs(pom);
 ~~~^~~~~
Bob.cpp:71:64: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if(k[a[i]] || a[i]==id || a[i]==tmp || k[b[i]] || b[i]==id || b[i]==tmp) continue;
        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6656 KB Output is correct
2 Correct 9 ms 6912 KB Output is correct
3 Correct 9 ms 6912 KB Output is correct
4 Correct 7 ms 6656 KB Output is correct
5 Correct 9 ms 6848 KB Output is correct
6 Correct 8 ms 6656 KB Output is correct
7 Correct 10 ms 6912 KB Output is correct
8 Correct 9 ms 6912 KB Output is correct
9 Correct 8 ms 6656 KB Output is correct
10 Correct 8 ms 6912 KB Output is correct
11 Correct 11 ms 6752 KB Output is correct
12 Correct 11 ms 6752 KB Output is correct
13 Correct 10 ms 6656 KB Output is correct
14 Correct 9 ms 6912 KB Output is correct
15 Correct 9 ms 6912 KB Output is correct
16 Correct 8 ms 6656 KB Output is correct
17 Correct 9 ms 6736 KB Output is correct
18 Correct 9 ms 6656 KB Output is correct
19 Correct 8 ms 6656 KB Output is correct
20 Correct 9 ms 6656 KB Output is correct
21 Correct 8 ms 6912 KB Output is correct
22 Correct 8 ms 6656 KB Output is correct
23 Correct 7 ms 6672 KB Output is correct
24 Correct 8 ms 6656 KB Output is correct
25 Correct 8 ms 6656 KB Output is correct
26 Correct 8 ms 6656 KB Output is correct
27 Correct 8 ms 6656 KB Output is correct
28 Correct 10 ms 6656 KB Output is correct
29 Correct 8 ms 6656 KB Output is correct
30 Correct 11 ms 6656 KB Output is correct
31 Correct 9 ms 6752 KB Output is correct
32 Correct 9 ms 6912 KB Output is correct
33 Correct 8 ms 6912 KB Output is correct
34 Correct 10 ms 6912 KB Output is correct
35 Correct 8 ms 6656 KB Output is correct
36 Correct 7 ms 6656 KB Output is correct
37 Correct 9 ms 6656 KB Output is correct
38 Correct 8 ms 6760 KB Output is correct
39 Correct 9 ms 6656 KB Output is correct
40 Correct 8 ms 6656 KB Output is correct
41 Correct 9 ms 6912 KB Output is correct
42 Correct 10 ms 6912 KB Output is correct
43 Correct 9 ms 6656 KB Output is correct
44 Correct 9 ms 6656 KB Output is correct
45 Correct 10 ms 6752 KB Output is correct
46 Correct 9 ms 6752 KB Output is correct
47 Correct 8 ms 6768 KB Output is correct
48 Correct 11 ms 6912 KB Output is correct
49 Correct 10 ms 6656 KB Output is correct
50 Correct 10 ms 6856 KB Output is correct
51 Correct 8 ms 6768 KB Output is correct
52 Correct 9 ms 6656 KB Output is correct
53 Correct 9 ms 6656 KB Output is correct
54 Correct 9 ms 6656 KB Output is correct
55 Correct 8 ms 6656 KB Output is correct
56 Correct 8 ms 6912 KB Output is correct
57 Correct 9 ms 6656 KB Output is correct
58 Correct 9 ms 6656 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6656 KB Output is correct
2 Correct 9 ms 6912 KB Output is correct
3 Correct 9 ms 6912 KB Output is correct
4 Correct 7 ms 6656 KB Output is correct
5 Correct 9 ms 6848 KB Output is correct
6 Correct 8 ms 6656 KB Output is correct
7 Correct 10 ms 6912 KB Output is correct
8 Correct 9 ms 6912 KB Output is correct
9 Correct 8 ms 6656 KB Output is correct
10 Correct 8 ms 6912 KB Output is correct
11 Correct 11 ms 6752 KB Output is correct
12 Correct 11 ms 6752 KB Output is correct
13 Correct 10 ms 6656 KB Output is correct
14 Correct 9 ms 6912 KB Output is correct
15 Correct 9 ms 6912 KB Output is correct
16 Correct 8 ms 6656 KB Output is correct
17 Correct 9 ms 6736 KB Output is correct
18 Correct 9 ms 6656 KB Output is correct
19 Correct 8 ms 6656 KB Output is correct
20 Correct 9 ms 6656 KB Output is correct
21 Correct 8 ms 6912 KB Output is correct
22 Correct 8 ms 6656 KB Output is correct
23 Correct 7 ms 6672 KB Output is correct
24 Correct 8 ms 6656 KB Output is correct
25 Correct 8 ms 6656 KB Output is correct
26 Correct 8 ms 6656 KB Output is correct
27 Correct 8 ms 6656 KB Output is correct
28 Correct 10 ms 6656 KB Output is correct
29 Correct 8 ms 6656 KB Output is correct
30 Correct 11 ms 6656 KB Output is correct
31 Correct 9 ms 6752 KB Output is correct
32 Correct 9 ms 6912 KB Output is correct
33 Correct 8 ms 6912 KB Output is correct
34 Correct 10 ms 6912 KB Output is correct
35 Correct 8 ms 6656 KB Output is correct
36 Correct 7 ms 6656 KB Output is correct
37 Correct 9 ms 6656 KB Output is correct
38 Correct 8 ms 6760 KB Output is correct
39 Correct 9 ms 6656 KB Output is correct
40 Correct 8 ms 6656 KB Output is correct
41 Correct 9 ms 6912 KB Output is correct
42 Correct 10 ms 6912 KB Output is correct
43 Correct 9 ms 6656 KB Output is correct
44 Correct 9 ms 6656 KB Output is correct
45 Correct 10 ms 6752 KB Output is correct
46 Correct 9 ms 6752 KB Output is correct
47 Correct 8 ms 6768 KB Output is correct
48 Correct 11 ms 6912 KB Output is correct
49 Correct 10 ms 6656 KB Output is correct
50 Correct 10 ms 6856 KB Output is correct
51 Correct 8 ms 6768 KB Output is correct
52 Correct 9 ms 6656 KB Output is correct
53 Correct 9 ms 6656 KB Output is correct
54 Correct 9 ms 6656 KB Output is correct
55 Correct 8 ms 6656 KB Output is correct
56 Correct 8 ms 6912 KB Output is correct
57 Correct 9 ms 6656 KB Output is correct
58 Correct 9 ms 6656 KB Output is correct
59 Correct 10 ms 6656 KB Output is correct
60 Correct 10 ms 6648 KB Output is correct
61 Correct 9 ms 6656 KB Output is correct
62 Correct 9 ms 6656 KB Output is correct
63 Correct 9 ms 6656 KB Output is correct
64 Correct 11 ms 6912 KB Output is correct
65 Correct 12 ms 6912 KB Output is correct
66 Correct 10 ms 6656 KB Output is correct
67 Correct 10 ms 6656 KB Output is correct
68 Correct 10 ms 6656 KB Output is correct
69 Correct 9 ms 6656 KB Output is correct
70 Correct 9 ms 6712 KB Output is correct
71 Correct 8 ms 6656 KB Output is correct
72 Correct 8 ms 6976 KB Output is correct
73 Correct 10 ms 6872 KB Output is correct
74 Correct 8 ms 6656 KB Output is correct
75 Correct 10 ms 6656 KB Output is correct
76 Correct 10 ms 6968 KB Output is correct
77 Correct 8 ms 6752 KB Output is correct
78 Correct 13 ms 6912 KB Output is correct
79 Correct 9 ms 6912 KB Output is correct
80 Correct 11 ms 6752 KB Output is correct
81 Correct 9 ms 6912 KB Output is correct
82 Correct 10 ms 6656 KB Output is correct
83 Correct 8 ms 6656 KB Output is correct
84 Correct 8 ms 6912 KB Output is correct
85 Correct 8 ms 6656 KB Output is correct
86 Correct 9 ms 6784 KB Output is correct
87 Correct 9 ms 6912 KB Output is correct
88 Correct 8 ms 6656 KB Output is correct
89 Correct 8 ms 6624 KB Output is correct
90 Correct 11 ms 6912 KB Output is correct
91 Correct 8 ms 6656 KB Output is correct
92 Correct 9 ms 6752 KB Output is correct
93 Correct 11 ms 6912 KB Output is correct
94 Correct 8 ms 6656 KB Output is correct
95 Correct 9 ms 6752 KB Output is correct
96 Correct 9 ms 6656 KB Output is correct
97 Correct 9 ms 6912 KB Output is correct
98 Correct 8 ms 6920 KB Output is correct
99 Correct 9 ms 7000 KB Output is correct
100 Correct 10 ms 6968 KB Output is correct
101 Correct 8 ms 6912 KB Output is correct
102 Correct 10 ms 6656 KB Output is correct
103 Correct 9 ms 6912 KB Output is correct
104 Correct 8 ms 6656 KB Output is correct
105 Correct 9 ms 6912 KB Output is correct
106 Correct 9 ms 6656 KB Output is correct
107 Correct 8 ms 6912 KB Output is correct
108 Correct 9 ms 6656 KB Output is correct
109 Correct 9 ms 6656 KB Output is correct
110 Correct 9 ms 6672 KB Output is correct
111 Correct 9 ms 7000 KB Output is correct
112 Correct 12 ms 6912 KB Output is correct
113 Correct 9 ms 6656 KB Output is correct
114 Correct 10 ms 6912 KB Output is correct
115 Correct 35 ms 6656 KB Output is correct
116 Correct 11 ms 6848 KB Output is correct
117 Correct 11 ms 6752 KB Output is correct
118 Correct 11 ms 6912 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 30536 KB Output is correct : V - N = 12
2 Correct 565 ms 25624 KB Output is correct : V - N = 12
3 Correct 227 ms 14032 KB Output is correct : V - N = 12
4 Correct 19 ms 7536 KB Output is correct : V - N = 12
5 Correct 153 ms 11320 KB Output is correct : V - N = 12
6 Correct 466 ms 23940 KB Output is correct : V - N = 12
7 Correct 770 ms 30512 KB Output is correct : V - N = 12
8 Correct 675 ms 27768 KB Output is correct : V - N = 12
9 Correct 316 ms 17288 KB Output is correct : V - N = 12
10 Correct 45 ms 8168 KB Output is correct : V - N = 12
11 Correct 75 ms 9072 KB Output is correct : V - N = 12
12 Correct 393 ms 19168 KB Output is correct : V - N = 12
13 Correct 662 ms 28816 KB Output is correct : V - N = 12
14 Correct 668 ms 29536 KB Output is correct : V - N = 12
15 Correct 452 ms 22624 KB Output is correct : V - N = 12
16 Correct 104 ms 9952 KB Output is correct : V - N = 12
17 Correct 25 ms 7680 KB Output is correct : V - N = 12
18 Correct 276 ms 15664 KB Output is correct : V - N = 12
19 Correct 599 ms 26808 KB Output is correct : V - N = 12
20 Correct 680 ms 30688 KB Output is correct : V - N = 12
21 Correct 218 ms 13080 KB Output is correct : V - N = 12
22 Correct 124 ms 11824 KB Output is correct : V - N = 12
23 Correct 65 ms 8816 KB Output is correct : V - N = 12
24 Correct 12 ms 7024 KB Output is correct : V - N = 12
25 Correct 33 ms 8216 KB Output is correct : V - N = 12
26 Correct 129 ms 11096 KB Output is correct : V - N = 12
27 Correct 192 ms 13016 KB Output is correct : V - N = 12
28 Correct 172 ms 12552 KB Output is correct : V - N = 12
29 Correct 92 ms 9696 KB Output is correct : V - N = 12
30 Correct 16 ms 7544 KB Output is correct : V - N = 12
31 Correct 16 ms 7168 KB Output is correct : V - N = 12
32 Correct 17 ms 7168 KB Output is correct : V - N = 12
33 Correct 14 ms 7168 KB Output is correct : V - N = 12
34 Correct 13 ms 7168 KB Output is correct : V - N = 12
35 Correct 12 ms 7168 KB Output is correct : V - N = 12
36 Correct 780 ms 30960 KB Output is correct : V - N = 12
37 Correct 718 ms 30888 KB Output is correct : V - N = 12
38 Correct 865 ms 30632 KB Output is correct : V - N = 12
39 Correct 723 ms 30688 KB Output is correct : V - N = 12
40 Correct 687 ms 30720 KB Output is correct : V - N = 12
41 Correct 131 ms 10968 KB Output is correct : V - N = 12
42 Correct 106 ms 10200 KB Output is correct : V - N = 12
43 Correct 120 ms 10648 KB Output is correct : V - N = 12
44 Correct 12 ms 7168 KB Output is correct : V - N = 12
45 Correct 80 ms 9440 KB Output is correct : V - N = 12
46 Correct 258 ms 14688 KB Output is correct : V - N = 12
47 Correct 129 ms 11024 KB Output is correct : V - N = 12
48 Correct 326 ms 17416 KB Output is correct : V - N = 12
49 Correct 68 ms 8928 KB Output is correct : V - N = 12
50 Correct 33 ms 7928 KB Output is correct : V - N = 12
51 Correct 535 ms 25808 KB Output is correct : V - N = 12
52 Correct 15 ms 7640 KB Output is correct : V - N = 12
53 Correct 479 ms 23588 KB Output is correct : V - N = 12
54 Correct 681 ms 27424 KB Output is correct : V - N = 12
55 Correct 40 ms 8440 KB Output is correct : V - N = 12
56 Correct 376 ms 18784 KB Output is correct : V - N = 12
57 Correct 798 ms 29096 KB Output is correct : V - N = 12
58 Correct 108 ms 9992 KB Output is correct : V - N = 12
59 Correct 261 ms 15448 KB Output is correct : V - N = 12
60 Correct 754 ms 29664 KB Output is correct : V - N = 12
61 Correct 10 ms 6656 KB Output is correct : V - N = 12
62 Correct 8 ms 6656 KB Output is correct : V - N = 12
63 Correct 11 ms 6656 KB Output is correct : V - N = 12
64 Correct 11 ms 7000 KB Output is correct : V - N = 12
65 Correct 12 ms 6656 KB Output is correct : V - N = 12
66 Correct 10 ms 6656 KB Output is correct : V - N = 12
67 Correct 8 ms 6912 KB Output is correct : V - N = 12
68 Correct 11 ms 6656 KB Output is correct : V - N = 12
69 Correct 23 ms 6912 KB Output is correct : V - N = 12
70 Correct 11 ms 6912 KB Output is correct : V - N = 12
71 Correct 10 ms 6912 KB Output is correct : V - N = 12
72 Correct 9 ms 6912 KB Output is correct : V - N = 12
73 Correct 9 ms 6952 KB Output is correct : V - N = 12
74 Correct 9 ms 6656 KB Output is correct : V - N = 12
75 Correct 11 ms 6912 KB Output is correct : V - N = 12
76 Correct 10 ms 6752 KB Output is correct : V - N = 12
77 Correct 10 ms 6656 KB Output is correct : V - N = 12
78 Correct 10 ms 6656 KB Output is correct : V - N = 12
79 Correct 10 ms 7168 KB Output is correct : V - N = 12
80 Correct 10 ms 6656 KB Output is correct : V - N = 12
81 Correct 9 ms 6656 KB Output is correct : V - N = 12
82 Correct 9 ms 6656 KB Output is correct : V - N = 12
83 Correct 10 ms 6912 KB Output is correct : V - N = 12
84 Correct 5 ms 6912 KB Output is correct : V - N = 12
85 Correct 11 ms 6656 KB Output is correct : V - N = 12
86 Correct 9 ms 6912 KB Output is correct : V - N = 12
87 Correct 9 ms 6912 KB Output is correct : V - N = 12
88 Correct 10 ms 6912 KB Output is correct : V - N = 12
89 Correct 9 ms 6912 KB Output is correct : V - N = 12
90 Correct 9 ms 6656 KB Output is correct : V - N = 12
91 Correct 10 ms 6720 KB Output is correct : V - N = 12
92 Correct 8 ms 6912 KB Output is correct : V - N = 12
93 Correct 7 ms 6656 KB Output is correct : V - N = 12
94 Correct 10 ms 6912 KB Output is correct : V - N = 12
95 Correct 9 ms 7000 KB Output is correct : V - N = 12
96 Correct 10 ms 6856 KB Output is correct : V - N = 12
97 Correct 12 ms 6752 KB Output is correct : V - N = 12
98 Correct 10 ms 6912 KB Output is correct : V - N = 12
99 Correct 9 ms 6656 KB Output is correct : V - N = 12
100 Correct 11 ms 6656 KB Output is correct : V - N = 12
101 Correct 10 ms 6656 KB Output is correct : V - N = 12
102 Correct 10 ms 6656 KB Output is correct : V - N = 12
103 Correct 10 ms 6656 KB Output is correct : V - N = 12
104 Correct 10 ms 6656 KB Output is correct : V - N = 12
105 Correct 9 ms 6744 KB Output is correct : V - N = 12
106 Correct 9 ms 6912 KB Output is correct : V - N = 12
107 Correct 9 ms 6656 KB Output is correct : V - N = 12
108 Correct 10 ms 6912 KB Output is correct : V - N = 12
109 Correct 9 ms 6656 KB Output is correct : V - N = 12
110 Correct 8 ms 6656 KB Output is correct : V - N = 12
111 Correct 8 ms 6656 KB Output is correct : V - N = 12
112 Correct 8 ms 7008 KB Output is correct : V - N = 12
113 Correct 11 ms 6912 KB Output is correct : V - N = 12
114 Correct 9 ms 6656 KB Output is correct : V - N = 12
115 Correct 9 ms 6656 KB Output is correct : V - N = 12
116 Correct 11 ms 7000 KB Output is correct : V - N = 12
117 Correct 9 ms 6656 KB Output is correct : V - N = 12
118 Correct 8 ms 6912 KB Output is correct : V - N = 12
119 Correct 8 ms 6656 KB Output is correct : V - N = 12
120 Correct 9 ms 7168 KB Output is correct : V - N = 12
121 Correct 9 ms 6656 KB Output is correct : V - N = 12
122 Correct 8 ms 6656 KB Output is correct : V - N = 12
123 Correct 8 ms 6656 KB Output is correct : V - N = 12
124 Correct 9 ms 6912 KB Output is correct : V - N = 12
125 Correct 9 ms 6752 KB Output is correct : V - N = 12
126 Correct 9 ms 6648 KB Output is correct : V - N = 12
127 Correct 8 ms 6656 KB Output is correct : V - N = 12
128 Correct 9 ms 6912 KB Output is correct : V - N = 12
129 Correct 10 ms 6912 KB Output is correct : V - N = 12
130 Correct 9 ms 6912 KB Output is correct : V - N = 12
131 Correct 9 ms 6656 KB Output is correct : V - N = 12
132 Correct 11 ms 6656 KB Output is correct : V - N = 12
133 Correct 10 ms 6656 KB Output is correct : V - N = 12
134 Correct 10 ms 6656 KB Output is correct : V - N = 12
135 Correct 9 ms 6912 KB Output is correct : V - N = 12
136 Correct 11 ms 7000 KB Output is correct : V - N = 12
137 Correct 9 ms 6912 KB Output is correct : V - N = 12
138 Correct 10 ms 6656 KB Output is correct : V - N = 12
139 Correct 10 ms 6912 KB Output is correct : V - N = 12
140 Correct 10 ms 6656 KB Output is correct : V - N = 12
141 Correct 10 ms 6912 KB Output is correct : V - N = 12
142 Correct 10 ms 6656 KB Output is correct : V - N = 12
143 Correct 10 ms 6912 KB Output is correct : V - N = 12
144 Correct 6 ms 6656 KB Output is correct : V - N = 12
145 Correct 9 ms 6656 KB Output is correct : V - N = 12
146 Correct 11 ms 6912 KB Output is correct : V - N = 12
147 Correct 11 ms 6912 KB Output is correct : V - N = 12
148 Correct 10 ms 6656 KB Output is correct : V - N = 12
149 Correct 9 ms 6656 KB Output is correct : V - N = 12
150 Correct 10 ms 6656 KB Output is correct : V - N = 12
151 Correct 11 ms 6912 KB Output is correct : V - N = 12
152 Correct 10 ms 6656 KB Output is correct : V - N = 12
153 Correct 13 ms 6912 KB Output is correct : V - N = 12
154 Correct 10 ms 6656 KB Output is correct : V - N = 12
155 Correct 9 ms 6912 KB Output is correct : V - N = 12
156 Correct 10 ms 6912 KB Output is correct : V - N = 12
157 Correct 9 ms 6656 KB Output is correct : V - N = 12
158 Correct 10 ms 6752 KB Output is correct : V - N = 12
159 Correct 9 ms 6912 KB Output is correct : V - N = 12
160 Correct 8 ms 6912 KB Output is correct : V - N = 12
161 Correct 9 ms 6656 KB Output is correct : V - N = 12
162 Correct 9 ms 6712 KB Output is correct : V - N = 12
163 Correct 13 ms 6656 KB Output is correct : V - N = 12
164 Correct 8 ms 6656 KB Output is correct : V - N = 12
165 Correct 9 ms 6656 KB Output is correct : V - N = 12
166 Correct 11 ms 6912 KB Output is correct : V - N = 12
167 Correct 9 ms 6912 KB Output is correct : V - N = 12
168 Correct 8 ms 6912 KB Output is correct : V - N = 12
169 Correct 9 ms 6912 KB Output is correct : V - N = 12
170 Correct 9 ms 6968 KB Output is correct : V - N = 12
171 Correct 11 ms 6656 KB Output is correct : V - N = 12
172 Correct 9 ms 6656 KB Output is correct : V - N = 12
173 Correct 10 ms 6712 KB Output is correct : V - N = 12
174 Correct 9 ms 6912 KB Output is correct : V - N = 12
175 Correct 10 ms 6696 KB Output is correct : V - N = 12
176 Correct 11 ms 6912 KB Output is correct : V - N = 12
177 Correct 11 ms 6912 KB Output is correct : V - N = 12
178 Correct 10 ms 6912 KB Output is correct : V - N = 12