oj.uz

답안 #685152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
685152 2023-01-23T15:36:20 Z stanislavpolyn Joker (BOI20_joker) C++17
39 / 100
 2000 ms 71308 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3")

#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pw(x) (1LL << (x))

using namespace std;

mt19937_64 rng(228);

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umx(T& a, T b) {
    return a < b ? a = b, 1 : 0;
}
template <typename T>
bool umn(T& a, T b) {
    return a > b ? a = b, 1 : 0;
}

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

const int N = 4e5 + 5;

int n, m, q;
ve<pii> e;
int ans[N];

int link[N];
ve<int> g[N];

int root(int x) {
    if (link[x] == x) {
        return x;
    } else {
        return link[x] = root(link[x]);
    }
}

bool uni(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) {
        return 0;
    }
    link[a] = b;
    return 1;
}

int dep[N];
int up[N][20];
int tin[N], tout[N], timer;
int vis[N];
ve<pii> ask[N];

void dfs(int v, int p) {
    vis[v] = 1;
    tin[v] = timer++;
    up[v][0] = p;
    fr (i, 1, 19) {
        up[v][i] = up[up[v][i - 1]][i - 1];
    }

    fe (to, g[v]) {
        if (to == p) continue;
        dep[to] = dep[v] + 1;
        dfs(to, v);
    }

    tout[v] = timer;
}

bool isUpper(int a, int b) {
    return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int getLCA(int a, int b) {
    if (isUpper(a, b)) return a;
    if (isUpper(b, a)) return b;

    rf (i, 19, 0) {
        if (up[a][i] && !isUpper(up[a][i], b)) {
            a = up[a][i];
        }
    }
    return up[a][0];
}

int getDist(int a, int b) {
    int c = getLCA(a, b);
    return dep[a] + dep[b] - 2 * dep[c];
}
bool found;

int l, r;

ve<pii> G[N];

void DFS(int v, int p) {
    vis[v] = 1;
    fe (to, G[v]) {
        if (to.fi == p) continue;

        if (to.se >= l && to.se <= r) continue;

        if (!vis[to.fi]) {
            dep[to.fi] = dep[v] + 1;
            DFS(to.fi, v);
        } else {
            if (vis[to.fi] == 2) {
                found |= (dep[v] - dep[to.fi]) % 2 == 0;
            }
        }
    }
    vis[v] = 2;
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif
//
//    cout << 2e5 * 2000 / 1e8 << "\n";
//
//    return 0;

    cin >> n >> m >> q;

    fr (i, 1, m) {
        int a, b;
        cin >> a >> b;
        e.pb({a, b});

        G[a].pb({b, i - 1});
        G[b].pb({a, i - 1});
    }


    fr (i, 0, m - 1) {
        e.pb(e[i]);
    }


    if (q <= 2000) {
        fr (i, 1, q) {
            cin >> l >> r;

            l--;
            r--;
            // r+1..m-1+l

            found = 0;
            fill(vis + 1, vis + 1 + n, 0);
            fr (v, 1, n) {
                if (!vis[v]) {
                    dep[v] = 0;
                    DFS(v, 0);
                }
            }

            ask[m - 1 + l].pb({r + 1, i});

            if (found) {
                cout << "YES\n";
            } else {
                cout << "NO\n";
            }
        }

        return 0;
    }

    fr (i, 1, q) {
        cin >> l >> r;

        l--;
        r--;
        // r+1..m-1+l

//        found = 0;
//        fill(vis + 1, vis + 1 + n, 0);
//        fr (v, 1, n) {
//            if (!vis[v]) {
//                dep[v] = 0;
//                DFS(v, 0);
//            }
//        }

        if (l == 0 && r == m - 1) {
            ans[i] = 0;
        } else {
            ask[m - 1 + l].pb({r + 1, i});
        }
//        if (found) {
//            cout << "YES\n";
//        } else {
//            cout << "NO\n";
//        }
    }

//    return 0;

    fr (i, 0, sz(e) - 1) {
        if (sz(ask[i])) {
            sort(all(ask[i]));
            reverse(all(ask[i]));

            iota(link, link + n + 1, 0);
            fr (j, 1, n) g[j].clear();

            rf (j, i, 0) {
                if (uni(e[j].fi, e[j].se)) {
                    g[e[j].fi].pb(e[j].se);
                    g[e[j].se].pb(e[j].fi);
                }
            }
            fr (v, 1, n) {
                fr (p, 0, 19) {
                    up[v][p] = 0;
                }
            }

            fill(vis + 1, vis + 1 + n, 0);
            fr (v, 1, n) {
                if (!vis[v]) {
                    timer = 0;
                    dep[v] = 0;
                    dfs(v, 0);
                }
            }

            iota(link, link + n + 1, 0);

            bool ok = 0;
            int ptr = 0;
            rf (j, i, 0) {
                if (uni(e[j].fi, e[j].se)) {

                } else {
                    int d = getDist(e[j].fi, e[j].se);
                    if (d % 2 == 0) {
                        ok = 1;
                    }
                }

                while (ptr < sz(ask[i]) && ask[i][ptr].fi == j) {
                    ans[ask[i][ptr].se] = ok;
                    ptr++;
                }
            }
        }
    }

    fr (i, 1, q) {
        if (ans[i]) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28520 KB Output is correct
2 Correct 14 ms 28504 KB Output is correct
3 Correct 14 ms 28456 KB Output is correct
4 Correct 15 ms 28516 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 15 ms 28488 KB Output is correct
7 Correct 16 ms 28512 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 16 ms 28508 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 18 ms 28520 KB Output is correct
12 Correct 17 ms 28512 KB Output is correct
13 Correct 17 ms 28500 KB Output is correct
14 Correct 17 ms 28432 KB Output is correct
15 Correct 16 ms 28512 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 15 ms 28500 KB Output is correct
18 Correct 15 ms 28516 KB Output is correct
19 Correct 15 ms 28500 KB Output is correct
20 Correct 16 ms 28480 KB Output is correct
21 Correct 16 ms 28516 KB Output is correct
22 Correct 14 ms 28520 KB Output is correct
23 Correct 16 ms 28516 KB Output is correct
24 Correct 16 ms 28520 KB Output is correct
25 Correct 16 ms 28440 KB Output is correct
26 Correct 16 ms 28516 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 15 ms 28512 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28520 KB Output is correct
2 Correct 14 ms 28504 KB Output is correct
3 Correct 14 ms 28456 KB Output is correct
4 Correct 15 ms 28516 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 15 ms 28488 KB Output is correct
7 Correct 16 ms 28512 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 16 ms 28508 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 18 ms 28520 KB Output is correct
12 Correct 17 ms 28512 KB Output is correct
13 Correct 17 ms 28500 KB Output is correct
14 Correct 17 ms 28432 KB Output is correct
15 Correct 16 ms 28512 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 15 ms 28500 KB Output is correct
18 Correct 15 ms 28516 KB Output is correct
19 Correct 15 ms 28500 KB Output is correct
20 Correct 16 ms 28480 KB Output is correct
21 Correct 16 ms 28516 KB Output is correct
22 Correct 14 ms 28520 KB Output is correct
23 Correct 16 ms 28516 KB Output is correct
24 Correct 16 ms 28520 KB Output is correct
25 Correct 16 ms 28440 KB Output is correct
26 Correct 16 ms 28516 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 15 ms 28512 KB Output is correct
29 Correct 80 ms 28764 KB Output is correct
30 Correct 128 ms 28688 KB Output is correct
31 Correct 127 ms 28696 KB Output is correct
32 Correct 98 ms 28700 KB Output is correct
33 Correct 78 ms 28680 KB Output is correct
34 Correct 130 ms 28612 KB Output is correct
35 Correct 135 ms 28628 KB Output is correct
36 Correct 49 ms 28780 KB Output is correct
37 Correct 87 ms 28708 KB Output is correct
38 Correct 95 ms 28692 KB Output is correct
39 Correct 98 ms 28696 KB Output is correct
40 Correct 90 ms 28628 KB Output is correct
41 Correct 86 ms 28712 KB Output is correct
42 Correct 88 ms 28700 KB Output is correct
43 Correct 86 ms 28700 KB Output is correct
44 Correct 120 ms 28696 KB Output is correct
45 Correct 133 ms 28696 KB Output is correct
46 Correct 131 ms 28720 KB Output is correct
47 Correct 83 ms 28648 KB Output is correct
48 Correct 92 ms 28700 KB Output is correct
49 Correct 108 ms 28696 KB Output is correct
50 Correct 123 ms 28620 KB Output is correct
51 Correct 81 ms 28692 KB Output is correct
52 Correct 106 ms 28700 KB Output is correct
53 Correct 116 ms 28700 KB Output is correct
54 Correct 134 ms 28684 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28520 KB Output is correct
2 Correct 14 ms 28504 KB Output is correct
3 Correct 162 ms 56184 KB Output is correct
4 Correct 272 ms 71308 KB Output is correct
5 Correct 257 ms 65200 KB Output is correct
6 Correct 196 ms 54872 KB Output is correct
7 Correct 199 ms 53796 KB Output is correct
8 Correct 163 ms 48972 KB Output is correct
9 Correct 234 ms 53680 KB Output is correct
10 Correct 282 ms 67000 KB Output is correct
11 Correct 199 ms 53836 KB Output is correct
12 Correct 248 ms 64612 KB Output is correct
13 Correct 145 ms 44404 KB Output is correct
14 Correct 175 ms 48732 KB Output is correct
15 Correct 253 ms 59116 KB Output is correct
16 Correct 317 ms 66876 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28520 KB Output is correct
2 Correct 14 ms 28504 KB Output is correct
3 Correct 14 ms 28456 KB Output is correct
4 Correct 15 ms 28516 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 15 ms 28488 KB Output is correct
7 Correct 16 ms 28512 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 16 ms 28508 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 18 ms 28520 KB Output is correct
12 Correct 17 ms 28512 KB Output is correct
13 Correct 17 ms 28500 KB Output is correct
14 Correct 17 ms 28432 KB Output is correct
15 Correct 16 ms 28512 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 15 ms 28500 KB Output is correct
18 Correct 15 ms 28516 KB Output is correct
19 Correct 15 ms 28500 KB Output is correct
20 Correct 16 ms 28480 KB Output is correct
21 Correct 16 ms 28516 KB Output is correct
22 Correct 14 ms 28520 KB Output is correct
23 Correct 16 ms 28516 KB Output is correct
24 Correct 16 ms 28520 KB Output is correct
25 Correct 16 ms 28440 KB Output is correct
26 Correct 16 ms 28516 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 15 ms 28512 KB Output is correct
29 Correct 162 ms 56184 KB Output is correct
30 Correct 272 ms 71308 KB Output is correct
31 Correct 257 ms 65200 KB Output is correct
32 Correct 196 ms 54872 KB Output is correct
33 Correct 199 ms 53796 KB Output is correct
34 Correct 163 ms 48972 KB Output is correct
35 Correct 234 ms 53680 KB Output is correct
36 Correct 282 ms 67000 KB Output is correct
37 Correct 199 ms 53836 KB Output is correct
38 Correct 248 ms 64612 KB Output is correct
39 Correct 145 ms 44404 KB Output is correct
40 Correct 175 ms 48732 KB Output is correct
41 Correct 253 ms 59116 KB Output is correct
42 Correct 317 ms 66876 KB Output is correct
43 Execution timed out 2058 ms 58204 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28520 KB Output is correct
2 Correct 14 ms 28504 KB Output is correct
3 Correct 14 ms 28456 KB Output is correct
4 Correct 15 ms 28516 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 15 ms 28488 KB Output is correct
7 Correct 16 ms 28512 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 16 ms 28508 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 18 ms 28520 KB Output is correct
12 Correct 17 ms 28512 KB Output is correct
13 Correct 17 ms 28500 KB Output is correct
14 Correct 17 ms 28432 KB Output is correct
15 Correct 16 ms 28512 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 15 ms 28500 KB Output is correct
18 Correct 15 ms 28516 KB Output is correct
19 Correct 15 ms 28500 KB Output is correct
20 Correct 16 ms 28480 KB Output is correct
21 Correct 16 ms 28516 KB Output is correct
22 Correct 14 ms 28520 KB Output is correct
23 Correct 16 ms 28516 KB Output is correct
24 Correct 16 ms 28520 KB Output is correct
25 Correct 16 ms 28440 KB Output is correct
26 Correct 16 ms 28516 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 15 ms 28512 KB Output is correct
29 Correct 80 ms 28764 KB Output is correct
30 Correct 128 ms 28688 KB Output is correct
31 Correct 127 ms 28696 KB Output is correct
32 Correct 98 ms 28700 KB Output is correct
33 Correct 78 ms 28680 KB Output is correct
34 Correct 130 ms 28612 KB Output is correct
35 Correct 135 ms 28628 KB Output is correct
36 Correct 49 ms 28780 KB Output is correct
37 Correct 87 ms 28708 KB Output is correct
38 Correct 95 ms 28692 KB Output is correct
39 Correct 98 ms 28696 KB Output is correct
40 Correct 90 ms 28628 KB Output is correct
41 Correct 86 ms 28712 KB Output is correct
42 Correct 88 ms 28700 KB Output is correct
43 Correct 86 ms 28700 KB Output is correct
44 Correct 120 ms 28696 KB Output is correct
45 Correct 133 ms 28696 KB Output is correct
46 Correct 131 ms 28720 KB Output is correct
47 Correct 83 ms 28648 KB Output is correct
48 Correct 92 ms 28700 KB Output is correct
49 Correct 108 ms 28696 KB Output is correct
50 Correct 123 ms 28620 KB Output is correct
51 Correct 81 ms 28692 KB Output is correct
52 Correct 106 ms 28700 KB Output is correct
53 Correct 116 ms 28700 KB Output is correct
54 Correct 134 ms 28684 KB Output is correct
55 Execution timed out 2065 ms 43116 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28520 KB Output is correct
2 Correct 14 ms 28504 KB Output is correct
3 Correct 14 ms 28456 KB Output is correct
4 Correct 15 ms 28516 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 15 ms 28488 KB Output is correct
7 Correct 16 ms 28512 KB Output is correct
8 Correct 16 ms 28500 KB Output is correct
9 Correct 16 ms 28508 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 18 ms 28520 KB Output is correct
12 Correct 17 ms 28512 KB Output is correct
13 Correct 17 ms 28500 KB Output is correct
14 Correct 17 ms 28432 KB Output is correct
15 Correct 16 ms 28512 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 15 ms 28500 KB Output is correct
18 Correct 15 ms 28516 KB Output is correct
19 Correct 15 ms 28500 KB Output is correct
20 Correct 16 ms 28480 KB Output is correct
21 Correct 16 ms 28516 KB Output is correct
22 Correct 14 ms 28520 KB Output is correct
23 Correct 16 ms 28516 KB Output is correct
24 Correct 16 ms 28520 KB Output is correct
25 Correct 16 ms 28440 KB Output is correct
26 Correct 16 ms 28516 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 15 ms 28512 KB Output is correct
29 Correct 80 ms 28764 KB Output is correct
30 Correct 128 ms 28688 KB Output is correct
31 Correct 127 ms 28696 KB Output is correct
32 Correct 98 ms 28700 KB Output is correct
33 Correct 78 ms 28680 KB Output is correct
34 Correct 130 ms 28612 KB Output is correct
35 Correct 135 ms 28628 KB Output is correct
36 Correct 49 ms 28780 KB Output is correct
37 Correct 87 ms 28708 KB Output is correct
38 Correct 95 ms 28692 KB Output is correct
39 Correct 98 ms 28696 KB Output is correct
40 Correct 90 ms 28628 KB Output is correct
41 Correct 86 ms 28712 KB Output is correct
42 Correct 88 ms 28700 KB Output is correct
43 Correct 86 ms 28700 KB Output is correct
44 Correct 120 ms 28696 KB Output is correct
45 Correct 133 ms 28696 KB Output is correct
46 Correct 131 ms 28720 KB Output is correct
47 Correct 83 ms 28648 KB Output is correct
48 Correct 92 ms 28700 KB Output is correct
49 Correct 108 ms 28696 KB Output is correct
50 Correct 123 ms 28620 KB Output is correct
51 Correct 81 ms 28692 KB Output is correct
52 Correct 106 ms 28700 KB Output is correct
53 Correct 116 ms 28700 KB Output is correct
54 Correct 134 ms 28684 KB Output is correct
55 Correct 162 ms 56184 KB Output is correct
56 Correct 272 ms 71308 KB Output is correct
57 Correct 257 ms 65200 KB Output is correct
58 Correct 196 ms 54872 KB Output is correct
59 Correct 199 ms 53796 KB Output is correct
60 Correct 163 ms 48972 KB Output is correct
61 Correct 234 ms 53680 KB Output is correct
62 Correct 282 ms 67000 KB Output is correct
63 Correct 199 ms 53836 KB Output is correct
64 Correct 248 ms 64612 KB Output is correct
65 Correct 145 ms 44404 KB Output is correct
66 Correct 175 ms 48732 KB Output is correct
67 Correct 253 ms 59116 KB Output is correct
68 Correct 317 ms 66876 KB Output is correct
69 Execution timed out 2058 ms 58204 KB Time limit exceeded
70 Halted 0 ms 0 KB -