oj.uz

답안 #289721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289721 2020-09-02T23:41:31 Z b00n0rp Graph (BOI20_graph) C++17
100 / 100
 234 ms 15600 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
// typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 100005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-8;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) \
    cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m;
vpii adj[MAXN];
bitset<MAXN> vis;
double ans[MAXN];
bool flag = 1;
int par[MAXN],dep[MAXN];
int pw[MAXN];
int sm[MAXN];
mii freq;

vi cc;

void dfs(int u,double val){
	ans[u] = val;
	for(auto v:adj[u]){
		if(par[v.F] == u and v.F != u){
			dfs(v.F,v.S-val);
		}
	}
}

void bfs(int root){
	// trace(root);
	dep[root] = 0;
	par[root] = root;
	sm[root] = 0;
	queue<int> q;
	q.push(root);
	while(q.size()){
		int u = q.front();
		q.pop();
		vis[u] = 1;
		cc.pb(u);
		for(auto v:adj[u]){
			if(dep[v.F] == MAXN){
				par[v.F] = u;
				// trace(v.F,par[v.F]);
				pw[v.F] = v.S;
				dep[v.F] = 1+dep[u];
				if(dep[u]%2 == 0) sm[v.F] = sm[u]+v.S;
				else sm[v.F] = sm[u]-v.S; 
				q.push(v.F);
			}
		}
	}
	double minoddshit = INF,maxoddshit = -INF;
	freq.clear();
	for(auto u:cc){
		freq[sm[u]]++;
		for(auto v:adj[u]){
			if(v.F != u and (dep[v.F]+1 == dep[u] or par[v.F] == u)) continue;
			if(dep[v.F] == dep[u]){
				// odd case
				double val;
				if(dep[u]%2 == 0){
					// x-sm[u] = (sm[v.F]-sm[u]+v.S)/2
					val = (double)(sm[v.F]-sm[u]+v.S)/(double)2+(double)sm[u];
				}
				else{
					// sm[u]-x = -sm[v.F]+sm[u]+v.S)/2
					// x-sm[u] = (sm[v.F]-sm[u]-v.S)/2
					val = (double)(sm[v.F]-sm[u]-v.S)/(double)2+(double)sm[u];
				}
				remin(minoddshit,val);
				remax(maxoddshit,val);
				if(minoddshit+eps < maxoddshit){
					flag = 0;
					return;
				}
			}
			else{
				// even case
				if(dep[u]%2 == 1){
					if(sm[u]-v.S == sm[v.F]) continue;
					flag = 0;
					return;
				}
				else{
					if(sm[u]+v.S == sm[v.F]) continue;
					flag = 0;
					return;
				}
			}
		}
	}
	if(minoddshit != INF){
		dfs(root,minoddshit);
		return;
	}
	int neg = 0,zer = 0,pos = 0,cur = 0;
	for(auto x:freq){
		if(x.F == 0) zer+=x.S;
		else if(x.F > 0) pos+=x.S;
		else neg+=x.S;
	}
	while(pos+zer < neg){
		pos += zer;
		cur--;
		zer = freq[cur];
		neg -= zer;
	} 
	while(neg+zer < pos){
		neg += zer;
		cur++;
		zer = freq[cur];
		pos -= zer;
	}
	dfs(root,cur);
}

void solvethetestcase(){
    cin >> n >> m;
    REP(i,m){
    	int u,v,w; cin >> u >> v >> w;
    	adj[u].pb({v,w});
    	adj[v].pb({u,w});
    }
    FOR(i,1,n+1){
    	sort(all(adj[i]));
    	for(int j = 0; j+1 < adj[i].size(); j ++){
    		if(adj[i][j].F == adj[i][j+1].F and adj[i][j].S != adj[i][j+1].S){
    			cout << "NO\n";
    			return;	
    		}
    	}
    }
    FOR(i,1,n+1) dep[i] = MAXN;
    FOR(i,1,n+1){
    	if(!vis[i]){
			bfs(i);
			cc.clear();
			if(!flag) break;
    	}
    }
    if(!flag){
    	cout << "NO\n";
    }
    else{
    	cout << "YES\n";
    	FOR(i,1,n+1) cout << ans[i] << " ";
    	cout << "\n";
    }
}

Compilation message

Graph.cpp:22:1: warning: multi-line comment [-Wcomment]
   22 | // typedef tree<int,null_type,less<int>,rb_tree_tag, \
      | ^
Graph.cpp:179:5: warning: multi-line comment [-Wcomment]
  179 |     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
      |     ^
Graph.cpp:182:9: warning: multi-line comment [-Wcomment]
  182 |         // (UNCOMMENT FOR CODEJAM) \
      |         ^
Graph.cpp: In function 'void solvethetestcase()':
Graph.cpp:307:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  307 |      for(int j = 0; j+1 < adj[i].size(); j ++){
      |                     ~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB answer = YES
2 Correct 2 ms 2688 KB answer = YES
3 Correct 2 ms 2688 KB answer = YES
4 Correct 2 ms 2688 KB answer = NO
5 Correct 2 ms 2688 KB answer = YES
6 Correct 2 ms 2688 KB answer = YES
7 Correct 2 ms 2688 KB answer = YES
8 Correct 2 ms 2688 KB answer = YES
9 Correct 2 ms 2688 KB answer = NO
10 Correct 2 ms 2688 KB answer = YES
11 Correct 2 ms 2688 KB answer = YES
12 Correct 2 ms 2688 KB answer = NO
13 Correct 2 ms 2688 KB answer = YES
14 Correct 3 ms 2688 KB answer = YES
15 Correct 2 ms 2688 KB answer = YES
16 Correct 3 ms 2688 KB answer = YES
17 Correct 2 ms 2688 KB answer = YES
18 Correct 2 ms 2688 KB answer = YES
19 Correct 2 ms 2688 KB answer = YES
20 Correct 2 ms 2688 KB answer = YES
21 Correct 2 ms 2688 KB answer = YES
22 Correct 2 ms 2688 KB answer = NO
23 Correct 2 ms 2688 KB answer = NO

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB answer = YES
2 Correct 2 ms 2688 KB answer = YES
3 Correct 2 ms 2688 KB answer = YES
4 Correct 2 ms 2688 KB answer = NO
5 Correct 2 ms 2688 KB answer = YES
6 Correct 2 ms 2688 KB answer = YES
7 Correct 2 ms 2688 KB answer = YES
8 Correct 2 ms 2688 KB answer = YES
9 Correct 2 ms 2688 KB answer = NO
10 Correct 2 ms 2688 KB answer = YES
11 Correct 2 ms 2688 KB answer = YES
12 Correct 2 ms 2688 KB answer = NO
13 Correct 2 ms 2688 KB answer = YES
14 Correct 3 ms 2688 KB answer = YES
15 Correct 2 ms 2688 KB answer = YES
16 Correct 3 ms 2688 KB answer = YES
17 Correct 2 ms 2688 KB answer = YES
18 Correct 2 ms 2688 KB answer = YES
19 Correct 2 ms 2688 KB answer = YES
20 Correct 2 ms 2688 KB answer = YES
21 Correct 2 ms 2688 KB answer = YES
22 Correct 2 ms 2688 KB answer = NO
23 Correct 2 ms 2688 KB answer = NO
24 Correct 3 ms 2816 KB answer = YES
25 Correct 2 ms 2688 KB answer = YES
26 Correct 2 ms 2688 KB answer = YES
27 Correct 2 ms 2688 KB answer = YES
28 Correct 2 ms 2688 KB answer = YES
29 Correct 2 ms 2688 KB answer = YES
30 Correct 2 ms 2688 KB answer = NO
31 Correct 2 ms 2688 KB answer = YES
32 Correct 2 ms 2688 KB answer = YES
33 Correct 2 ms 2688 KB answer = YES
34 Correct 2 ms 2688 KB answer = YES
35 Correct 2 ms 2688 KB answer = YES
36 Correct 2 ms 2688 KB answer = YES

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB answer = YES
2 Correct 2 ms 2688 KB answer = YES
3 Correct 2 ms 2688 KB answer = YES
4 Correct 2 ms 2688 KB answer = NO
5 Correct 2 ms 2688 KB answer = YES
6 Correct 2 ms 2688 KB answer = YES
7 Correct 2 ms 2688 KB answer = YES
8 Correct 2 ms 2688 KB answer = YES
9 Correct 2 ms 2688 KB answer = NO
10 Correct 2 ms 2688 KB answer = YES
11 Correct 2 ms 2688 KB answer = YES
12 Correct 2 ms 2688 KB answer = NO
13 Correct 2 ms 2688 KB answer = YES
14 Correct 3 ms 2688 KB answer = YES
15 Correct 2 ms 2688 KB answer = YES
16 Correct 3 ms 2688 KB answer = YES
17 Correct 2 ms 2688 KB answer = YES
18 Correct 2 ms 2688 KB answer = YES
19 Correct 2 ms 2688 KB answer = YES
20 Correct 2 ms 2688 KB answer = YES
21 Correct 2 ms 2688 KB answer = YES
22 Correct 2 ms 2688 KB answer = NO
23 Correct 2 ms 2688 KB answer = NO
24 Correct 3 ms 2816 KB answer = YES
25 Correct 2 ms 2688 KB answer = YES
26 Correct 2 ms 2688 KB answer = YES
27 Correct 2 ms 2688 KB answer = YES
28 Correct 2 ms 2688 KB answer = YES
29 Correct 2 ms 2688 KB answer = YES
30 Correct 2 ms 2688 KB answer = NO
31 Correct 2 ms 2688 KB answer = YES
32 Correct 2 ms 2688 KB answer = YES
33 Correct 2 ms 2688 KB answer = YES
34 Correct 2 ms 2688 KB answer = YES
35 Correct 2 ms 2688 KB answer = YES
36 Correct 2 ms 2688 KB answer = YES
37 Correct 2 ms 2688 KB answer = YES
38 Correct 2 ms 2688 KB answer = YES
39 Correct 3 ms 2816 KB answer = YES
40 Correct 3 ms 2816 KB answer = YES
41 Correct 2 ms 2816 KB answer = NO
42 Correct 3 ms 2816 KB answer = YES
43 Correct 3 ms 2816 KB answer = YES
44 Correct 3 ms 2816 KB answer = YES
45 Correct 3 ms 2816 KB answer = YES
46 Correct 2 ms 2688 KB answer = YES
47 Correct 3 ms 2816 KB answer = YES
48 Correct 3 ms 2816 KB answer = YES

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB answer = YES
2 Correct 2 ms 2688 KB answer = YES
3 Correct 2 ms 2688 KB answer = YES
4 Correct 2 ms 2688 KB answer = NO
5 Correct 2 ms 2688 KB answer = YES
6 Correct 2 ms 2688 KB answer = YES
7 Correct 2 ms 2688 KB answer = YES
8 Correct 2 ms 2688 KB answer = YES
9 Correct 2 ms 2688 KB answer = NO
10 Correct 2 ms 2688 KB answer = YES
11 Correct 2 ms 2688 KB answer = YES
12 Correct 2 ms 2688 KB answer = NO
13 Correct 2 ms 2688 KB answer = YES
14 Correct 3 ms 2688 KB answer = YES
15 Correct 2 ms 2688 KB answer = YES
16 Correct 3 ms 2688 KB answer = YES
17 Correct 2 ms 2688 KB answer = YES
18 Correct 2 ms 2688 KB answer = YES
19 Correct 2 ms 2688 KB answer = YES
20 Correct 2 ms 2688 KB answer = YES
21 Correct 2 ms 2688 KB answer = YES
22 Correct 2 ms 2688 KB answer = NO
23 Correct 2 ms 2688 KB answer = NO
24 Correct 3 ms 2816 KB answer = YES
25 Correct 2 ms 2688 KB answer = YES
26 Correct 2 ms 2688 KB answer = YES
27 Correct 2 ms 2688 KB answer = YES
28 Correct 2 ms 2688 KB answer = YES
29 Correct 2 ms 2688 KB answer = YES
30 Correct 2 ms 2688 KB answer = NO
31 Correct 2 ms 2688 KB answer = YES
32 Correct 2 ms 2688 KB answer = YES
33 Correct 2 ms 2688 KB answer = YES
34 Correct 2 ms 2688 KB answer = YES
35 Correct 2 ms 2688 KB answer = YES
36 Correct 2 ms 2688 KB answer = YES
37 Correct 2 ms 2688 KB answer = YES
38 Correct 2 ms 2688 KB answer = YES
39 Correct 3 ms 2816 KB answer = YES
40 Correct 3 ms 2816 KB answer = YES
41 Correct 2 ms 2816 KB answer = NO
42 Correct 3 ms 2816 KB answer = YES
43 Correct 3 ms 2816 KB answer = YES
44 Correct 3 ms 2816 KB answer = YES
45 Correct 3 ms 2816 KB answer = YES
46 Correct 2 ms 2688 KB answer = YES
47 Correct 3 ms 2816 KB answer = YES
48 Correct 3 ms 2816 KB answer = YES
49 Correct 13 ms 3584 KB answer = YES
50 Correct 12 ms 3840 KB answer = YES
51 Correct 12 ms 3968 KB answer = YES
52 Correct 7 ms 3584 KB answer = NO
53 Correct 3 ms 2816 KB answer = YES
54 Correct 4 ms 2944 KB answer = YES
55 Correct 7 ms 3200 KB answer = YES
56 Correct 12 ms 3584 KB answer = YES
57 Correct 11 ms 3456 KB answer = YES
58 Correct 10 ms 3456 KB answer = YES
59 Correct 11 ms 3456 KB answer = YES
60 Correct 12 ms 3584 KB answer = YES
61 Correct 7 ms 3200 KB answer = YES
62 Correct 69 ms 9592 KB answer = NO
63 Correct 92 ms 9976 KB answer = YES
64 Correct 88 ms 9848 KB answer = NO
65 Correct 89 ms 9976 KB answer = YES
66 Correct 4 ms 2944 KB answer = YES

Subtask #5
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB answer = YES
2 Correct 2 ms 2688 KB answer = YES
3 Correct 2 ms 2688 KB answer = YES
4 Correct 2 ms 2688 KB answer = NO
5 Correct 2 ms 2688 KB answer = YES
6 Correct 2 ms 2688 KB answer = YES
7 Correct 2 ms 2688 KB answer = YES
8 Correct 2 ms 2688 KB answer = YES
9 Correct 2 ms 2688 KB answer = NO
10 Correct 2 ms 2688 KB answer = YES
11 Correct 2 ms 2688 KB answer = YES
12 Correct 2 ms 2688 KB answer = NO
13 Correct 2 ms 2688 KB answer = YES
14 Correct 3 ms 2688 KB answer = YES
15 Correct 2 ms 2688 KB answer = YES
16 Correct 3 ms 2688 KB answer = YES
17 Correct 2 ms 2688 KB answer = YES
18 Correct 2 ms 2688 KB answer = YES
19 Correct 2 ms 2688 KB answer = YES
20 Correct 2 ms 2688 KB answer = YES
21 Correct 2 ms 2688 KB answer = YES
22 Correct 2 ms 2688 KB answer = NO
23 Correct 2 ms 2688 KB answer = NO
24 Correct 3 ms 2816 KB answer = YES
25 Correct 2 ms 2688 KB answer = YES
26 Correct 2 ms 2688 KB answer = YES
27 Correct 2 ms 2688 KB answer = YES
28 Correct 2 ms 2688 KB answer = YES
29 Correct 2 ms 2688 KB answer = YES
30 Correct 2 ms 2688 KB answer = NO
31 Correct 2 ms 2688 KB answer = YES
32 Correct 2 ms 2688 KB answer = YES
33 Correct 2 ms 2688 KB answer = YES
34 Correct 2 ms 2688 KB answer = YES
35 Correct 2 ms 2688 KB answer = YES
36 Correct 2 ms 2688 KB answer = YES
37 Correct 2 ms 2688 KB answer = YES
38 Correct 2 ms 2688 KB answer = YES
39 Correct 3 ms 2816 KB answer = YES
40 Correct 3 ms 2816 KB answer = YES
41 Correct 2 ms 2816 KB answer = NO
42 Correct 3 ms 2816 KB answer = YES
43 Correct 3 ms 2816 KB answer = YES
44 Correct 3 ms 2816 KB answer = YES
45 Correct 3 ms 2816 KB answer = YES
46 Correct 2 ms 2688 KB answer = YES
47 Correct 3 ms 2816 KB answer = YES
48 Correct 3 ms 2816 KB answer = YES
49 Correct 13 ms 3584 KB answer = YES
50 Correct 12 ms 3840 KB answer = YES
51 Correct 12 ms 3968 KB answer = YES
52 Correct 7 ms 3584 KB answer = NO
53 Correct 3 ms 2816 KB answer = YES
54 Correct 4 ms 2944 KB answer = YES
55 Correct 7 ms 3200 KB answer = YES
56 Correct 12 ms 3584 KB answer = YES
57 Correct 11 ms 3456 KB answer = YES
58 Correct 10 ms 3456 KB answer = YES
59 Correct 11 ms 3456 KB answer = YES
60 Correct 12 ms 3584 KB answer = YES
61 Correct 7 ms 3200 KB answer = YES
62 Correct 69 ms 9592 KB answer = NO
63 Correct 92 ms 9976 KB answer = YES
64 Correct 88 ms 9848 KB answer = NO
65 Correct 89 ms 9976 KB answer = YES
66 Correct 4 ms 2944 KB answer = YES
67 Correct 94 ms 15088 KB answer = YES
68 Correct 88 ms 14960 KB answer = YES
69 Correct 84 ms 12656 KB answer = YES
70 Correct 129 ms 15600 KB answer = YES
71 Correct 95 ms 12912 KB answer = YES
72 Correct 135 ms 10864 KB answer = YES
73 Correct 134 ms 10864 KB answer = YES
74 Correct 75 ms 10228 KB answer = YES
75 Correct 37 ms 7032 KB answer = NO
76 Correct 14 ms 3712 KB answer = YES
77 Correct 27 ms 4864 KB answer = YES
78 Correct 49 ms 6392 KB answer = YES
79 Correct 108 ms 9760 KB answer = YES
80 Correct 73 ms 10356 KB answer = YES
81 Correct 67 ms 9332 KB answer = NO
82 Correct 128 ms 11760 KB answer = YES
83 Correct 160 ms 12908 KB answer = YES
84 Correct 151 ms 12796 KB answer = YES
85 Correct 93 ms 12784 KB answer = YES
86 Correct 93 ms 12784 KB answer = YES
87 Correct 74 ms 10104 KB answer = NO
88 Correct 155 ms 11376 KB answer = YES
89 Correct 114 ms 9848 KB answer = YES
90 Correct 110 ms 9848 KB answer = YES
91 Correct 122 ms 9848 KB answer = YES
92 Correct 57 ms 7032 KB answer = YES
93 Correct 54 ms 6908 KB answer = YES
94 Correct 85 ms 9460 KB answer = NO
95 Correct 56 ms 9464 KB answer = NO
96 Correct 234 ms 14964 KB answer = YES
97 Correct 45 ms 9328 KB answer = NO