oj.uz

답안 #470765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470765 2021-09-05T13:31:31 Z NhatMinh0208 항공 노선도 (JOI18_airline) C++17
100 / 100
 865 ms 33368 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//

#endif

#include "Alicelib.h"
#include <cassert>
#include <cstdio>

void Alice( int N, int M, int A[], int B[] ){
    vector<pii(int)> lmao;
    for (int i=0;i<M;i++) {
        lmao.emplace_back(A[i],B[i]);
    }
    for (int i=0;i<N;i++) for (int j=0;j<10;j++) {
        if (i&(1<<j)) lmao.push_back({i,N+j});
    }
    for (int i=0;i<10;i++) {
        lmao.push_back({N+i,N+10});
    }
    for (int i=1;i<10;i++) {
        lmao.push_back({N+i-1,N+i});
    }
    for (int i=0;i<N+10;i++) {
        lmao.push_back({i,N+11});
    }
    InitG(N+12,lmao.size());
    int u=-1;
    for (auto g : lmao) {
        u++;
        // cout<<g.fi<<' '<<g.se<<endl;
        MakeG(u, g.fi, g.se);
    }
    // cout<<endl<<endl;
}


#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

//---------END-------//

#endif


#include "Boblib.h"
#include <cassert>
#include <cstdio>


vector<int> gt[1012];
vector<int> ancs;
int usedd[1012];

void dfs(int x, int p) {
    ancs.push_back(x);
    for (auto g : gt[x]) if (usedd[g] && g-p) dfs(g,x);
}

void Bob( int V, int U, int C[], int D[] ){
    int adj[1012][1012];
    int arr[1012];
    int pos[1012];
    int N=V-12;
    if (N==1) {
        InitMap(1,0);
        return;
    }

    
    for (int i=0;i<V;i++) {
        arr[i]=pos[i]=usedd[i]=0;
    }
    for (int i=0;i<V;i++) for (int j=0;j<V;j++) {
        adj[i][j]=0;
    }

    for (int i=0;i<U;i++) {
         // cout<<C[i]<<' '<<D[i]<<endl;
        adj[C[i]][D[i]]=1;
        adj[D[i]][C[i]]=1;
        gt[C[i]].push_back(D[i]);
        gt[D[i]].push_back(C[i]);
    }
    int i,j,k;
    for (i=0;i<V;i++) if (gt[i].size() == V-2) break;
    arr[N+11]=i;
    pos[i]=N+11;
    for (i=0;i<V;i++) if (i-arr[N+11] && adj[i][arr[N+11]]==0) break;
    arr[N+10]=i;
    pos[i]=N+10;
    ancs=gt[arr[N+10]];
    for (auto g : ancs) {
        usedd[g]=1;
        // cout<<g<<' ';
    }
    // cout<<endl;
    for (auto g : ancs) {
        i=0;
        for (auto gg : gt[g]) if (usedd[gg]) i++;
        if (i==1) {
            j=g;
            break;
        } 
    }
    ancs.clear();
    dfs(j,-1);

    if (gt[ancs[0]].size()<gt[ancs[9]].size()) reverse(ancs.begin(),ancs.end());
    for (i=0;i<10;i++) {
        arr[N+i]=ancs[i];
        pos[ancs[i]]=N+i;
    }
    for (i=0;i<V;i++) if (!pos[i]) {
        int u=0,v;
        for (auto g : gt[i])  {
            v=pos[g];
            if (v>=N && v<N+10) {
                u+=(1<<(v-N));
            }
        }
        pos[i]=u;
        arr[u]=i;
    }
    // for (i=0;i<V;i++) {cout<<arr[i]<<' ';} // cout<<endl;
    // for (i=0;i<V;i++) {cout<<pos[i]<<' ';} // cout<<endl;
    vector<pii(int)> lmao;
    for (i=0;i<U;i++) {
        int u,v;
        u=pos[C[i]];
        v=pos[D[i]];
        if (u>=0 && v>=0 && u<N && v<N) {
            lmao.push_back({u,v});
        }
    }
    InitMap(N,lmao.size());
    for (auto g : lmao) MakeMap(g.fi, g.se);
}

Compilation message

Alice.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 

Bob.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:129:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  129 |     for (i=0;i<V;i++) if (gt[i].size() == V-2) break;
      |                           ~~~~~~~~~~~~~^~~~~~
Bob.cpp:128:13: warning: unused variable 'k' [-Wunused-variable]
  128 |     int i,j,k;
      |             ^
Bob.cpp:128:11: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
  128 |     int i,j,k;
      |           ^

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8612 KB Output is correct
2 Correct 5 ms 8684 KB Output is correct
3 Correct 5 ms 8612 KB Output is correct
4 Correct 5 ms 8552 KB Output is correct
5 Correct 5 ms 8684 KB Output is correct
6 Correct 5 ms 8712 KB Output is correct
7 Correct 5 ms 8612 KB Output is correct
8 Correct 6 ms 8696 KB Output is correct
9 Correct 5 ms 8624 KB Output is correct
10 Correct 5 ms 8684 KB Output is correct
11 Correct 5 ms 8684 KB Output is correct
12 Correct 5 ms 8604 KB Output is correct
13 Correct 5 ms 8688 KB Output is correct
14 Correct 5 ms 8684 KB Output is correct
15 Correct 5 ms 8484 KB Output is correct
16 Correct 5 ms 8508 KB Output is correct
17 Correct 5 ms 8624 KB Output is correct
18 Correct 5 ms 8684 KB Output is correct
19 Correct 6 ms 8612 KB Output is correct
20 Correct 5 ms 8720 KB Output is correct
21 Correct 5 ms 8688 KB Output is correct
22 Correct 5 ms 8676 KB Output is correct
23 Correct 5 ms 8664 KB Output is correct
24 Correct 5 ms 8680 KB Output is correct
25 Correct 5 ms 8612 KB Output is correct
26 Correct 6 ms 8624 KB Output is correct
27 Correct 5 ms 8488 KB Output is correct
28 Correct 5 ms 8612 KB Output is correct
29 Correct 5 ms 8684 KB Output is correct
30 Correct 5 ms 8660 KB Output is correct
31 Correct 5 ms 8608 KB Output is correct
32 Correct 5 ms 8552 KB Output is correct
33 Correct 5 ms 8676 KB Output is correct
34 Correct 5 ms 8564 KB Output is correct
35 Correct 5 ms 8680 KB Output is correct
36 Correct 5 ms 8684 KB Output is correct
37 Correct 5 ms 8612 KB Output is correct
38 Correct 5 ms 8684 KB Output is correct
39 Correct 5 ms 8624 KB Output is correct
40 Correct 5 ms 8612 KB Output is correct
41 Correct 5 ms 8612 KB Output is correct
42 Correct 5 ms 8464 KB Output is correct
43 Correct 5 ms 8560 KB Output is correct
44 Correct 5 ms 8680 KB Output is correct
45 Correct 5 ms 8620 KB Output is correct
46 Correct 5 ms 8676 KB Output is correct
47 Correct 5 ms 8560 KB Output is correct
48 Correct 5 ms 8684 KB Output is correct
49 Correct 5 ms 8684 KB Output is correct
50 Correct 5 ms 8624 KB Output is correct
51 Correct 5 ms 8552 KB Output is correct
52 Correct 5 ms 8684 KB Output is correct
53 Correct 5 ms 8676 KB Output is correct
54 Correct 5 ms 8684 KB Output is correct
55 Correct 5 ms 8684 KB Output is correct
56 Correct 5 ms 8680 KB Output is correct
57 Correct 5 ms 8556 KB Output is correct
58 Correct 5 ms 8684 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8612 KB Output is correct
2 Correct 5 ms 8684 KB Output is correct
3 Correct 5 ms 8612 KB Output is correct
4 Correct 5 ms 8552 KB Output is correct
5 Correct 5 ms 8684 KB Output is correct
6 Correct 5 ms 8712 KB Output is correct
7 Correct 5 ms 8612 KB Output is correct
8 Correct 6 ms 8696 KB Output is correct
9 Correct 5 ms 8624 KB Output is correct
10 Correct 5 ms 8684 KB Output is correct
11 Correct 5 ms 8684 KB Output is correct
12 Correct 5 ms 8604 KB Output is correct
13 Correct 5 ms 8688 KB Output is correct
14 Correct 5 ms 8684 KB Output is correct
15 Correct 5 ms 8484 KB Output is correct
16 Correct 5 ms 8508 KB Output is correct
17 Correct 5 ms 8624 KB Output is correct
18 Correct 5 ms 8684 KB Output is correct
19 Correct 6 ms 8612 KB Output is correct
20 Correct 5 ms 8720 KB Output is correct
21 Correct 5 ms 8688 KB Output is correct
22 Correct 5 ms 8676 KB Output is correct
23 Correct 5 ms 8664 KB Output is correct
24 Correct 5 ms 8680 KB Output is correct
25 Correct 5 ms 8612 KB Output is correct
26 Correct 6 ms 8624 KB Output is correct
27 Correct 5 ms 8488 KB Output is correct
28 Correct 5 ms 8612 KB Output is correct
29 Correct 5 ms 8684 KB Output is correct
30 Correct 5 ms 8660 KB Output is correct
31 Correct 5 ms 8608 KB Output is correct
32 Correct 5 ms 8552 KB Output is correct
33 Correct 5 ms 8676 KB Output is correct
34 Correct 5 ms 8564 KB Output is correct
35 Correct 5 ms 8680 KB Output is correct
36 Correct 5 ms 8684 KB Output is correct
37 Correct 5 ms 8612 KB Output is correct
38 Correct 5 ms 8684 KB Output is correct
39 Correct 5 ms 8624 KB Output is correct
40 Correct 5 ms 8612 KB Output is correct
41 Correct 5 ms 8612 KB Output is correct
42 Correct 5 ms 8464 KB Output is correct
43 Correct 5 ms 8560 KB Output is correct
44 Correct 5 ms 8680 KB Output is correct
45 Correct 5 ms 8620 KB Output is correct
46 Correct 5 ms 8676 KB Output is correct
47 Correct 5 ms 8560 KB Output is correct
48 Correct 5 ms 8684 KB Output is correct
49 Correct 5 ms 8684 KB Output is correct
50 Correct 5 ms 8624 KB Output is correct
51 Correct 5 ms 8552 KB Output is correct
52 Correct 5 ms 8684 KB Output is correct
53 Correct 5 ms 8676 KB Output is correct
54 Correct 5 ms 8684 KB Output is correct
55 Correct 5 ms 8684 KB Output is correct
56 Correct 5 ms 8680 KB Output is correct
57 Correct 5 ms 8556 KB Output is correct
58 Correct 5 ms 8684 KB Output is correct
59 Correct 6 ms 8720 KB Output is correct
60 Correct 5 ms 8752 KB Output is correct
61 Correct 5 ms 8592 KB Output is correct
62 Correct 5 ms 8632 KB Output is correct
63 Correct 5 ms 8612 KB Output is correct
64 Correct 5 ms 8684 KB Output is correct
65 Correct 5 ms 8820 KB Output is correct
66 Correct 6 ms 8692 KB Output is correct
67 Correct 5 ms 8684 KB Output is correct
68 Correct 5 ms 8684 KB Output is correct
69 Correct 5 ms 8608 KB Output is correct
70 Correct 5 ms 8692 KB Output is correct
71 Correct 5 ms 8812 KB Output is correct
72 Correct 5 ms 8724 KB Output is correct
73 Correct 6 ms 8792 KB Output is correct
74 Correct 5 ms 8676 KB Output is correct
75 Correct 5 ms 8664 KB Output is correct
76 Correct 5 ms 8684 KB Output is correct
77 Correct 5 ms 8792 KB Output is correct
78 Correct 5 ms 8708 KB Output is correct
79 Correct 5 ms 8740 KB Output is correct
80 Correct 5 ms 8612 KB Output is correct
81 Correct 5 ms 8600 KB Output is correct
82 Correct 5 ms 8584 KB Output is correct
83 Correct 5 ms 8668 KB Output is correct
84 Correct 5 ms 8684 KB Output is correct
85 Correct 5 ms 8740 KB Output is correct
86 Correct 6 ms 8808 KB Output is correct
87 Correct 5 ms 8664 KB Output is correct
88 Correct 5 ms 8692 KB Output is correct
89 Correct 5 ms 8680 KB Output is correct
90 Correct 5 ms 8684 KB Output is correct
91 Correct 5 ms 8608 KB Output is correct
92 Correct 5 ms 8680 KB Output is correct
93 Correct 5 ms 8592 KB Output is correct
94 Correct 5 ms 8812 KB Output is correct
95 Correct 5 ms 8796 KB Output is correct
96 Correct 5 ms 8808 KB Output is correct
97 Correct 6 ms 8736 KB Output is correct
98 Correct 5 ms 8792 KB Output is correct
99 Correct 5 ms 8812 KB Output is correct
100 Correct 5 ms 8684 KB Output is correct
101 Correct 5 ms 8684 KB Output is correct
102 Correct 5 ms 8660 KB Output is correct
103 Correct 5 ms 8612 KB Output is correct
104 Correct 6 ms 8684 KB Output is correct
105 Correct 5 ms 8692 KB Output is correct
106 Correct 5 ms 8812 KB Output is correct
107 Correct 5 ms 8624 KB Output is correct
108 Correct 5 ms 8560 KB Output is correct
109 Correct 5 ms 8812 KB Output is correct
110 Correct 6 ms 8624 KB Output is correct
111 Correct 5 ms 8680 KB Output is correct
112 Correct 5 ms 8664 KB Output is correct
113 Correct 5 ms 8644 KB Output is correct
114 Correct 6 ms 8692 KB Output is correct
115 Correct 5 ms 8792 KB Output is correct
116 Correct 5 ms 8684 KB Output is correct
117 Correct 5 ms 8684 KB Output is correct
118 Correct 5 ms 8812 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 643 ms 33368 KB Output is correct : V - N = 12
2 Correct 485 ms 29564 KB Output is correct : V - N = 12
3 Correct 249 ms 17856 KB Output is correct : V - N = 12
4 Correct 13 ms 9328 KB Output is correct : V - N = 12
5 Correct 153 ms 13880 KB Output is correct : V - N = 12
6 Correct 385 ms 27608 KB Output is correct : V - N = 12
7 Correct 593 ms 32932 KB Output is correct : V - N = 12
8 Correct 756 ms 31312 KB Output is correct : V - N = 12
9 Correct 331 ms 20016 KB Output is correct : V - N = 12
10 Correct 51 ms 10288 KB Output is correct : V - N = 12
11 Correct 82 ms 11436 KB Output is correct : V - N = 12
12 Correct 458 ms 22144 KB Output is correct : V - N = 12
13 Correct 714 ms 31980 KB Output is correct : V - N = 12
14 Correct 579 ms 32448 KB Output is correct : V - N = 12
15 Correct 436 ms 26460 KB Output is correct : V - N = 12
16 Correct 91 ms 12364 KB Output is correct : V - N = 12
17 Correct 25 ms 9616 KB Output is correct : V - N = 12
18 Correct 343 ms 19036 KB Output is correct : V - N = 12
19 Correct 546 ms 30648 KB Output is correct : V - N = 12
20 Correct 744 ms 33180 KB Output is correct : V - N = 12
21 Correct 236 ms 16296 KB Output is correct : V - N = 12
22 Correct 125 ms 14216 KB Output is correct : V - N = 12
23 Correct 75 ms 11260 KB Output is correct : V - N = 12
24 Correct 8 ms 8720 KB Output is correct : V - N = 12
25 Correct 37 ms 10256 KB Output is correct : V - N = 12
26 Correct 133 ms 13624 KB Output is correct : V - N = 12
27 Correct 202 ms 15220 KB Output is correct : V - N = 12
28 Correct 189 ms 14708 KB Output is correct : V - N = 12
29 Correct 73 ms 11756 KB Output is correct : V - N = 12
30 Correct 11 ms 9340 KB Output is correct : V - N = 12
31 Correct 11 ms 9024 KB Output is correct : V - N = 12
32 Correct 11 ms 9016 KB Output is correct : V - N = 12
33 Correct 10 ms 9064 KB Output is correct : V - N = 12
34 Correct 11 ms 9032 KB Output is correct : V - N = 12
35 Correct 11 ms 8996 KB Output is correct : V - N = 12
36 Correct 865 ms 33336 KB Output is correct : V - N = 12
37 Correct 729 ms 33240 KB Output is correct : V - N = 12
38 Correct 837 ms 33304 KB Output is correct : V - N = 12
39 Correct 697 ms 33148 KB Output is correct : V - N = 12
40 Correct 845 ms 33260 KB Output is correct : V - N = 12
41 Correct 120 ms 13696 KB Output is correct : V - N = 12
42 Correct 132 ms 12552 KB Output is correct : V - N = 12
43 Correct 100 ms 13464 KB Output is correct : V - N = 12
44 Correct 13 ms 9048 KB Output is correct : V - N = 12
45 Correct 88 ms 11648 KB Output is correct : V - N = 12
46 Correct 203 ms 18360 KB Output is correct : V - N = 12
47 Correct 112 ms 13752 KB Output is correct : V - N = 12
48 Correct 302 ms 20056 KB Output is correct : V - N = 12
49 Correct 61 ms 11144 KB Output is correct : V - N = 12
50 Correct 27 ms 9720 KB Output is correct : V - N = 12
51 Correct 509 ms 29628 KB Output is correct : V - N = 12
52 Correct 13 ms 9316 KB Output is correct : V - N = 12
53 Correct 531 ms 27548 KB Output is correct : V - N = 12
54 Correct 536 ms 31004 KB Output is correct : V - N = 12
55 Correct 43 ms 10236 KB Output is correct : V - N = 12
56 Correct 446 ms 21764 KB Output is correct : V - N = 12
57 Correct 828 ms 31976 KB Output is correct : V - N = 12
58 Correct 80 ms 12212 KB Output is correct : V - N = 12
59 Correct 339 ms 18800 KB Output is correct : V - N = 12
60 Correct 574 ms 32648 KB Output is correct : V - N = 12
61 Correct 5 ms 8792 KB Output is correct : V - N = 12
62 Correct 5 ms 8748 KB Output is correct : V - N = 12
63 Correct 6 ms 8592 KB Output is correct : V - N = 12
64 Correct 5 ms 8684 KB Output is correct : V - N = 12
65 Correct 5 ms 8612 KB Output is correct : V - N = 12
66 Correct 5 ms 8812 KB Output is correct : V - N = 12
67 Correct 5 ms 8816 KB Output is correct : V - N = 12
68 Correct 5 ms 8764 KB Output is correct : V - N = 12
69 Correct 5 ms 8692 KB Output is correct : V - N = 12
70 Correct 5 ms 8560 KB Output is correct : V - N = 12
71 Correct 5 ms 8684 KB Output is correct : V - N = 12
72 Correct 5 ms 8740 KB Output is correct : V - N = 12
73 Correct 5 ms 8684 KB Output is correct : V - N = 12
74 Correct 6 ms 8748 KB Output is correct : V - N = 12
75 Correct 5 ms 8812 KB Output is correct : V - N = 12
76 Correct 6 ms 8684 KB Output is correct : V - N = 12
77 Correct 5 ms 8692 KB Output is correct : V - N = 12
78 Correct 5 ms 8684 KB Output is correct : V - N = 12
79 Correct 5 ms 8812 KB Output is correct : V - N = 12
80 Correct 5 ms 8792 KB Output is correct : V - N = 12
81 Correct 5 ms 8812 KB Output is correct : V - N = 12
82 Correct 5 ms 8684 KB Output is correct : V - N = 12
83 Correct 6 ms 8684 KB Output is correct : V - N = 12
84 Correct 5 ms 8664 KB Output is correct : V - N = 12
85 Correct 5 ms 8696 KB Output is correct : V - N = 12
86 Correct 5 ms 8684 KB Output is correct : V - N = 12
87 Correct 5 ms 8676 KB Output is correct : V - N = 12
88 Correct 5 ms 8812 KB Output is correct : V - N = 12
89 Correct 5 ms 8612 KB Output is correct : V - N = 12
90 Correct 5 ms 8684 KB Output is correct : V - N = 12
91 Correct 5 ms 8556 KB Output is correct : V - N = 12
92 Correct 5 ms 8684 KB Output is correct : V - N = 12
93 Correct 5 ms 8752 KB Output is correct : V - N = 12
94 Correct 5 ms 8660 KB Output is correct : V - N = 12
95 Correct 5 ms 8612 KB Output is correct : V - N = 12
96 Correct 6 ms 8760 KB Output is correct : V - N = 12
97 Correct 5 ms 8812 KB Output is correct : V - N = 12
98 Correct 5 ms 8812 KB Output is correct : V - N = 12
99 Correct 5 ms 8720 KB Output is correct : V - N = 12
100 Correct 5 ms 8792 KB Output is correct : V - N = 12
101 Correct 5 ms 8804 KB Output is correct : V - N = 12
102 Correct 5 ms 8664 KB Output is correct : V - N = 12
103 Correct 5 ms 8612 KB Output is correct : V - N = 12
104 Correct 5 ms 8680 KB Output is correct : V - N = 12
105 Correct 5 ms 8684 KB Output is correct : V - N = 12
106 Correct 5 ms 8684 KB Output is correct : V - N = 12
107 Correct 5 ms 8684 KB Output is correct : V - N = 12
108 Correct 5 ms 8740 KB Output is correct : V - N = 12
109 Correct 5 ms 8684 KB Output is correct : V - N = 12
110 Correct 5 ms 8660 KB Output is correct : V - N = 12
111 Correct 5 ms 8816 KB Output is correct : V - N = 12
112 Correct 5 ms 8688 KB Output is correct : V - N = 12
113 Correct 5 ms 8632 KB Output is correct : V - N = 12
114 Correct 5 ms 8684 KB Output is correct : V - N = 12
115 Correct 5 ms 8664 KB Output is correct : V - N = 12
116 Correct 5 ms 8612 KB Output is correct : V - N = 12
117 Correct 5 ms 8680 KB Output is correct : V - N = 12
118 Correct 5 ms 8688 KB Output is correct : V - N = 12
119 Correct 5 ms 8664 KB Output is correct : V - N = 12
120 Correct 5 ms 8812 KB Output is correct : V - N = 12
121 Correct 5 ms 8684 KB Output is correct : V - N = 12
122 Correct 6 ms 8680 KB Output is correct : V - N = 12
123 Correct 5 ms 8664 KB Output is correct : V - N = 12
124 Correct 5 ms 8680 KB Output is correct : V - N = 12
125 Correct 5 ms 8684 KB Output is correct : V - N = 12
126 Correct 5 ms 8680 KB Output is correct : V - N = 12
127 Correct 5 ms 8736 KB Output is correct : V - N = 12
128 Correct 5 ms 8672 KB Output is correct : V - N = 12
129 Correct 5 ms 8680 KB Output is correct : V - N = 12
130 Correct 5 ms 8552 KB Output is correct : V - N = 12
131 Correct 5 ms 8556 KB Output is correct : V - N = 12
132 Correct 5 ms 8684 KB Output is correct : V - N = 12
133 Correct 5 ms 8496 KB Output is correct : V - N = 12
134 Correct 5 ms 8692 KB Output is correct : V - N = 12
135 Correct 5 ms 8556 KB Output is correct : V - N = 12
136 Correct 5 ms 8484 KB Output is correct : V - N = 12
137 Correct 5 ms 8680 KB Output is correct : V - N = 12
138 Correct 5 ms 8696 KB Output is correct : V - N = 12
139 Correct 5 ms 8684 KB Output is correct : V - N = 12
140 Correct 5 ms 8664 KB Output is correct : V - N = 12
141 Correct 5 ms 8684 KB Output is correct : V - N = 12
142 Correct 5 ms 8612 KB Output is correct : V - N = 12
143 Correct 5 ms 8664 KB Output is correct : V - N = 12
144 Correct 5 ms 8552 KB Output is correct : V - N = 12
145 Correct 5 ms 8680 KB Output is correct : V - N = 12
146 Correct 5 ms 8684 KB Output is correct : V - N = 12
147 Correct 5 ms 8476 KB Output is correct : V - N = 12
148 Correct 6 ms 8696 KB Output is correct : V - N = 12
149 Correct 5 ms 8564 KB Output is correct : V - N = 12
150 Correct 5 ms 8680 KB Output is correct : V - N = 12
151 Correct 5 ms 8552 KB Output is correct : V - N = 12
152 Correct 5 ms 8552 KB Output is correct : V - N = 12
153 Correct 5 ms 8676 KB Output is correct : V - N = 12
154 Correct 5 ms 8680 KB Output is correct : V - N = 12
155 Correct 5 ms 8656 KB Output is correct : V - N = 12
156 Correct 5 ms 8612 KB Output is correct : V - N = 12
157 Correct 5 ms 8684 KB Output is correct : V - N = 12
158 Correct 5 ms 8684 KB Output is correct : V - N = 12
159 Correct 6 ms 8616 KB Output is correct : V - N = 12
160 Correct 5 ms 8680 KB Output is correct : V - N = 12
161 Correct 5 ms 8592 KB Output is correct : V - N = 12
162 Correct 5 ms 8556 KB Output is correct : V - N = 12
163 Correct 5 ms 8484 KB Output is correct : V - N = 12
164 Correct 5 ms 8620 KB Output is correct : V - N = 12
165 Correct 5 ms 8624 KB Output is correct : V - N = 12
166 Correct 6 ms 8608 KB Output is correct : V - N = 12
167 Correct 5 ms 8564 KB Output is correct : V - N = 12
168 Correct 5 ms 8696 KB Output is correct : V - N = 12
169 Correct 5 ms 8592 KB Output is correct : V - N = 12
170 Correct 5 ms 8620 KB Output is correct : V - N = 12
171 Correct 6 ms 8676 KB Output is correct : V - N = 12
172 Correct 5 ms 8620 KB Output is correct : V - N = 12
173 Correct 5 ms 8680 KB Output is correct : V - N = 12
174 Correct 5 ms 8692 KB Output is correct : V - N = 12
175 Correct 5 ms 8564 KB Output is correct : V - N = 12
176 Correct 5 ms 8676 KB Output is correct : V - N = 12
177 Correct 5 ms 8692 KB Output is correct : V - N = 12
178 Correct 5 ms 8636 KB Output is correct : V - N = 12