oj.uz

답안 #884748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884748 2023-12-08T10:35:46 Z Shayan86 Railway (BOI17_railway) C++14
100 / 100
 108 ms 33108 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll L = 20;
const ll N = 1e5 + 50;
const ll Mod = 1e9 + 7;

ll n, m, k, st[N], timer, h[N], par[N][L], id[N], cnt[N];

vector<pii> adj[N];

void dfs(int v, int p = 0){
    par[v][0] = p;
    for(int i = 1; i < L; i++){
        if(!par[v][i-1]) break;
        par[v][i] = par[par[v][i-1]][i-1];
    }

    st[v] = ++timer;
    for(auto [u, i]: adj[v]){
        if(u == p) continue;
        h[u] = h[v] + 1; id[i] = u;
        dfs(u, v);
    }
}

int getPar(int v, int x){
    for(int i = 0; i < L; i++){
        if(x >> i & 1) v = par[v][i];
    }
    return v;
}

int lca(int v, int u){
    if(h[v] < h[u]) swap(u, v);
    v = getPar(v, h[v] - h[u]);
    if(u == v) return v;

    for(int i = L-1; i >= 0; i--){
        if(par[v][i] != par[u][i]){
            v = par[v][i]; u = par[u][i];
        }
    }
    return par[v][0];
}

void cal(int v){
    for(auto [u, i]: adj[v]){
        if(u == par[v][0]) continue;
        cal(u); cnt[v] += cnt[u];
    }
}

int main(){
    fast_io;

    cin >> n >> m >> k;

    int u, v;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        adj[u].pb(Mp(v, i));
        adj[v].pb(Mp(u, i));
    }

    dfs(1);

    while(m--){
        int si; cin >> si;

        set<pii> ver;
        for(int i = 1; i <= si; i++){
            cin >> v; ver.insert({st[v], v});
        }

        while(ver.size() > 1){
            auto lst1 = *ver.rbegin(); ver.erase(lst1);
            auto lst2 = *ver.rbegin();
            int l = lca(lst1.S, lst2.S);

            cnt[lst1.S]++; cnt[l]--;
            ver.insert({st[l], l});
        }
    }
    //for(int i = 1; i <= n; i++) cout << cnt[i] << sep;

    cal(1);

    int res = 0;
    for(int i = 1; i < n; i++) if(cnt[id[i]] >= k) res++;
    
    cout << res << endl;
    for(int i = 1; i < n; i++) if(cnt[id[i]] >= k) cout << i << sep;

}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:42:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   42 |     for(auto [u, i]: adj[v]){
      |              ^
railway.cpp: In function 'void cal(int)':
railway.cpp:70:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |     for(auto [u, i]: adj[v]){
      |              ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 4 ms 7256 KB Output is correct
3 Correct 4 ms 7260 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 4 ms 7260 KB Output is correct
8 Correct 3 ms 7260 KB Output is correct
9 Correct 3 ms 7260 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 4 ms 7256 KB Output is correct
3 Correct 4 ms 7260 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 4 ms 7260 KB Output is correct
8 Correct 3 ms 7260 KB Output is correct
9 Correct 3 ms 7260 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 25 ms 7256 KB Output is correct
16 Correct 25 ms 7324 KB Output is correct
17 Correct 25 ms 7336 KB Output is correct
18 Correct 5 ms 7516 KB Output is correct
19 Correct 4 ms 7260 KB Output is correct
20 Correct 22 ms 7372 KB Output is correct
21 Correct 27 ms 7368 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 4 ms 7260 KB Output is correct
24 Correct 4 ms 7260 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 5 ms 7708 KB Output is correct
28 Correct 4 ms 7260 KB Output is correct
29 Correct 4 ms 7148 KB Output is correct
30 Correct 3 ms 7260 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4696 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 32848 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 71 ms 32596 KB Output is correct
4 Correct 66 ms 32540 KB Output is correct
5 Correct 108 ms 32796 KB Output is correct
6 Correct 82 ms 33064 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 29012 KB Output is correct
2 Correct 62 ms 25692 KB Output is correct
3 Correct 59 ms 25216 KB Output is correct
4 Correct 56 ms 25180 KB Output is correct
5 Correct 58 ms 25180 KB Output is correct
6 Correct 57 ms 29020 KB Output is correct
7 Correct 55 ms 29020 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 29012 KB Output is correct
2 Correct 62 ms 25692 KB Output is correct
3 Correct 59 ms 25216 KB Output is correct
4 Correct 56 ms 25180 KB Output is correct
5 Correct 58 ms 25180 KB Output is correct
6 Correct 57 ms 29020 KB Output is correct
7 Correct 55 ms 29020 KB Output is correct
8 Correct 81 ms 29140 KB Output is correct
9 Correct 100 ms 29012 KB Output is correct
10 Correct 84 ms 33080 KB Output is correct
11 Correct 82 ms 33108 KB Output is correct
12 Correct 55 ms 25492 KB Output is correct
13 Correct 60 ms 25432 KB Output is correct
14 Correct 69 ms 25328 KB Output is correct
15 Correct 70 ms 25328 KB Output is correct
16 Correct 74 ms 25360 KB Output is correct
17 Correct 57 ms 25180 KB Output is correct
18 Correct 60 ms 25328 KB Output is correct
19 Correct 62 ms 25708 KB Output is correct
20 Correct 59 ms 29264 KB Output is correct
21 Correct 66 ms 29324 KB Output is correct
22 Correct 60 ms 29216 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 4 ms 7256 KB Output is correct
3 Correct 4 ms 7260 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 4 ms 7260 KB Output is correct
8 Correct 3 ms 7260 KB Output is correct
9 Correct 3 ms 7260 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 25 ms 7256 KB Output is correct
16 Correct 25 ms 7324 KB Output is correct
17 Correct 25 ms 7336 KB Output is correct
18 Correct 5 ms 7516 KB Output is correct
19 Correct 4 ms 7260 KB Output is correct
20 Correct 22 ms 7372 KB Output is correct
21 Correct 27 ms 7368 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 4 ms 7260 KB Output is correct
24 Correct 4 ms 7260 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 5 ms 7708 KB Output is correct
28 Correct 4 ms 7260 KB Output is correct
29 Correct 4 ms 7148 KB Output is correct
30 Correct 3 ms 7260 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4696 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 66 ms 32848 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 71 ms 32596 KB Output is correct
39 Correct 66 ms 32540 KB Output is correct
40 Correct 108 ms 32796 KB Output is correct
41 Correct 82 ms 33064 KB Output is correct
42 Correct 61 ms 29012 KB Output is correct
43 Correct 62 ms 25692 KB Output is correct
44 Correct 59 ms 25216 KB Output is correct
45 Correct 56 ms 25180 KB Output is correct
46 Correct 58 ms 25180 KB Output is correct
47 Correct 57 ms 29020 KB Output is correct
48 Correct 55 ms 29020 KB Output is correct
49 Correct 81 ms 29140 KB Output is correct
50 Correct 100 ms 29012 KB Output is correct
51 Correct 84 ms 33080 KB Output is correct
52 Correct 82 ms 33108 KB Output is correct
53 Correct 55 ms 25492 KB Output is correct
54 Correct 60 ms 25432 KB Output is correct
55 Correct 69 ms 25328 KB Output is correct
56 Correct 70 ms 25328 KB Output is correct
57 Correct 74 ms 25360 KB Output is correct
58 Correct 57 ms 25180 KB Output is correct
59 Correct 60 ms 25328 KB Output is correct
60 Correct 62 ms 25708 KB Output is correct
61 Correct 59 ms 29264 KB Output is correct
62 Correct 66 ms 29324 KB Output is correct
63 Correct 60 ms 29216 KB Output is correct
64 Correct 65 ms 29020 KB Output is correct
65 Correct 64 ms 25168 KB Output is correct
66 Correct 81 ms 25328 KB Output is correct
67 Correct 72 ms 25164 KB Output is correct
68 Correct 48 ms 25632 KB Output is correct
69 Correct 56 ms 25620 KB Output is correct
70 Correct 68 ms 29180 KB Output is correct
71 Correct 80 ms 29016 KB Output is correct
72 Correct 1 ms 4700 KB Output is correct
73 Correct 6 ms 7260 KB Output is correct
74 Correct 4 ms 7260 KB Output is correct
75 Correct 1 ms 4700 KB Output is correct
76 Correct 1 ms 4700 KB Output is correct
77 Correct 7 ms 7724 KB Output is correct
78 Correct 4 ms 7260 KB Output is correct
79 Correct 4 ms 7260 KB Output is correct
80 Correct 3 ms 7260 KB Output is correct
81 Correct 1 ms 4700 KB Output is correct
82 Correct 1 ms 4700 KB Output is correct
83 Correct 1 ms 4700 KB Output is correct
84 Correct 1 ms 4700 KB Output is correct
85 Correct 1 ms 4700 KB Output is correct
86 Correct 24 ms 7260 KB Output is correct
87 Correct 26 ms 7260 KB Output is correct
88 Correct 25 ms 7260 KB Output is correct
89 Correct 5 ms 7516 KB Output is correct
90 Correct 5 ms 7260 KB Output is correct
91 Correct 23 ms 7384 KB Output is correct
92 Correct 25 ms 7260 KB Output is correct
93 Correct 1 ms 4700 KB Output is correct
94 Correct 78 ms 32796 KB Output is correct
95 Correct 65 ms 32592 KB Output is correct
96 Correct 63 ms 32336 KB Output is correct
97 Correct 103 ms 33052 KB Output is correct
98 Correct 78 ms 33108 KB Output is correct
99 Correct 58 ms 25320 KB Output is correct
100 Correct 56 ms 25332 KB Output is correct
101 Correct 61 ms 25428 KB Output is correct
102 Correct 64 ms 25720 KB Output is correct
103 Correct 57 ms 29108 KB Output is correct
104 Correct 63 ms 29268 KB Output is correct
105 Correct 77 ms 29004 KB Output is correct
106 Correct 75 ms 29132 KB Output is correct
107 Correct 75 ms 29136 KB Output is correct
108 Correct 83 ms 33076 KB Output is correct
109 Correct 90 ms 33104 KB Output is correct
110 Correct 79 ms 25556 KB Output is correct
111 Correct 57 ms 25588 KB Output is correct
112 Correct 71 ms 25176 KB Output is correct
113 Correct 75 ms 25332 KB Output is correct