oj.uz

Submission #1042414

# Submission time Handle Problem Language Result Execution time Memory
1042414 2024-08-03T04:11:02 Z sleepntsheep Inside information (BOI21_servers) C
47.5 / 100
 3500 ms 29524 KB 
/* WHAT IS EXTRA INFORAMZTION GTR RR */

#include <stdio.h>
#include <stdlib.h>

int max(int i, int j) { return i > j ? i : j; }
/*
 * 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 120001
#define B 300

int n, q, pp[N], jj[N], dd[N], up[N], temp, inc[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[2];
    int a, b;
} 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, ua;
    ua = anc(u, dd[a] + 1);
    va = anc(v, 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 time, int root) {
    comp[u] = root;
    for (int j = 0; j < eo[u]; ++j)
        if (fh[u][j] <= time && comp[eh[u][j]] == -1)
            efs(eh[u][j], 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[0] != '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, 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) {
        int a, b = 0;
        char *s = qq[i].type;

        scanf(" %s%d", s, &a);
        if (s[0] == 'S') {
            scanf("%d", &b);
            link(a, b, j++);
        } else if (s[0] == 'Q')
            scanf("%d", &b);

        qq[i].a = a, qq[i].b = 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[0] == 'S')
            ++j;

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

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

    }
}

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:128:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  128 |     scanf("%d%d", &n, &q);
      |     ^~~~~~~~~~~~~~~~~~~~~
servers.c:135:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |         scanf(" %s%d", s, &a);
      |         ^~~~~~~~~~~~~~~~~~~~~
servers.c:137:13: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |             scanf("%d", &b);
      |             ^~~~~~~~~~~~~~~
servers.c:140:13: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  140 |             scanf("%d", &b);
      |             ^~~~~~~~~~~~~~~

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2136 KB Output is correct
2 Correct 60 ms 2644 KB Output is correct
3 Correct 49 ms 2640 KB Output is correct
4 Correct 77 ms 2640 KB Output is correct
5 Correct 82 ms 2900 KB Output is correct
6 Correct 43 ms 2648 KB Output is correct

Subtask #2
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2136 KB Output is correct
2 Correct 60 ms 2644 KB Output is correct
3 Correct 49 ms 2640 KB Output is correct
4 Correct 77 ms 2640 KB Output is correct
5 Correct 82 ms 2900 KB Output is correct
6 Correct 43 ms 2648 KB Output is correct
7 Correct 31 ms 2648 KB Output is correct
8 Correct 85 ms 2644 KB Output is correct
9 Correct 89 ms 3724 KB Output is correct
10 Correct 152 ms 3664 KB Output is correct
11 Correct 109 ms 3924 KB Output is correct
12 Correct 58 ms 3920 KB Output is correct

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2124 KB Output is correct
2 Correct 993 ms 17888 KB Output is correct
3 Correct 975 ms 17748 KB Output is correct

Subtask #4
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2124 KB Output is correct
2 Correct 993 ms 17888 KB Output is correct
3 Correct 975 ms 17748 KB Output is correct
4 Correct 31 ms 2384 KB Output is correct
5 Correct 1002 ms 18000 KB Output is correct
6 Correct 1052 ms 20216 KB Output is correct
7 Correct 1018 ms 20308 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2712 KB Output is correct
2 Correct 1762 ms 26100 KB Output is correct
3 Correct 1754 ms 26076 KB Output is correct
4 Correct 762 ms 26296 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2712 KB Output is correct
2 Correct 1762 ms 26100 KB Output is correct
3 Correct 1754 ms 26076 KB Output is correct
4 Correct 762 ms 26296 KB Output is correct
5 Correct 31 ms 2648 KB Output is correct
6 Correct 3487 ms 26308 KB Output is correct
7 Correct 1723 ms 29524 KB Output is correct
8 Execution timed out 3544 ms 28776 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2652 KB Output is correct
2 Correct 626 ms 16724 KB Output is correct
3 Correct 1894 ms 16620 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2652 KB Output is correct
2 Correct 626 ms 16724 KB Output is correct
3 Correct 1894 ms 16620 KB Output is correct
4 Correct 30 ms 2648 KB Output is correct
5 Correct 766 ms 16900 KB Output is correct
6 Correct 2256 ms 19832 KB Output is correct

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2652 KB Output is correct
2 Correct 1735 ms 26200 KB Output is correct
3 Correct 1712 ms 26048 KB Output is correct
4 Correct 734 ms 25920 KB Output is correct
5 Correct 29 ms 2652 KB Output is correct
6 Correct 664 ms 16640 KB Output is correct
7 Correct 1966 ms 17044 KB Output is correct
8 Correct 2388 ms 17704 KB Output is correct
9 Correct 1902 ms 17712 KB Output is correct
10 Correct 1831 ms 20152 KB Output is correct
11 Correct 2178 ms 19580 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2652 KB Output is correct
2 Correct 1735 ms 26200 KB Output is correct
3 Correct 1712 ms 26048 KB Output is correct
4 Correct 734 ms 25920 KB Output is correct
5 Correct 29 ms 2652 KB Output is correct
6 Correct 664 ms 16640 KB Output is correct
7 Correct 1966 ms 17044 KB Output is correct
8 Correct 2388 ms 17704 KB Output is correct
9 Correct 1902 ms 17712 KB Output is correct
10 Correct 1831 ms 20152 KB Output is correct
11 Correct 2178 ms 19580 KB Output is correct
12 Correct 35 ms 2648 KB Output is correct
13 Correct 3469 ms 26180 KB Output is correct
14 Correct 1662 ms 29520 KB Output is correct
15 Execution timed out 3524 ms 28996 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2652 KB Output is correct
2 Correct 61 ms 2524 KB Output is correct
3 Correct 48 ms 2640 KB Output is correct
4 Correct 82 ms 2896 KB Output is correct
5 Correct 81 ms 3408 KB Output is correct
6 Correct 49 ms 2648 KB Output is correct
7 Correct 33 ms 2136 KB Output is correct
8 Correct 944 ms 17744 KB Output is correct
9 Correct 925 ms 17744 KB Output is correct
10 Correct 39 ms 2648 KB Output is correct
11 Correct 1783 ms 26092 KB Output is correct
12 Correct 1668 ms 26188 KB Output is correct
13 Correct 705 ms 26036 KB Output is correct
14 Correct 33 ms 2648 KB Output is correct
15 Correct 672 ms 16704 KB Output is correct
16 Correct 2159 ms 16624 KB Output is correct
17 Correct 3095 ms 17532 KB Output is correct
18 Correct 2527 ms 17680 KB Output is correct
19 Correct 2220 ms 20280 KB Output is correct
20 Correct 2484 ms 19536 KB Output is correct
21 Correct 1068 ms 17744 KB Output is correct
22 Correct 1137 ms 17864 KB Output is correct
23 Correct 1549 ms 18000 KB Output is correct
24 Correct 1319 ms 18260 KB Output is correct
25 Correct 2142 ms 19904 KB Output is correct
26 Execution timed out 3531 ms 18940 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2652 KB Output is correct
2 Correct 61 ms 2524 KB Output is correct
3 Correct 48 ms 2640 KB Output is correct
4 Correct 82 ms 2896 KB Output is correct
5 Correct 81 ms 3408 KB Output is correct
6 Correct 49 ms 2648 KB Output is correct
7 Correct 33 ms 2136 KB Output is correct
8 Correct 944 ms 17744 KB Output is correct
9 Correct 925 ms 17744 KB Output is correct
10 Correct 39 ms 2648 KB Output is correct
11 Correct 1783 ms 26092 KB Output is correct
12 Correct 1668 ms 26188 KB Output is correct
13 Correct 705 ms 26036 KB Output is correct
14 Correct 33 ms 2648 KB Output is correct
15 Correct 672 ms 16704 KB Output is correct
16 Correct 2159 ms 16624 KB Output is correct
17 Correct 3095 ms 17532 KB Output is correct
18 Correct 2527 ms 17680 KB Output is correct
19 Correct 2220 ms 20280 KB Output is correct
20 Correct 2484 ms 19536 KB Output is correct
21 Correct 1068 ms 17744 KB Output is correct
22 Correct 1137 ms 17864 KB Output is correct
23 Correct 1549 ms 18000 KB Output is correct
24 Correct 1319 ms 18260 KB Output is correct
25 Correct 2142 ms 19904 KB Output is correct
26 Execution timed out 3531 ms 18940 KB Time limit exceeded
27 Halted 0 ms 0 KB -