oj.uz

답안 #922852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922852 2024-02-06T08:09:40 Z asdasdqwer Railway (BOI17_railway) C++14
100 / 100
 248 ms 49280 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t

vector<int> idx;

signed main() {
    int n,m,k;cin>>n>>m>>k;
    vector<vector<int>> g(n);
    int hh=0;
    map<array<int,2>,int> mp;
    for (int i=1;i<n;i++) {
        int a,b;cin>>a>>b;a--;b--;
        g[a].push_back(b);
        g[b].push_back(a);
        mp[{a,b}] = hh++;
    }

    idx.assign(n, -1);

    int cnt=0;
    vector<vector<int>> lft(n, vector<int>(20, -1));
    vector<int> d(n);

    function<void(int,int)> dfs=[&](int node,int pv) {
        idx[node]=cnt++;
        for (int x:g[node]) {
            if (x==pv)continue;
            d[x]=d[node]+1;
            lft[x][0]=node;
            dfs(x,node);
        }
    };

    dfs(0, -1);

    for (int j=1;j<20;j++) {
        for (int i=0;i<n;i++) {
            lft[i][j]=lft[i][j-1];
            if (lft[i][j] != -1) {
                lft[i][j] = lft[lft[i][j]][j-1];
            }
        }
    }

    function<int(int,int)> jmp=[&](int a, int steps) -> int {
        int c=0;
        while (steps) {
            if ((steps&1)==1) {
                a=lft[a][c];
            }
            c++;steps>>=1;
        }
        return a;
    };

    function<int(int,int)> lca=[&](int a,int b) -> int {
        if (d[a]<d[b])swap(a,b);
        a=jmp(a,d[a]-d[b]);
        if (a==b)return a;

        for (int i=19;i>=0;i--) {
            if (lft[a][i] != lft[b][i]) {
                a=lft[a][i];
                b=lft[b][i];
            }
        }
        return lft[a][0];
    };

    vector<int> sm(n, 0);

    for (int i=0;i<m;i++) {
        int s;cin>>s;
        vector<int> inp(s);
        for (auto &x:inp){cin>>x;x--;}

        sort(inp.begin(),inp.end(), [](int a, int b) { return idx[a] < idx[b]; });

        for (int j=0;j<s;j++) {
            int n1=inp[j];
            int n2=inp[(j+1)%s];
            sm[n1]++;
            sm[n2]++;
            sm[lca(n1,n2)] -= 2;
        }
    }

    function<void(int,int)> dfs2=[&](int node,int pv) {
        for (int x:g[node]) {
            if (x == pv) continue;
            dfs2(x,node);
            sm[node] += sm[x];
        }
    };

    dfs2(0, -1);

    vector<int> out;
    for (int i=0;i<n;i++) {
        if (sm[i] >= 2*k) {
            int code=-1;
            if (mp.find({i, lft[i][0]}) != mp.end()) {
                code = mp[{i, lft[i][0]}];
            }

            else if (mp.find({lft[i][0], i}) != mp.end()) {
                code = mp[{lft[i][0], i}];
            }

            if (code != -1) {
                out.push_back(code);
            }

            else {
                assert(0 == -1);
            }
        }
    }

    sort(out.begin(), out.end());
    if (out.size() == 0) {
        cout<<0<<"\n";
        return 0;
    }

    vector<int> dis={out[0]};
    for (int x:out) {
        if (dis.back() != x)dis.push_back(x);
    }

    cout<<dis.size()<<"\n";
    for (int x:dis) {
        cout<<x+1<<" ";
    }
    cout<<"\n";
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 9 ms 3932 KB Output is correct
3 Correct 9 ms 3932 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 12 ms 4440 KB Output is correct
7 Correct 9 ms 3932 KB Output is correct
8 Correct 8 ms 3872 KB Output is correct
9 Correct 10 ms 3996 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 9 ms 3932 KB Output is correct
3 Correct 9 ms 3932 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 12 ms 4440 KB Output is correct
7 Correct 9 ms 3932 KB Output is correct
8 Correct 8 ms 3872 KB Output is correct
9 Correct 10 ms 3996 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 45 ms 4184 KB Output is correct
16 Correct 41 ms 4320 KB Output is correct
17 Correct 37 ms 4332 KB Output is correct
18 Correct 17 ms 4444 KB Output is correct
19 Correct 9 ms 3932 KB Output is correct
20 Correct 37 ms 4368 KB Output is correct
21 Correct 37 ms 4428 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 10 ms 3780 KB Output is correct
24 Correct 11 ms 3932 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 12 ms 4516 KB Output is correct
28 Correct 9 ms 3932 KB Output is correct
29 Correct 8 ms 3932 KB Output is correct
30 Correct 9 ms 3928 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 48248 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 212 ms 47964 KB Output is correct
4 Correct 181 ms 46712 KB Output is correct
5 Correct 232 ms 48736 KB Output is correct
6 Correct 212 ms 49280 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 41296 KB Output is correct
2 Correct 157 ms 37032 KB Output is correct
3 Correct 180 ms 36452 KB Output is correct
4 Correct 203 ms 36476 KB Output is correct
5 Correct 155 ms 36336 KB Output is correct
6 Correct 152 ms 42068 KB Output is correct
7 Correct 154 ms 41808 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 41296 KB Output is correct
2 Correct 157 ms 37032 KB Output is correct
3 Correct 180 ms 36452 KB Output is correct
4 Correct 203 ms 36476 KB Output is correct
5 Correct 155 ms 36336 KB Output is correct
6 Correct 152 ms 42068 KB Output is correct
7 Correct 154 ms 41808 KB Output is correct
8 Correct 174 ms 42240 KB Output is correct
9 Correct 165 ms 42240 KB Output is correct
10 Correct 197 ms 48964 KB Output is correct
11 Correct 200 ms 48984 KB Output is correct
12 Correct 146 ms 36020 KB Output is correct
13 Correct 131 ms 36028 KB Output is correct
14 Correct 154 ms 36176 KB Output is correct
15 Correct 152 ms 36260 KB Output is correct
16 Correct 163 ms 36484 KB Output is correct
17 Correct 157 ms 36460 KB Output is correct
18 Correct 169 ms 36484 KB Output is correct
19 Correct 155 ms 36952 KB Output is correct
20 Correct 162 ms 42444 KB Output is correct
21 Correct 168 ms 42956 KB Output is correct
22 Correct 160 ms 42592 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 9 ms 3932 KB Output is correct
3 Correct 9 ms 3932 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 12 ms 4440 KB Output is correct
7 Correct 9 ms 3932 KB Output is correct
8 Correct 8 ms 3872 KB Output is correct
9 Correct 10 ms 3996 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 45 ms 4184 KB Output is correct
16 Correct 41 ms 4320 KB Output is correct
17 Correct 37 ms 4332 KB Output is correct
18 Correct 17 ms 4444 KB Output is correct
19 Correct 9 ms 3932 KB Output is correct
20 Correct 37 ms 4368 KB Output is correct
21 Correct 37 ms 4428 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 10 ms 3780 KB Output is correct
24 Correct 11 ms 3932 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 12 ms 4516 KB Output is correct
28 Correct 9 ms 3932 KB Output is correct
29 Correct 8 ms 3932 KB Output is correct
30 Correct 9 ms 3928 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 228 ms 48248 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 212 ms 47964 KB Output is correct
39 Correct 181 ms 46712 KB Output is correct
40 Correct 232 ms 48736 KB Output is correct
41 Correct 212 ms 49280 KB Output is correct
42 Correct 145 ms 41296 KB Output is correct
43 Correct 157 ms 37032 KB Output is correct
44 Correct 180 ms 36452 KB Output is correct
45 Correct 203 ms 36476 KB Output is correct
46 Correct 155 ms 36336 KB Output is correct
47 Correct 152 ms 42068 KB Output is correct
48 Correct 154 ms 41808 KB Output is correct
49 Correct 174 ms 42240 KB Output is correct
50 Correct 165 ms 42240 KB Output is correct
51 Correct 197 ms 48964 KB Output is correct
52 Correct 200 ms 48984 KB Output is correct
53 Correct 146 ms 36020 KB Output is correct
54 Correct 131 ms 36028 KB Output is correct
55 Correct 154 ms 36176 KB Output is correct
56 Correct 152 ms 36260 KB Output is correct
57 Correct 163 ms 36484 KB Output is correct
58 Correct 157 ms 36460 KB Output is correct
59 Correct 169 ms 36484 KB Output is correct
60 Correct 155 ms 36952 KB Output is correct
61 Correct 162 ms 42444 KB Output is correct
62 Correct 168 ms 42956 KB Output is correct
63 Correct 160 ms 42592 KB Output is correct
64 Correct 173 ms 42272 KB Output is correct
65 Correct 166 ms 36276 KB Output is correct
66 Correct 168 ms 36416 KB Output is correct
67 Correct 163 ms 36180 KB Output is correct
68 Correct 124 ms 36180 KB Output is correct
69 Correct 141 ms 35960 KB Output is correct
70 Correct 174 ms 42980 KB Output is correct
71 Correct 163 ms 41600 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 9 ms 3932 KB Output is correct
74 Correct 9 ms 3928 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 436 KB Output is correct
77 Correct 11 ms 4440 KB Output is correct
78 Correct 9 ms 4128 KB Output is correct
79 Correct 8 ms 3932 KB Output is correct
80 Correct 8 ms 3932 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 428 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 29 ms 4188 KB Output is correct
87 Correct 30 ms 4184 KB Output is correct
88 Correct 32 ms 4320 KB Output is correct
89 Correct 11 ms 4444 KB Output is correct
90 Correct 9 ms 3932 KB Output is correct
91 Correct 31 ms 4440 KB Output is correct
92 Correct 34 ms 4276 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 201 ms 48988 KB Output is correct
95 Correct 230 ms 47944 KB Output is correct
96 Correct 192 ms 46712 KB Output is correct
97 Correct 248 ms 48980 KB Output is correct
98 Correct 208 ms 49212 KB Output is correct
99 Correct 170 ms 36408 KB Output is correct
100 Correct 179 ms 36404 KB Output is correct
101 Correct 181 ms 36492 KB Output is correct
102 Correct 194 ms 36944 KB Output is correct
103 Correct 164 ms 41856 KB Output is correct
104 Correct 190 ms 42668 KB Output is correct
105 Correct 159 ms 41892 KB Output is correct
106 Correct 170 ms 42376 KB Output is correct
107 Correct 183 ms 42060 KB Output is correct
108 Correct 242 ms 48976 KB Output is correct
109 Correct 199 ms 48836 KB Output is correct
110 Correct 133 ms 36148 KB Output is correct
111 Correct 143 ms 36140 KB Output is correct
112 Correct 184 ms 36172 KB Output is correct
113 Correct 152 ms 36200 KB Output is correct