제출 #877225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
877225		CDuong	Joker (BOI20_joker)	C++17	14 / 100	2033 ms	3016 KiB

Joker

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname "NOHOME"
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

struct DisjointSetUnion01 {
    vector<int> lab, val;

    DisjointSetUnion01(int n) : lab(n + 1, -1), val(n + 1, 0) {}

    pair<int, int> root(int v) {
        if (lab[v] < 0) return {v, val[v]};
        auto cpar = root(lab[v]);
        lab[v] = cpar.ff, val[v] ^= cpar.ss;
        return {lab[v], val[v]};
    }

    bool merge(int u, int v, int edge_val) {
        auto rootu = root(u);
        auto rootv = root(v);
        if (rootu.ff != rootv.ff) {
            if (-lab[rootu.ff] < -lab[rootv.ff])
                swap(u, v), swap(rootu, rootv);
            lab[rootu.ff] += lab[rootv.ff];
            lab[rootv.ff] = rootu.ff;
            val[rootv.ff] = rootu.ss ^ rootv.ss ^ edge_val;
            return true;
        }
        return (rootu.ss ^ rootv.ss ^ edge_val ^ 1);
    }
};

int n, m, q;
vector<pair<int, int>> edges;

void solve() {
    cin >> n >> m >> q;
    for (int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        edges.emplace_back(u, v);
    }
    for (int i = 1; i <= q; ++i) {
        int l, r; cin >> l >> r;
        bool flag = true;
        DisjointSetUnion01 dsu(n + 1);
        for (int i = 0; i < l - 1; ++i) flag &= dsu.merge(edges[i].ff, edges[i].ss, 1);
        for (int i = r; i < m; ++i) flag &= dsu.merge(edges[i].ff, edges[i].ss, 1);
        cout << (flag ? "NO" : "YES") << "\n";
    }
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

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