oj.uz

Submission #992453

# Submission time Handle Problem Language Result Execution time Memory
992453 2024-06-04T13:27:26 Z Fatonim Joker (BOI20_joker) C++17
14 / 100
 2000 ms 8480 KB 
// "We create our own demons."
#include <bits/stdc++.h>

using namespace std;

#ifdef ONPC
    #include "debug.h"
#else
    #define dbg(...)
#endif

#define int long long
#define ll long long
#define ld long double
#define pi pair<int, int>
// vector
#define sz(a) (int)((a).size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(x) (*max_element(all(x)))
#define minel(x) (*min_element(all(x)))
#define maxpos(x) (max_element(all(x)) - x.begin())
#define minpos(x) (min_element(all(x)) - x.begin())
#define srt(x) (sort(all(x)))
#define rev(x) (reverse(all(x)))
// bitwise operations
#define cnt_bit(n) __builtin_popcountll(n)
#define low_bit(n) ((n) & (-(n)))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n) | (1LL << (i)))
#define reset_bit(n, i) ((n) & ~(1LL << (i)))
#define flip_bit(n, i) ((n) ^ (1LL << (i)))
// math
#define sqr(n) ((n) * (n))
#define divup(a, b) (((a) + (b)-1) / (b))
// ostream
#define Fixed(a) cout << fixed << setprecision(12) << a;

template <class T> void chmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> void chmax(T& a, const T& b) { return b > a ? a = b, 1 : 0; }

template <class T> using min_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using max_queue = priority_queue<T, vector<T>, less<T>>;

template <class T> using V = vector<T>;
using vi = V<int>;
using vd = V<ld>;
using vb = V<bool>;
using vpi = V<pi>;
using vvi = V<vi>;
using vvb = V<vb>;

const int mod = 1e9 + 7; // 998244353 1e9 + 7
const ll inf = (int)(1e18) + 7;
const int inf_s = 1e9 + 7;
const ld eps = 1e-9;

const int B = 32;
const int N = 1000 + 3;
const int logn = 20;
const int maxn = 2e5 + 7;
/////////////////////////solve/////////////////////////

pi e[maxn];

struct DSU {
    vi p, sz, len;
    DSU(int n) {
        p.resize(n), sz.resize(n, 1);
        len.resize(n, 0);
        for (int i = 0; i < n; ++i) {
            p[i] = i;
        }
    }
    pi get(int a) {
        if (a != p[a]) {
            pi res = get(p[a]);
            p[a] = res.first;
            len[a] ^= res.second;
        }
        return {p[a], len[a]};
    }
    bool unite(int aa, int bb) {
        auto [a, x] = get(aa);
        auto [b, y] = get(bb);
        if (a == b) return x == y;
        if (sz[a] > sz[b]) swap(a, b);
        sz[b] += sz[a];
        p[a] = b;
        len[a] = x ^ y ^ 1;
        return 0;
    }
};

void solve() {
    int n, m, q;
    cin >> n >> m >> q;

    for (int i = 0; i < m; ++i) {
        int v, u;
        cin >> v >> u;
        --v; --u;

        e[i] = {v, u};
    }

    for (int qi = 0; qi < q; ++qi) {
        int l, r;
        cin >> l >> r;
        --l; --r;

        bool ok = 0;
        DSU dsu(n);
        for (int i = 0; i < l; ++i) {
            auto [v, u] = e[i];
            dbg(v, u);
            if (dsu.unite(v, u)) ok = 1;
        }
        for (int i = r + 1; i < m; ++i) {
            auto [v, u] = e[i];
            dbg(v, u);
            if (dsu.unite(v, u)) ok = 1;
        }

        cout << (ok ? "YES" : "NO") << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef ONPC
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("error.txt", "w", stderr);
#endif

    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; ++i) {
#ifdef ONPC
        cerr << "===========" << i << "===========" << '\n';
#endif
        solve();
    }

#ifdef ONPC
    cerr << endl << "Time " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 14 ms 348 KB Output is correct
30 Correct 22 ms 344 KB Output is correct
31 Correct 20 ms 544 KB Output is correct
32 Correct 16 ms 556 KB Output is correct
33 Correct 12 ms 552 KB Output is correct
34 Correct 22 ms 348 KB Output is correct
35 Correct 24 ms 348 KB Output is correct
36 Correct 16 ms 348 KB Output is correct
37 Correct 28 ms 604 KB Output is correct
38 Correct 28 ms 344 KB Output is correct
39 Correct 16 ms 348 KB Output is correct
40 Correct 18 ms 348 KB Output is correct
41 Correct 18 ms 348 KB Output is correct
42 Correct 16 ms 344 KB Output is correct
43 Correct 19 ms 544 KB Output is correct
44 Correct 20 ms 564 KB Output is correct
45 Correct 25 ms 344 KB Output is correct
46 Correct 27 ms 344 KB Output is correct
47 Correct 16 ms 348 KB Output is correct
48 Correct 18 ms 560 KB Output is correct
49 Correct 22 ms 348 KB Output is correct
50 Correct 23 ms 584 KB Output is correct
51 Correct 13 ms 348 KB Output is correct
52 Correct 16 ms 552 KB Output is correct
53 Correct 18 ms 348 KB Output is correct
54 Correct 23 ms 344 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2037 ms 8480 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Execution timed out 2037 ms 8480 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 14 ms 348 KB Output is correct
30 Correct 22 ms 344 KB Output is correct
31 Correct 20 ms 544 KB Output is correct
32 Correct 16 ms 556 KB Output is correct
33 Correct 12 ms 552 KB Output is correct
34 Correct 22 ms 348 KB Output is correct
35 Correct 24 ms 348 KB Output is correct
36 Correct 16 ms 348 KB Output is correct
37 Correct 28 ms 604 KB Output is correct
38 Correct 28 ms 344 KB Output is correct
39 Correct 16 ms 348 KB Output is correct
40 Correct 18 ms 348 KB Output is correct
41 Correct 18 ms 348 KB Output is correct
42 Correct 16 ms 344 KB Output is correct
43 Correct 19 ms 544 KB Output is correct
44 Correct 20 ms 564 KB Output is correct
45 Correct 25 ms 344 KB Output is correct
46 Correct 27 ms 344 KB Output is correct
47 Correct 16 ms 348 KB Output is correct
48 Correct 18 ms 560 KB Output is correct
49 Correct 22 ms 348 KB Output is correct
50 Correct 23 ms 584 KB Output is correct
51 Correct 13 ms 348 KB Output is correct
52 Correct 16 ms 552 KB Output is correct
53 Correct 18 ms 348 KB Output is correct
54 Correct 23 ms 344 KB Output is correct
55 Execution timed out 2021 ms 8284 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 14 ms 348 KB Output is correct
30 Correct 22 ms 344 KB Output is correct
31 Correct 20 ms 544 KB Output is correct
32 Correct 16 ms 556 KB Output is correct
33 Correct 12 ms 552 KB Output is correct
34 Correct 22 ms 348 KB Output is correct
35 Correct 24 ms 348 KB Output is correct
36 Correct 16 ms 348 KB Output is correct
37 Correct 28 ms 604 KB Output is correct
38 Correct 28 ms 344 KB Output is correct
39 Correct 16 ms 348 KB Output is correct
40 Correct 18 ms 348 KB Output is correct
41 Correct 18 ms 348 KB Output is correct
42 Correct 16 ms 344 KB Output is correct
43 Correct 19 ms 544 KB Output is correct
44 Correct 20 ms 564 KB Output is correct
45 Correct 25 ms 344 KB Output is correct
46 Correct 27 ms 344 KB Output is correct
47 Correct 16 ms 348 KB Output is correct
48 Correct 18 ms 560 KB Output is correct
49 Correct 22 ms 348 KB Output is correct
50 Correct 23 ms 584 KB Output is correct
51 Correct 13 ms 348 KB Output is correct
52 Correct 16 ms 552 KB Output is correct
53 Correct 18 ms 348 KB Output is correct
54 Correct 23 ms 344 KB Output is correct
55 Execution timed out 2037 ms 8480 KB Time limit exceeded
56 Halted 0 ms 0 KB -