oj.uz

답안 #750657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750657 2023-05-30T05:32:01 Z GrindMachine Joker (BOI20_joker) C++17
14 / 100
 2000 ms 7824 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct DSU {
    vector<int> par, rankk, siz;
    vector<int> weight;
    bool is_bip;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        weight = vector<int>(n + 1);
        is_bip = true;
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
        weight[u] = 0;
    }

    pii find(int u) {
        if (u == par[u]) return {u,0};
        auto [p, cp] = find(par[u]);
        return {p, cp ^ weight[u]};        
    }

    bool same(int u, int v) {
        return find(u).ff == find(v).ff;
    }

    void merge(int u, int v) {
        auto [pu,cu] = find(u);
        auto [pv,cv] = find(v);

        // debug(pu);
        // debug(pv);
        // debug(cu);
        // debug(cv);

        if(pu == pv){
            if(cu == cv){
                is_bip = false;
            }

            return;
        }

        int w = cu ^ cv ^ 1;
        u = pu, v = pv;

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
        weight[v] = w;
    }
};

void solve(int test_case)
{
    int n,m,q; cin >> n >> m >> q;
    vector<pii> edges(m+5);
    rep1(i,m) cin >> edges[i].ff >> edges[i].ss;

    DSU d(n+5);

    while(q--){
        int l,r; cin >> l >> r;
        DSU dsu(n+5);

        rep1(i,m){
            if(i < l or i > r){
                auto [u,v] = edges[i];
                dsu.merge(u,v);
            }
        }

        if(!dsu.is_bip){
            yes;
        }
        else{
            no;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 34 ms 340 KB Output is correct
30 Correct 51 ms 428 KB Output is correct
31 Correct 57 ms 328 KB Output is correct
32 Correct 43 ms 388 KB Output is correct
33 Correct 39 ms 392 KB Output is correct
34 Correct 53 ms 432 KB Output is correct
35 Correct 56 ms 340 KB Output is correct
36 Correct 31 ms 340 KB Output is correct
37 Correct 54 ms 424 KB Output is correct
38 Correct 58 ms 428 KB Output is correct
39 Correct 41 ms 340 KB Output is correct
40 Correct 41 ms 340 KB Output is correct
41 Correct 39 ms 500 KB Output is correct
42 Correct 39 ms 340 KB Output is correct
43 Correct 61 ms 388 KB Output is correct
44 Correct 67 ms 384 KB Output is correct
45 Correct 71 ms 400 KB Output is correct
46 Correct 71 ms 436 KB Output is correct
47 Correct 37 ms 340 KB Output is correct
48 Correct 43 ms 512 KB Output is correct
49 Correct 46 ms 412 KB Output is correct
50 Correct 55 ms 420 KB Output is correct
51 Correct 41 ms 336 KB Output is correct
52 Correct 45 ms 328 KB Output is correct
53 Correct 50 ms 416 KB Output is correct
54 Correct 56 ms 424 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 2067 ms 7824 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Execution timed out 2067 ms 7824 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 34 ms 340 KB Output is correct
30 Correct 51 ms 428 KB Output is correct
31 Correct 57 ms 328 KB Output is correct
32 Correct 43 ms 388 KB Output is correct
33 Correct 39 ms 392 KB Output is correct
34 Correct 53 ms 432 KB Output is correct
35 Correct 56 ms 340 KB Output is correct
36 Correct 31 ms 340 KB Output is correct
37 Correct 54 ms 424 KB Output is correct
38 Correct 58 ms 428 KB Output is correct
39 Correct 41 ms 340 KB Output is correct
40 Correct 41 ms 340 KB Output is correct
41 Correct 39 ms 500 KB Output is correct
42 Correct 39 ms 340 KB Output is correct
43 Correct 61 ms 388 KB Output is correct
44 Correct 67 ms 384 KB Output is correct
45 Correct 71 ms 400 KB Output is correct
46 Correct 71 ms 436 KB Output is correct
47 Correct 37 ms 340 KB Output is correct
48 Correct 43 ms 512 KB Output is correct
49 Correct 46 ms 412 KB Output is correct
50 Correct 55 ms 420 KB Output is correct
51 Correct 41 ms 336 KB Output is correct
52 Correct 45 ms 328 KB Output is correct
53 Correct 50 ms 416 KB Output is correct
54 Correct 56 ms 424 KB Output is correct
55 Execution timed out 2039 ms 7556 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 34 ms 340 KB Output is correct
30 Correct 51 ms 428 KB Output is correct
31 Correct 57 ms 328 KB Output is correct
32 Correct 43 ms 388 KB Output is correct
33 Correct 39 ms 392 KB Output is correct
34 Correct 53 ms 432 KB Output is correct
35 Correct 56 ms 340 KB Output is correct
36 Correct 31 ms 340 KB Output is correct
37 Correct 54 ms 424 KB Output is correct
38 Correct 58 ms 428 KB Output is correct
39 Correct 41 ms 340 KB Output is correct
40 Correct 41 ms 340 KB Output is correct
41 Correct 39 ms 500 KB Output is correct
42 Correct 39 ms 340 KB Output is correct
43 Correct 61 ms 388 KB Output is correct
44 Correct 67 ms 384 KB Output is correct
45 Correct 71 ms 400 KB Output is correct
46 Correct 71 ms 436 KB Output is correct
47 Correct 37 ms 340 KB Output is correct
48 Correct 43 ms 512 KB Output is correct
49 Correct 46 ms 412 KB Output is correct
50 Correct 55 ms 420 KB Output is correct
51 Correct 41 ms 336 KB Output is correct
52 Correct 45 ms 328 KB Output is correct
53 Correct 50 ms 416 KB Output is correct
54 Correct 56 ms 424 KB Output is correct
55 Execution timed out 2067 ms 7824 KB Time limit exceeded
56 Halted 0 ms 0 KB -