oj.uz

Submission #877219

# Submission time Handle Problem Language Result Execution time Memory
877219 2023-11-23T03:58:30 Z bachhoangxuan Joker (BOI20_joker) C++17
0 / 100
 48 ms 12260 KB 
// 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 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 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;
const int base=101;

int n,m,q;
pii p[maxn];
int ans[maxn],ql[maxn],qr[maxn];
vector<int> query[maxn];

namespace DSU{
    bool check=true;
    int par[maxn],d[maxn];
    void reset(){
        check=true;
        for(int i=1;i<=n;i++) par[i]=i,d[i]=0;
    }
    int findpar(int u){
        if(u!=par[u]){
            int nxt=par[u];
            par[u]=findpar(par[u]);
            d[u]^=d[nxt];
            return par[u];
        }
        return u;
    }
    void unions(int u,int v){
        int pu=findpar(u),pv=findpar(v);
        if(pu==pv){
            if(d[u]==d[v]) check=false;
            return;
        }
        par[pv]=pu;
        d[pv]^=d[u]^d[v]^1;
    }
}

void solve(){
    cin >> n >> m >> q;
    for(int i=1;i<=m;i++) cin >> p[i].fi >> p[i].se;
    int Max=0;
    for(int i=1;i<=q;i++){
        cin >> ql[i] >> qr[i];
        Max=max(Max,ql[i]);
        query[ql[i]].push_back(i);
    }
    for(int i=1;i<=Max;i++){
        DSU::reset();
        for(int j=1;j<i;j++) DSU::unions(p[i].fi,p[i].se);
        int cur=m;
        if(cur>=i && DSU::check) DSU::unions(p[cur].fi,p[cur].se),cur--;
        for(int id:query[i]) if(qr[id]<=cur) ans[id]=1;
    }
    for(int i=1;i<=q;i++) cout << (ans[i]?"YES\n":"NO\n");
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 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 -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 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 -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Incorrect 48 ms 12260 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 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 -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 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 -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 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 -