oj.uz

Submission #943971

# Submission time Handle Problem Language Result Execution time Memory
943971 2024-03-12T05:52:14 Z vjudge1 Railway (BOI17_railway) C++17
100 / 100
 194 ms 51588 KB 
#include <bits/stdc++.h>
using namespace std;
// typedefs...
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
// constants...
const double PI = acos(-1);
const ll mod = 1000000007; // 998244353
const ll INF = 1e9+5;
const ll INFLL = 1e18+5;
// defines...
#define PB        push_back
#define fi         first
#define se         second
#define boost_      ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define endl '\n'

// functions...
ll gcd(ll a, ll b){ while (b){ a %= b; swap(a, b);} return a;}
ll lcm(ll a, ll b){ return (a/gcd(a, b)*b);}
ll modpow(ll a,ll p,ll mod) {ll ans=1;while(p){if(p%2)ans=(ans*a)%mod;a=(a*a)%mod;p/=2;} return ans;}
ll inverse_mod(ll n,ll mod) {return modpow(n,mod-2,mod);}

const int N= 1e5+5,LOG= 18;
int depth[N],up[N][LOG], sz[N];
vector<pii> v[N];
vector<int> col[N], minister[N];
void dfs(int pos,int pre) {
   sz[pos] = 1;
   for(auto it:v[pos]) {
      if(it.fi==pre) continue;
      depth[it.fi]=depth[pos]+1;
      up[it.fi][0] = pos; 
      for(int j = 1; j < LOG; j++) 
      {
        up[it.fi][j] = up[up[it.fi][j-1]][j-1];
      }
      dfs(it.fi,pos);
      sz[pos] += sz[it.fi];
   }
   return ;
}
int kthancestor(int pos,int k) {
    for(int i=LOG-1;i>=0;i--) {
        if(k&(1<<i))
        pos=up[pos][i];
    }
    return pos;
}
int get_lca(int a, int b)  { 
    if(depth[a] < depth[b]) {
        swap(a, b);
    }
    // 1) Get same depth.
    int k = depth[a] - depth[b];
    a=kthancestor(a,k);
    // 2) if b was ancestor of a then now a==b
    if(a == b) {
        return a;
    }
    // 3) move both a and b with powers of two
    for(int j = LOG - 1; j >= 0; j--) {
        if(up[a][j] != up[b][j]) {
            a = up[a][j];
            b = up[b][j];
        }
    }
    return up[a][0];
}
int n, m, k;
set<int> subtree[N], ans;
void dfs_seg(int pos, int pre, int ind) {
    int big = -1, big_ind = -1;
    for(auto it : v[pos]) {
        if(it.fi == pre) continue;
        if(big == -1 || sz[big] < sz[it.fi]) {
            big = it.fi; big_ind = it.se;
        }
    }
    if(big == -1) {
        for(auto it : col[pos])
        subtree[pos].insert(it);
        for(auto it : minister[pos])
        subtree[pos].erase(it);
        if(subtree[pos].size() >= k) ans.insert(ind);
        return;
    }
    dfs_seg(big, pos, big_ind);
    swap(subtree[big], subtree[pos]);
    for(auto it : col[pos])
    subtree[pos].insert(it);
    
    for(auto it : v[pos]) {
        if(it.fi == pre || it.fi == big) continue;
        dfs_seg(it.fi, pos, it.se);
        for(auto itt : subtree[it.fi]) {
            subtree[pos].insert(itt);
        }
    }
    for(auto it : minister[pos])
        subtree[pos].erase(it);
    if(subtree[pos].size() >= k) ans.insert(ind);
}

void solve() {

    
    cin >> n >> m >> k;
    for(int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        v[x].PB({y, i}); v[y].PB({x, i});
    }
    dfs(1, 1);
    for(int i = 1; i <= m; i++) {
        int x, y, lc;
        cin >> x;
        vector<int> temp(x);
        for(int j = 0; j < x; j++) cin >> temp[j];
        for(int j = 0; j < x; j++) {
            if(j == 0) lc = temp[j];
            else lc = get_lca(lc, temp[j]);
            // cout << i << lc << endl;
        }
        minister[lc].PB(i);
        for(int j = 0; j < x; j++) {
            col[temp[j]].PB(i);
        }
    }
    dfs_seg(1, 1, 0);
    ans.erase(0);
    cout << ans.size() << endl;
    for(auto it : ans) cout << it << " ";
    cout << endl;
}
int main()
{
    boost_;
    int t = 1;
    // cin >> t;
    for(int i=1;i<=t;i++)
    {
        // cout<<"Case "<<i<<":\n";
        solve();
    }
}

Compilation message

railway.cpp: In function 'void dfs_seg(int, int, int)':
railway.cpp:87:32: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   87 |         if(subtree[pos].size() >= k) ans.insert(ind);
      |            ~~~~~~~~~~~~~~~~~~~~^~~~
railway.cpp:104:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  104 |     if(subtree[pos].size() >= k) ans.insert(ind);
      |        ~~~~~~~~~~~~~~~~~~~~^~~~
railway.cpp: In function 'void solve()':
railway.cpp:118:16: warning: unused variable 'y' [-Wunused-variable]
  118 |         int x, y, lc;
      |                ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 8 ms 15704 KB Output is correct
3 Correct 7 ms 15452 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 9 ms 16476 KB Output is correct
7 Correct 7 ms 15708 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 3 ms 12864 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12952 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 3 ms 12712 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 8 ms 15704 KB Output is correct
3 Correct 7 ms 15452 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 9 ms 16476 KB Output is correct
7 Correct 7 ms 15708 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 3 ms 12864 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12952 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 3 ms 12712 KB Output is correct
15 Correct 28 ms 19388 KB Output is correct
16 Correct 26 ms 19628 KB Output is correct
17 Correct 27 ms 19804 KB Output is correct
18 Correct 8 ms 16476 KB Output is correct
19 Correct 7 ms 15708 KB Output is correct
20 Correct 29 ms 21024 KB Output is correct
21 Correct 28 ms 20820 KB Output is correct
22 Correct 2 ms 12892 KB Output is correct
23 Correct 9 ms 15452 KB Output is correct
24 Correct 8 ms 15432 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 9 ms 16512 KB Output is correct
28 Correct 7 ms 15708 KB Output is correct
29 Correct 6 ms 15452 KB Output is correct
30 Correct 6 ms 15708 KB Output is correct
31 Correct 2 ms 12892 KB Output is correct
32 Correct 3 ms 12892 KB Output is correct
33 Correct 3 ms 12888 KB Output is correct
34 Correct 2 ms 12892 KB Output is correct
35 Correct 3 ms 12888 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 46396 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 138 ms 45564 KB Output is correct
4 Correct 102 ms 43092 KB Output is correct
5 Correct 95 ms 45540 KB Output is correct
6 Correct 119 ms 45652 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 35464 KB Output is correct
2 Correct 102 ms 33212 KB Output is correct
3 Correct 110 ms 37376 KB Output is correct
4 Correct 131 ms 46032 KB Output is correct
5 Correct 112 ms 40144 KB Output is correct
6 Correct 90 ms 36164 KB Output is correct
7 Correct 88 ms 35908 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 35464 KB Output is correct
2 Correct 102 ms 33212 KB Output is correct
3 Correct 110 ms 37376 KB Output is correct
4 Correct 131 ms 46032 KB Output is correct
5 Correct 112 ms 40144 KB Output is correct
6 Correct 90 ms 36164 KB Output is correct
7 Correct 88 ms 35908 KB Output is correct
8 Correct 84 ms 36180 KB Output is correct
9 Correct 83 ms 35924 KB Output is correct
10 Correct 96 ms 45752 KB Output is correct
11 Correct 94 ms 45520 KB Output is correct
12 Correct 59 ms 30548 KB Output is correct
13 Correct 57 ms 30568 KB Output is correct
14 Correct 92 ms 35660 KB Output is correct
15 Correct 115 ms 34816 KB Output is correct
16 Correct 140 ms 45520 KB Output is correct
17 Correct 125 ms 44244 KB Output is correct
18 Correct 129 ms 44248 KB Output is correct
19 Correct 101 ms 31676 KB Output is correct
20 Correct 84 ms 36824 KB Output is correct
21 Correct 93 ms 37328 KB Output is correct
22 Correct 89 ms 37088 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 8 ms 15704 KB Output is correct
3 Correct 7 ms 15452 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 9 ms 16476 KB Output is correct
7 Correct 7 ms 15708 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 3 ms 12864 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12952 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 3 ms 12712 KB Output is correct
15 Correct 28 ms 19388 KB Output is correct
16 Correct 26 ms 19628 KB Output is correct
17 Correct 27 ms 19804 KB Output is correct
18 Correct 8 ms 16476 KB Output is correct
19 Correct 7 ms 15708 KB Output is correct
20 Correct 29 ms 21024 KB Output is correct
21 Correct 28 ms 20820 KB Output is correct
22 Correct 2 ms 12892 KB Output is correct
23 Correct 9 ms 15452 KB Output is correct
24 Correct 8 ms 15432 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 9 ms 16512 KB Output is correct
28 Correct 7 ms 15708 KB Output is correct
29 Correct 6 ms 15452 KB Output is correct
30 Correct 6 ms 15708 KB Output is correct
31 Correct 2 ms 12892 KB Output is correct
32 Correct 3 ms 12892 KB Output is correct
33 Correct 3 ms 12888 KB Output is correct
34 Correct 2 ms 12892 KB Output is correct
35 Correct 3 ms 12888 KB Output is correct
36 Correct 124 ms 46396 KB Output is correct
37 Correct 2 ms 12892 KB Output is correct
38 Correct 138 ms 45564 KB Output is correct
39 Correct 102 ms 43092 KB Output is correct
40 Correct 95 ms 45540 KB Output is correct
41 Correct 119 ms 45652 KB Output is correct
42 Correct 82 ms 35464 KB Output is correct
43 Correct 102 ms 33212 KB Output is correct
44 Correct 110 ms 37376 KB Output is correct
45 Correct 131 ms 46032 KB Output is correct
46 Correct 112 ms 40144 KB Output is correct
47 Correct 90 ms 36164 KB Output is correct
48 Correct 88 ms 35908 KB Output is correct
49 Correct 84 ms 36180 KB Output is correct
50 Correct 83 ms 35924 KB Output is correct
51 Correct 96 ms 45752 KB Output is correct
52 Correct 94 ms 45520 KB Output is correct
53 Correct 59 ms 30548 KB Output is correct
54 Correct 57 ms 30568 KB Output is correct
55 Correct 92 ms 35660 KB Output is correct
56 Correct 115 ms 34816 KB Output is correct
57 Correct 140 ms 45520 KB Output is correct
58 Correct 125 ms 44244 KB Output is correct
59 Correct 129 ms 44248 KB Output is correct
60 Correct 101 ms 31676 KB Output is correct
61 Correct 84 ms 36824 KB Output is correct
62 Correct 93 ms 37328 KB Output is correct
63 Correct 89 ms 37088 KB Output is correct
64 Correct 97 ms 36948 KB Output is correct
65 Correct 194 ms 45660 KB Output is correct
66 Correct 121 ms 41864 KB Output is correct
67 Correct 105 ms 37060 KB Output is correct
68 Correct 55 ms 28400 KB Output is correct
69 Correct 56 ms 28440 KB Output is correct
70 Correct 121 ms 39432 KB Output is correct
71 Correct 80 ms 35664 KB Output is correct
72 Correct 2 ms 12888 KB Output is correct
73 Correct 7 ms 15452 KB Output is correct
74 Correct 7 ms 15452 KB Output is correct
75 Correct 2 ms 12892 KB Output is correct
76 Correct 2 ms 12892 KB Output is correct
77 Correct 9 ms 16492 KB Output is correct
78 Correct 7 ms 15708 KB Output is correct
79 Correct 6 ms 15636 KB Output is correct
80 Correct 8 ms 15704 KB Output is correct
81 Correct 3 ms 12892 KB Output is correct
82 Correct 3 ms 12892 KB Output is correct
83 Correct 2 ms 12892 KB Output is correct
84 Correct 2 ms 12720 KB Output is correct
85 Correct 2 ms 12892 KB Output is correct
86 Correct 26 ms 19548 KB Output is correct
87 Correct 26 ms 19636 KB Output is correct
88 Correct 27 ms 19856 KB Output is correct
89 Correct 8 ms 16476 KB Output is correct
90 Correct 7 ms 15708 KB Output is correct
91 Correct 30 ms 21168 KB Output is correct
92 Correct 27 ms 21024 KB Output is correct
93 Correct 2 ms 12892 KB Output is correct
94 Correct 118 ms 46444 KB Output is correct
95 Correct 129 ms 45056 KB Output is correct
96 Correct 99 ms 43096 KB Output is correct
97 Correct 107 ms 45392 KB Output is correct
98 Correct 100 ms 45488 KB Output is correct
99 Correct 121 ms 44240 KB Output is correct
100 Correct 130 ms 44236 KB Output is correct
101 Correct 147 ms 51588 KB Output is correct
102 Correct 97 ms 33108 KB Output is correct
103 Correct 89 ms 35876 KB Output is correct
104 Correct 93 ms 37388 KB Output is correct
105 Correct 87 ms 35440 KB Output is correct
106 Correct 96 ms 37172 KB Output is correct
107 Correct 92 ms 36396 KB Output is correct
108 Correct 101 ms 45648 KB Output is correct
109 Correct 94 ms 45644 KB Output is correct
110 Correct 57 ms 30524 KB Output is correct
111 Correct 62 ms 30620 KB Output is correct
112 Correct 101 ms 35792 KB Output is correct
113 Correct 102 ms 35152 KB Output is correct