oj.uz

Submission #91499

# Submission time Handle Problem Language Result Execution time Memory
91499 2018-12-27T21:27:24 Z igzi Airline Route Map (JOI18_airline) C++17
100 / 100
 740 ms 30832 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;

vector <int> v,adj[maxN];
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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6904 KB Output is correct
2 Correct 6 ms 6640 KB Output is correct
3 Correct 6 ms 6736 KB Output is correct
4 Correct 7 ms 6896 KB Output is correct
5 Correct 7 ms 6640 KB Output is correct
6 Correct 6 ms 6640 KB Output is correct
7 Correct 7 ms 6896 KB Output is correct
8 Correct 7 ms 6896 KB Output is correct
9 Correct 7 ms 6896 KB Output is correct
10 Correct 8 ms 6640 KB Output is correct
11 Correct 8 ms 6896 KB Output is correct
12 Correct 8 ms 6896 KB Output is correct
13 Correct 7 ms 6896 KB Output is correct
14 Correct 7 ms 6640 KB Output is correct
15 Correct 7 ms 6904 KB Output is correct
16 Correct 7 ms 6640 KB Output is correct
17 Correct 8 ms 6896 KB Output is correct
18 Correct 8 ms 6736 KB Output is correct
19 Correct 6 ms 6640 KB Output is correct
20 Correct 7 ms 6640 KB Output is correct
21 Correct 8 ms 6904 KB Output is correct
22 Correct 8 ms 6896 KB Output is correct
23 Correct 8 ms 6736 KB Output is correct
24 Correct 8 ms 6744 KB Output is correct
25 Correct 8 ms 6896 KB Output is correct
26 Correct 8 ms 6640 KB Output is correct
27 Correct 8 ms 6640 KB Output is correct
28 Correct 8 ms 6640 KB Output is correct
29 Correct 8 ms 6640 KB Output is correct
30 Correct 7 ms 6640 KB Output is correct
31 Correct 7 ms 6648 KB Output is correct
32 Correct 7 ms 6784 KB Output is correct
33 Correct 7 ms 6736 KB Output is correct
34 Correct 8 ms 6736 KB Output is correct
35 Correct 7 ms 6736 KB Output is correct
36 Correct 8 ms 6664 KB Output is correct
37 Correct 8 ms 6608 KB Output is correct
38 Correct 6 ms 6640 KB Output is correct
39 Correct 8 ms 6664 KB Output is correct
40 Correct 8 ms 6640 KB Output is correct
41 Correct 8 ms 6896 KB Output is correct
42 Correct 8 ms 6560 KB Output is correct
43 Correct 8 ms 6648 KB Output is correct
44 Correct 8 ms 6640 KB Output is correct
45 Correct 7 ms 6736 KB Output is correct
46 Correct 8 ms 6640 KB Output is correct
47 Correct 8 ms 6640 KB Output is correct
48 Correct 8 ms 6896 KB Output is correct
49 Correct 8 ms 6640 KB Output is correct
50 Correct 8 ms 6648 KB Output is correct
51 Correct 7 ms 6736 KB Output is correct
52 Correct 8 ms 6792 KB Output is correct
53 Correct 8 ms 6744 KB Output is correct
54 Correct 8 ms 6640 KB Output is correct
55 Correct 8 ms 6640 KB Output is correct
56 Correct 8 ms 6896 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 7 ms 6640 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6904 KB Output is correct
2 Correct 6 ms 6640 KB Output is correct
3 Correct 6 ms 6736 KB Output is correct
4 Correct 7 ms 6896 KB Output is correct
5 Correct 7 ms 6640 KB Output is correct
6 Correct 6 ms 6640 KB Output is correct
7 Correct 7 ms 6896 KB Output is correct
8 Correct 7 ms 6896 KB Output is correct
9 Correct 7 ms 6896 KB Output is correct
10 Correct 8 ms 6640 KB Output is correct
11 Correct 8 ms 6896 KB Output is correct
12 Correct 8 ms 6896 KB Output is correct
13 Correct 7 ms 6896 KB Output is correct
14 Correct 7 ms 6640 KB Output is correct
15 Correct 7 ms 6904 KB Output is correct
16 Correct 7 ms 6640 KB Output is correct
17 Correct 8 ms 6896 KB Output is correct
18 Correct 8 ms 6736 KB Output is correct
19 Correct 6 ms 6640 KB Output is correct
20 Correct 7 ms 6640 KB Output is correct
21 Correct 8 ms 6904 KB Output is correct
22 Correct 8 ms 6896 KB Output is correct
23 Correct 8 ms 6736 KB Output is correct
24 Correct 8 ms 6744 KB Output is correct
25 Correct 8 ms 6896 KB Output is correct
26 Correct 8 ms 6640 KB Output is correct
27 Correct 8 ms 6640 KB Output is correct
28 Correct 8 ms 6640 KB Output is correct
29 Correct 8 ms 6640 KB Output is correct
30 Correct 7 ms 6640 KB Output is correct
31 Correct 7 ms 6648 KB Output is correct
32 Correct 7 ms 6784 KB Output is correct
33 Correct 7 ms 6736 KB Output is correct
34 Correct 8 ms 6736 KB Output is correct
35 Correct 7 ms 6736 KB Output is correct
36 Correct 8 ms 6664 KB Output is correct
37 Correct 8 ms 6608 KB Output is correct
38 Correct 6 ms 6640 KB Output is correct
39 Correct 8 ms 6664 KB Output is correct
40 Correct 8 ms 6640 KB Output is correct
41 Correct 8 ms 6896 KB Output is correct
42 Correct 8 ms 6560 KB Output is correct
43 Correct 8 ms 6648 KB Output is correct
44 Correct 8 ms 6640 KB Output is correct
45 Correct 7 ms 6736 KB Output is correct
46 Correct 8 ms 6640 KB Output is correct
47 Correct 8 ms 6640 KB Output is correct
48 Correct 8 ms 6896 KB Output is correct
49 Correct 8 ms 6640 KB Output is correct
50 Correct 8 ms 6648 KB Output is correct
51 Correct 7 ms 6736 KB Output is correct
52 Correct 8 ms 6792 KB Output is correct
53 Correct 8 ms 6744 KB Output is correct
54 Correct 8 ms 6640 KB Output is correct
55 Correct 8 ms 6640 KB Output is correct
56 Correct 8 ms 6896 KB Output is correct
57 Correct 8 ms 6640 KB Output is correct
58 Correct 7 ms 6640 KB Output is correct
59 Correct 8 ms 6640 KB Output is correct
60 Correct 8 ms 6896 KB Output is correct
61 Correct 8 ms 6640 KB Output is correct
62 Correct 8 ms 6640 KB Output is correct
63 Correct 8 ms 6736 KB Output is correct
64 Correct 8 ms 6640 KB Output is correct
65 Correct 8 ms 6904 KB Output is correct
66 Correct 8 ms 6640 KB Output is correct
67 Correct 4 ms 6736 KB Output is correct
68 Correct 8 ms 6704 KB Output is correct
69 Correct 7 ms 6640 KB Output is correct
70 Correct 8 ms 6640 KB Output is correct
71 Correct 8 ms 6656 KB Output is correct
72 Correct 8 ms 6736 KB Output is correct
73 Correct 8 ms 6640 KB Output is correct
74 Correct 8 ms 6896 KB Output is correct
75 Correct 8 ms 6904 KB Output is correct
76 Correct 8 ms 6896 KB Output is correct
77 Correct 8 ms 6776 KB Output is correct
78 Correct 8 ms 6640 KB Output is correct
79 Correct 8 ms 6896 KB Output is correct
80 Correct 8 ms 6640 KB Output is correct
81 Correct 8 ms 6640 KB Output is correct
82 Correct 7 ms 6896 KB Output is correct
83 Correct 7 ms 6952 KB Output is correct
84 Correct 7 ms 6640 KB Output is correct
85 Correct 8 ms 6640 KB Output is correct
86 Correct 8 ms 6640 KB Output is correct
87 Correct 8 ms 6736 KB Output is correct
88 Correct 6 ms 6640 KB Output is correct
89 Correct 8 ms 6640 KB Output is correct
90 Correct 8 ms 6640 KB Output is correct
91 Correct 8 ms 6896 KB Output is correct
92 Correct 7 ms 6896 KB Output is correct
93 Correct 8 ms 6952 KB Output is correct
94 Correct 8 ms 6640 KB Output is correct
95 Correct 8 ms 6640 KB Output is correct
96 Correct 8 ms 6640 KB Output is correct
97 Correct 8 ms 6640 KB Output is correct
98 Correct 8 ms 6600 KB Output is correct
99 Correct 8 ms 6896 KB Output is correct
100 Correct 8 ms 6640 KB Output is correct
101 Correct 8 ms 6904 KB Output is correct
102 Correct 7 ms 6640 KB Output is correct
103 Correct 8 ms 6640 KB Output is correct
104 Correct 7 ms 6640 KB Output is correct
105 Correct 8 ms 6640 KB Output is correct
106 Correct 8 ms 6736 KB Output is correct
107 Correct 8 ms 6736 KB Output is correct
108 Correct 8 ms 6640 KB Output is correct
109 Correct 8 ms 6680 KB Output is correct
110 Correct 6 ms 6576 KB Output is correct
111 Correct 8 ms 6648 KB Output is correct
112 Correct 7 ms 6640 KB Output is correct
113 Correct 7 ms 6672 KB Output is correct
114 Correct 8 ms 6648 KB Output is correct
115 Correct 8 ms 6824 KB Output is correct
116 Correct 7 ms 6744 KB Output is correct
117 Correct 8 ms 6640 KB Output is correct
118 Correct 8 ms 6640 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 644 ms 30704 KB Output is correct : V - N = 12
2 Correct 490 ms 25648 KB Output is correct : V - N = 12
3 Correct 182 ms 13968 KB Output is correct : V - N = 12
4 Correct 18 ms 7496 KB Output is correct : V - N = 12
5 Correct 144 ms 11088 KB Output is correct : V - N = 12
6 Correct 441 ms 23732 KB Output is correct : V - N = 12
7 Correct 740 ms 30080 KB Output is correct : V - N = 12
8 Correct 605 ms 27736 KB Output is correct : V - N = 12
9 Correct 309 ms 17184 KB Output is correct : V - N = 12
10 Correct 45 ms 8424 KB Output is correct : V - N = 12
11 Correct 71 ms 9112 KB Output is correct : V - N = 12
12 Correct 371 ms 18968 KB Output is correct : V - N = 12
13 Correct 707 ms 28800 KB Output is correct : V - N = 12
14 Correct 657 ms 29440 KB Output is correct : V - N = 12
15 Correct 430 ms 22592 KB Output is correct : V - N = 12
16 Correct 95 ms 10080 KB Output is correct : V - N = 12
17 Correct 19 ms 7624 KB Output is correct : V - N = 12
18 Correct 223 ms 15640 KB Output is correct : V - N = 12
19 Correct 564 ms 26528 KB Output is correct : V - N = 12
20 Correct 723 ms 30512 KB Output is correct : V - N = 12
21 Correct 189 ms 13152 KB Output is correct : V - N = 12
22 Correct 144 ms 11880 KB Output is correct : V - N = 12
23 Correct 64 ms 8768 KB Output is correct : V - N = 12
24 Correct 10 ms 6992 KB Output is correct : V - N = 12
25 Correct 33 ms 8200 KB Output is correct : V - N = 12
26 Correct 110 ms 11192 KB Output is correct : V - N = 12
27 Correct 169 ms 13032 KB Output is correct : V - N = 12
28 Correct 150 ms 12424 KB Output is correct : V - N = 12
29 Correct 88 ms 9696 KB Output is correct : V - N = 12
30 Correct 12 ms 7408 KB Output is correct : V - N = 12
31 Correct 10 ms 7152 KB Output is correct : V - N = 12
32 Correct 10 ms 7240 KB Output is correct : V - N = 12
33 Correct 10 ms 7288 KB Output is correct : V - N = 12
34 Correct 10 ms 7152 KB Output is correct : V - N = 12
35 Correct 11 ms 6992 KB Output is correct : V - N = 12
36 Correct 691 ms 30584 KB Output is correct : V - N = 12
37 Correct 688 ms 30600 KB Output is correct : V - N = 12
38 Correct 642 ms 30512 KB Output is correct : V - N = 12
39 Correct 702 ms 30800 KB Output is correct : V - N = 12
40 Correct 586 ms 30832 KB Output is correct : V - N = 12
41 Correct 141 ms 11080 KB Output is correct : V - N = 12
42 Correct 119 ms 10288 KB Output is correct : V - N = 12
43 Correct 108 ms 10504 KB Output is correct : V - N = 12
44 Correct 13 ms 7408 KB Output is correct : V - N = 12
45 Correct 71 ms 9184 KB Output is correct : V - N = 12
46 Correct 225 ms 14672 KB Output is correct : V - N = 12
47 Correct 132 ms 10992 KB Output is correct : V - N = 12
48 Correct 313 ms 17560 KB Output is correct : V - N = 12
49 Correct 89 ms 8912 KB Output is correct : V - N = 12
50 Correct 27 ms 7784 KB Output is correct : V - N = 12
51 Correct 531 ms 25740 KB Output is correct : V - N = 12
52 Correct 14 ms 7248 KB Output is correct : V - N = 12
53 Correct 468 ms 23516 KB Output is correct : V - N = 12
54 Correct 615 ms 27296 KB Output is correct : V - N = 12
55 Correct 41 ms 8120 KB Output is correct : V - N = 12
56 Correct 373 ms 18576 KB Output is correct : V - N = 12
57 Correct 614 ms 29064 KB Output is correct : V - N = 12
58 Correct 89 ms 9912 KB Output is correct : V - N = 12
59 Correct 226 ms 15552 KB Output is correct : V - N = 12
60 Correct 638 ms 29680 KB Output is correct : V - N = 12
61 Correct 13 ms 6896 KB Output is correct : V - N = 12
62 Correct 8 ms 6640 KB Output is correct : V - N = 12
63 Correct 8 ms 6640 KB Output is correct : V - N = 12
64 Correct 8 ms 6896 KB Output is correct : V - N = 12
65 Correct 8 ms 6736 KB Output is correct : V - N = 12
66 Correct 8 ms 6896 KB Output is correct : V - N = 12
67 Correct 8 ms 6736 KB Output is correct : V - N = 12
68 Correct 9 ms 6640 KB Output is correct : V - N = 12
69 Correct 8 ms 6896 KB Output is correct : V - N = 12
70 Correct 8 ms 6640 KB Output is correct : V - N = 12
71 Correct 8 ms 6640 KB Output is correct : V - N = 12
72 Correct 8 ms 6736 KB Output is correct : V - N = 12
73 Correct 8 ms 6896 KB Output is correct : V - N = 12
74 Correct 8 ms 6640 KB Output is correct : V - N = 12
75 Correct 8 ms 6640 KB Output is correct : V - N = 12
76 Correct 8 ms 6640 KB Output is correct : V - N = 12
77 Correct 8 ms 6768 KB Output is correct : V - N = 12
78 Correct 8 ms 6640 KB Output is correct : V - N = 12
79 Correct 8 ms 6896 KB Output is correct : V - N = 12
80 Correct 8 ms 6640 KB Output is correct : V - N = 12
81 Correct 8 ms 6896 KB Output is correct : V - N = 12
82 Correct 8 ms 6640 KB Output is correct : V - N = 12
83 Correct 8 ms 6640 KB Output is correct : V - N = 12
84 Correct 8 ms 6640 KB Output is correct : V - N = 12
85 Correct 7 ms 6640 KB Output is correct : V - N = 12
86 Correct 8 ms 6736 KB Output is correct : V - N = 12
87 Correct 8 ms 6648 KB Output is correct : V - N = 12
88 Correct 8 ms 6648 KB Output is correct : V - N = 12
89 Correct 8 ms 6640 KB Output is correct : V - N = 12
90 Correct 8 ms 6640 KB Output is correct : V - N = 12
91 Correct 8 ms 6736 KB Output is correct : V - N = 12
92 Correct 8 ms 6640 KB Output is correct : V - N = 12
93 Correct 8 ms 6896 KB Output is correct : V - N = 12
94 Correct 7 ms 6896 KB Output is correct : V - N = 12
95 Correct 7 ms 6640 KB Output is correct : V - N = 12
96 Correct 9 ms 6896 KB Output is correct : V - N = 12
97 Correct 8 ms 6640 KB Output is correct : V - N = 12
98 Correct 8 ms 6640 KB Output is correct : V - N = 12
99 Correct 7 ms 6640 KB Output is correct : V - N = 12
100 Correct 8 ms 6744 KB Output is correct : V - N = 12
101 Correct 8 ms 6896 KB Output is correct : V - N = 12
102 Correct 7 ms 6896 KB Output is correct : V - N = 12
103 Correct 7 ms 6648 KB Output is correct : V - N = 12
104 Correct 18 ms 6688 KB Output is correct : V - N = 12
105 Correct 7 ms 6896 KB Output is correct : V - N = 12
106 Correct 7 ms 6720 KB Output is correct : V - N = 12
107 Correct 8 ms 6904 KB Output is correct : V - N = 12
108 Correct 6 ms 6640 KB Output is correct : V - N = 12
109 Correct 6 ms 6744 KB Output is correct : V - N = 12
110 Correct 8 ms 6896 KB Output is correct : V - N = 12
111 Correct 7 ms 6896 KB Output is correct : V - N = 12
112 Correct 7 ms 6640 KB Output is correct : V - N = 12
113 Correct 6 ms 6736 KB Output is correct : V - N = 12
114 Correct 8 ms 6704 KB Output is correct : V - N = 12
115 Correct 7 ms 6640 KB Output is correct : V - N = 12
116 Correct 8 ms 6640 KB Output is correct : V - N = 12
117 Correct 9 ms 6640 KB Output is correct : V - N = 12
118 Correct 8 ms 6896 KB Output is correct : V - N = 12
119 Correct 8 ms 6896 KB Output is correct : V - N = 12
120 Correct 8 ms 6896 KB Output is correct : V - N = 12
121 Correct 7 ms 7152 KB Output is correct : V - N = 12
122 Correct 8 ms 6640 KB Output is correct : V - N = 12
123 Correct 8 ms 6896 KB Output is correct : V - N = 12
124 Correct 7 ms 6640 KB Output is correct : V - N = 12
125 Correct 8 ms 6640 KB Output is correct : V - N = 12
126 Correct 7 ms 6840 KB Output is correct : V - N = 12
127 Correct 8 ms 6896 KB Output is correct : V - N = 12
128 Correct 8 ms 6640 KB Output is correct : V - N = 12
129 Correct 7 ms 6728 KB Output is correct : V - N = 12
130 Correct 6 ms 6640 KB Output is correct : V - N = 12
131 Correct 8 ms 6800 KB Output is correct : V - N = 12
132 Correct 8 ms 6640 KB Output is correct : V - N = 12
133 Correct 7 ms 6736 KB Output is correct : V - N = 12
134 Correct 8 ms 6640 KB Output is correct : V - N = 12
135 Correct 8 ms 6896 KB Output is correct : V - N = 12
136 Correct 8 ms 6640 KB Output is correct : V - N = 12
137 Correct 8 ms 6896 KB Output is correct : V - N = 12
138 Correct 8 ms 6640 KB Output is correct : V - N = 12
139 Correct 8 ms 6640 KB Output is correct : V - N = 12
140 Correct 8 ms 6896 KB Output is correct : V - N = 12
141 Correct 8 ms 6648 KB Output is correct : V - N = 12
142 Correct 7 ms 6640 KB Output is correct : V - N = 12
143 Correct 8 ms 6896 KB Output is correct : V - N = 12
144 Correct 7 ms 6680 KB Output is correct : V - N = 12
145 Correct 8 ms 6640 KB Output is correct : V - N = 12
146 Correct 7 ms 6752 KB Output is correct : V - N = 12
147 Correct 7 ms 6640 KB Output is correct : V - N = 12
148 Correct 7 ms 6648 KB Output is correct : V - N = 12
149 Correct 8 ms 6736 KB Output is correct : V - N = 12
150 Correct 6 ms 6640 KB Output is correct : V - N = 12
151 Correct 8 ms 6640 KB Output is correct : V - N = 12
152 Correct 7 ms 6736 KB Output is correct : V - N = 12
153 Correct 5 ms 6656 KB Output is correct : V - N = 12
154 Correct 7 ms 6896 KB Output is correct : V - N = 12
155 Correct 7 ms 6632 KB Output is correct : V - N = 12
156 Correct 7 ms 6784 KB Output is correct : V - N = 12
157 Correct 7 ms 6784 KB Output is correct : V - N = 12
158 Correct 6 ms 6896 KB Output is correct : V - N = 12
159 Correct 6 ms 6728 KB Output is correct : V - N = 12
160 Correct 4 ms 6640 KB Output is correct : V - N = 12
161 Correct 7 ms 6736 KB Output is correct : V - N = 12
162 Correct 7 ms 6640 KB Output is correct : V - N = 12
163 Correct 7 ms 6640 KB Output is correct : V - N = 12
164 Correct 7 ms 6640 KB Output is correct : V - N = 12
165 Correct 7 ms 6640 KB Output is correct : V - N = 12
166 Correct 8 ms 6896 KB Output is correct : V - N = 12
167 Correct 8 ms 6640 KB Output is correct : V - N = 12
168 Correct 6 ms 6640 KB Output is correct : V - N = 12
169 Correct 8 ms 6736 KB Output is correct : V - N = 12
170 Correct 7 ms 6896 KB Output is correct : V - N = 12
171 Correct 7 ms 6640 KB Output is correct : V - N = 12
172 Correct 7 ms 6896 KB Output is correct : V - N = 12
173 Correct 8 ms 6728 KB Output is correct : V - N = 12
174 Correct 8 ms 6896 KB Output is correct : V - N = 12
175 Correct 7 ms 6648 KB Output is correct : V - N = 12
176 Correct 6 ms 6640 KB Output is correct : V - N = 12
177 Correct 7 ms 6640 KB Output is correct : V - N = 12
178 Correct 7 ms 6640 KB Output is correct : V - N = 12