oj.uz

Submission #540459

# Submission time Handle Problem Language Result Execution time Memory
540459 2022-03-20T11:51:01 Z elazarkoren Inside information (BOI21_servers) C++17
50 / 100
 204 ms 44240 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);
}

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> q;
    int c = 0;
    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});
            times[max(A, b)] = c;
            c++;
        } else if (type[i] == 'Q') {
            cin >> a[i] >> d[i];
        } else {
            int x;
            cin >> x;
            ans[i] = c - times[x] + 1;
//            ans[i] = Dfs(x, -1);
        }
    }
    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;
}

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 27 ms 10196 KB Output is correct
2 Correct 39 ms 10960 KB Output is correct
3 Correct 44 ms 11104 KB Output is correct
4 Correct 45 ms 11080 KB Output is correct
5 Correct 52 ms 11320 KB Output is correct
6 Correct 33 ms 11076 KB Output is correct

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 27 ms 10196 KB Output is correct
2 Correct 39 ms 10960 KB Output is correct
3 Correct 44 ms 11104 KB Output is correct
4 Correct 45 ms 11080 KB Output is correct
5 Correct 52 ms 11320 KB Output is correct
6 Correct 33 ms 11076 KB Output is correct
7 Incorrect 27 ms 10160 KB Extra information in the output file
8 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 25 ms 10196 KB Output is correct
2 Correct 146 ms 36152 KB Output is correct
3 Correct 146 ms 35484 KB Output is correct

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 25 ms 10196 KB Output is correct
2 Correct 146 ms 36152 KB Output is correct
3 Correct 146 ms 35484 KB Output is correct
4 Incorrect 30 ms 10188 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10196 KB Output is correct
2 Correct 148 ms 43400 KB Output is correct
3 Correct 187 ms 43468 KB Output is correct
4 Correct 135 ms 43820 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10196 KB Output is correct
2 Correct 148 ms 43400 KB Output is correct
3 Correct 187 ms 43468 KB Output is correct
4 Correct 135 ms 43820 KB Output is correct
5 Incorrect 34 ms 10188 KB Extra information in the output file
6 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10228 KB Output is correct
2 Correct 132 ms 35616 KB Output is correct
3 Correct 139 ms 35424 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10228 KB Output is correct
2 Correct 132 ms 35616 KB Output is correct
3 Correct 139 ms 35424 KB Output is correct
4 Incorrect 28 ms 10184 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 27 ms 10196 KB Output is correct
2 Correct 140 ms 43356 KB Output is correct
3 Correct 143 ms 43428 KB Output is correct
4 Correct 146 ms 44108 KB Output is correct
5 Correct 31 ms 10060 KB Output is correct
6 Correct 128 ms 35788 KB Output is correct
7 Correct 136 ms 35700 KB Output is correct
8 Correct 169 ms 36188 KB Output is correct
9 Correct 136 ms 36664 KB Output is correct
10 Correct 159 ms 41316 KB Output is correct
11 Correct 204 ms 40644 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 27 ms 10196 KB Output is correct
2 Correct 140 ms 43356 KB Output is correct
3 Correct 143 ms 43428 KB Output is correct
4 Correct 146 ms 44108 KB Output is correct
5 Correct 31 ms 10060 KB Output is correct
6 Correct 128 ms 35788 KB Output is correct
7 Correct 136 ms 35700 KB Output is correct
8 Correct 169 ms 36188 KB Output is correct
9 Correct 136 ms 36664 KB Output is correct
10 Correct 159 ms 41316 KB Output is correct
11 Correct 204 ms 40644 KB Output is correct
12 Incorrect 28 ms 10212 KB Extra information in the output file
13 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 10132 KB Output is correct
2 Correct 41 ms 11012 KB Output is correct
3 Correct 37 ms 11216 KB Output is correct
4 Correct 47 ms 11180 KB Output is correct
5 Correct 41 ms 11332 KB Output is correct
6 Correct 36 ms 11084 KB Output is correct
7 Correct 28 ms 10172 KB Output is correct
8 Correct 140 ms 36136 KB Output is correct
9 Correct 143 ms 35612 KB Output is correct
10 Correct 27 ms 10216 KB Output is correct
11 Correct 123 ms 44212 KB Output is correct
12 Correct 132 ms 44108 KB Output is correct
13 Correct 141 ms 44240 KB Output is correct
14 Correct 27 ms 9932 KB Output is correct
15 Correct 125 ms 35784 KB Output is correct
16 Correct 122 ms 35676 KB Output is correct
17 Correct 149 ms 36244 KB Output is correct
18 Correct 142 ms 36228 KB Output is correct
19 Correct 138 ms 41216 KB Output is correct
20 Correct 186 ms 40216 KB Output is correct
21 Correct 142 ms 35856 KB Output is correct
22 Correct 146 ms 35088 KB Output is correct
23 Correct 138 ms 36044 KB Output is correct
24 Correct 132 ms 36312 KB Output is correct
25 Correct 138 ms 37836 KB Output is correct
26 Correct 120 ms 34408 KB Output is correct
27 Correct 116 ms 33868 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 10132 KB Output is correct
2 Correct 41 ms 11012 KB Output is correct
3 Correct 37 ms 11216 KB Output is correct
4 Correct 47 ms 11180 KB Output is correct
5 Correct 41 ms 11332 KB Output is correct
6 Correct 36 ms 11084 KB Output is correct
7 Correct 28 ms 10172 KB Output is correct
8 Correct 140 ms 36136 KB Output is correct
9 Correct 143 ms 35612 KB Output is correct
10 Correct 27 ms 10216 KB Output is correct
11 Correct 123 ms 44212 KB Output is correct
12 Correct 132 ms 44108 KB Output is correct
13 Correct 141 ms 44240 KB Output is correct
14 Correct 27 ms 9932 KB Output is correct
15 Correct 125 ms 35784 KB Output is correct
16 Correct 122 ms 35676 KB Output is correct
17 Correct 149 ms 36244 KB Output is correct
18 Correct 142 ms 36228 KB Output is correct
19 Correct 138 ms 41216 KB Output is correct
20 Correct 186 ms 40216 KB Output is correct
21 Correct 142 ms 35856 KB Output is correct
22 Correct 146 ms 35088 KB Output is correct
23 Correct 138 ms 36044 KB Output is correct
24 Correct 132 ms 36312 KB Output is correct
25 Correct 138 ms 37836 KB Output is correct
26 Correct 120 ms 34408 KB Output is correct
27 Correct 116 ms 33868 KB Output is correct
28 Incorrect 27 ms 10132 KB Extra information in the output file
29 Halted 0 ms 0 KB -