Submission #1240231

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240231		lioow	Sightseeing (NOI14_sightseeing)	C++20	25 / 25	1649 ms	164528 KiB

sightseeing

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"YES"<<endl
#define cn cout<<"NO"<<endl
#define ca cout<<"Alice"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p3 pair<int,pair<int,int>>
#define p2
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef long long bryson;
const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
//const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
	if(e==0) return 1;
	int tmp=expo(b,e/2);
	if(e%2) return mul(tmp,mul(tmp,b));
	else return mul(tmp,tmp);
}
const int maxn=5e5+5;
const int N=1e5;
const long double eps=1e-6;

vector<int> c[maxn+2];
int p[maxn];
int ans[maxn];
int root(int x){
	if(p[x]==x) return x;
	return p[x]=root(p[x]);
}
int nw;
void merge(int x,int y){
	x=root(x),y=root(y);
	if(root(1)==x){
		for(auto v:c[y]) ans[v]=nw;
	} else if(root(1)==y){
		for(auto v:c[x]) ans[v]=nw;
	}
	if(c[x].size()<c[y].size()) swap(x,y);
	for(auto v:c[y]) c[x].pb(v);
	p[y]=x;
}

signed main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int n,m,q;cin>>n>>m>>q;
	pair<int,pii> edge[m+2];
	repp(i,1,n) c[i].pb(i),p[i]=i;
	repp(i,1,m){
		int u,v,w;cin>>u>>v>>w;
		edge[i]={w,{u,v}};
	}
	sort(edge+1,edge+m+1);
	for(int i=m;i>=1;i--){
		nw=edge[i].first;
		auto[u,v]=edge[i].se;
		if(root(u)==root(v)) continue;
		merge(u,v);
	}
	repp(i,1,q){
		int x;cin>>x;
		cout<<ans[x]<<endl;
	}
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 6 / 6
• Subtask 4: 10 / 10