Submission #1283460

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283460		d1mk	Joker (BOI20_joker)	C++20	0 / 100	2096 ms	16240 KiB

Joker

/// 407!3 +/ \!<07!\*
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvpi = vector<vpi>;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define er erase
#define ub upper_bound
#define lb lower_bound

// loops
#define FOR(i,a,b) for (ll i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (ll i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!
const char nl = '\n';

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

template<typename T>
using indexed_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fbo find_by_order

void _input() {return;}
template <typename T, typename... V>
void _input(T &t, V&... v) {cin >> (t); if (sizeof...(v))  _input(v...);}
void __input(vi &v, const int n){F0R(i, n)cin >> v[i];}
void __input(vvi &v, const int n, const int m){F0R(i, n)F0R(j, m)cin>>v[i][j];}

ll binpow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

ll n, m, q, f = 0;
vl p(MX, -1), rnk(MX, 1), c(MX, 0), kraj(MX);
vpl e(MX);
vector<array<ll, 3>> his;

pl dsufind(ll u){
    ll col = 0;
    while(p[u] != -1){
        col ^= c[u];
        u = p[u];
    }
    return {u, col};
}

void dsuunite(ll u, ll v){
    pi a = dsufind(u), b = dsufind(v);
    if(a.f == b.f && a.s == b.s){
        f++;
        his.pb({0LL, 0LL, 0LL});
    }
    his.pb({a.f, p[a.f], rnk[a.f]});
    his.pb({b.f, p[b.f], rnk[b.f]});
    if(rnk[a.f] < rnk[b.f]){
        p[a.f] = b.f;
        rnk[b.f] += rnk[a.f];
        c[a.f] = a.s ^ b.s ^ 1;
    }
    else{
        p[b.f] = a.f;
        rnk[a.f] += rnk[b.f];
        c[b.f] = a.s ^ b.s ^ 1;
    }
}

void dsurollback(){
    if(!sz(his))return;
    array<ll, 3> lst = his.back();
    his.pop_back();
    if(lst[0] == 0)f--;
    else{
        p[lst[0]] = lst[1];
        rnk[lst[0]] = lst[2];
    }
}

void rollback(int sz){
    if(sz < 0)return;
    while(sz(his) > sz)dsurollback();
}

void rec(int l1, int r1, int l2, int r2){
    if(l1 > r1)return;
    //_print(l1, r1, l2, r2);
    int md = (l1 + r1) / 2;
    int st = sz(his);
    FOR(i, l1, md)dsuunite(e[i].f, e[i].s);
    ROF(i, max(md, l2), r2 + 1){
        if(f){
            kraj[md] = i;
            break;
        }
        dsuunite(e[i].f, e[i].s);
    }
    rollback(st);
    if(!kraj[md])kraj[md] = md - 1;
    FOR(i, l1, md)dsuunite(e[i].f, e[i].s);
    rec(md + 1, r1, kraj[md], r2);
    rollback(st);
    ROF(i, kraj[md] + 1, r2 + 1)dsuunite(e[i].f, e[i].s);
    rec(l1, md - 1, l2, kraj[md]);
    rollback(st);
}

void solve(){
    cin >> n >> m >> q;
    FOR(i, 1, 1 + m) cin >> e[i].f >> e[i].s;
    rec(1, m, 1, m);
    while(q--){
        int l, r;
        cin >> l >> r;
        if(kraj[l] >= r)cout << "YES\n";
        else cout << "NO\n";
    }

}


/*


*/

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t; t = 1;while(t--){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 25
• Subtask 3: 0 / 10
• Subtask 4: 0 / 22
• Subtask 5: 0 / 29
• Subtask 6: 0 / 6