oj.uz

답안 #619809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619809 2022-08-02T16:08:07 Z yuto1115 Inside information (BOI21_servers) C++17
55 / 100
 235 ms 37680 KB 
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); ++i)
#define rrep(i, n) for(ll i = ll(n) - 1; i >= 0; --i)
#define rrep2(i, n, t) for(ll i = ll(n) - 1; i >= ll(t); --i)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define SZ(a) int(a.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, q;
    cin >> n >> q;
    vvp G(n);
    vp es;
    vector qs(n, vector<tuple<int, int, int>>());
    bool uni = true;
    bool line = true;
    rep(_, n + q - 1) {
        char c;
        cin >> c;
        if (c == 'S') {
            int a, b;
            cin >> a >> b;
            --a, --b;
            G[a].eb(b, SZ(es));
            G[b].eb(a, SZ(es));
            es.eb(a, b);
            uni &= (!a or !b);
            line &= abs(a - b) == 1;
        } else if (c == 'Q') {
            int a, d;
            cin >> a >> d;
            --a, --d;
            qs[SZ(es)].eb(0, d, a);
        } else {
            int d;
            cin >> d;
            --d;
            qs[SZ(es)].eb(1, d, 0);
        }
    }
    vi dep(n);
    vvi par(20, vi(n));
    vi pid(n), inc(n), dec(n);
    auto dfs = [&](auto &dfs, int u, int p, int d, int _pid) -> void {
        dep[u] = d;
        par[0][u] = p;
        pid[u] = _pid;
        for (auto[v, id]: G[u]) {
            if (v == p) continue;
            inc[v] = (u and _pid > id ? inc[u] : 0) + 1;
            dec[v] = (u and _pid < id ? dec[u] : 0) + 1;
            dfs(dfs, v, u, d + 1, id);
        }
    };
    dfs(dfs, 0, -1, 0, -1);
    rep(k, 19) {
        rep(i, n) {
            if (par[k][i] == -1) par[k + 1][i] = -1;
            else par[k + 1][i] = par[k][par[k][i]];
        }
    }
    auto la = [&](int u, int d) {
        if (!d) return u;
        rep(k, 20) {
            if (d >> k & 1) {
                u = par[k][u];
                assert(u != -1);
            }
        }
        return u;
    };
    auto lca = [&](int u, int v) {
        if (dep[u] > dep[v]) swap(u, v);
        v = la(v, dep[v] - dep[u]);
        if (u == v) return u;
        rrep(k, 20) {
            if (par[k][u] != par[k][v]) {
                u = par[k][u];
                v = par[k][v];
            }
        }
        return par[0][u];
    };
    vs ans(q);
    int it = 0;
    rep(i, n) {
        for (auto[t, d, a]: qs[i]) {
            if (t == 0) {
                int l = lca(d, a);
                int hd = dep[d] - dep[l];
                int ha = dep[a] - dep[l];
                int when;
                if (d == a) {
                    when = -1;
                } else if (l == d) {
                    when = (dec[a] >= ha ? pid[a] : inf);
                } else if (l == a) {
                    when = (inc[d] >= hd ? pid[la(d, hd - 1)] : inf);
                } else {
                    // d -> (edge : x) -> l -> (edge : y) -> a
                    int x = pid[la(d, hd - 1)];
                    int y = pid[la(a, ha - 1)];
                    when = (inc[d] >= hd and dec[a] >= ha and x < y ? pid[a] : inf);
                }
                ans[it] = (when < i ? "yes" : "no");
            } else {
                int val = 0;
                if (uni) {
                    if (!d) {
                        val = i + 1;
                    } else {
                        val = max<int>(1, i - pid[d] + 1);
                    }
                } else if (line) {
                    val = 1;
                    val += d + 1 - (upper_bound(pid.begin() + d - inc[d] + 1, pid.begin() + d + 1, i,
                                                [&](int key, int now) { return pid[now] < key; }) - pid.begin());
                    int _d = d;
                    val += (lower_bound(pid.begin() + d + 1, pid.end(), i,
                                        [&](int now, int key) {
                                            return pid[now] < key and dec[now] >= now - _d;
                                        }) - pid.begin()) - d - 1;
                }
                ans[it] = to_string(val);
            }
            ++it;
        }
    }
    if (n <= 4000) {
        vector<bitset<4000>> bt(n);
        rep(i, n) bt[i].set(i);
        vi cnt(n, 1);
        it = 0;
        rep(i, n) {
            for (auto[t, d, a]: qs[i]) {
                if (t == 1) {
                    ans[it] = to_string(cnt[d]);
                }
                ++it;
            }
            if (i < n - 1) {
                auto[u, v] = es[i];
                rep(j, n) if (bt[u][j] or bt[v][j]) ++cnt[j];
                bt[u] |= bt[v];
                bt[v] = bt[u];
            }
        }
    }
    rep(i, q) cout << ans[i] << '\n';
}

//4 4
//S 1 2
//S 1 3
//S 3 4
//Q 2 1
//Q 2 2
//Q 2 3
//Q 2 4

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 6716 KB Output is correct
2 Correct 74 ms 9508 KB Output is correct
3 Correct 74 ms 9768 KB Output is correct
4 Correct 83 ms 9544 KB Output is correct
5 Correct 61 ms 9064 KB Output is correct
6 Correct 84 ms 9320 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 6716 KB Output is correct
2 Correct 74 ms 9508 KB Output is correct
3 Correct 74 ms 9768 KB Output is correct
4 Correct 83 ms 9544 KB Output is correct
5 Correct 61 ms 9064 KB Output is correct
6 Correct 84 ms 9320 KB Output is correct
7 Correct 40 ms 6716 KB Output is correct
8 Correct 66 ms 9976 KB Output is correct
9 Correct 68 ms 10188 KB Output is correct
10 Correct 66 ms 10032 KB Output is correct
11 Correct 59 ms 9556 KB Output is correct
12 Correct 81 ms 9668 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 6820 KB Output is correct
2 Correct 157 ms 32068 KB Output is correct
3 Correct 145 ms 32024 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 6820 KB Output is correct
2 Correct 157 ms 32068 KB Output is correct
3 Correct 145 ms 32024 KB Output is correct
4 Correct 28 ms 6768 KB Output is correct
5 Correct 124 ms 33492 KB Output is correct
6 Correct 86 ms 32768 KB Output is correct
7 Correct 80 ms 32820 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 6660 KB Output is correct
2 Correct 133 ms 35164 KB Output is correct
3 Correct 133 ms 35312 KB Output is correct
4 Correct 137 ms 35160 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 6660 KB Output is correct
2 Correct 133 ms 35164 KB Output is correct
3 Correct 133 ms 35312 KB Output is correct
4 Correct 137 ms 35160 KB Output is correct
5 Correct 32 ms 6756 KB Output is correct
6 Incorrect 134 ms 37568 KB Extra information in the output file
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 6664 KB Output is correct
2 Correct 136 ms 30240 KB Output is correct
3 Correct 125 ms 29504 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 6664 KB Output is correct
2 Correct 136 ms 30240 KB Output is correct
3 Correct 125 ms 29504 KB Output is correct
4 Correct 35 ms 6720 KB Output is correct
5 Incorrect 106 ms 32400 KB Extra information in the output file
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 6756 KB Output is correct
2 Correct 142 ms 35132 KB Output is correct
3 Correct 133 ms 35176 KB Output is correct
4 Correct 124 ms 35120 KB Output is correct
5 Correct 36 ms 6716 KB Output is correct
6 Correct 122 ms 30196 KB Output is correct
7 Correct 144 ms 29564 KB Output is correct
8 Correct 201 ms 30148 KB Output is correct
9 Correct 153 ms 32200 KB Output is correct
10 Correct 139 ms 33212 KB Output is correct
11 Correct 211 ms 32488 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 6756 KB Output is correct
2 Correct 142 ms 35132 KB Output is correct
3 Correct 133 ms 35176 KB Output is correct
4 Correct 124 ms 35120 KB Output is correct
5 Correct 36 ms 6716 KB Output is correct
6 Correct 122 ms 30196 KB Output is correct
7 Correct 144 ms 29564 KB Output is correct
8 Correct 201 ms 30148 KB Output is correct
9 Correct 153 ms 32200 KB Output is correct
10 Correct 139 ms 33212 KB Output is correct
11 Correct 211 ms 32488 KB Output is correct
12 Correct 34 ms 6776 KB Output is correct
13 Incorrect 160 ms 37680 KB Extra information in the output file
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 6788 KB Output is correct
2 Correct 71 ms 9488 KB Output is correct
3 Correct 67 ms 9644 KB Output is correct
4 Correct 78 ms 9556 KB Output is correct
5 Correct 58 ms 9104 KB Output is correct
6 Correct 89 ms 9272 KB Output is correct
7 Correct 34 ms 6888 KB Output is correct
8 Correct 126 ms 31420 KB Output is correct
9 Correct 123 ms 31412 KB Output is correct
10 Correct 38 ms 6700 KB Output is correct
11 Correct 142 ms 35116 KB Output is correct
12 Correct 124 ms 35140 KB Output is correct
13 Correct 110 ms 35096 KB Output is correct
14 Correct 51 ms 6744 KB Output is correct
15 Correct 140 ms 30244 KB Output is correct
16 Correct 131 ms 29632 KB Output is correct
17 Correct 235 ms 30044 KB Output is correct
18 Correct 199 ms 32296 KB Output is correct
19 Correct 152 ms 33084 KB Output is correct
20 Correct 191 ms 32496 KB Output is correct
21 Correct 174 ms 31412 KB Output is correct
22 Correct 168 ms 31428 KB Output is correct
23 Correct 158 ms 31864 KB Output is correct
24 Correct 179 ms 31848 KB Output is correct
25 Correct 148 ms 32272 KB Output is correct
26 Correct 139 ms 29892 KB Output is correct
27 Correct 147 ms 29272 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 6788 KB Output is correct
2 Correct 71 ms 9488 KB Output is correct
3 Correct 67 ms 9644 KB Output is correct
4 Correct 78 ms 9556 KB Output is correct
5 Correct 58 ms 9104 KB Output is correct
6 Correct 89 ms 9272 KB Output is correct
7 Correct 34 ms 6888 KB Output is correct
8 Correct 126 ms 31420 KB Output is correct
9 Correct 123 ms 31412 KB Output is correct
10 Correct 38 ms 6700 KB Output is correct
11 Correct 142 ms 35116 KB Output is correct
12 Correct 124 ms 35140 KB Output is correct
13 Correct 110 ms 35096 KB Output is correct
14 Correct 51 ms 6744 KB Output is correct
15 Correct 140 ms 30244 KB Output is correct
16 Correct 131 ms 29632 KB Output is correct
17 Correct 235 ms 30044 KB Output is correct
18 Correct 199 ms 32296 KB Output is correct
19 Correct 152 ms 33084 KB Output is correct
20 Correct 191 ms 32496 KB Output is correct
21 Correct 174 ms 31412 KB Output is correct
22 Correct 168 ms 31428 KB Output is correct
23 Correct 158 ms 31864 KB Output is correct
24 Correct 179 ms 31848 KB Output is correct
25 Correct 148 ms 32272 KB Output is correct
26 Correct 139 ms 29892 KB Output is correct
27 Correct 147 ms 29272 KB Output is correct
28 Correct 41 ms 6688 KB Output is correct
29 Correct 74 ms 9980 KB Output is correct
30 Correct 74 ms 10204 KB Output is correct
31 Correct 90 ms 10048 KB Output is correct
32 Correct 100 ms 9544 KB Output is correct
33 Correct 104 ms 9680 KB Output is correct
34 Correct 38 ms 6924 KB Output is correct
35 Correct 127 ms 33456 KB Output is correct
36 Correct 83 ms 32672 KB Output is correct
37 Correct 81 ms 32796 KB Output is correct
38 Correct 41 ms 6948 KB Output is correct
39 Incorrect 144 ms 37504 KB Extra information in the output file
40 Halted 0 ms 0 KB -