oj.uz

Submission #370591

# Submission time Handle Problem Language Result Execution time Memory
370591 2021-02-24T07:51:17 Z maroonrk Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 286 ms 24316 KB 
#include "supertrees.h"
#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);
}

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)];
	}
};

signed construct(std::vector<std::vector<signed>> p){
	int n=si(p);
	rep(i,n)rep(j,n)if(p[i][j]==3)return 0;
	vc<pi> es;
	vc<bool> alive(n,1);
	{
		unionfind uf(n);
		rep(i,n)rep(j,n)if(p[i][j]==1)uf.unite(i,j);
		vvc<int> idx;
		rep(i,n)if(uf.find(i)==i){
			idx.eb();
			rep(j,n)if(uf.find(j)==i)idx.back().pb(j);
			for(auto a:idx.back())for(auto b:idx.back())
				if(p[a][b]!=1){
					return 0;
				}
			for(auto a:idx.back()){
				rep(to,n){
					if(p[a][to]!=p[idx.back()[0]][to]){
						return 0;
					}
				}
			}
		}
		for(auto&vs:idx){
			rng(i,1,si(vs)){
				es.eb(vs[i-1],vs[i]);
				alive[vs[i]]=0;
			}
		}
	}
	{
		vi cur;
		rep(i,n)if(alive[i])cur.pb(i);
		unionfind uf(n);
		for(auto i:cur)for(auto j:cur)if(p[i][j]>=2)uf.unite(i,j);
		vvc<int> idx;
		for(auto i:cur)if(uf.find(i)==i){
			idx.eb();
			for(auto j:cur)if(uf.find(j)==i)idx.back().pb(j);
			int val=-1;
			for(auto a:idx.back())for(auto b:idx.back()){
				if(a==b)continue;
				if(val==-1)val=p[a][b];
				if(val!=p[a][b])return 0;
			}
			if(val==-1){
				//do nothing
			}else{
				const auto&vs=idx.back();
				if(si(vs)==2)return 0;
				rep(a,si(vs)){
					int b=(a+1)%si(vs);
					es.eb(vs[a],vs[b]);
				}
			}
		}
	}
	vvc<signed> ans(n,vc<signed>(n));
	for(auto e:es){
		ans[e.a][e.b]=1;
		ans[e.b][e.a]=1;
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 258 ms 22252 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 258 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 265 ms 22124 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 620 KB Output is correct
17 Correct 134 ms 8300 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 82 ms 5868 KB Output is correct
21 Correct 251 ms 22124 KB Output is correct
22 Correct 268 ms 22124 KB Output is correct
23 Correct 258 ms 22124 KB Output is correct
24 Correct 253 ms 22124 KB Output is correct
25 Correct 106 ms 8300 KB Output is correct
26 Correct 115 ms 8300 KB Output is correct
27 Correct 259 ms 22124 KB Output is correct
28 Correct 252 ms 22124 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 258 ms 24172 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 260 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 123 ms 10348 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 64 ms 6380 KB Output is correct
22 Correct 257 ms 24172 KB Output is correct
23 Correct 252 ms 24044 KB Output is correct
24 Correct 262 ms 24172 KB Output is correct
25 Correct 114 ms 10220 KB Output is correct
26 Correct 113 ms 10220 KB Output is correct
27 Correct 254 ms 24044 KB Output is correct
28 Correct 286 ms 24044 KB Output is correct
29 Correct 111 ms 10220 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 62 ms 5908 KB Output is correct
5 Correct 248 ms 22124 KB Output is correct
6 Correct 254 ms 22124 KB Output is correct
7 Correct 267 ms 22124 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 63 ms 5868 KB Output is correct
10 Correct 256 ms 24300 KB Output is correct
11 Correct 270 ms 24064 KB Output is correct
12 Correct 262 ms 24044 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 65 ms 6380 KB Output is correct
17 Correct 255 ms 24316 KB Output is correct
18 Correct 255 ms 24096 KB Output is correct
19 Correct 252 ms 24068 KB Output is correct
20 Correct 254 ms 24072 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 258 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 265 ms 22124 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 620 KB Output is correct
17 Correct 134 ms 8300 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 82 ms 5868 KB Output is correct
21 Correct 251 ms 22124 KB Output is correct
22 Correct 268 ms 22124 KB Output is correct
23 Correct 258 ms 22124 KB Output is correct
24 Correct 253 ms 22124 KB Output is correct
25 Correct 106 ms 8300 KB Output is correct
26 Correct 115 ms 8300 KB Output is correct
27 Correct 259 ms 22124 KB Output is correct
28 Correct 252 ms 22124 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 258 ms 24172 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 260 ms 24172 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 6 ms 748 KB Output is correct
45 Correct 123 ms 10348 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 64 ms 6380 KB Output is correct
50 Correct 257 ms 24172 KB Output is correct
51 Correct 252 ms 24044 KB Output is correct
52 Correct 262 ms 24172 KB Output is correct
53 Correct 114 ms 10220 KB Output is correct
54 Correct 113 ms 10220 KB Output is correct
55 Correct 254 ms 24044 KB Output is correct
56 Correct 286 ms 24044 KB Output is correct
57 Correct 111 ms 10220 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 116 ms 10220 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 63 ms 6380 KB Output is correct
66 Correct 106 ms 10220 KB Output is correct
67 Correct 116 ms 10220 KB Output is correct
68 Correct 108 ms 10196 KB Output is correct
69 Correct 109 ms 10224 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 1260 KB Output is correct
7 Correct 258 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 265 ms 22124 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 620 KB Output is correct
17 Correct 134 ms 8300 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 82 ms 5868 KB Output is correct
21 Correct 251 ms 22124 KB Output is correct
22 Correct 268 ms 22124 KB Output is correct
23 Correct 258 ms 22124 KB Output is correct
24 Correct 253 ms 22124 KB Output is correct
25 Correct 106 ms 8300 KB Output is correct
26 Correct 115 ms 8300 KB Output is correct
27 Correct 259 ms 22124 KB Output is correct
28 Correct 252 ms 22124 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 258 ms 24172 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 260 ms 24172 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 6 ms 748 KB Output is correct
45 Correct 123 ms 10348 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 64 ms 6380 KB Output is correct
50 Correct 257 ms 24172 KB Output is correct
51 Correct 252 ms 24044 KB Output is correct
52 Correct 262 ms 24172 KB Output is correct
53 Correct 114 ms 10220 KB Output is correct
54 Correct 113 ms 10220 KB Output is correct
55 Correct 254 ms 24044 KB Output is correct
56 Correct 286 ms 24044 KB Output is correct
57 Correct 111 ms 10220 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 0 ms 364 KB Output is correct
61 Correct 62 ms 5908 KB Output is correct
62 Correct 248 ms 22124 KB Output is correct
63 Correct 254 ms 22124 KB Output is correct
64 Correct 267 ms 22124 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 63 ms 5868 KB Output is correct
67 Correct 256 ms 24300 KB Output is correct
68 Correct 270 ms 24064 KB Output is correct
69 Correct 262 ms 24044 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 492 KB Output is correct
73 Correct 65 ms 6380 KB Output is correct
74 Correct 255 ms 24316 KB Output is correct
75 Correct 255 ms 24096 KB Output is correct
76 Correct 252 ms 24068 KB Output is correct
77 Correct 254 ms 24072 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 5 ms 896 KB Output is correct
81 Correct 116 ms 10220 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 63 ms 6380 KB Output is correct
86 Correct 106 ms 10220 KB Output is correct
87 Correct 116 ms 10220 KB Output is correct
88 Correct 108 ms 10196 KB Output is correct
89 Correct 109 ms 10224 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 748 KB Output is correct
93 Correct 110 ms 10220 KB Output is correct
94 Correct 1 ms 364 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 26 ms 2796 KB Output is correct
98 Correct 105 ms 10220 KB Output is correct
99 Correct 115 ms 10220 KB Output is correct
100 Correct 105 ms 10220 KB Output is correct
101 Correct 104 ms 10240 KB Output is correct
102 Correct 102 ms 10220 KB Output is correct
103 Correct 102 ms 10220 KB Output is correct
104 Correct 104 ms 10220 KB Output is correct
105 Correct 109 ms 10144 KB Output is correct