답안 #931422

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931422	2024-02-21T18:45:46 Z	qwusha	Joker (BOI20_joker)	C++17	0 / 100	60 ms	9040 KB

Joker

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
typedef long double ld;
const ll inf = 1e9;
const ld eps = 1e-8;
const ll logs = 32;
#include <cmath>
bool ch = 0;
vector<vector<pair<ll, ll>>> g;
vector<bool> ok;
vector<ll> col;

void dfs(ll v, ll c = 0) {
    col[v] = c;
    for (auto [u, ind] : g[v]) {
        if (!ok[ind]) {
            continue;
        }
        if (col[u] == -1)
            dfs(u, 1 - c);
        else if (col[u] == col[v])
            ch = 1;
    }
}


struct dsu {
    vector<ll> par, dist, sz;
    void init(ll n) {
        par.resize(n);
        dist.resize(n);
        sz.resize(n);
        for (ll i = 0; i < n; i++) {
            par[i] = i;
            sz[i] = 1;
        }
    }
    ll get_par(ll v) {
        if (v == par[v])
            return v;
        ll ans = get_par(par[v]);
        par[v] = ans;
        return ans;
    }
    ll get_dist(ll v) {
        if (v == par[v])
            return 0;
        return (dist[v] + get_dist(par[v])) % 2;
    }
    void union_(ll v, ll u) {
        ll nv = get_par(v);
        ll nu = get_par(u);
        if (nv == nu) {
            if (get_dist(v) == get_dist(u))
                ch = 1;
            return;
        }
        if (sz[nu] > sz[nv])
            swap(nv, nu);
        par[nu] = nv;
        dist[nu] = 1;
    }
};


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n, m, q;
    cin >> n >> m >> q;
    if (n <= 2000 && m <= 0 && q <= 2000) {
        g.resize(n);
        ok.resize(m, 1);
        col.resize(n);
        for (ll i = 0; i < m; i++) {
            ll v, u;
            cin >> v >> u;
            g[v - 1].push_back({u - 1, i});
            g[u - 1].push_back({v - 1, i});
        }
        for (ll qw = 0; qw < q; qw++) {
            ll l, r;
            cin >> l >> r;
            for (ll i = 0; i < m; i++) {
                if (l - 1 <= i && i < r)
                    ok[i] = 0;
                else
                    ok[i] = 1;
            }
            for (ll i = 0; i < n; i++) {
                col[i] = -1;
            }
            bool check = 0;
            for (ll i = 0; i < n; i++) {
                if (col[i] == -1) {
                    ch = 0;
                    dfs(i);
                    if (ch)
                        check = 1;
                }
            }
            if (check) {
                cout << "YES" << '\n';
            } else {
                cout << "NO" << '\n';
            }
        }
    } else {
        vector<pair<ll, ll>> vert(m);
        for (ll i = 0; i < m; i++) {
            ll v, u;
            cin >> v >> u;
            vert[i] = {v - 1, u - 1};
        }
        reverse(vert.begin(), vert.end());
        ll val = -1;
        dsu dsu;
        dsu.init(n);
        for (ll i = 0; i < m; i++) {
            auto [v, u] = vert[i];
            ch = 0;
            dsu.union_(v, u);
            if (ch) {
                val = (m - i);
                break;
            }
        }
        for (ll qw = 0; qw < q; qw++) {
            ll l, r;
            cin >> l >> r;
            if (r < val)
                cout << "YES" << '\n';
            else
                cout << "NO" << '\n';
        }
    }
}

Subtask #1
0 / 6.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #2
0 / 8.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #3
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	55 ms	6812 KB	Output is correct
4	Correct	56 ms	9040 KB	Output is correct
5	Incorrect	60 ms	8460 KB	Output isn't correct
6	Halted	0 ms	0 KB	-