oj.uz

답안 #396149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
396149 2021-04-29T13:48:38 Z nathanlee726 항공 노선도 (JOI18_airline) C++14
100 / 100
 884 ms 25308 KB 
//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
 
//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
void InitG( int V, int U ){cout<<V<<" "<<U<<endl;}
void MakeG( int pos, int C, int D ){cout<<C<<" "<<D<<endl;}
#else
#include "Alicelib.h"
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
 
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod; 
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
int c[500010],d[500010];
void Alice(int N,int M,int a[],int b[]){
	int n=N+12,m=0;
	F(N){
		Fi(j,10)if((i+1)&(1<<j)){c[m]=N+j+1,d[m]=i,m++;}
	}
	F(9){
		c[m]=N+1+i,d[m]=N+2+i;
		m++;
	} 
	InitG(n,M+m+11);
	F(M)MakeG(i,a[i],b[i]);
	F(m)MakeG(M+i,c[i],d[i]);
	MakeG(M+m,N,N+11);
	F(10)MakeG(M+m+1+i,N+11,N+1+i); 
}
/*
int main(){
	int n,m,a[500],b[500];
	cin>>n>>m;
	F(m){
		cin>>a[i]>>b[i];
	}
	Alice(n,m,a,b);
	return 0;
}*/
/*
1
01
11
001
101
011
111
0001
*/
//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
 
//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
void InitMap( int N, int M ){cout<<N<<" "<<M<<endl;}
void MakeMap( int A, int B ){cout<<A<<" "<<B<<endl;}
#else
#include "Boblib.h"
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
 
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod; 
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
vector<int> g[1050];
int fr[1050],id[1050],idd[1050],c[500010],d[500010];
bool vis[1050],tag[1050];
void Bob(int N,int M,int a[],int b[]){
	int n=N-12,m=0;
	if(n==1){
		InitMap(n,m);
		return;
	}
	vector<int> v;
	F(M){
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	F(N)if(sz(g[i])==1)v.pb(i);
	memres(tag);
	int s=-1;
	for(int i:v){
		if(sz(g[g[i][0]])==11)s=i; 
		bug(sz(g[g[i][0]]));
	}
	bug(s);
	int ms=s;
	s=g[s][0];
	int mn=1e9,mnp=-1;
	for(int u:g[s]){
		if(u==ms)continue;
		tag[u]=1;
		if(mn>sz(g[u]))mn=sz(g[u]),mnp=u;
	}
	memres(idd);
	id[mnp]=9;
	F(9){
		for(int u:g[mnp]){
			if(tag[u]&&id[u]==0){
				id[u]=8-i;
				bug(u,id[u]);
				mnp=u;
				break;
			}
		}
	}
	tag[s]=1,tag[ms]=1;
	F(N){
		if(tag[i])continue;
		int ind=0;
		for(int u:g[i]){
			if(tag[u]){
				ind+=(1<<id[u]);
			}
		}
		idd[i]=ind-1;	
	}
	F(N){
		if(tag[i])continue;
		for(int u:g[i]){
			if(tag[u])continue;
			if(i<u){
				bug(i,u);
				c[m]=idd[i];
				d[m]=idd[u];
				m++;
			}
		}
	}
	InitMap(n,m);
	F(m){
		MakeMap(c[i],d[i]);
	}
}
/*
int main(){
	int n,m,a[500],b[500];
	cin>>n>>m;
	F(m){
		cin>>a[i]>>b[i];
	}
	Bob(n,m,a,b);
	return 0;
}*/
/*
17 25
0 1
0 2
1 3
1 4
3 4
2 3
2 4
6 0
7 1
6 2
7 2
8 3
6 4
8 4
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16

5 7
0 1
0 2
1 3
1 4
3 4
2 3
2 4
*/

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4728 KB Output is correct
2 Correct 6 ms 4736 KB Output is correct
3 Correct 5 ms 4664 KB Output is correct
4 Correct 5 ms 4700 KB Output is correct
5 Correct 5 ms 4728 KB Output is correct
6 Correct 5 ms 4728 KB Output is correct
7 Correct 5 ms 4708 KB Output is correct
8 Correct 5 ms 4644 KB Output is correct
9 Correct 5 ms 4728 KB Output is correct
10 Correct 5 ms 4588 KB Output is correct
11 Correct 5 ms 4728 KB Output is correct
12 Correct 5 ms 4712 KB Output is correct
13 Correct 5 ms 4624 KB Output is correct
14 Correct 6 ms 4728 KB Output is correct
15 Correct 5 ms 4708 KB Output is correct
16 Correct 6 ms 4496 KB Output is correct
17 Correct 5 ms 4560 KB Output is correct
18 Correct 5 ms 4728 KB Output is correct
19 Correct 5 ms 4708 KB Output is correct
20 Correct 5 ms 4736 KB Output is correct
21 Correct 6 ms 4728 KB Output is correct
22 Correct 6 ms 4736 KB Output is correct
23 Correct 5 ms 4596 KB Output is correct
24 Correct 6 ms 4592 KB Output is correct
25 Correct 5 ms 4496 KB Output is correct
26 Correct 5 ms 4780 KB Output is correct
27 Correct 6 ms 4816 KB Output is correct
28 Correct 5 ms 4736 KB Output is correct
29 Correct 5 ms 4600 KB Output is correct
30 Correct 5 ms 4596 KB Output is correct
31 Correct 5 ms 4596 KB Output is correct
32 Correct 5 ms 4604 KB Output is correct
33 Correct 5 ms 4596 KB Output is correct
34 Correct 5 ms 4580 KB Output is correct
35 Correct 5 ms 4600 KB Output is correct
36 Correct 5 ms 4624 KB Output is correct
37 Correct 5 ms 4708 KB Output is correct
38 Correct 5 ms 4644 KB Output is correct
39 Correct 5 ms 4728 KB Output is correct
40 Correct 5 ms 4652 KB Output is correct
41 Correct 5 ms 4728 KB Output is correct
42 Correct 5 ms 4728 KB Output is correct
43 Correct 5 ms 4708 KB Output is correct
44 Correct 5 ms 4596 KB Output is correct
45 Correct 5 ms 4596 KB Output is correct
46 Correct 5 ms 4736 KB Output is correct
47 Correct 5 ms 4724 KB Output is correct
48 Correct 5 ms 4636 KB Output is correct
49 Correct 5 ms 4496 KB Output is correct
50 Correct 5 ms 4496 KB Output is correct
51 Correct 5 ms 4596 KB Output is correct
52 Correct 5 ms 4740 KB Output is correct
53 Correct 5 ms 4596 KB Output is correct
54 Correct 6 ms 4728 KB Output is correct
55 Correct 5 ms 4600 KB Output is correct
56 Correct 5 ms 4600 KB Output is correct
57 Correct 5 ms 4732 KB Output is correct
58 Correct 5 ms 4644 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4728 KB Output is correct
2 Correct 6 ms 4736 KB Output is correct
3 Correct 5 ms 4664 KB Output is correct
4 Correct 5 ms 4700 KB Output is correct
5 Correct 5 ms 4728 KB Output is correct
6 Correct 5 ms 4728 KB Output is correct
7 Correct 5 ms 4708 KB Output is correct
8 Correct 5 ms 4644 KB Output is correct
9 Correct 5 ms 4728 KB Output is correct
10 Correct 5 ms 4588 KB Output is correct
11 Correct 5 ms 4728 KB Output is correct
12 Correct 5 ms 4712 KB Output is correct
13 Correct 5 ms 4624 KB Output is correct
14 Correct 6 ms 4728 KB Output is correct
15 Correct 5 ms 4708 KB Output is correct
16 Correct 6 ms 4496 KB Output is correct
17 Correct 5 ms 4560 KB Output is correct
18 Correct 5 ms 4728 KB Output is correct
19 Correct 5 ms 4708 KB Output is correct
20 Correct 5 ms 4736 KB Output is correct
21 Correct 6 ms 4728 KB Output is correct
22 Correct 6 ms 4736 KB Output is correct
23 Correct 5 ms 4596 KB Output is correct
24 Correct 6 ms 4592 KB Output is correct
25 Correct 5 ms 4496 KB Output is correct
26 Correct 5 ms 4780 KB Output is correct
27 Correct 6 ms 4816 KB Output is correct
28 Correct 5 ms 4736 KB Output is correct
29 Correct 5 ms 4600 KB Output is correct
30 Correct 5 ms 4596 KB Output is correct
31 Correct 5 ms 4596 KB Output is correct
32 Correct 5 ms 4604 KB Output is correct
33 Correct 5 ms 4596 KB Output is correct
34 Correct 5 ms 4580 KB Output is correct
35 Correct 5 ms 4600 KB Output is correct
36 Correct 5 ms 4624 KB Output is correct
37 Correct 5 ms 4708 KB Output is correct
38 Correct 5 ms 4644 KB Output is correct
39 Correct 5 ms 4728 KB Output is correct
40 Correct 5 ms 4652 KB Output is correct
41 Correct 5 ms 4728 KB Output is correct
42 Correct 5 ms 4728 KB Output is correct
43 Correct 5 ms 4708 KB Output is correct
44 Correct 5 ms 4596 KB Output is correct
45 Correct 5 ms 4596 KB Output is correct
46 Correct 5 ms 4736 KB Output is correct
47 Correct 5 ms 4724 KB Output is correct
48 Correct 5 ms 4636 KB Output is correct
49 Correct 5 ms 4496 KB Output is correct
50 Correct 5 ms 4496 KB Output is correct
51 Correct 5 ms 4596 KB Output is correct
52 Correct 5 ms 4740 KB Output is correct
53 Correct 5 ms 4596 KB Output is correct
54 Correct 6 ms 4728 KB Output is correct
55 Correct 5 ms 4600 KB Output is correct
56 Correct 5 ms 4600 KB Output is correct
57 Correct 5 ms 4732 KB Output is correct
58 Correct 5 ms 4644 KB Output is correct
59 Correct 7 ms 4836 KB Output is correct
60 Correct 6 ms 4864 KB Output is correct
61 Correct 5 ms 4704 KB Output is correct
62 Correct 5 ms 4728 KB Output is correct
63 Correct 5 ms 4728 KB Output is correct
64 Correct 6 ms 4856 KB Output is correct
65 Correct 7 ms 4728 KB Output is correct
66 Correct 6 ms 4856 KB Output is correct
67 Correct 7 ms 4860 KB Output is correct
68 Correct 6 ms 4728 KB Output is correct
69 Correct 6 ms 4728 KB Output is correct
70 Correct 7 ms 4856 KB Output is correct
71 Correct 7 ms 4836 KB Output is correct
72 Correct 6 ms 4860 KB Output is correct
73 Correct 6 ms 4820 KB Output is correct
74 Correct 6 ms 4728 KB Output is correct
75 Correct 6 ms 4604 KB Output is correct
76 Correct 6 ms 4856 KB Output is correct
77 Correct 6 ms 4856 KB Output is correct
78 Correct 7 ms 4772 KB Output is correct
79 Correct 6 ms 4856 KB Output is correct
80 Correct 6 ms 4856 KB Output is correct
81 Correct 5 ms 4736 KB Output is correct
82 Correct 5 ms 4596 KB Output is correct
83 Correct 6 ms 4728 KB Output is correct
84 Correct 6 ms 4856 KB Output is correct
85 Correct 6 ms 4856 KB Output is correct
86 Correct 6 ms 4856 KB Output is correct
87 Correct 6 ms 4752 KB Output is correct
88 Correct 5 ms 4964 KB Output is correct
89 Correct 6 ms 4516 KB Output is correct
90 Correct 6 ms 4576 KB Output is correct
91 Correct 6 ms 4576 KB Output is correct
92 Correct 5 ms 4528 KB Output is correct
93 Correct 5 ms 4596 KB Output is correct
94 Correct 7 ms 4856 KB Output is correct
95 Correct 7 ms 4836 KB Output is correct
96 Correct 7 ms 4856 KB Output is correct
97 Correct 7 ms 4864 KB Output is correct
98 Correct 6 ms 4872 KB Output is correct
99 Correct 6 ms 4840 KB Output is correct
100 Correct 6 ms 4776 KB Output is correct
101 Correct 5 ms 4720 KB Output is correct
102 Correct 5 ms 4596 KB Output is correct
103 Correct 6 ms 4720 KB Output is correct
104 Correct 6 ms 4728 KB Output is correct
105 Correct 6 ms 4856 KB Output is correct
106 Correct 6 ms 4856 KB Output is correct
107 Correct 6 ms 4652 KB Output is correct
108 Correct 5 ms 4724 KB Output is correct
109 Correct 6 ms 4836 KB Output is correct
110 Correct 5 ms 4644 KB Output is correct
111 Correct 7 ms 4724 KB Output is correct
112 Correct 5 ms 4740 KB Output is correct
113 Correct 5 ms 4736 KB Output is correct
114 Correct 6 ms 4836 KB Output is correct
115 Correct 6 ms 4840 KB Output is correct
116 Correct 5 ms 4728 KB Output is correct
117 Correct 6 ms 4728 KB Output is correct
118 Correct 6 ms 4720 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 689 ms 25176 KB Output is correct : V - N = 12
2 Correct 607 ms 21376 KB Output is correct : V - N = 12
3 Correct 229 ms 11740 KB Output is correct : V - N = 12
4 Correct 12 ms 5008 KB Output is correct : V - N = 12
5 Correct 168 ms 8912 KB Output is correct : V - N = 12
6 Correct 564 ms 19472 KB Output is correct : V - N = 12
7 Correct 780 ms 24832 KB Output is correct : V - N = 12
8 Correct 771 ms 23216 KB Output is correct : V - N = 12
9 Correct 373 ms 13904 KB Output is correct : V - N = 12
10 Correct 50 ms 5972 KB Output is correct : V - N = 12
11 Correct 73 ms 6780 KB Output is correct : V - N = 12
12 Correct 328 ms 15976 KB Output is correct : V - N = 12
13 Correct 742 ms 24044 KB Output is correct : V - N = 12
14 Correct 621 ms 24340 KB Output is correct : V - N = 12
15 Correct 466 ms 18416 KB Output is correct : V - N = 12
16 Correct 115 ms 7672 KB Output is correct : V - N = 12
17 Correct 20 ms 5392 KB Output is correct : V - N = 12
18 Correct 258 ms 12880 KB Output is correct : V - N = 12
19 Correct 595 ms 22424 KB Output is correct : V - N = 12
20 Correct 859 ms 24988 KB Output is correct : V - N = 12
21 Correct 237 ms 11072 KB Output is correct : V - N = 12
22 Correct 137 ms 9212 KB Output is correct : V - N = 12
23 Correct 75 ms 6644 KB Output is correct : V - N = 12
24 Correct 9 ms 4764 KB Output is correct : V - N = 12
25 Correct 44 ms 5776 KB Output is correct : V - N = 12
26 Correct 109 ms 8800 KB Output is correct : V - N = 12
27 Correct 232 ms 10016 KB Output is correct : V - N = 12
28 Correct 205 ms 9612 KB Output is correct : V - N = 12
29 Correct 105 ms 7244 KB Output is correct : V - N = 12
30 Correct 12 ms 5240 KB Output is correct : V - N = 12
31 Correct 11 ms 4960 KB Output is correct : V - N = 12
32 Correct 10 ms 4772 KB Output is correct : V - N = 12
33 Correct 12 ms 4752 KB Output is correct : V - N = 12
34 Correct 10 ms 4776 KB Output is correct : V - N = 12
35 Correct 10 ms 4976 KB Output is correct : V - N = 12
36 Correct 767 ms 25308 KB Output is correct : V - N = 12
37 Correct 746 ms 25052 KB Output is correct : V - N = 12
38 Correct 704 ms 25120 KB Output is correct : V - N = 12
39 Correct 884 ms 25284 KB Output is correct : V - N = 12
40 Correct 874 ms 25176 KB Output is correct : V - N = 12
41 Correct 127 ms 8788 KB Output is correct : V - N = 12
42 Correct 127 ms 7924 KB Output is correct : V - N = 12
43 Correct 141 ms 8320 KB Output is correct : V - N = 12
44 Correct 12 ms 5028 KB Output is correct : V - N = 12
45 Correct 88 ms 6916 KB Output is correct : V - N = 12
46 Correct 256 ms 12240 KB Output is correct : V - N = 12
47 Correct 154 ms 8660 KB Output is correct : V - N = 12
48 Correct 399 ms 14300 KB Output is correct : V - N = 12
49 Correct 67 ms 6620 KB Output is correct : V - N = 12
50 Correct 20 ms 5420 KB Output is correct : V - N = 12
51 Correct 553 ms 21648 KB Output is correct : V - N = 12
52 Correct 13 ms 5092 KB Output is correct : V - N = 12
53 Correct 474 ms 19396 KB Output is correct : V - N = 12
54 Correct 651 ms 22840 KB Output is correct : V - N = 12
55 Correct 38 ms 6100 KB Output is correct : V - N = 12
56 Correct 433 ms 15488 KB Output is correct : V - N = 12
57 Correct 742 ms 24120 KB Output is correct : V - N = 12
58 Correct 89 ms 7580 KB Output is correct : V - N = 12
59 Correct 318 ms 12768 KB Output is correct : V - N = 12
60 Correct 812 ms 24664 KB Output is correct : V - N = 12
61 Correct 7 ms 4772 KB Output is correct : V - N = 12
62 Correct 7 ms 4856 KB Output is correct : V - N = 12
63 Correct 5 ms 4856 KB Output is correct : V - N = 12
64 Correct 5 ms 4668 KB Output is correct : V - N = 12
65 Correct 5 ms 4740 KB Output is correct : V - N = 12
66 Correct 8 ms 4872 KB Output is correct : V - N = 12
67 Correct 7 ms 4872 KB Output is correct : V - N = 12
68 Correct 6 ms 4868 KB Output is correct : V - N = 12
69 Correct 6 ms 4836 KB Output is correct : V - N = 12
70 Correct 5 ms 4720 KB Output is correct : V - N = 12
71 Correct 6 ms 4644 KB Output is correct : V - N = 12
72 Correct 6 ms 4864 KB Output is correct : V - N = 12
73 Correct 7 ms 4836 KB Output is correct : V - N = 12
74 Correct 7 ms 4776 KB Output is correct : V - N = 12
75 Correct 6 ms 4856 KB Output is correct : V - N = 12
76 Correct 6 ms 4732 KB Output is correct : V - N = 12
77 Correct 5 ms 4728 KB Output is correct : V - N = 12
78 Correct 7 ms 4864 KB Output is correct : V - N = 12
79 Correct 6 ms 4752 KB Output is correct : V - N = 12
80 Correct 6 ms 4772 KB Output is correct : V - N = 12
81 Correct 6 ms 4784 KB Output is correct : V - N = 12
82 Correct 6 ms 4856 KB Output is correct : V - N = 12
83 Correct 6 ms 4776 KB Output is correct : V - N = 12
84 Correct 5 ms 4608 KB Output is correct : V - N = 12
85 Correct 5 ms 4728 KB Output is correct : V - N = 12
86 Correct 6 ms 4752 KB Output is correct : V - N = 12
87 Correct 6 ms 4856 KB Output is correct : V - N = 12
88 Correct 6 ms 4652 KB Output is correct : V - N = 12
89 Correct 5 ms 4860 KB Output is correct : V - N = 12
90 Correct 5 ms 4736 KB Output is correct : V - N = 12
91 Correct 6 ms 4592 KB Output is correct : V - N = 12
92 Correct 5 ms 4508 KB Output is correct : V - N = 12
93 Correct 5 ms 4608 KB Output is correct : V - N = 12
94 Correct 5 ms 4528 KB Output is correct : V - N = 12
95 Correct 5 ms 4604 KB Output is correct : V - N = 12
96 Correct 7 ms 4864 KB Output is correct : V - N = 12
97 Correct 7 ms 4856 KB Output is correct : V - N = 12
98 Correct 7 ms 4856 KB Output is correct : V - N = 12
99 Correct 7 ms 4856 KB Output is correct : V - N = 12
100 Correct 6 ms 4772 KB Output is correct : V - N = 12
101 Correct 6 ms 4640 KB Output is correct : V - N = 12
102 Correct 6 ms 4836 KB Output is correct : V - N = 12
103 Correct 5 ms 4636 KB Output is correct : V - N = 12
104 Correct 5 ms 4688 KB Output is correct : V - N = 12
105 Correct 6 ms 4728 KB Output is correct : V - N = 12
106 Correct 7 ms 4728 KB Output is correct : V - N = 12
107 Correct 6 ms 4836 KB Output is correct : V - N = 12
108 Correct 6 ms 4836 KB Output is correct : V - N = 12
109 Correct 5 ms 4736 KB Output is correct : V - N = 12
110 Correct 6 ms 4644 KB Output is correct : V - N = 12
111 Correct 6 ms 4784 KB Output is correct : V - N = 12
112 Correct 6 ms 4708 KB Output is correct : V - N = 12
113 Correct 6 ms 4860 KB Output is correct : V - N = 12
114 Correct 6 ms 4708 KB Output is correct : V - N = 12
115 Correct 5 ms 4712 KB Output is correct : V - N = 12
116 Correct 6 ms 4716 KB Output is correct : V - N = 12
117 Correct 6 ms 4868 KB Output is correct : V - N = 12
118 Correct 5 ms 4656 KB Output is correct : V - N = 12
119 Correct 6 ms 4728 KB Output is correct : V - N = 12
120 Correct 6 ms 4644 KB Output is correct : V - N = 12
121 Correct 5 ms 4728 KB Output is correct : V - N = 12
122 Correct 5 ms 4728 KB Output is correct : V - N = 12
123 Correct 5 ms 4736 KB Output is correct : V - N = 12
124 Correct 5 ms 4596 KB Output is correct : V - N = 12
125 Correct 5 ms 4728 KB Output is correct : V - N = 12
126 Correct 5 ms 4728 KB Output is correct : V - N = 12
127 Correct 5 ms 4728 KB Output is correct : V - N = 12
128 Correct 7 ms 4720 KB Output is correct : V - N = 12
129 Correct 7 ms 4652 KB Output is correct : V - N = 12
130 Correct 5 ms 4600 KB Output is correct : V - N = 12
131 Correct 6 ms 4720 KB Output is correct : V - N = 12
132 Correct 6 ms 4728 KB Output is correct : V - N = 12
133 Correct 5 ms 4660 KB Output is correct : V - N = 12
134 Correct 5 ms 4636 KB Output is correct : V - N = 12
135 Correct 6 ms 4644 KB Output is correct : V - N = 12
136 Correct 6 ms 4516 KB Output is correct : V - N = 12
137 Correct 6 ms 4576 KB Output is correct : V - N = 12
138 Correct 5 ms 4636 KB Output is correct : V - N = 12
139 Correct 5 ms 4700 KB Output is correct : V - N = 12
140 Correct 5 ms 4656 KB Output is correct : V - N = 12
141 Correct 5 ms 4624 KB Output is correct : V - N = 12
142 Correct 6 ms 4648 KB Output is correct : V - N = 12
143 Correct 6 ms 4624 KB Output is correct : V - N = 12
144 Correct 6 ms 4592 KB Output is correct : V - N = 12
145 Correct 6 ms 4580 KB Output is correct : V - N = 12
146 Correct 5 ms 4556 KB Output is correct : V - N = 12
147 Correct 5 ms 4688 KB Output is correct : V - N = 12
148 Correct 7 ms 4732 KB Output is correct : V - N = 12
149 Correct 6 ms 4512 KB Output is correct : V - N = 12
150 Correct 7 ms 4532 KB Output is correct : V - N = 12
151 Correct 5 ms 4516 KB Output is correct : V - N = 12
152 Correct 7 ms 4588 KB Output is correct : V - N = 12
153 Correct 5 ms 4572 KB Output is correct : V - N = 12
154 Correct 5 ms 4556 KB Output is correct : V - N = 12
155 Correct 7 ms 4572 KB Output is correct : V - N = 12
156 Correct 5 ms 4624 KB Output is correct : V - N = 12
157 Correct 7 ms 4760 KB Output is correct : V - N = 12
158 Correct 5 ms 4624 KB Output is correct : V - N = 12
159 Correct 6 ms 4624 KB Output is correct : V - N = 12
160 Correct 6 ms 4720 KB Output is correct : V - N = 12
161 Correct 5 ms 4516 KB Output is correct : V - N = 12
162 Correct 5 ms 4580 KB Output is correct : V - N = 12
163 Correct 5 ms 4716 KB Output is correct : V - N = 12
164 Correct 6 ms 4496 KB Output is correct : V - N = 12
165 Correct 8 ms 4588 KB Output is correct : V - N = 12
166 Correct 5 ms 4580 KB Output is correct : V - N = 12
167 Correct 5 ms 4640 KB Output is correct : V - N = 12
168 Correct 5 ms 4516 KB Output is correct : V - N = 12
169 Correct 6 ms 4728 KB Output is correct : V - N = 12
170 Correct 6 ms 4508 KB Output is correct : V - N = 12
171 Correct 6 ms 4600 KB Output is correct : V - N = 12
172 Correct 6 ms 4608 KB Output is correct : V - N = 12
173 Correct 6 ms 4620 KB Output is correct : V - N = 12
174 Correct 6 ms 4644 KB Output is correct : V - N = 12
175 Correct 6 ms 4760 KB Output is correct : V - N = 12
176 Correct 5 ms 4720 KB Output is correct : V - N = 12
177 Correct 6 ms 4632 KB Output is correct : V - N = 12
178 Correct 7 ms 4652 KB Output is correct : V - N = 12