oj.uz

답안 #540467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540467 2022-03-20T12:33:28 Z elazarkoren Inside information (BOI21_servers) C++17
50 / 100
 196 ms 43404 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;

const int MAX_N = 3e5;
const int infinity = 1e9;

vii tree[MAX_N];

int depth[MAX_N];
pii dp[20][MAX_N];
int increase[MAX_N], decrease[MAX_N];
int loga[MAX_N];

void Dfs(int node, int parent, int w, int len_i, int len_d, int dist) {
    depth[node] = dist;
    dp[0][node] = {parent, w};
    increase[node] = len_i, decrease[node] = len_d;
    for (auto [neighbor, d] : tree[node]) {
        if (neighbor == parent) continue;
        Dfs(neighbor, node, d, (w > d ? len_i : 0) + 1, (w < d ? len_d : 0) + 1, dist + 1);
    }
}

bool Dfs(int node, int end, int w) {
    if (node == end) return true;
    for (auto [neighbor, d] : tree[node]) {
        if (d >= w) continue;
        if (Dfs(neighbor, end, d)) {
            return true;
        }
    }
    return false;
}

int Dfs(int node, int w) {
    int c = 1;
    for (auto [neighbor, d] : tree[node]) {
        if (d <= w) continue;
        c += Dfs(neighbor, d);
    }
    return c;
}

int n, q;

pii Jump(int a, int k) {
    int max_w = 0;
    for (int i = 0; i <= loga[n]; i++) {
        if ((k >> i) & 1) {
            chkmax(max_w, dp[i][a].y);
            a = dp[i][a].x;
        }
    }
    return {a, max_w};
}

int Solve(int v, int u) {
    if (u == v) return 0;
    int a = v, b = u;
    int max_w = 0;
    if (depth[a] > depth[b]) {
        pii p = Jump(a, depth[a] - depth[b]);
        a = p.x, max_w = p.y;
    } else {
        pii p = Jump(b, depth[b] - depth[a]);
        b = p.x, max_w = p.y;
    }
    bool bad = a != b;
    for (int i = loga[n]; i >= 0; i--) {
        if (dp[i][a].x != dp[i][b].x) {
            chkmax(max_w, dp[i][a].y);
            chkmax(max_w, dp[i][b].y);
            a = dp[i][a].x, b = dp[i][b].x;
        }
    }
    int dep_lca = depth[a] - bad;
    if (bad) {
        chkmax(max_w, dp[0][a].y);
        chkmax(max_w, dp[0][b].y);
    }
    if (dep_lca < depth[v] - decrease[v] || dep_lca < depth[u] - increase[u]) {
        return infinity;
    }
    return (!bad || dp[0][a].y > dp[0][b].y ? max_w : infinity);
}

int cnt[MAX_N];
int graph[MAX_N][2];

int Solve(vi &v, int i, int count, int d, int end) {
    int node = v[i];
    if (node == end) {
        return count + cnt[node];
    }
    if (v[i + 1] == 2 * node) {
        if (graph[node][0] == -1) {
            return Solve(v, i + 1, 0, 0, end);
        }
        if (graph[node][0] > d) count = 0;
        count += (graph[node][0] < graph[node][1]) * cnt[2 * node + 1];
        count++;
        return Solve(v, i + 1, count, graph[node][0], end);
    }
    if (graph[node][1] == -1) {
        return Solve(v, i + 1, 0, 0, end);
    }
    if (graph[node][1] > d) count = 0;
    count += (graph[node][1] < graph[node][0]) * cnt[2 * node];
    count++;
    return Solve(v, i + 1, count, graph[node][1], end);
}

char type[MAX_N];
int a[MAX_N], d[MAX_N], ans[MAX_N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        graph[i][0] = graph[i][1] = -1;
    }
    for (int i = 1; i <= n; i++) cnt[i] = 1;
    for (int i = 0; i < n + q - 1; i++) {
        cin >> type[i];
        if (type[i] == 'S') {
            int A, b;
            cin >> A >> b;
            tree[A].push_back({b, i});
            tree[b].push_back({A, i});
            int x = max(A, b);
            int y = min(A, b);
            graph[y][x & 1] = i;
            int last = i;
            cnt[y]++;
            x >>= 1;
            while (x) {
                int par = x >> 1;
                int next_w = graph[par][x & 1];
                if (next_w == -1 || next_w > last) break;
                cnt[par]++;
                x = par, last = next_w;
            }
        } else if (type[i] == 'Q') {
            cin >> a[i] >> d[i];
        } else {
            cin >> d[i];
            vi path;
            int x = d[i];
            while (x) {
                path.push_back(x);
                x >>= 1;
            }
            reverse(all(path));
            ans[i] = Solve(path, 0, 0, 0, d[i]);
        }
    }
    for (int i = 2; i <= n; i++) {
        loga[i] = loga[i >> 1] + 1;
    }
    Dfs(1, 0, 0, 0, 0, 0);
    for (int i = 1; i <= loga[n]; i++) {
        for (int j = 1; j <= n; j++) {
            dp[i][j].x = dp[i - 1][dp[i - 1][j].x].x;
            dp[i][j].y = max(dp[i - 1][j].y, dp[i - 1][dp[i - 1][j].x].y);
        }
    }
    for (int i = 0; i < n + q - 1; i++) {
        if (type[i] == 'Q') {
            ans[i] = Solve(a[i], d[i]) <= i;
        }
    }
    for (int i = 0; i < n + q - 1; i++) {
        if (type[i] == 'Q') {
            cout << (ans[i] ? "yes\n" : "no\n");
        } else if (type[i] == 'C') {
            cout << ans[i] << '\n';
        }
    }
    return 0;
}
//3 9
//C 1
//C 2
//C 3
//S 1 2
//C 1
//C 2
//C 3
//S 1 3
//C 1
//C 2
//C 3

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 9300 KB Output is correct
2 Correct 35 ms 10000 KB Output is correct
3 Correct 31 ms 10136 KB Output is correct
4 Correct 44 ms 10144 KB Output is correct
5 Correct 36 ms 10316 KB Output is correct
6 Correct 30 ms 10140 KB Output is correct

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 9300 KB Output is correct
2 Correct 35 ms 10000 KB Output is correct
3 Correct 31 ms 10136 KB Output is correct
4 Correct 44 ms 10144 KB Output is correct
5 Correct 36 ms 10316 KB Output is correct
6 Correct 30 ms 10140 KB Output is correct
7 Incorrect 25 ms 9308 KB Extra information in the output file
8 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 9292 KB Output is correct
2 Correct 117 ms 34916 KB Output is correct
3 Correct 124 ms 34900 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 9292 KB Output is correct
2 Correct 117 ms 34916 KB Output is correct
3 Correct 124 ms 34900 KB Output is correct
4 Incorrect 26 ms 9332 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9312 KB Output is correct
2 Correct 157 ms 43392 KB Output is correct
3 Correct 140 ms 43404 KB Output is correct
4 Correct 130 ms 43292 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9312 KB Output is correct
2 Correct 157 ms 43392 KB Output is correct
3 Correct 140 ms 43404 KB Output is correct
4 Correct 130 ms 43292 KB Output is correct
5 Incorrect 25 ms 9244 KB Extra information in the output file
6 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9300 KB Output is correct
2 Correct 115 ms 34888 KB Output is correct
3 Correct 122 ms 34596 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9300 KB Output is correct
2 Correct 115 ms 34888 KB Output is correct
3 Correct 122 ms 34596 KB Output is correct
4 Incorrect 26 ms 9252 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9296 KB Output is correct
2 Correct 121 ms 43344 KB Output is correct
3 Correct 148 ms 43308 KB Output is correct
4 Correct 129 ms 43308 KB Output is correct
5 Correct 23 ms 9328 KB Output is correct
6 Correct 110 ms 34868 KB Output is correct
7 Correct 119 ms 34708 KB Output is correct
8 Correct 153 ms 35660 KB Output is correct
9 Correct 127 ms 35772 KB Output is correct
10 Correct 126 ms 40276 KB Output is correct
11 Correct 196 ms 39536 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9296 KB Output is correct
2 Correct 121 ms 43344 KB Output is correct
3 Correct 148 ms 43308 KB Output is correct
4 Correct 129 ms 43308 KB Output is correct
5 Correct 23 ms 9328 KB Output is correct
6 Correct 110 ms 34868 KB Output is correct
7 Correct 119 ms 34708 KB Output is correct
8 Correct 153 ms 35660 KB Output is correct
9 Correct 127 ms 35772 KB Output is correct
10 Correct 126 ms 40276 KB Output is correct
11 Correct 196 ms 39536 KB Output is correct
12 Incorrect 25 ms 9300 KB Extra information in the output file
13 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9264 KB Output is correct
2 Correct 37 ms 10008 KB Output is correct
3 Correct 32 ms 10072 KB Output is correct
4 Correct 42 ms 10176 KB Output is correct
5 Correct 46 ms 10352 KB Output is correct
6 Correct 30 ms 10116 KB Output is correct
7 Correct 23 ms 9368 KB Output is correct
8 Correct 120 ms 35060 KB Output is correct
9 Correct 119 ms 34880 KB Output is correct
10 Correct 24 ms 9280 KB Output is correct
11 Correct 134 ms 43340 KB Output is correct
12 Correct 122 ms 43388 KB Output is correct
13 Correct 126 ms 43284 KB Output is correct
14 Correct 23 ms 9328 KB Output is correct
15 Correct 112 ms 34840 KB Output is correct
16 Correct 124 ms 34728 KB Output is correct
17 Correct 153 ms 35916 KB Output is correct
18 Correct 128 ms 35748 KB Output is correct
19 Correct 134 ms 40268 KB Output is correct
20 Correct 196 ms 39500 KB Output is correct
21 Correct 131 ms 34856 KB Output is correct
22 Correct 132 ms 34836 KB Output is correct
23 Correct 135 ms 35592 KB Output is correct
24 Correct 123 ms 35352 KB Output is correct
25 Correct 146 ms 37092 KB Output is correct
26 Correct 117 ms 33516 KB Output is correct
27 Correct 118 ms 33352 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 9264 KB Output is correct
2 Correct 37 ms 10008 KB Output is correct
3 Correct 32 ms 10072 KB Output is correct
4 Correct 42 ms 10176 KB Output is correct
5 Correct 46 ms 10352 KB Output is correct
6 Correct 30 ms 10116 KB Output is correct
7 Correct 23 ms 9368 KB Output is correct
8 Correct 120 ms 35060 KB Output is correct
9 Correct 119 ms 34880 KB Output is correct
10 Correct 24 ms 9280 KB Output is correct
11 Correct 134 ms 43340 KB Output is correct
12 Correct 122 ms 43388 KB Output is correct
13 Correct 126 ms 43284 KB Output is correct
14 Correct 23 ms 9328 KB Output is correct
15 Correct 112 ms 34840 KB Output is correct
16 Correct 124 ms 34728 KB Output is correct
17 Correct 153 ms 35916 KB Output is correct
18 Correct 128 ms 35748 KB Output is correct
19 Correct 134 ms 40268 KB Output is correct
20 Correct 196 ms 39500 KB Output is correct
21 Correct 131 ms 34856 KB Output is correct
22 Correct 132 ms 34836 KB Output is correct
23 Correct 135 ms 35592 KB Output is correct
24 Correct 123 ms 35352 KB Output is correct
25 Correct 146 ms 37092 KB Output is correct
26 Correct 117 ms 33516 KB Output is correct
27 Correct 118 ms 33352 KB Output is correct
28 Incorrect 28 ms 9316 KB Extra information in the output file
29 Halted 0 ms 0 KB -