oj.uz

Submission #484944

# Submission time Handle Problem Language Result Execution time Memory
484944 2021-11-05T18:49:49 Z maroonrk Fountain Parks (IOI21_parks) C++17
100 / 100
 1018 ms 86948 KB 
#include "parks.h"

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print(const array<T,N>&v,int suc=1){
	rep(i,N)
		print(v[i],i==int(N)-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

//VERIFY: yosupo
//KUPC2017J
//AOJDSL1A
//without rank
struct unionfind{
	vi p,s;
	int c;
	unionfind(int n):p(n,-1),s(n,1),c(n){}
	int find(int a){
		return p[a]==-1?a:(p[a]=find(p[a]));
	}
	//set b to a child of a
	bool unite(int a,int b){
		a=find(a);
		b=find(b);
		if(a==b)return false;
		p[b]=a;
		s[a]+=s[b];
		c--;
		return true;
	}
	bool same(int a,int b){
		return find(a)==find(b);
	}
	int sz(int a){
		return s[find(a)];
	}
};

int construct_roads(std::vector<int> xs, std::vector<int> ys){
	int n=si(xs);
	map<pi,int> z;
	rep(i,n){
		z[pi(xs[i]/=2,ys[i]/=2)]=i;
	}
	{
		unionfind uf(n);
		rep(i,n){
			{
				pi w(xs[i]+1,ys[i]);
				if(z.count(w))uf.unite(i,z[w]);
			}
			{
				pi w(xs[i],ys[i]+1);
				if(z.count(w))uf.unite(i,z[w]);
			}
		}
		if(uf.c>1)return 0;
	}
	map<pi,int> hori;
	map<pi,pi> ps;
	{
		map<int,vi> y2x;
		rep(i,n)y2x[ys[i]].pb(xs[i]);
		vc<pi> pre;
		for(auto [y,tmp]:y2x){
			sort(all(tmp));
			vc<pi> cur;
			{
				int prex=-inf;
				for(auto x:tmp){
					if(prex+1<x){
						cur.eb(x,x);
					}else{
						cur.back().b=x;
					}
					prex=x;
				}
			}
			int head=0;
			for(auto [l,r]:cur){
				rng(x,l,r)hori[pi(x,y)]=0;
				while(head<si(pre)&&pre[head].b<l)head++;
				while(head<si(pre)&&pre[head].a<=r){
					int p=max(pre[head].a,l);
					int q=min(pre[head].b,r);
					int k=si(ps);
					ps[pi(p-1,y)]=pi(0,k);
					ps[pi(q,y)]=pi(1,k+1);
					head++;
				}
				head--;
				chmax(head,0);
			}
			pre=cur;
		}
	}
	int s=si(ps);
	vvc<int> g(s);
	rep(i,s)g[i].pb(i^1);
	{
		pi pre(-inf,-inf);
		int preid=-1;
		for(auto [pos,info]:ps){
			int id=info.b;
			if(pre.a==pos.a){
				bool ok=true;
				rng(y,pre.b,pos.b){
					if(hori.count(pi(pos.a,y))==0){
						ok=false;
						break;
					}
				}
				if(ok){
					g[preid].pb(id);
					g[id].pb(preid);
				}
			}
			pre=pos;
			preid=id;
		}
	}
	vi d(s,-1);
	{
		auto dfs=[&](auto self,int v,int w)->void{
			if(d[v]!=-1){
				assert(d[v]==w);
				return;
			}
			d[v]=w;
			for(auto to:g[v])self(self,to,w^1);
		};
		rep(i,s)if(d[i]==-1)dfs(dfs,i,0);
	}
	unionfind uf(n);
	vi ans[4];
	set<pi> used;
	auto addvert=[&](int x,int y,int k){
		assert(z.count(pi(x,y)));
		assert(z.count(pi(x,y+1)));
		int i=z[pi(x,y)];
		int j=z[pi(x,y+1)];
		pi w=pi(x*2+k*2-1,y*2+1);
		auto [tmp,b]=used.insert(w);
		assert(b);
		ans[0].pb(i);
		ans[1].pb(j);
		ans[2].pb(w.a);
		ans[3].pb(w.b);
		uf.unite(i,j);
	};
	auto addhori=[&](int x,int y,int k){
		assert(z.count(pi(x,y)));
		assert(z.count(pi(x+1,y)));
		int i=z[pi(x,y)];
		int j=z[pi(x+1,y)];
		pi w=pi(x*2+1,y*2+k*2-1);
		auto [tmp,b]=used.insert(w);
		assert(b);
		ans[0].pb(i);
		ans[1].pb(j);
		ans[2].pb(w.a);
		ans[3].pb(w.b);
		uf.unite(i,j);
	};
	{
		for(auto [pos,info]:ps){
			auto [way,id]=info;
			if(d[id]){
				if(way==0){
					addvert(pos.a+1,pos.b-1,0);
				}else{
					addvert(pos.a,pos.b-1,1);
				}
				rng(y,pos.b,inf){
					auto itr=hori.find(pi(pos.a,y));
					if(itr==hori.ed)break;
					itr->b=1;
				}
			}
		}
	}
	for(auto [pos,k]:hori){
		addhori(pos.a,pos.b,k);
	}
	assert(uf.c==1);
	build(ans[0],ans[1],ans[2],ans[3]);
	return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 355 ms 43496 KB Output is correct
10 Correct 23 ms 4808 KB Output is correct
11 Correct 174 ms 23536 KB Output is correct
12 Correct 35 ms 6928 KB Output is correct
13 Correct 33 ms 4428 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 358 ms 43396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 355 ms 43496 KB Output is correct
10 Correct 23 ms 4808 KB Output is correct
11 Correct 174 ms 23536 KB Output is correct
12 Correct 35 ms 6928 KB Output is correct
13 Correct 33 ms 4428 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 358 ms 43396 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 826 ms 68772 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 3 ms 576 KB Output is correct
27 Correct 4 ms 568 KB Output is correct
28 Correct 258 ms 27656 KB Output is correct
29 Correct 502 ms 41312 KB Output is correct
30 Correct 594 ms 55248 KB Output is correct
31 Correct 917 ms 68708 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 292 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 292 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 436 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 343 ms 37916 KB Output is correct
46 Correct 571 ms 55528 KB Output is correct
47 Correct 575 ms 55448 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 355 ms 43496 KB Output is correct
10 Correct 23 ms 4808 KB Output is correct
11 Correct 174 ms 23536 KB Output is correct
12 Correct 35 ms 6928 KB Output is correct
13 Correct 33 ms 4428 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 358 ms 43396 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 826 ms 68772 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 3 ms 576 KB Output is correct
27 Correct 4 ms 568 KB Output is correct
28 Correct 258 ms 27656 KB Output is correct
29 Correct 502 ms 41312 KB Output is correct
30 Correct 594 ms 55248 KB Output is correct
31 Correct 917 ms 68708 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 292 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 292 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 436 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 343 ms 37916 KB Output is correct
46 Correct 571 ms 55528 KB Output is correct
47 Correct 575 ms 55448 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 844 ms 62760 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 4 ms 844 KB Output is correct
58 Correct 12 ms 2260 KB Output is correct
59 Correct 8 ms 1236 KB Output is correct
60 Correct 337 ms 31444 KB Output is correct
61 Correct 468 ms 43548 KB Output is correct
62 Correct 675 ms 52144 KB Output is correct
63 Correct 944 ms 62712 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 256 KB Output is correct
67 Correct 826 ms 86748 KB Output is correct
68 Correct 861 ms 86948 KB Output is correct
69 Correct 889 ms 86316 KB Output is correct
70 Correct 3 ms 588 KB Output is correct
71 Correct 6 ms 972 KB Output is correct
72 Correct 362 ms 37024 KB Output is correct
73 Correct 621 ms 55936 KB Output is correct
74 Correct 955 ms 74008 KB Output is correct
75 Correct 1018 ms 85608 KB Output is correct
76 Correct 885 ms 86672 KB Output is correct
77 Correct 5 ms 716 KB Output is correct
78 Correct 7 ms 1128 KB Output is correct
79 Correct 391 ms 39836 KB Output is correct
80 Correct 636 ms 60088 KB Output is correct
81 Correct 927 ms 79888 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 355 ms 43496 KB Output is correct
10 Correct 23 ms 4808 KB Output is correct
11 Correct 174 ms 23536 KB Output is correct
12 Correct 35 ms 6928 KB Output is correct
13 Correct 33 ms 4428 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 358 ms 43396 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 771 ms 75620 KB Output is correct
21 Correct 731 ms 72276 KB Output is correct
22 Correct 737 ms 72356 KB Output is correct
23 Correct 505 ms 54456 KB Output is correct
24 Correct 275 ms 19228 KB Output is correct
25 Correct 365 ms 19140 KB Output is correct
26 Correct 312 ms 19124 KB Output is correct
27 Correct 671 ms 86576 KB Output is correct
28 Correct 677 ms 86452 KB Output is correct
29 Correct 614 ms 51136 KB Output is correct
30 Correct 609 ms 51364 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 34 ms 5136 KB Output is correct
33 Correct 88 ms 10052 KB Output is correct
34 Correct 743 ms 75424 KB Output is correct
35 Correct 8 ms 1228 KB Output is correct
36 Correct 52 ms 5148 KB Output is correct
37 Correct 127 ms 10180 KB Output is correct
38 Correct 261 ms 28376 KB Output is correct
39 Correct 377 ms 38312 KB Output is correct
40 Correct 517 ms 49736 KB Output is correct
41 Correct 653 ms 59476 KB Output is correct
42 Correct 795 ms 69668 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 292 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 460 KB Output is correct
55 Correct 2 ms 460 KB Output is correct
56 Correct 345 ms 38172 KB Output is correct
57 Correct 559 ms 55440 KB Output is correct
58 Correct 554 ms 55468 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 859 ms 86752 KB Output is correct
63 Correct 836 ms 86628 KB Output is correct
64 Correct 826 ms 86260 KB Output is correct
65 Correct 3 ms 588 KB Output is correct
66 Correct 6 ms 972 KB Output is correct
67 Correct 352 ms 37092 KB Output is correct
68 Correct 575 ms 55932 KB Output is correct
69 Correct 837 ms 74148 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 355 ms 43496 KB Output is correct
10 Correct 23 ms 4808 KB Output is correct
11 Correct 174 ms 23536 KB Output is correct
12 Correct 35 ms 6928 KB Output is correct
13 Correct 33 ms 4428 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 358 ms 43396 KB Output is correct
17 Correct 644 ms 69224 KB Output is correct
18 Correct 659 ms 69252 KB Output is correct
19 Correct 709 ms 75272 KB Output is correct
20 Correct 787 ms 83136 KB Output is correct
21 Correct 593 ms 65120 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 91 ms 11920 KB Output is correct
24 Correct 18 ms 2256 KB Output is correct
25 Correct 81 ms 7212 KB Output is correct
26 Correct 164 ms 12228 KB Output is correct
27 Correct 365 ms 39648 KB Output is correct
28 Correct 489 ms 49756 KB Output is correct
29 Correct 610 ms 59964 KB Output is correct
30 Correct 766 ms 69532 KB Output is correct
31 Correct 862 ms 79256 KB Output is correct
32 Correct 944 ms 85736 KB Output is correct
33 Correct 809 ms 86808 KB Output is correct
34 Correct 4 ms 688 KB Output is correct
35 Correct 6 ms 1100 KB Output is correct
36 Correct 363 ms 39776 KB Output is correct
37 Correct 600 ms 60284 KB Output is correct
38 Correct 872 ms 79748 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 355 ms 43496 KB Output is correct
10 Correct 23 ms 4808 KB Output is correct
11 Correct 174 ms 23536 KB Output is correct
12 Correct 35 ms 6928 KB Output is correct
13 Correct 33 ms 4428 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 358 ms 43396 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 826 ms 68772 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 3 ms 576 KB Output is correct
27 Correct 4 ms 568 KB Output is correct
28 Correct 258 ms 27656 KB Output is correct
29 Correct 502 ms 41312 KB Output is correct
30 Correct 594 ms 55248 KB Output is correct
31 Correct 917 ms 68708 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 292 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 292 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 436 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 343 ms 37916 KB Output is correct
46 Correct 571 ms 55528 KB Output is correct
47 Correct 575 ms 55448 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 844 ms 62760 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 4 ms 844 KB Output is correct
58 Correct 12 ms 2260 KB Output is correct
59 Correct 8 ms 1236 KB Output is correct
60 Correct 337 ms 31444 KB Output is correct
61 Correct 468 ms 43548 KB Output is correct
62 Correct 675 ms 52144 KB Output is correct
63 Correct 944 ms 62712 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 256 KB Output is correct
67 Correct 826 ms 86748 KB Output is correct
68 Correct 861 ms 86948 KB Output is correct
69 Correct 889 ms 86316 KB Output is correct
70 Correct 3 ms 588 KB Output is correct
71 Correct 6 ms 972 KB Output is correct
72 Correct 362 ms 37024 KB Output is correct
73 Correct 621 ms 55936 KB Output is correct
74 Correct 955 ms 74008 KB Output is correct
75 Correct 1018 ms 85608 KB Output is correct
76 Correct 885 ms 86672 KB Output is correct
77 Correct 5 ms 716 KB Output is correct
78 Correct 7 ms 1128 KB Output is correct
79 Correct 391 ms 39836 KB Output is correct
80 Correct 636 ms 60088 KB Output is correct
81 Correct 927 ms 79888 KB Output is correct
82 Correct 0 ms 204 KB Output is correct
83 Correct 0 ms 204 KB Output is correct
84 Correct 0 ms 296 KB Output is correct
85 Correct 771 ms 75620 KB Output is correct
86 Correct 731 ms 72276 KB Output is correct
87 Correct 737 ms 72356 KB Output is correct
88 Correct 505 ms 54456 KB Output is correct
89 Correct 275 ms 19228 KB Output is correct
90 Correct 365 ms 19140 KB Output is correct
91 Correct 312 ms 19124 KB Output is correct
92 Correct 671 ms 86576 KB Output is correct
93 Correct 677 ms 86452 KB Output is correct
94 Correct 614 ms 51136 KB Output is correct
95 Correct 609 ms 51364 KB Output is correct
96 Correct 0 ms 204 KB Output is correct
97 Correct 34 ms 5136 KB Output is correct
98 Correct 88 ms 10052 KB Output is correct
99 Correct 743 ms 75424 KB Output is correct
100 Correct 8 ms 1228 KB Output is correct
101 Correct 52 ms 5148 KB Output is correct
102 Correct 127 ms 10180 KB Output is correct
103 Correct 261 ms 28376 KB Output is correct
104 Correct 377 ms 38312 KB Output is correct
105 Correct 517 ms 49736 KB Output is correct
106 Correct 653 ms 59476 KB Output is correct
107 Correct 795 ms 69668 KB Output is correct
108 Correct 0 ms 204 KB Output is correct
109 Correct 0 ms 292 KB Output is correct
110 Correct 0 ms 204 KB Output is correct
111 Correct 0 ms 204 KB Output is correct
112 Correct 0 ms 204 KB Output is correct
113 Correct 0 ms 204 KB Output is correct
114 Correct 0 ms 204 KB Output is correct
115 Correct 0 ms 204 KB Output is correct
116 Correct 0 ms 204 KB Output is correct
117 Correct 0 ms 204 KB Output is correct
118 Correct 0 ms 204 KB Output is correct
119 Correct 1 ms 460 KB Output is correct
120 Correct 2 ms 460 KB Output is correct
121 Correct 345 ms 38172 KB Output is correct
122 Correct 559 ms 55440 KB Output is correct
123 Correct 554 ms 55468 KB Output is correct
124 Correct 0 ms 204 KB Output is correct
125 Correct 1 ms 204 KB Output is correct
126 Correct 0 ms 204 KB Output is correct
127 Correct 859 ms 86752 KB Output is correct
128 Correct 836 ms 86628 KB Output is correct
129 Correct 826 ms 86260 KB Output is correct
130 Correct 3 ms 588 KB Output is correct
131 Correct 6 ms 972 KB Output is correct
132 Correct 352 ms 37092 KB Output is correct
133 Correct 575 ms 55932 KB Output is correct
134 Correct 837 ms 74148 KB Output is correct
135 Correct 644 ms 69224 KB Output is correct
136 Correct 659 ms 69252 KB Output is correct
137 Correct 709 ms 75272 KB Output is correct
138 Correct 787 ms 83136 KB Output is correct
139 Correct 593 ms 65120 KB Output is correct
140 Correct 0 ms 204 KB Output is correct
141 Correct 91 ms 11920 KB Output is correct
142 Correct 18 ms 2256 KB Output is correct
143 Correct 81 ms 7212 KB Output is correct
144 Correct 164 ms 12228 KB Output is correct
145 Correct 365 ms 39648 KB Output is correct
146 Correct 489 ms 49756 KB Output is correct
147 Correct 610 ms 59964 KB Output is correct
148 Correct 766 ms 69532 KB Output is correct
149 Correct 862 ms 79256 KB Output is correct
150 Correct 944 ms 85736 KB Output is correct
151 Correct 809 ms 86808 KB Output is correct
152 Correct 4 ms 688 KB Output is correct
153 Correct 6 ms 1100 KB Output is correct
154 Correct 363 ms 39776 KB Output is correct
155 Correct 600 ms 60284 KB Output is correct
156 Correct 872 ms 79748 KB Output is correct
157 Correct 0 ms 204 KB Output is correct
158 Correct 0 ms 204 KB Output is correct
159 Correct 1 ms 204 KB Output is correct
160 Correct 0 ms 204 KB Output is correct
161 Correct 660 ms 51848 KB Output is correct
162 Correct 718 ms 75456 KB Output is correct
163 Correct 724 ms 65524 KB Output is correct
164 Correct 708 ms 65440 KB Output is correct
165 Correct 685 ms 55588 KB Output is correct
166 Correct 680 ms 52980 KB Output is correct
167 Correct 120 ms 13652 KB Output is correct
168 Correct 32 ms 3228 KB Output is correct
169 Correct 101 ms 8188 KB Output is correct
170 Correct 237 ms 15152 KB Output is correct
171 Correct 376 ms 19900 KB Output is correct
172 Correct 283 ms 26884 KB Output is correct
173 Correct 349 ms 32124 KB Output is correct
174 Correct 432 ms 37444 KB Output is correct
175 Correct 515 ms 42636 KB Output is correct
176 Correct 603 ms 46956 KB Output is correct
177 Correct 690 ms 53340 KB Output is correct