/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"yes":"no")<<endl;
}
struct DSU{
vector<int>P,sz,t;
void init(int n){
P.resize(n+5);
sz.assign(n+5,1);
t.resize(n+5);
for(int i=0;i<n+5;i++)P[i]=i;
}
int find(int node,int time){
if(P[node]==node || t[node]>time)return node;
return P[node]=find(P[node],time);
}
bool unite(int a,int b,int time){
int p1=find(a,time);
int p2=find(b,time);
if(p1==p2){
return 0;
}
if(sz[p1]>sz[p2]){
swap(p1,p2);
}
P[p1]=p2;
sz[p2]+=sz[p1];
t[p1]=time;
return 1;
}
}d;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#ifndef ONLINE_JUDGE
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
fast
int n,q;cin>>n>>q;
d.init(n+5);q+=n;
q--;
int cnt=1;
vector<int>u(n+5),v(n+5);
vector<pair<int,int>>p;
vector<int>o;
while(q--){
char c;cin>>c;
if(c=='S'){
int a,b;cin>>a>>b;
u[cnt]=a;v[cnt]=b;
d.unite(a,b,cnt++);
}
else if(c=='Q'){
int a,b;cin>>a>>b;
p.push_back({a,b});
o.push_back(cnt-1);
}
}
int j=0;
for(auto i:p){
int a=i.first,b=i.second;
if(a==b){
cout<<"yes"<<endl;
continue;
}
int l=1,r=o[j];
int e=-1;
while(l<=r){
int mid=l+r>>1;
if(d.find(a,mid)==d.find(b,mid)){
e=mid;
r=mid-1;
}
else{
l=mid+1;
}
}
cout<<((a==u[e] || a==v[e])?"yes":"no")<<endl;
j++;
}
return 0;
}
Compilation message
servers.cpp: In function 'int main()':
servers.cpp:104:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
104 | int mid=l+r>>1;
| ~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
24 ms |
2756 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
24 ms |
2756 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
2692 KB |
Output is correct |
| 2 |
Incorrect |
72 ms |
5148 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
2692 KB |
Output is correct |
| 2 |
Incorrect |
72 ms |
5148 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
31 ms |
2644 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
31 ms |
2644 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
30 ms |
2668 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
30 ms |
2668 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
27 ms |
2528 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
27 ms |
2528 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
2512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
2512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
