oj.uz

Submission #540415

# Submission time Handle Problem Language Result Execution time Memory
540415 2022-03-20T10:12:06 Z elazarkoren Inside information (BOI21_servers) C++17
52.5 / 100
 3500 ms 43436 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];// weight[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};
//    weight[node] = 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 main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> q;
    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});
        } else if (type[i] == 'Q') {
//            int a, d;
            cin >> a[i] >> d[i];
//            cout << (Dfs(a, d, infinity) ? "yes\n" : "no\n");
        } else {
            int x;
            cin >> x;
            ans[i] = Dfs(x, -1);
//            cout << Dfs(d, -1) << '\n';
        }
    }
    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;
//            cout << (Solve(a[i], d[i]) <= i ? "yes\n" : "no\n");
        }
    }
    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 36 ms 9300 KB Output is correct
2 Correct 43 ms 9900 KB Output is correct
3 Correct 38 ms 10012 KB Output is correct
4 Correct 61 ms 10116 KB Output is correct
5 Correct 40 ms 10288 KB Output is correct
6 Correct 35 ms 10344 KB Output is correct

Subtask #2
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 9300 KB Output is correct
2 Correct 43 ms 9900 KB Output is correct
3 Correct 38 ms 10012 KB Output is correct
4 Correct 61 ms 10116 KB Output is correct
5 Correct 40 ms 10288 KB Output is correct
6 Correct 35 ms 10344 KB Output is correct
7 Correct 32 ms 9620 KB Output is correct
8 Correct 40 ms 10144 KB Output is correct
9 Correct 242 ms 10804 KB Output is correct
10 Correct 42 ms 10440 KB Output is correct
11 Correct 39 ms 10128 KB Output is correct
12 Correct 961 ms 10120 KB Output is correct

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 31 ms 9360 KB Output is correct
2 Correct 175 ms 34028 KB Output is correct
3 Correct 160 ms 35100 KB Output is correct

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 31 ms 9360 KB Output is correct
2 Correct 175 ms 34028 KB Output is correct
3 Correct 160 ms 35100 KB Output is correct
4 Correct 28 ms 9292 KB Output is correct
5 Execution timed out 3550 ms 13856 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 9324 KB Output is correct
2 Correct 149 ms 42136 KB Output is correct
3 Correct 149 ms 41996 KB Output is correct
4 Correct 181 ms 41880 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 9324 KB Output is correct
2 Correct 149 ms 42136 KB Output is correct
3 Correct 149 ms 41996 KB Output is correct
4 Correct 181 ms 41880 KB Output is correct
5 Correct 28 ms 9216 KB Output is correct
6 Correct 141 ms 43428 KB Output is correct
7 Execution timed out 3553 ms 15072 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9348 KB Output is correct
2 Correct 155 ms 34088 KB Output is correct
3 Correct 155 ms 34556 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9348 KB Output is correct
2 Correct 155 ms 34088 KB Output is correct
3 Correct 155 ms 34556 KB Output is correct
4 Correct 40 ms 9288 KB Output is correct
5 Execution timed out 3542 ms 15180 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9600 KB Output is correct
2 Correct 142 ms 42160 KB Output is correct
3 Correct 157 ms 42036 KB Output is correct
4 Correct 156 ms 42312 KB Output is correct
5 Correct 26 ms 9432 KB Output is correct
6 Correct 129 ms 33956 KB Output is correct
7 Correct 173 ms 34308 KB Output is correct
8 Correct 187 ms 34572 KB Output is correct
9 Correct 157 ms 34884 KB Output is correct
10 Correct 157 ms 39544 KB Output is correct
11 Correct 232 ms 39012 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9600 KB Output is correct
2 Correct 142 ms 42160 KB Output is correct
3 Correct 157 ms 42036 KB Output is correct
4 Correct 156 ms 42312 KB Output is correct
5 Correct 26 ms 9432 KB Output is correct
6 Correct 129 ms 33956 KB Output is correct
7 Correct 173 ms 34308 KB Output is correct
8 Correct 187 ms 34572 KB Output is correct
9 Correct 157 ms 34884 KB Output is correct
10 Correct 157 ms 39544 KB Output is correct
11 Correct 232 ms 39012 KB Output is correct
12 Correct 28 ms 9524 KB Output is correct
13 Correct 145 ms 43436 KB Output is correct
14 Execution timed out 3567 ms 14360 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 30 ms 9328 KB Output is correct
2 Correct 41 ms 10052 KB Output is correct
3 Correct 35 ms 10208 KB Output is correct
4 Correct 46 ms 10236 KB Output is correct
5 Correct 48 ms 10364 KB Output is correct
6 Correct 35 ms 10320 KB Output is correct
7 Correct 26 ms 9648 KB Output is correct
8 Correct 182 ms 34092 KB Output is correct
9 Correct 144 ms 33720 KB Output is correct
10 Correct 28 ms 9884 KB Output is correct
11 Correct 171 ms 43168 KB Output is correct
12 Correct 144 ms 43240 KB Output is correct
13 Correct 163 ms 43096 KB Output is correct
14 Correct 27 ms 10192 KB Output is correct
15 Correct 130 ms 34044 KB Output is correct
16 Correct 154 ms 33836 KB Output is correct
17 Correct 208 ms 34604 KB Output is correct
18 Correct 157 ms 35952 KB Output is correct
19 Correct 172 ms 39532 KB Output is correct
20 Correct 223 ms 39372 KB Output is correct
21 Correct 171 ms 34172 KB Output is correct
22 Correct 189 ms 35024 KB Output is correct
23 Correct 152 ms 34264 KB Output is correct
24 Correct 166 ms 35120 KB Output is correct
25 Correct 158 ms 35988 KB Output is correct
26 Correct 134 ms 32628 KB Output is correct
27 Correct 156 ms 33520 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 30 ms 9328 KB Output is correct
2 Correct 41 ms 10052 KB Output is correct
3 Correct 35 ms 10208 KB Output is correct
4 Correct 46 ms 10236 KB Output is correct
5 Correct 48 ms 10364 KB Output is correct
6 Correct 35 ms 10320 KB Output is correct
7 Correct 26 ms 9648 KB Output is correct
8 Correct 182 ms 34092 KB Output is correct
9 Correct 144 ms 33720 KB Output is correct
10 Correct 28 ms 9884 KB Output is correct
11 Correct 171 ms 43168 KB Output is correct
12 Correct 144 ms 43240 KB Output is correct
13 Correct 163 ms 43096 KB Output is correct
14 Correct 27 ms 10192 KB Output is correct
15 Correct 130 ms 34044 KB Output is correct
16 Correct 154 ms 33836 KB Output is correct
17 Correct 208 ms 34604 KB Output is correct
18 Correct 157 ms 35952 KB Output is correct
19 Correct 172 ms 39532 KB Output is correct
20 Correct 223 ms 39372 KB Output is correct
21 Correct 171 ms 34172 KB Output is correct
22 Correct 189 ms 35024 KB Output is correct
23 Correct 152 ms 34264 KB Output is correct
24 Correct 166 ms 35120 KB Output is correct
25 Correct 158 ms 35988 KB Output is correct
26 Correct 134 ms 32628 KB Output is correct
27 Correct 156 ms 33520 KB Output is correct
28 Correct 32 ms 9368 KB Output is correct
29 Correct 39 ms 9944 KB Output is correct
30 Correct 245 ms 11116 KB Output is correct
31 Correct 41 ms 10048 KB Output is correct
32 Correct 48 ms 11332 KB Output is correct
33 Correct 884 ms 10516 KB Output is correct
34 Correct 28 ms 9564 KB Output is correct
35 Execution timed out 3548 ms 13884 KB Time limit exceeded
36 Halted 0 ms 0 KB -