oj.uz

답안 #1076539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076539 2024-08-26T14:36:41 Z ArthuroWich 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 1327 ms 75632 KB 
#include "garden.h"
#include "gardenlib.h"
#include<bits/stdc++.h>
using namespace std;
int n, m, p, ans = 0;
vector<int> adj[150005], radj[300005];
int succ[300005][31], vis1[300005], vis2[300005], dep1[300005], dep2[300005], cyc1 = -1, cyc2 = -1;
void initsucc() {
    for (int j = 1; j < 31; j++) {
        for (int i = 0; i <= 2*n; i++) {
            succ[i][j] = succ[succ[i][j-1]][j-1];
        }
    }
}
void calc(int a, int k) {
    for (int i = 0; i < 31; i++) {
        if (k & (1 << i)) {
            a = succ[a][i];
        }
    }
    if (a == p || a == p+n) {
        ans++;
    }
}
void dfs1(int i, int st, int d) {
    if (vis1[i] && st == i && cyc1 == -1) {
        cyc1 = d;
        return;
    }
    if (vis1[i]) {
        return;
    }
    vis1[i] = 1;
    dep1[i] = d;
    for (int j : radj[i]) {
        dfs1(j, st, d+1);
    }
}
void dfs2(int i, int st, int d) {
    if (vis2[i] && st == i && cyc2 == -1) {
        cyc2 = d;
        return;
    }
    if (vis2[i]) {
        return;
    }
    vis2[i] = 1;
    dep2[i] = d;
    for (int j : radj[i]) {
        dfs2(j, st, d+1);
    }
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
    n = N, m = M, p = P;
    for (int i = 0; i < m; i++) {
        if (adj[R[i][0]].size() < 2) {
            adj[R[i][0]].push_back(R[i][1]);
        }
        if (adj[R[i][1]].size() < 2) {
            adj[R[i][1]].push_back(R[i][0]);
        }
    }
    for (int i = 0; i < n; i++) {
        if (adj[i].size() == 1) {
            if (i == adj[adj[i][0]][0]) {
                succ[i][0] = adj[i][0]+n;
            } else {
                succ[i][0] = adj[i][0];
            }
            succ[i+n][0] = succ[i][0];
        } else {
            if (i == adj[adj[i][0]][0]) {
                succ[i][0] = adj[i][0]+n;
            } else {
                succ[i][0] = adj[i][0];
            }
            if (i == adj[adj[i][1]][0]) {
                succ[i+n][0] = adj[i][1]+n;
            } else {
                succ[i+n][0] = adj[i][1];
            }
        }
    }
    if (Q == 1) {
        initsucc();
        ans = 0;
        for (int i = 0; i < n; i++) {
            calc(i, G[0]);
        }
        answer(ans);
        return;
    } 
    for (int i = 0; i < 2*n; i++) {
        radj[succ[i][0]].push_back(i);
    }
    dfs1(p, p, 0);
    dfs2(p+n, p+n, 0);
    for (int j = 0; j < Q; j++) {
        ans = 0;
        for (int i = 0; i < n; i++) {
            bool f1 = 0, f2 = 0;
            int k = G[j];
            if (vis1[i]) {
                k -= dep1[i];
                if (k == 0) {
                    f1 = 1;
                } else if (k > 0 && cyc1 != -1 && k % cyc1 == 0) {
                    f1 = 1;
                }
            }
            k = G[j];
            if (vis2[i]) {
                k -= dep2[i];
                if (k == 0) {
                    f2 = 1;
                } else if (k > 0 && cyc2 != -1 && k % cyc2 == 0) {
                    f2 = 1;
                }
            }
            if (f1 || f2) {
                ans++;
            }
        }
        answer(ans);
    }
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11100 KB Output is correct
2 Correct 5 ms 11100 KB Output is correct
3 Correct 5 ms 11100 KB Output is correct
4 Correct 5 ms 10844 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 7 ms 11220 KB Output is correct
7 Correct 5 ms 10844 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11100 KB Output is correct
2 Correct 5 ms 11100 KB Output is correct
3 Correct 5 ms 11100 KB Output is correct
4 Correct 5 ms 10844 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 7 ms 11220 KB Output is correct
7 Correct 5 ms 10844 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 5 ms 10844 KB Output is correct
11 Correct 23 ms 17352 KB Output is correct
12 Correct 29 ms 21596 KB Output is correct
13 Correct 51 ms 34908 KB Output is correct
14 Correct 91 ms 49096 KB Output is correct
15 Correct 90 ms 49492 KB Output is correct
16 Correct 63 ms 36952 KB Output is correct
17 Correct 56 ms 33040 KB Output is correct
18 Correct 30 ms 21692 KB Output is correct
19 Correct 92 ms 49116 KB Output is correct
20 Correct 104 ms 49488 KB Output is correct
21 Correct 60 ms 36956 KB Output is correct
22 Correct 60 ms 33036 KB Output is correct
23 Correct 110 ms 53072 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11100 KB Output is correct
2 Correct 5 ms 11100 KB Output is correct
3 Correct 5 ms 11100 KB Output is correct
4 Correct 5 ms 10844 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 7 ms 11220 KB Output is correct
7 Correct 5 ms 10844 KB Output is correct
8 Correct 5 ms 11100 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 5 ms 10844 KB Output is correct
11 Correct 23 ms 17352 KB Output is correct
12 Correct 29 ms 21596 KB Output is correct
13 Correct 51 ms 34908 KB Output is correct
14 Correct 91 ms 49096 KB Output is correct
15 Correct 90 ms 49492 KB Output is correct
16 Correct 63 ms 36952 KB Output is correct
17 Correct 56 ms 33040 KB Output is correct
18 Correct 30 ms 21692 KB Output is correct
19 Correct 92 ms 49116 KB Output is correct
20 Correct 104 ms 49488 KB Output is correct
21 Correct 60 ms 36956 KB Output is correct
22 Correct 60 ms 33036 KB Output is correct
23 Correct 110 ms 53072 KB Output is correct
24 Correct 5 ms 11096 KB Output is correct
25 Correct 56 ms 18592 KB Output is correct
26 Correct 93 ms 23752 KB Output is correct
27 Correct 718 ms 51028 KB Output is correct
28 Correct 662 ms 58708 KB Output is correct
29 Correct 858 ms 59472 KB Output is correct
30 Correct 432 ms 43352 KB Output is correct
31 Correct 467 ms 39352 KB Output is correct
32 Correct 92 ms 24148 KB Output is correct
33 Correct 719 ms 58456 KB Output is correct
34 Correct 867 ms 59520 KB Output is correct
35 Correct 468 ms 43544 KB Output is correct
36 Correct 839 ms 39320 KB Output is correct
37 Correct 531 ms 61524 KB Output is correct
38 Correct 1327 ms 75632 KB Output is correct