oj.uz

Submission #484626

# Submission time Handle Problem Language Result Execution time Memory
484626 2021-11-04T20:53:03 Z maroonrk Keys (IOI21_keys) C++17
100 / 100
 698 ms 116660 KB 
#include <vector>

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

const int nmax=300010;
int ufr[nmax];

struct State{
	set<int> keys;
	set<pi> es;
	vi ls,idx;
	void addkey(int key){
		if(keys.insert(key).b){
			auto itr=es.lower_bound(pi(key,-1));
			while(itr!=es.ed&&itr->a==key){
				ls.pb(itr->b);
				itr=es.erase(itr);
			}
		}
	}
	void addedge(int key,int to){
		if(keys.find(key)==keys.ed){
			es.emplace(key,to);
		}else{
			ls.pb(to);
		}
	}
	int size(){
		return si(keys)+si(es)+si(ls)+si(idx);
	}
	void clear(){
		keys.clear();
		es.clear();
		ls.clear();
		idx.clear();
	}
	int getcand(){
		assert(si(idx));
		return idx[0];
	}
};

void mg(State&a,State&b){
	if(si(a)<si(b))swap(a,b);
	for(auto key:b.keys)a.addkey(key);
	for(auto [key,to]:b.es)a.addedge(key,to);
	for(auto to:b.ls)a.ls.pb(to);
	int cand=a.getcand();
	for(auto i:b.idx){
		ufr[i]=cand;
		a.idx.pb(i);
	}
}

std::vector<signed> find_reachable(std::vector<signed> r, std::vector<signed> u, std::vector<signed> v, std::vector<signed> c) {
	int n=si(r);
	rep(i,n)ufr[i]=i;
	vvc<pi> g(n);
	rep(i,si(u)){
		g[u[i]].eb(c[i],v[i]);
		g[v[i]].eb(c[i],u[i]);
	}
	vi vis(n);
	vc<State> buf(n);
	int mn=inf;
	vi ans;
	auto updans=[&](vi ls){
		if(chmin(mn,si(ls))){
			ans.clear();
		}
		if(mn==si(ls)){
			ans.insert(ans.ed,all(ls));
		}
	};
	rep(root,n){
		assert(vis[root]!=1);
		if(vis[root]==0){
			int s=0;
			auto loadvertex=[&](int i){
				assert(vis[i]==0);
				vis[i]=1;
				buf[s].clear();
				buf[s].addkey(r[i]);
				for(auto [key,to]:g[i])
					buf[s].addedge(key,to);
				buf[s].idx.pb(i);
				s++;
			};
			loadvertex(root);
			while(1){
				auto&z=buf[s-1];
				if(z.ls.empty()){
					updans(z.idx);
					break;
				}
				int to=z.ls.back();z.ls.pop_back();
				if(vis[to]==0){
					loadvertex(to);
				}else if(vis[to]==1){
					while(ufr[to]!=buf[s-1].getcand()){
						mg(buf[s-2],buf[s-1]);
						s--;
					}
				}else if(vis[to]==2){
					break;
				}else assert(false);
			}
			rep(i,s)for(auto j:buf[i].idx){
				vis[j]=2;
			}
		}
	}
	vi res(n);
	for(auto i:ans)res[i]=1;
	return res;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 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 332 KB Output is correct
5 Correct 0 ms 300 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 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 332 KB Output is correct
5 Correct 0 ms 300 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 272 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 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 332 KB Output is correct
5 Correct 0 ms 300 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 272 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 2 ms 824 KB Output is correct
28 Correct 2 ms 844 KB Output is correct
29 Correct 2 ms 844 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 588 KB Output is correct
36 Correct 3 ms 1100 KB Output is correct
37 Correct 3 ms 1100 KB Output is correct
38 Correct 3 ms 1228 KB Output is correct
39 Correct 3 ms 1228 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 2 ms 588 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 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 332 KB Output is correct
5 Correct 0 ms 300 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 271 ms 55624 KB Output is correct
11 Correct 413 ms 94952 KB Output is correct
12 Correct 46 ms 14212 KB Output is correct
13 Correct 250 ms 71956 KB Output is correct
14 Correct 225 ms 113620 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 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 332 KB Output is correct
5 Correct 0 ms 300 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 272 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 2 ms 824 KB Output is correct
28 Correct 2 ms 844 KB Output is correct
29 Correct 2 ms 844 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 588 KB Output is correct
36 Correct 3 ms 1100 KB Output is correct
37 Correct 3 ms 1100 KB Output is correct
38 Correct 3 ms 1228 KB Output is correct
39 Correct 3 ms 1228 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 271 ms 55624 KB Output is correct
43 Correct 413 ms 94952 KB Output is correct
44 Correct 46 ms 14212 KB Output is correct
45 Correct 250 ms 71956 KB Output is correct
46 Correct 225 ms 113620 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 202 ms 99432 KB Output is correct
51 Correct 181 ms 81536 KB Output is correct
52 Correct 196 ms 55996 KB Output is correct
53 Correct 190 ms 55868 KB Output is correct
54 Correct 190 ms 55848 KB Output is correct
55 Correct 338 ms 65496 KB Output is correct
56 Correct 292 ms 87864 KB Output is correct
57 Correct 250 ms 82780 KB Output is correct
58 Correct 388 ms 93484 KB Output is correct
59 Correct 698 ms 100752 KB Output is correct
60 Correct 308 ms 73668 KB Output is correct
61 Correct 651 ms 116660 KB Output is correct
62 Correct 537 ms 65340 KB Output is correct
63 Correct 173 ms 51768 KB Output is correct
64 Correct 4 ms 2124 KB Output is correct
65 Correct 5 ms 2252 KB Output is correct
66 Correct 555 ms 65552 KB Output is correct
67 Correct 23 ms 11724 KB Output is correct
68 Correct 38 ms 19420 KB Output is correct
69 Correct 669 ms 105004 KB Output is correct
70 Correct 75 ms 38328 KB Output is correct
71 Correct 229 ms 113576 KB Output is correct
72 Correct 659 ms 104224 KB Output is correct
73 Correct 553 ms 65468 KB Output is correct