// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;n>>=1;
}
return res;
}
const int iroot=power(3,mod-2);
const int base=101;
int n,m,q,lst[maxn];
pii p[maxn];
struct event{
int pu,pv;
bool cur;
};
namespace DSU{
bool check=true;
int par[maxn],d[maxn],sz[maxn];
vector<event> E;
void reset(){
check=true;E.clear();
for(int i=1;i<=n;i++) par[i]=i,d[i]=0;
}
pii findpar(int u){
if(u!=par[u]){
pii x=findpar(par[u]);
return {x.fi,x.se^d[u]};
}
return {u,0};
}
void unions(int u,int v){
auto [pu,du]=findpar(u);
auto [pv,dv]=findpar(v);
if(pu==pv){
E.push_back({pu,pv,check});
if(du==dv) check=false;
return;
}
if(sz[pu]<sz[pv]) swap(pu,pv);
E.push_back({pu,pv,check});
par[pv]=pu;sz[pu]+=sz[pv];
d[pv]^=du^dv^1;
}
void roll_back(){
event e=E.back();E.pop_back();
check=e.cur;
int pu=e.pu,pv=e.pv;
if(pu==pv) return;
d[pv]=0;par[pv]=pv;
sz[pu]-=sz[pv];
}
}
void dnc(int l,int r,int optl,int optr){
int mid=(l+r)>>1;
for(int i=l;i<mid;i++) DSU::unions(p[i].fi,p[i].se);
int opt=optr;
while(DSU::check) DSU::unions(p[opt].fi,p[opt].se),opt--;
lst[mid]=opt;
for(int i=opt+1;i<=optr;i++) DSU::roll_back();
if(mid<r) dnc(mid+1,r,opt,optr);
for(int i=l;i<mid;i++) DSU::roll_back();
for(int i=optr;i>opt;i--) DSU::unions(p[i].fi,p[i].se);
if(l<mid) dnc(l,mid-1,optl,opt);
for(int i=opt+1;i<=optr;i++) DSU::roll_back();
}
void solve(){
cin >> n >> m >> q;
DSU::reset();
for(int i=1;i<=m;i++){
cin >> p[i].fi >> p[i].se;
DSU::unions(p[i].fi,p[i].se);
}
if(DSU::check){
for(int i=1;i<=q;i++) cout << "NO\n";
return;
}
DSU::reset();
dnc(1,m,1,m);
for(int i=1;i<=q;i++){
int l,r;cin >> l >> r;
if(r<=lst[l]) cout << "YES\n";
else cout << "NO\n";
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int test=1;//cin >> test;
while(test--) solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 3 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 3 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 3 |
Execution timed out |
2058 ms |
10960 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 3 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 3 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 3 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
