Submission #1113697

#	Time	Username	Problem	Language	Result	Execution time	Memory
1113697		thelegendary08	Drivers (BOI24_drivers)	C++17	100 / 100	131 ms	27820 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;
int par[mxn];
int sz[mxn];
int find(int x){
	while(x != par[x])x = par[x];
	return x;
}
/*
struct quer{
	int p, a, b, dex;
	operator
};
*/
void unite(int a, int b){
	//dout2(a,b);
	a = find(a);
	b = find(b);
	if(sz[a] < sz[b])swap(a,b);
	sz[a] += sz[b];
	par[b] = a;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,q);
	f0r(i,n){
		par[i] = i;
		sz[i] = 1;
	}
	vector<pair<int,pii>>edges;
	f0r(i,m){
		in3(x,y,t);
		x--;
		y--;
		edges.pb({t,{x,y}});
	}
	sort(all(edges));
	vb ans(q);
	vector<pair<int, pair<pii, int>>>quers;
	f0r(i,q){
		in3(a,b,p);
		quers.pb({p, {{a-1, b-1}, i}});
	}
	sort(all(quers));
	int ptr = 0;
	f0r(i,q){
		while(ptr < m && quers[i].first >= edges[ptr].first){
			if(find(edges[ptr].second.first) != find(edges[ptr].second.second))unite(edges[ptr].second.first, edges[ptr].second.second);
			ptr++;
		}
		//out2(find(quers[i][1]), find(quers[i][2]));
		if(find(quers[i].second.first.first) == find(quers[i].second.first.second)){
			ans[quers[i].second.second] = 1;
		}
		else ans[quers[i].second.second] = 0;
	}
	f0r(i, q){
		if(ans[i])out("TAIP");
		else out("NE");
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 23 / 23
• Subtask 5: 45 / 45