oj.uz

Submission #815095

# Submission time Handle Problem Language Result Execution time Memory
815095 2023-08-08T12:20:32 Z blackyuki Keys (IOI21_keys) C++17
100 / 100
 972 ms 170880 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
const ll inf=1001001001001001001;
#include "keys.h"
struct UF{
	ll n;
	vi par,sz;
	UF(ll n_):n(n_),par(n,-1),sz(n,1){}
	void merge(ll a,ll b){
		a=root(a);b=root(b);
		if(a==b)return;
		if(sz[a]>sz[b])swap(a,b);
		par[a]=b;
		sz[b]+=sz[a];
	}
	ll root(ll i){
		if(par[i]==-1)return i;
		par[i]=root(par[i]);
		return par[i];
	}
	bool same(ll a,ll b){
		return root(a)==root(b);
	}
};
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	ll n=r.size(),m=u.size();
	vvp g(n);
	rep(i,m){
		g[u[i]].pb(v[i],c[i]);
		g[v[i]].pb(u[i],c[i]);
	}
	vi par(n,-1);
	rep(i,n)for(P x:g[i])if(x.se==r[i])par[i]=x.fi;
	rep(i,n)if(par[i]==-1){
		vector<int> res(n);
		rep(j,n)if(par[j]==-1)res[j]=1;
		return res;
	}
	UF uf(n);
	rep(i,n)uf.merge(i,par[i]);
	vi rt(n);
	vvi gr(n);
	vector<set<ll>> key(n);
	vector<map<ll,vi>> edge(n);
	vvi okedge(n);
	rep(i,n){
		rt[i]=i;
		gr[i].pb(i);
		key[i].insert(r[i]);
		for(auto x:g[i]){
			if(x.se==r[i])okedge[i].pb(x.fi);
			else edge[i][x.se].pb(x.fi);
		}
	}
	auto merge=[&](ll a,ll b){
		a=rt[a];b=rt[b];
		if(gr[a].size()>gr[b].size())swap(a,b);
		for(ll x:gr[a]){
			gr[b].pb(x);
			rt[x]=b;
		}
		for(ll x:okedge[a]){
			okedge[b].pb(x);
		}
		for(ll x:key[a]){
			key[b].insert(x);
			if(edge[b].count(x)){
				for(ll y:edge[b][x])okedge[b].pb(y);
				edge[b][x]=vi(0);
			}
		}
		for(auto x:edge[a]){
			if(key[b].find(x.fi)!=key[b].end()){
				for(ll y:x.se)okedge[b].pb(y);
			}
			else{
				for(ll y:x.se)edge[b][x.fi].pb(y);
			}
		}
	};
	queue<ll> que;
	vi id(n,-1);
	rep(i,n)if(id[i]==-1){
		ll cur=i;
		vi al;
		while(id[cur]==-1){
			al.pb(cur);id[cur]=i;cur=par[cur];
		}
		if(id[cur]!=i)continue;
		reverse(all(al));
		while(al.back()!=cur)al.pop_back();
		rep(j,al.size()-1)merge(al[j],al[j+1]);
		que.push(rt[al[0]]);
	}
	vi confirm;
	while(!que.empty()){
		ll i=que.front();que.pop();
		bool done=false;
		while(okedge[i].size()){
			ll j=okedge[i].back();okedge[i].pop_back();
			if(rt[j]==rt[i])continue;
			if(!uf.same(i,j)){
				uf.merge(i,j);
				par[i]=j;
				done=true;break;
			}
			vi al;
			ll cur=rt[j];
			while(cur!=i){
				al.pb(cur);cur=rt[par[cur]];
			}
			al.pb(i);
			rep(t,al.size()-1)merge(al[t],al[t+1]);
			i=rt[i];
		}
		if(!done)confirm.pb(rt[i]);
	}
	ll mi=inf;
	for(ll i:confirm)chmin(mi,(ll)(gr[i].size()));
	vector<int> res(n);
	for(ll i:confirm)if(mi==gr[i].size()){
		for(ll j:gr[i])res[j]=1;
	}
	return res;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:139:24: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |  for(ll i:confirm)if(mi==gr[i].size()){
      |                      ~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 436 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 564 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 4 ms 1236 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 128 ms 31592 KB Output is correct
11 Correct 436 ms 131140 KB Output is correct
12 Correct 119 ms 33720 KB Output is correct
13 Correct 588 ms 161852 KB Output is correct
14 Correct 278 ms 141264 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 852 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 436 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 564 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 4 ms 1236 KB Output is correct
42 Correct 128 ms 31592 KB Output is correct
43 Correct 436 ms 131140 KB Output is correct
44 Correct 119 ms 33720 KB Output is correct
45 Correct 588 ms 161852 KB Output is correct
46 Correct 278 ms 141264 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 213 ms 130904 KB Output is correct
51 Correct 125 ms 41960 KB Output is correct
52 Correct 120 ms 30420 KB Output is correct
53 Correct 144 ms 30432 KB Output is correct
54 Correct 122 ms 30432 KB Output is correct
55 Correct 125 ms 32868 KB Output is correct
56 Correct 158 ms 43256 KB Output is correct
57 Correct 148 ms 42328 KB Output is correct
58 Correct 150 ms 42216 KB Output is correct
59 Correct 972 ms 170880 KB Output is correct
60 Correct 183 ms 38156 KB Output is correct
61 Correct 221 ms 38468 KB Output is correct
62 Correct 139 ms 34920 KB Output is correct
63 Correct 374 ms 145448 KB Output is correct
64 Correct 4 ms 2644 KB Output is correct
65 Correct 5 ms 2724 KB Output is correct
66 Correct 147 ms 35068 KB Output is correct
67 Correct 22 ms 13864 KB Output is correct
68 Correct 37 ms 23076 KB Output is correct
69 Correct 881 ms 166248 KB Output is correct
70 Correct 76 ms 45380 KB Output is correct
71 Correct 224 ms 141148 KB Output is correct
72 Correct 891 ms 166224 KB Output is correct
73 Correct 146 ms 34832 KB Output is correct