oj.uz

답안 #740094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740094 2023-05-12T06:18:29 Z shadow_sami 자매 도시 (APIO20_swap) C++17
100 / 100
 541 ms 115320 KB 
#include "swap.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 3e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
typedef struct EDGE{
	ll src,dest,wet;
	void init(ll aa,ll bb,ll cc){
		src = aa;
		dest = bb;
		wet = cc;
		return;
	}
	void printer(){
		cout<<src<<" "<<dest<<" "<<wet<<nli;
		return;
	}
}edge;

edge qt;

bool cmp(const edge &aa,const edge &bb){
	return aa.wet < bb.wet;
}

vector<edge> ve;

ll root;
ll parent[mx];
ll comp[mx];
vi adj[mx];
ll siz[mx];
bool flag[mx];
bool flag2[mx];
ll degree[mx];
ll ed[mx];
ll up[mx][30];
ll depth[mx];

typedef struct Disjoint_Set_Union{
	// vi parent,siz;
	// vector<bool> flag,flag2;
	// vi degree;
	ll srcparent,destparent;
	void init(ll nodes,ll edgee){
		// debug(nodes);
		// debug(edgee);
		fip(0,nodes+5){
			degree[i] = 0;
			siz[i] = 1;
		}
		fip(0,nodes+edgee+5){
			comp[i] = i;
			parent[i] = i;
			flag2[i] = flag[i] = false;
		}
		// debug(nodes);
		// debug(edgee);
		return;
	}
	ll find(ll k){
		return parent[k] == k ? k : parent[k] = find(parent[k]);
	}
	bool unite(ll u,ll v){
		srcparent=find(u);
		destparent=find(v);
		degree[u]++;
		degree[v]++;
		cnt++;
		
		f = 0;
		if(srcparent == destparent)
			flag2[cnt] = 1;
		if(degree[u]>2 || degree[v]>2){
			// f = 1;
			// cout<<u<<" "<<v<<nli;
			flag[cnt] = 1;
		}
		flag[cnt] = flag[cnt] | flag[comp[srcparent]] | flag[comp[destparent]];
		flag2[cnt] = flag2[cnt] | flag2[comp[srcparent]] | flag2[comp[destparent]];
		adj[cnt].push_back(comp[srcparent]);
		adj[comp[srcparent]].push_back(cnt);
		if(srcparent!=destparent){
			adj[cnt].push_back(comp[destparent]);
			adj[comp[destparent]].push_back(cnt);
		}
		if(srcparent != destparent){
			if(siz[srcparent] < siz[destparent])
				swap(srcparent,destparent);
			parent[destparent] = srcparent;
			siz[srcparent] += siz[destparent];
		}
		// debug(u);
		// debug(v);
		// debug(cnt);
		// debug(flag2[cnt]);
		// debug(flag[cnt]);
		// debug(comp[srcparent]);
		// debug(comp[destparent]);		
		// debug(flag2[comp[srcparent]]);
		// debug(flag2[comp[destparent]]);
		// if(f){
		// 	cout<<flag2[cnt]<<nli;
		// 	cout<<cnt<<" "<<comp[srcparent]<<" "<<comp[destparent]<<nli;
		// 	cout<<flag2[comp[srcparent]]<<nli;
		// 	cout<<flag2[comp[destparent]]<<nli;
		// }
		comp[srcparent] = cnt;		
		comp[destparent] = cnt;		
		return 1;
	}
}DSU;

DSU dsu;

void dfs(ll u,ll par,ll de){
	up[u][0] = par;
	depth[u] = de;

	fip(1,30){

		// if(u==183472){
		// 	debug(up[up[u][i-1]][i-1]);
		// 	debug(up[u][i-1]);
		// }
		// if(up[u][i-1]>mx)
		// 	cerr<<" tt"<<u<<nli;
		// if(up[u][i-1]<0)
		// 	cerr<<" tt"<<u<<nli;
		// if(up[up[u][i-1]][i-1]<0)
		// 	cerr<<" tt"<<u<<nli;
		// if(up[up[u][i-1]][i-1]>mx)
		// 	cerr<<" tt"<<u<<nli;
		up[u][i] = up[up[u][i-1]][i-1];
	}
	// debug(u);
	fx(adj[u]){
		if(x!=par){
			// if(ed[x] > ed[u])
			// 	cout<<u<<" "<<x<<nli;
			// debug(x);
			// debug(u);
			dfs(x,u,de+1);
		}
	}

	return;
}

void init(int N, int M,vector<int> U,vector<int> V,vector<int> W) {
	n = N;
	m = M;
	cnt = n-1;
	// cerr<<"ok";
	dsu.init(n,m);
	fip(0,m){
		qt.init(U[i],V[i],W[i]);
		ve.push_back(qt);
	}
	// cerr<<"ok";
	sort(ve.begin(),ve.end(),cmp);
	// fx(ve)
	// 	x.printer();
	// cerr<<"ok";
	fip(0,m){
		ll u = ve[i].src;
		ll v = ve[i].dest;
		// cout<<u<<v<<nli;
		dsu.unite(u,v);
		ed[cnt] = ve[i].wet;
	}
	// cerr<<"ok";
	root = cnt;
	// debug(root);
	// fip(0,root +1){
	// 	cout<<i<<" "<<ed[i]<<nli;
	// }
	dfs(root,root,0);	
	return;
}

ll lca(ll aa,ll bb){
	if(depth[aa] < depth[bb])
		swap(aa,bb);
	ll diff = depth[aa] - depth[bb];
	// debug(depth[aa]);
	// debug(depth[bb]);
	fin(29,0)
		if(diff & (1<<i))
			aa = up[aa][i];
	// debug(aa);
	// debug(bb);
	if(aa==bb)
		return aa;
	fin(29,0){
		if(up[aa][i] != up[bb][i]){
			aa = up[aa][i];
			bb = up[bb][i];
		}
	}
	return up[aa][0];
}

int getMinimumFuelCapacity(int X, int Y) {
	ans = -1;
	tptp = lca(X,Y);
	// debug(tptp);
	if(flag[tptp] || flag2[tptp])
		return ed[tptp];
	fin(29,0){
		if((flag[up[tptp][i]] || flag2[up[tptp][i]]) == false)
			tptp = up[tptp][i];
	}
	// cout<<tptp<<nli;
	if(flag[up[tptp][0]] || flag2[up[tptp][0]])
		ans = ed[up[tptp][0]];
	return ans;
}


// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         int N,M;
//         cin>>N>>M;
//         vector<int> U(M),V(M),W(M);
//         fip(0,M){
//         	cin>>U[i]>>V[i]>>W[i];
//         }
        
//         init(N,M,U,V,W);
//         ll Q;
//         cin>>Q;
//         int sr,de;
//         fip(0,Q){
//         	cin>>sr>>de;
//         	cout<<getMinimumFuelCapacity(sr,de)<<nli;
//         }
//         // cout<<"ok"<<nli;
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7636 KB Output is correct
5 Correct 5 ms 8020 KB Output is correct
6 Correct 4 ms 7892 KB Output is correct
7 Correct 5 ms 8020 KB Output is correct
8 Correct 5 ms 8020 KB Output is correct
9 Correct 139 ms 60220 KB Output is correct
10 Correct 178 ms 72044 KB Output is correct
11 Correct 193 ms 70892 KB Output is correct
12 Correct 215 ms 74820 KB Output is correct
13 Correct 202 ms 76568 KB Output is correct
14 Correct 159 ms 60240 KB Output is correct
15 Correct 349 ms 74288 KB Output is correct
16 Correct 338 ms 72504 KB Output is correct
17 Correct 363 ms 76456 KB Output is correct
18 Correct 539 ms 78408 KB Output is correct
19 Correct 147 ms 21448 KB Output is correct
20 Correct 328 ms 75816 KB Output is correct
21 Correct 337 ms 73284 KB Output is correct
22 Correct 357 ms 77892 KB Output is correct
23 Correct 541 ms 79812 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 412 ms 78172 KB Output is correct
4 Correct 422 ms 81736 KB Output is correct
5 Correct 426 ms 79444 KB Output is correct
6 Correct 418 ms 81328 KB Output is correct
7 Correct 426 ms 80440 KB Output is correct
8 Correct 409 ms 77580 KB Output is correct
9 Correct 427 ms 80056 KB Output is correct
10 Correct 423 ms 76964 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7636 KB Output is correct
5 Correct 5 ms 8020 KB Output is correct
6 Correct 4 ms 7892 KB Output is correct
7 Correct 5 ms 8020 KB Output is correct
8 Correct 5 ms 8020 KB Output is correct
9 Correct 4 ms 7468 KB Output is correct
10 Correct 5 ms 8032 KB Output is correct
11 Correct 5 ms 8020 KB Output is correct
12 Correct 7 ms 8020 KB Output is correct
13 Correct 5 ms 7968 KB Output is correct
14 Correct 5 ms 7892 KB Output is correct
15 Correct 6 ms 8044 KB Output is correct
16 Correct 7 ms 8020 KB Output is correct
17 Correct 6 ms 8020 KB Output is correct
18 Correct 5 ms 8020 KB Output is correct
19 Correct 5 ms 7892 KB Output is correct
20 Correct 5 ms 8020 KB Output is correct
21 Correct 5 ms 8020 KB Output is correct
22 Correct 6 ms 8172 KB Output is correct
23 Correct 5 ms 7892 KB Output is correct
24 Correct 5 ms 8276 KB Output is correct
25 Correct 5 ms 8404 KB Output is correct
26 Correct 6 ms 8404 KB Output is correct
27 Correct 5 ms 8020 KB Output is correct
28 Correct 5 ms 8404 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7468 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7636 KB Output is correct
6 Correct 5 ms 8020 KB Output is correct
7 Correct 4 ms 7892 KB Output is correct
8 Correct 5 ms 8020 KB Output is correct
9 Correct 5 ms 8020 KB Output is correct
10 Correct 139 ms 60220 KB Output is correct
11 Correct 178 ms 72044 KB Output is correct
12 Correct 193 ms 70892 KB Output is correct
13 Correct 215 ms 74820 KB Output is correct
14 Correct 202 ms 76568 KB Output is correct
15 Correct 5 ms 8032 KB Output is correct
16 Correct 5 ms 8020 KB Output is correct
17 Correct 7 ms 8020 KB Output is correct
18 Correct 5 ms 7968 KB Output is correct
19 Correct 5 ms 7892 KB Output is correct
20 Correct 6 ms 8044 KB Output is correct
21 Correct 7 ms 8020 KB Output is correct
22 Correct 6 ms 8020 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 5 ms 7892 KB Output is correct
25 Correct 5 ms 8020 KB Output is correct
26 Correct 5 ms 8020 KB Output is correct
27 Correct 6 ms 8172 KB Output is correct
28 Correct 5 ms 7892 KB Output is correct
29 Correct 5 ms 8276 KB Output is correct
30 Correct 5 ms 8404 KB Output is correct
31 Correct 6 ms 8404 KB Output is correct
32 Correct 5 ms 8020 KB Output is correct
33 Correct 5 ms 8404 KB Output is correct
34 Correct 21 ms 16464 KB Output is correct
35 Correct 180 ms 74648 KB Output is correct
36 Correct 178 ms 74572 KB Output is correct
37 Correct 180 ms 74556 KB Output is correct
38 Correct 174 ms 73732 KB Output is correct
39 Correct 178 ms 73292 KB Output is correct
40 Correct 159 ms 67756 KB Output is correct
41 Correct 180 ms 74748 KB Output is correct
42 Correct 174 ms 74684 KB Output is correct
43 Correct 180 ms 77352 KB Output is correct
44 Correct 183 ms 74356 KB Output is correct
45 Correct 222 ms 87964 KB Output is correct
46 Correct 184 ms 74756 KB Output is correct
47 Correct 186 ms 74668 KB Output is correct
48 Correct 200 ms 78988 KB Output is correct
49 Correct 132 ms 69744 KB Output is correct
50 Correct 103 ms 56928 KB Output is correct
51 Correct 200 ms 76312 KB Output is correct
52 Correct 246 ms 98480 KB Output is correct
53 Correct 281 ms 104272 KB Output is correct
54 Correct 263 ms 113616 KB Output is correct
55 Correct 183 ms 77140 KB Output is correct
56 Correct 266 ms 103948 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7636 KB Output is correct
5 Correct 5 ms 8020 KB Output is correct
6 Correct 4 ms 7892 KB Output is correct
7 Correct 5 ms 8020 KB Output is correct
8 Correct 5 ms 8020 KB Output is correct
9 Correct 139 ms 60220 KB Output is correct
10 Correct 178 ms 72044 KB Output is correct
11 Correct 193 ms 70892 KB Output is correct
12 Correct 215 ms 74820 KB Output is correct
13 Correct 202 ms 76568 KB Output is correct
14 Correct 159 ms 60240 KB Output is correct
15 Correct 349 ms 74288 KB Output is correct
16 Correct 338 ms 72504 KB Output is correct
17 Correct 363 ms 76456 KB Output is correct
18 Correct 539 ms 78408 KB Output is correct
19 Correct 412 ms 78172 KB Output is correct
20 Correct 422 ms 81736 KB Output is correct
21 Correct 426 ms 79444 KB Output is correct
22 Correct 418 ms 81328 KB Output is correct
23 Correct 426 ms 80440 KB Output is correct
24 Correct 409 ms 77580 KB Output is correct
25 Correct 427 ms 80056 KB Output is correct
26 Correct 423 ms 76964 KB Output is correct
27 Correct 5 ms 8032 KB Output is correct
28 Correct 5 ms 8020 KB Output is correct
29 Correct 7 ms 8020 KB Output is correct
30 Correct 5 ms 7968 KB Output is correct
31 Correct 5 ms 7892 KB Output is correct
32 Correct 6 ms 8044 KB Output is correct
33 Correct 7 ms 8020 KB Output is correct
34 Correct 6 ms 8020 KB Output is correct
35 Correct 5 ms 8020 KB Output is correct
36 Correct 21 ms 16464 KB Output is correct
37 Correct 180 ms 74648 KB Output is correct
38 Correct 178 ms 74572 KB Output is correct
39 Correct 180 ms 74556 KB Output is correct
40 Correct 174 ms 73732 KB Output is correct
41 Correct 178 ms 73292 KB Output is correct
42 Correct 159 ms 67756 KB Output is correct
43 Correct 180 ms 74748 KB Output is correct
44 Correct 174 ms 74684 KB Output is correct
45 Correct 180 ms 77352 KB Output is correct
46 Correct 183 ms 74356 KB Output is correct
47 Correct 30 ms 15960 KB Output is correct
48 Correct 383 ms 77192 KB Output is correct
49 Correct 322 ms 77280 KB Output is correct
50 Correct 335 ms 77100 KB Output is correct
51 Correct 307 ms 76744 KB Output is correct
52 Correct 299 ms 72772 KB Output is correct
53 Correct 254 ms 55372 KB Output is correct
54 Correct 327 ms 77860 KB Output is correct
55 Correct 360 ms 77252 KB Output is correct
56 Correct 500 ms 79556 KB Output is correct
57 Correct 334 ms 77596 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7468 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7636 KB Output is correct
6 Correct 5 ms 8020 KB Output is correct
7 Correct 4 ms 7892 KB Output is correct
8 Correct 5 ms 8020 KB Output is correct
9 Correct 5 ms 8020 KB Output is correct
10 Correct 139 ms 60220 KB Output is correct
11 Correct 178 ms 72044 KB Output is correct
12 Correct 193 ms 70892 KB Output is correct
13 Correct 215 ms 74820 KB Output is correct
14 Correct 202 ms 76568 KB Output is correct
15 Correct 159 ms 60240 KB Output is correct
16 Correct 349 ms 74288 KB Output is correct
17 Correct 338 ms 72504 KB Output is correct
18 Correct 363 ms 76456 KB Output is correct
19 Correct 539 ms 78408 KB Output is correct
20 Correct 412 ms 78172 KB Output is correct
21 Correct 422 ms 81736 KB Output is correct
22 Correct 426 ms 79444 KB Output is correct
23 Correct 418 ms 81328 KB Output is correct
24 Correct 426 ms 80440 KB Output is correct
25 Correct 409 ms 77580 KB Output is correct
26 Correct 427 ms 80056 KB Output is correct
27 Correct 423 ms 76964 KB Output is correct
28 Correct 5 ms 8032 KB Output is correct
29 Correct 5 ms 8020 KB Output is correct
30 Correct 7 ms 8020 KB Output is correct
31 Correct 5 ms 7968 KB Output is correct
32 Correct 5 ms 7892 KB Output is correct
33 Correct 6 ms 8044 KB Output is correct
34 Correct 7 ms 8020 KB Output is correct
35 Correct 6 ms 8020 KB Output is correct
36 Correct 5 ms 8020 KB Output is correct
37 Correct 21 ms 16464 KB Output is correct
38 Correct 180 ms 74648 KB Output is correct
39 Correct 178 ms 74572 KB Output is correct
40 Correct 180 ms 74556 KB Output is correct
41 Correct 174 ms 73732 KB Output is correct
42 Correct 178 ms 73292 KB Output is correct
43 Correct 159 ms 67756 KB Output is correct
44 Correct 180 ms 74748 KB Output is correct
45 Correct 174 ms 74684 KB Output is correct
46 Correct 180 ms 77352 KB Output is correct
47 Correct 183 ms 74356 KB Output is correct
48 Correct 30 ms 15960 KB Output is correct
49 Correct 383 ms 77192 KB Output is correct
50 Correct 322 ms 77280 KB Output is correct
51 Correct 335 ms 77100 KB Output is correct
52 Correct 307 ms 76744 KB Output is correct
53 Correct 299 ms 72772 KB Output is correct
54 Correct 254 ms 55372 KB Output is correct
55 Correct 327 ms 77860 KB Output is correct
56 Correct 360 ms 77252 KB Output is correct
57 Correct 500 ms 79556 KB Output is correct
58 Correct 334 ms 77596 KB Output is correct
59 Correct 147 ms 21448 KB Output is correct
60 Correct 328 ms 75816 KB Output is correct
61 Correct 337 ms 73284 KB Output is correct
62 Correct 357 ms 77892 KB Output is correct
63 Correct 541 ms 79812 KB Output is correct
64 Correct 5 ms 7892 KB Output is correct
65 Correct 5 ms 8020 KB Output is correct
66 Correct 5 ms 8020 KB Output is correct
67 Correct 6 ms 8172 KB Output is correct
68 Correct 5 ms 7892 KB Output is correct
69 Correct 5 ms 8276 KB Output is correct
70 Correct 5 ms 8404 KB Output is correct
71 Correct 6 ms 8404 KB Output is correct
72 Correct 5 ms 8020 KB Output is correct
73 Correct 5 ms 8404 KB Output is correct
74 Correct 222 ms 87964 KB Output is correct
75 Correct 184 ms 74756 KB Output is correct
76 Correct 186 ms 74668 KB Output is correct
77 Correct 200 ms 78988 KB Output is correct
78 Correct 132 ms 69744 KB Output is correct
79 Correct 103 ms 56928 KB Output is correct
80 Correct 200 ms 76312 KB Output is correct
81 Correct 246 ms 98480 KB Output is correct
82 Correct 281 ms 104272 KB Output is correct
83 Correct 263 ms 113616 KB Output is correct
84 Correct 183 ms 77140 KB Output is correct
85 Correct 266 ms 103948 KB Output is correct
86 Correct 117 ms 36496 KB Output is correct
87 Correct 331 ms 77284 KB Output is correct
88 Correct 362 ms 77228 KB Output is correct
89 Correct 428 ms 77868 KB Output is correct
90 Correct 232 ms 75584 KB Output is correct
91 Correct 247 ms 71704 KB Output is correct
92 Correct 425 ms 76840 KB Output is correct
93 Correct 388 ms 99764 KB Output is correct
94 Correct 507 ms 106060 KB Output is correct
95 Correct 420 ms 115320 KB Output is correct
96 Correct 534 ms 79620 KB Output is correct
97 Correct 475 ms 92220 KB Output is correct