oj.uz

Submission #943948

# Submission time Handle Problem Language Result Execution time Memory
943948 2024-03-12T05:20:23 Z vjudge1 Railway (BOI17_railway) C++17
100 / 100
 153 ms 47984 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) {
    
    for(auto it : v[pos]) {
        if(it.fi == pre) continue;
        dfs_seg(it.fi, pos, it.se);
        if(subtree[pos].size() < subtree[it.fi].size())
        swap(subtree[pos], subtree[it.fi]);
        for(auto itt : subtree[it.fi]) {
            subtree[pos].insert(itt);
        }
    }
    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);
}

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:28: 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: In function 'void solve()':
railway.cpp:101:16: warning: unused variable 'y' [-Wunused-variable]
  101 |         int x, y, lc;
      |                ^

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 7 ms 15452 KB Output is correct
3 Correct 7 ms 15432 KB Output is correct
4 Correct 3 ms 12888 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 8 ms 16476 KB Output is correct
7 Correct 7 ms 15708 KB Output is correct
8 Correct 6 ms 15708 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12888 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 27 ms 19804 KB Output is correct
16 Correct 27 ms 19900 KB Output is correct
17 Correct 28 ms 20052 KB Output is correct
18 Correct 8 ms 16220 KB Output is correct
19 Correct 7 ms 15708 KB Output is correct
20 Correct 30 ms 21588 KB Output is correct
21 Correct 31 ms 21376 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 7 ms 15620 KB Output is correct
24 Correct 7 ms 15452 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 16392 KB Output is correct
28 Correct 7 ms 15708 KB Output is correct
29 Correct 6 ms 15708 KB Output is correct
30 Correct 7 ms 15704 KB Output is correct
31 Correct 3 ms 12892 KB Output is correct
32 Correct 2 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12892 KB Output is correct
35 Correct 4 ms 12940 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 45140 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 120 ms 44116 KB Output is correct
4 Correct 94 ms 41552 KB Output is correct
5 Correct 92 ms 44164 KB Output is correct
6 Correct 97 ms 44436 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 35668 KB Output is correct
2 Correct 98 ms 33064 KB Output is correct
3 Correct 107 ms 38772 KB Output is correct
4 Correct 101 ms 38604 KB Output is correct
5 Correct 115 ms 38864 KB Output is correct
6 Correct 81 ms 36440 KB Output is correct
7 Correct 78 ms 35924 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 35668 KB Output is correct
2 Correct 98 ms 33064 KB Output is correct
3 Correct 107 ms 38772 KB Output is correct
4 Correct 101 ms 38604 KB Output is correct
5 Correct 115 ms 38864 KB Output is correct
6 Correct 81 ms 36440 KB Output is correct
7 Correct 78 ms 35924 KB Output is correct
8 Correct 83 ms 36444 KB Output is correct
9 Correct 85 ms 36188 KB Output is correct
10 Correct 102 ms 44368 KB Output is correct
11 Correct 92 ms 44104 KB Output is correct
12 Correct 61 ms 31828 KB Output is correct
13 Correct 58 ms 31936 KB Output is correct
14 Correct 92 ms 33668 KB Output is correct
15 Correct 100 ms 33872 KB Output is correct
16 Correct 108 ms 39792 KB Output is correct
17 Correct 106 ms 40232 KB Output is correct
18 Correct 137 ms 37928 KB Output is correct
19 Correct 106 ms 33348 KB Output is correct
20 Correct 85 ms 36992 KB Output is correct
21 Correct 99 ms 37764 KB Output is correct
22 Correct 87 ms 37352 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 7 ms 15452 KB Output is correct
3 Correct 7 ms 15432 KB Output is correct
4 Correct 3 ms 12888 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 8 ms 16476 KB Output is correct
7 Correct 7 ms 15708 KB Output is correct
8 Correct 6 ms 15708 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12888 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 27 ms 19804 KB Output is correct
16 Correct 27 ms 19900 KB Output is correct
17 Correct 28 ms 20052 KB Output is correct
18 Correct 8 ms 16220 KB Output is correct
19 Correct 7 ms 15708 KB Output is correct
20 Correct 30 ms 21588 KB Output is correct
21 Correct 31 ms 21376 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 7 ms 15620 KB Output is correct
24 Correct 7 ms 15452 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 16392 KB Output is correct
28 Correct 7 ms 15708 KB Output is correct
29 Correct 6 ms 15708 KB Output is correct
30 Correct 7 ms 15704 KB Output is correct
31 Correct 3 ms 12892 KB Output is correct
32 Correct 2 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12892 KB Output is correct
35 Correct 4 ms 12940 KB Output is correct
36 Correct 143 ms 45140 KB Output is correct
37 Correct 3 ms 12892 KB Output is correct
38 Correct 120 ms 44116 KB Output is correct
39 Correct 94 ms 41552 KB Output is correct
40 Correct 92 ms 44164 KB Output is correct
41 Correct 97 ms 44436 KB Output is correct
42 Correct 78 ms 35668 KB Output is correct
43 Correct 98 ms 33064 KB Output is correct
44 Correct 107 ms 38772 KB Output is correct
45 Correct 101 ms 38604 KB Output is correct
46 Correct 115 ms 38864 KB Output is correct
47 Correct 81 ms 36440 KB Output is correct
48 Correct 78 ms 35924 KB Output is correct
49 Correct 83 ms 36444 KB Output is correct
50 Correct 85 ms 36188 KB Output is correct
51 Correct 102 ms 44368 KB Output is correct
52 Correct 92 ms 44104 KB Output is correct
53 Correct 61 ms 31828 KB Output is correct
54 Correct 58 ms 31936 KB Output is correct
55 Correct 92 ms 33668 KB Output is correct
56 Correct 100 ms 33872 KB Output is correct
57 Correct 108 ms 39792 KB Output is correct
58 Correct 106 ms 40232 KB Output is correct
59 Correct 137 ms 37928 KB Output is correct
60 Correct 106 ms 33348 KB Output is correct
61 Correct 85 ms 36992 KB Output is correct
62 Correct 99 ms 37764 KB Output is correct
63 Correct 87 ms 37352 KB Output is correct
64 Correct 91 ms 36948 KB Output is correct
65 Correct 153 ms 47984 KB Output is correct
66 Correct 143 ms 43392 KB Output is correct
67 Correct 110 ms 38252 KB Output is correct
68 Correct 63 ms 29572 KB Output is correct
69 Correct 62 ms 29592 KB Output is correct
70 Correct 100 ms 39008 KB Output is correct
71 Correct 81 ms 35920 KB Output is correct
72 Correct 2 ms 12892 KB Output is correct
73 Correct 7 ms 15448 KB Output is correct
74 Correct 7 ms 15452 KB Output is correct
75 Correct 3 ms 12892 KB Output is correct
76 Correct 3 ms 12892 KB Output is correct
77 Correct 8 ms 16472 KB Output is correct
78 Correct 8 ms 15708 KB Output is correct
79 Correct 6 ms 15708 KB Output is correct
80 Correct 6 ms 15708 KB Output is correct
81 Correct 2 ms 12892 KB Output is correct
82 Correct 3 ms 12904 KB Output is correct
83 Correct 3 ms 12892 KB Output is correct
84 Correct 3 ms 12892 KB Output is correct
85 Correct 3 ms 12892 KB Output is correct
86 Correct 28 ms 20000 KB Output is correct
87 Correct 29 ms 20092 KB Output is correct
88 Correct 31 ms 20244 KB Output is correct
89 Correct 8 ms 16216 KB Output is correct
90 Correct 7 ms 15708 KB Output is correct
91 Correct 31 ms 21588 KB Output is correct
92 Correct 36 ms 21340 KB Output is correct
93 Correct 2 ms 12888 KB Output is correct
94 Correct 125 ms 45088 KB Output is correct
95 Correct 109 ms 43860 KB Output is correct
96 Correct 123 ms 41588 KB Output is correct
97 Correct 102 ms 43956 KB Output is correct
98 Correct 93 ms 44612 KB Output is correct
99 Correct 141 ms 42556 KB Output is correct
100 Correct 110 ms 39520 KB Output is correct
101 Correct 110 ms 39884 KB Output is correct
102 Correct 91 ms 32832 KB Output is correct
103 Correct 79 ms 36176 KB Output is correct
104 Correct 87 ms 37444 KB Output is correct
105 Correct 77 ms 35784 KB Output is correct
106 Correct 84 ms 37200 KB Output is correct
107 Correct 84 ms 36504 KB Output is correct
108 Correct 112 ms 44116 KB Output is correct
109 Correct 88 ms 44276 KB Output is correct
110 Correct 60 ms 31824 KB Output is correct
111 Correct 61 ms 31920 KB Output is correct
112 Correct 90 ms 33532 KB Output is correct
113 Correct 83 ms 33400 KB Output is correct