oj.uz

Submission #1042390

# Submission time Handle Problem Language Result Execution time Memory
1042390 2024-08-03T03:29:53 Z sleepntsheep Inside information (BOI21_servers) C
50 / 100
 3500 ms 27828 KB 
#include <stdio.h>
#include <stdlib.h>

/*
 * For "Q" queries, use LCA + prefix sum on tree ~ 3O(lgn) [for finding lca and almost-lca]
 *
 *
 * Every B queries of any type, do naive dp on tree (reverse edge order)
 * to find answer for "C" queries  ~ O(n)
 *
 * On "C" queries, use cached answer from above and count all edges that appeared after that (by "Q")
 * ~ O(B lgn)
 *
 *
 * Time complexity = O(N^2 / B) + O(N lgn) + O(N B lgn)
 *
 * Let B = sqrt(N / lgN)
 */

#define N 1200010
#define B 300


int n, q, pp[N], jj[N], dd[N], up[N], temp, inc[N], map_time[N];

void pus_(int **eh, int *eo, int i, int j) {
    int o = eo[i]++;
    if (0 == o) eh[i] = (int*)malloc(2 * sizeof **eh);
    else if (0 == (o & o - 1)) eh[i] = (int*)realloc(eh[i], 2 * o * sizeof **eh);
    eh[i][o] = j;
}

int *eh[N], *fh[N], eo[N];

void link(int u, int v, int w) {
    pus_(eh, eo, u, v);
    --eo[u];
    pus_(fh, eo, u, w);
    pus_(eh, eo, v, u);
    --eo[v];
    pus_(fh, eo, v, w);
}

void dfs(int u, int p) {
    inc[u] = (up[u] > up[p]) + inc[p];
    for (int j = 0; j < eo[u]; ++j) if (eh[u][j] != p) {
        int v = eh[u][j];
        dd[v] = dd[u] + 1;
        pp[v] = u;
        jj[v] = (dd[u] - dd[jj[u]] == dd[jj[u]] - dd[jj[jj[u]]]) ? jj[jj[u]]: u;

        up[v] = fh[u][j];
        dfs(v, u);
    }
}

int lca(int u, int v) {
    while (dd[u] != dd[v]) {
        if (dd[u] < dd[v]) temp = u, u = v, v = temp;
        u = (dd[jj[u]] >= dd[v]) ? jj[u] : pp[u];
    }
    while (u != v)
        if (jj[u] != jj[v]) u = jj[u], v = jj[v];
        else u = pp[u], v = pp[v];
    return u;
}

int anc(int u, int dep) {
    while (dd[u] > dep)
        u = (dd[jj[u]] >= dep) ? jj[u] : pp[u];
    return u;
}

struct Query {
    char type;
    int a, b;
    int ans;
} qq[N * 2];

/* u = data node, v = ask node */
int query_yesno(int u, int v, int time) {
    if (u == v) return 1;
    int a = lca(u, v);
    int va = anc(v, dd[a] + 1);
    int ua = anc(u, dd[a] + 1);

    if (u == a)
        return inc[v] - inc[va] == dd[v] - dd[va] && up[v] <= time;
    if (v == a)
        return inc[u] - inc[ua] == 0 && up[ua] <= time;

    return (dd[v] - dd[va] == inc[v] - inc[va]) && (inc[u] - inc[ua] == 0)
        && up[va] > up[ua] && up[v] <= time;
}

int dp[N], comp[N];

void efs(int u, int p, int time, int root) {
    comp[u] = root;
    for (int j = 0; j < eo[u]; ++j)
        if (eh[u][j] != p && fh[u][j] <= time && comp[eh[u][j]] == -1)
            efs(eh[u][j], u, time, root);
}

void build(int ii, int tme) {
    for (int i = 1; i <= n; ++i)
        dp[i] = 1, comp[i] = -1;

    for (int i = ii; i >= 0; --i) {
        if (qq[i].type != 'S')
            continue;

        int x = dp[qq[i].a], y = dp[qq[i].b];
        dp[qq[i].a] += y;
        dp[qq[i].b] += x;
    }

    for (int i = 1; i <= n; ++i)
        if (comp[i] == -1)
            efs(i, i, tme, i);
}

int counted[N];

int main() {
    scanf("%d%d", &n, &q);

    q = n + q - 1;
    for (int j = 0, i = 0; i < q; ++i) {
        char c;
        int a, b;
        scanf(" %c%d", &c, &a);
        if (c == 'S') {
            scanf("%d", &b);
            link(a, b, j++);
            map_time[j - 1] = i;
        } else if (c == 'Q')
            scanf("%d", &b);

        qq[i] = (struct Query){c, a, b};
    }

    up[1] = 1e9;
    pp[1] = jj[1] = 1;
    dfs(1, 1);

    build(-1, -1);
    int at = 0;

    for (int j = 0, i = 0; i < q; ++i) {
        if (qq[i].type == 'S') {
            ++j;
        }
        else if (qq[i].type == 'Q') {
            puts(query_yesno(qq[i].b, qq[i].a, j - 1) ? "yes": "no");
        } else {
            int focus = qq[i].a;
            int addition = 0;
            for (int k = at; k < i; ++k)
                if (qq[k].type == 'S') {
                    int a = qq[k].a, b = qq[k].b;

                    if (counted[a] != i + 1 &&
                            comp[a] != comp[focus] && query_yesno(focus, a, j - 1))
                        ++addition, counted[a] = i + 1;
                    if (counted[b] != i + 1 && 
                            comp[b] != comp[focus] && query_yesno(focus, b, j - 1))
                        ++addition, counted[b] = i + 1;
                }
            printf("%d\n", dp[focus] + addition);
        }

        if (i % B == 0) {
            build(i, j);
            at = i + 1;
        }
    }
}

Compilation message

servers.c: In function 'pus_':
servers.c:30:26: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   30 |     else if (0 == (o & o - 1)) eh[i] = (int*)realloc(eh[i], 2 * o * sizeof **eh);
      |                        ~~^~~
servers.c: In function 'main':
servers.c:127:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |     scanf("%d%d", &n, &q);
      |     ^~~~~~~~~~~~~~~~~~~~~
servers.c:133:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |         scanf(" %c%d", &c, &a);
      |         ^~~~~~~~~~~~~~~~~~~~~~
servers.c:135:13: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |             scanf("%d", &b);
      |             ^~~~~~~~~~~~~~~
servers.c:139:13: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  139 |             scanf("%d", &b);
      |             ^~~~~~~~~~~~~~~

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2640 KB Output is correct
2 Correct 109 ms 3408 KB Output is correct
3 Correct 55 ms 3152 KB Output is correct
4 Correct 89 ms 3152 KB Output is correct
5 Correct 88 ms 3412 KB Output is correct
6 Correct 49 ms 3156 KB Output is correct

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2640 KB Output is correct
2 Correct 109 ms 3408 KB Output is correct
3 Correct 55 ms 3152 KB Output is correct
4 Correct 89 ms 3152 KB Output is correct
5 Correct 88 ms 3412 KB Output is correct
6 Correct 49 ms 3156 KB Output is correct
7 Correct 36 ms 2644 KB Output is correct
8 Incorrect 89 ms 3152 KB Extra information in the output file
9 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2644 KB Output is correct
2 Correct 1120 ms 19032 KB Output is correct
3 Correct 1051 ms 19204 KB Output is correct

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2644 KB Output is correct
2 Correct 1120 ms 19032 KB Output is correct
3 Correct 1051 ms 19204 KB Output is correct
4 Correct 36 ms 2648 KB Output is correct
5 Incorrect 1058 ms 19684 KB Extra information in the output file
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2608 KB Output is correct
2 Correct 2315 ms 27692 KB Output is correct
3 Correct 2506 ms 27604 KB Output is correct
4 Correct 822 ms 27472 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2608 KB Output is correct
2 Correct 2315 ms 27692 KB Output is correct
3 Correct 2506 ms 27604 KB Output is correct
4 Correct 822 ms 27472 KB Output is correct
5 Correct 53 ms 2640 KB Output is correct
6 Execution timed out 3544 ms 27764 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2652 KB Output is correct
2 Correct 730 ms 18256 KB Output is correct
3 Correct 2919 ms 18200 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2652 KB Output is correct
2 Correct 730 ms 18256 KB Output is correct
3 Correct 2919 ms 18200 KB Output is correct
4 Correct 43 ms 2648 KB Output is correct
5 Incorrect 797 ms 18596 KB Extra information in the output file
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 71 ms 2640 KB Output is correct
2 Correct 2087 ms 27688 KB Output is correct
3 Correct 2069 ms 27480 KB Output is correct
4 Correct 868 ms 27628 KB Output is correct
5 Correct 44 ms 2640 KB Output is correct
6 Correct 677 ms 18208 KB Output is correct
7 Correct 2098 ms 18260 KB Output is correct
8 Correct 2329 ms 19364 KB Output is correct
9 Correct 1947 ms 19300 KB Output is correct
10 Correct 1906 ms 21588 KB Output is correct
11 Correct 2294 ms 21028 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 71 ms 2640 KB Output is correct
2 Correct 2087 ms 27688 KB Output is correct
3 Correct 2069 ms 27480 KB Output is correct
4 Correct 868 ms 27628 KB Output is correct
5 Correct 44 ms 2640 KB Output is correct
6 Correct 677 ms 18208 KB Output is correct
7 Correct 2098 ms 18260 KB Output is correct
8 Correct 2329 ms 19364 KB Output is correct
9 Correct 1947 ms 19300 KB Output is correct
10 Correct 1906 ms 21588 KB Output is correct
11 Correct 2294 ms 21028 KB Output is correct
12 Correct 36 ms 2644 KB Output is correct
13 Incorrect 3451 ms 27828 KB Extra information in the output file
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2648 KB Output is correct
2 Correct 67 ms 3128 KB Output is correct
3 Correct 54 ms 3124 KB Output is correct
4 Correct 83 ms 3152 KB Output is correct
5 Correct 93 ms 3492 KB Output is correct
6 Correct 47 ms 3152 KB Output is correct
7 Correct 35 ms 2648 KB Output is correct
8 Correct 960 ms 19072 KB Output is correct
9 Correct 948 ms 19360 KB Output is correct
10 Correct 36 ms 2652 KB Output is correct
11 Correct 1738 ms 27536 KB Output is correct
12 Correct 1706 ms 27740 KB Output is correct
13 Correct 745 ms 27648 KB Output is correct
14 Correct 45 ms 2640 KB Output is correct
15 Correct 641 ms 18232 KB Output is correct
16 Correct 1893 ms 18256 KB Output is correct
17 Correct 2328 ms 19228 KB Output is correct
18 Correct 1898 ms 19280 KB Output is correct
19 Correct 1905 ms 21800 KB Output is correct
20 Correct 2292 ms 20976 KB Output is correct
21 Correct 959 ms 19140 KB Output is correct
22 Correct 1087 ms 19384 KB Output is correct
23 Correct 1231 ms 19792 KB Output is correct
24 Correct 1194 ms 19800 KB Output is correct
25 Correct 1816 ms 21556 KB Output is correct
26 Correct 2810 ms 18548 KB Output is correct
27 Correct 2794 ms 18516 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2648 KB Output is correct
2 Correct 67 ms 3128 KB Output is correct
3 Correct 54 ms 3124 KB Output is correct
4 Correct 83 ms 3152 KB Output is correct
5 Correct 93 ms 3492 KB Output is correct
6 Correct 47 ms 3152 KB Output is correct
7 Correct 35 ms 2648 KB Output is correct
8 Correct 960 ms 19072 KB Output is correct
9 Correct 948 ms 19360 KB Output is correct
10 Correct 36 ms 2652 KB Output is correct
11 Correct 1738 ms 27536 KB Output is correct
12 Correct 1706 ms 27740 KB Output is correct
13 Correct 745 ms 27648 KB Output is correct
14 Correct 45 ms 2640 KB Output is correct
15 Correct 641 ms 18232 KB Output is correct
16 Correct 1893 ms 18256 KB Output is correct
17 Correct 2328 ms 19228 KB Output is correct
18 Correct 1898 ms 19280 KB Output is correct
19 Correct 1905 ms 21800 KB Output is correct
20 Correct 2292 ms 20976 KB Output is correct
21 Correct 959 ms 19140 KB Output is correct
22 Correct 1087 ms 19384 KB Output is correct
23 Correct 1231 ms 19792 KB Output is correct
24 Correct 1194 ms 19800 KB Output is correct
25 Correct 1816 ms 21556 KB Output is correct
26 Correct 2810 ms 18548 KB Output is correct
27 Correct 2794 ms 18516 KB Output is correct
28 Correct 36 ms 3412 KB Output is correct
29 Incorrect 90 ms 4176 KB Extra information in the output file
30 Halted 0 ms 0 KB -