oj.uz

Submission #540560

# Submission time Handle Problem Language Result Execution time Memory
540560 2022-03-21T01:42:04 Z Evang Railway (BOI17_railway) C++17
100 / 100
 102 ms 25572 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

#ifdef _DEBUG
#define dout(x) clog << "Line " << __LINE__ << ": " << #x << "=" << (x) << el
#else
#define dout(x)
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define uid(a,b) uniform_int_distribution<int>(a,b)(rng)

#define ins insert
#define ssize(x) (int((x).size()))
#define bs(args...) binary_search(args)
#define lb(args...) lower_bound(args)
#define ub(args...) upper_bound(args)
#define all(x) (x).begin(),(x).end()
#define mp(a, b) make_pair(a, b)
#define mt(args...) make_tuple(args)
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define die exit(0)

template<typename T>
using vc = vector<T>;
template<typename T>
using uset = unordered_set<T>;
template<typename A, typename B>
using umap = unordered_map<A, B>;
template<typename T, typename Comp>
using pq = std::priority_queue<T, vc<T>, Comp>;
template<typename T>
using maxpq = pq<T, less<T>>;
template<typename T>
using minpq = pq<T, greater<T>>;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

using db = double;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vc<int>;
using vll = vc<ll>;
using vpi = vc<pi>;
using vpll = vc<pll>;
using str = string;

constexpr char el = '\n';
constexpr char sp = ' ';
constexpr int inf = 0x3f3f3f3f;
constexpr ll llinf = 0x3f3f3f3f3f3f3f3fLL;
// ---------------------------------------------------------------------


const int N = 1e5+5;
const int LG = 20;
// pa[i] = the ID of the edge connecting node i with i's parent
// cnt[i] = edge's i's value; how many Ministers need edge i
int n, m, k, pa[N], cnt[N], a[N], tin[N], tout[N], up[N][LG];
struct edge {
    edge(int x, int y): u(x), id(y) {}
    int u, id;
};
vc<edge> adj[N];

struct BIT {
    int bit[2*N];
    void _upd(int i, int x){
        while(i<=n){
            bit[i] += x;
            i += i&-i;
        }
    }
    int _qry(int r){
        int ans = 0;
        while(r>0){
            ans += bit[r];
            r -= r&-r;
        }
        return ans;
    }
    int _qry(int l, int r){
        return _qry(r) - _qry(l - 1);
    }
    void upd(int l, int r, int x){
        _upd(l, x);
        _upd(r+1, -x);
    }
    int qry(int i){
        return _qry(1, i);
    }
} bit;

void dfs(int v, int p){
    static int tim = 0;
    tin[v] = ++tim;
    up[v][0] = p;
    for(int i = 1; i < LG; ++i)
        up[v][i] = up[up[v][i-1]][i-1];

    for(auto[u, id]: adj[v])
        if(u!=p) {
            pa[u] = id;
            dfs(u, v);
        }
    tout[v] = tim;
}

bool is_anc(int x, int y){
    // is x y's ancestor?
    return tin[x] <= tin[y] && tout[y] <= tout[x];
}

int lca(int x, int y){
    if(is_anc(x, y))
        return x;

    for(int i = LG-1; i >= 0; --i)
        if(up[x][i]&&!is_anc(up[x][i], y))
            x = up[x][i];

    return up[x][0];
}

void upd(int x, int y){
    // increment all edges of the path from x to y
    // to increment an edge (v, u), where v is the parent,
    // increment a[u]
    if(is_anc(x, y)){
        cnt[pa[x]]--;
        cnt[pa[y]]++;
        return;
    }
    if(is_anc(y, x)){
        cnt[pa[y]]--;
        cnt[pa[x]]++;
        return;
    }

    int an = lca(x, y);
    cnt[pa[x]]++;
    cnt[pa[y]]++;
    cnt[pa[an]] -= 2;
}

void dfs2(int v, int p){
    for(auto[u, _]: adj[v]){
        if(u!=p) {
            dfs2(u, v);
            cnt[pa[v]] += cnt[pa[u]];
        }
    }
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cout << fixed; clog << fixed; clog << unitbuf;
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("debug.txt", "w", stderr);
#else
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
#endif

    cin >> n >> m >> k;
    for(int i = 1; i < n; ++i){
        int x, y;
        cin >> x >> y;
        adj[x].eb(y, i);
        adj[y].eb(x, i);
    }
    dfs(1, 0);

    while(m--){
        int s;
        cin >> s;
        vi b;
        for(int i = 0; i < s; ++i){
            int x;
            cin >> x;
            b.pb(x);
        }
        sort(all(b), [](int x, int y){
            return tin[x] < tin[y];
        });
        b.pb(b[0]);

        for(int i = 0; i < s; ++i)
            upd(b[i], b[i+1]);
    }

    dfs2(1, 0);

    int ans = 0;
    for(int i = 1; i < n; ++i)
        if(cnt[i]>=2*k)
            ++ans;

    cout << ans << el;
    for(int i = 1; i < n; ++i)
        if(cnt[i]>=2*k)
            cout << i << sp;

#ifdef _DEBUG
    clog << "Line " << __LINE__ << ":\n";
    for(int i = 1; i <= n; ++i)
        clog << pa[i] << sp;
    clog << el;
#endif

#ifdef _DEBUG
    clog << "Line " << __LINE__ << ":\n";
    for(int i = 1; i < n; ++i)
        clog << cnt[i] << sp;
    clog << el;
#endif
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 6 ms 4116 KB Output is correct
3 Correct 6 ms 4052 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2692 KB Output is correct
6 Correct 6 ms 4496 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4052 KB Output is correct
9 Correct 6 ms 4052 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 6 ms 4116 KB Output is correct
3 Correct 6 ms 4052 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2692 KB Output is correct
6 Correct 6 ms 4496 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4052 KB Output is correct
9 Correct 6 ms 4052 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 19 ms 4392 KB Output is correct
16 Correct 18 ms 4472 KB Output is correct
17 Correct 18 ms 4512 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 17 ms 4560 KB Output is correct
21 Correct 20 ms 4548 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 7 ms 4112 KB Output is correct
24 Correct 7 ms 4104 KB Output is correct
25 Correct 2 ms 2692 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 7 ms 4448 KB Output is correct
28 Correct 6 ms 4108 KB Output is correct
29 Correct 6 ms 4100 KB Output is correct
30 Correct 6 ms 4052 KB Output is correct
31 Correct 2 ms 2684 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2692 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 25272 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 64 ms 25020 KB Output is correct
4 Correct 73 ms 24800 KB Output is correct
5 Correct 66 ms 25164 KB Output is correct
6 Correct 66 ms 25500 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 21332 KB Output is correct
2 Correct 90 ms 17868 KB Output is correct
3 Correct 96 ms 17564 KB Output is correct
4 Correct 89 ms 17596 KB Output is correct
5 Correct 91 ms 17716 KB Output is correct
6 Correct 75 ms 21432 KB Output is correct
7 Correct 72 ms 21392 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 21332 KB Output is correct
2 Correct 90 ms 17868 KB Output is correct
3 Correct 96 ms 17564 KB Output is correct
4 Correct 89 ms 17596 KB Output is correct
5 Correct 91 ms 17716 KB Output is correct
6 Correct 75 ms 21432 KB Output is correct
7 Correct 72 ms 21392 KB Output is correct
8 Correct 83 ms 21380 KB Output is correct
9 Correct 83 ms 21372 KB Output is correct
10 Correct 66 ms 25260 KB Output is correct
11 Correct 64 ms 25196 KB Output is correct
12 Correct 63 ms 17328 KB Output is correct
13 Correct 63 ms 17280 KB Output is correct
14 Correct 92 ms 17484 KB Output is correct
15 Correct 97 ms 17452 KB Output is correct
16 Correct 100 ms 17572 KB Output is correct
17 Correct 91 ms 17484 KB Output is correct
18 Correct 90 ms 17576 KB Output is correct
19 Correct 92 ms 17956 KB Output is correct
20 Correct 75 ms 21464 KB Output is correct
21 Correct 80 ms 21588 KB Output is correct
22 Correct 75 ms 21452 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 6 ms 4116 KB Output is correct
3 Correct 6 ms 4052 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2692 KB Output is correct
6 Correct 6 ms 4496 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4052 KB Output is correct
9 Correct 6 ms 4052 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 19 ms 4392 KB Output is correct
16 Correct 18 ms 4472 KB Output is correct
17 Correct 18 ms 4512 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 17 ms 4560 KB Output is correct
21 Correct 20 ms 4548 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 7 ms 4112 KB Output is correct
24 Correct 7 ms 4104 KB Output is correct
25 Correct 2 ms 2692 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 7 ms 4448 KB Output is correct
28 Correct 6 ms 4108 KB Output is correct
29 Correct 6 ms 4100 KB Output is correct
30 Correct 6 ms 4052 KB Output is correct
31 Correct 2 ms 2684 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2692 KB Output is correct
36 Correct 67 ms 25272 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 64 ms 25020 KB Output is correct
39 Correct 73 ms 24800 KB Output is correct
40 Correct 66 ms 25164 KB Output is correct
41 Correct 66 ms 25500 KB Output is correct
42 Correct 74 ms 21332 KB Output is correct
43 Correct 90 ms 17868 KB Output is correct
44 Correct 96 ms 17564 KB Output is correct
45 Correct 89 ms 17596 KB Output is correct
46 Correct 91 ms 17716 KB Output is correct
47 Correct 75 ms 21432 KB Output is correct
48 Correct 72 ms 21392 KB Output is correct
49 Correct 83 ms 21380 KB Output is correct
50 Correct 83 ms 21372 KB Output is correct
51 Correct 66 ms 25260 KB Output is correct
52 Correct 64 ms 25196 KB Output is correct
53 Correct 63 ms 17328 KB Output is correct
54 Correct 63 ms 17280 KB Output is correct
55 Correct 92 ms 17484 KB Output is correct
56 Correct 97 ms 17452 KB Output is correct
57 Correct 100 ms 17572 KB Output is correct
58 Correct 91 ms 17484 KB Output is correct
59 Correct 90 ms 17576 KB Output is correct
60 Correct 92 ms 17956 KB Output is correct
61 Correct 75 ms 21464 KB Output is correct
62 Correct 80 ms 21588 KB Output is correct
63 Correct 75 ms 21452 KB Output is correct
64 Correct 83 ms 21456 KB Output is correct
65 Correct 96 ms 17576 KB Output is correct
66 Correct 97 ms 17616 KB Output is correct
67 Correct 88 ms 17408 KB Output is correct
68 Correct 63 ms 17200 KB Output is correct
69 Correct 60 ms 17268 KB Output is correct
70 Correct 86 ms 21576 KB Output is correct
71 Correct 83 ms 21324 KB Output is correct
72 Correct 2 ms 2644 KB Output is correct
73 Correct 6 ms 4052 KB Output is correct
74 Correct 6 ms 4040 KB Output is correct
75 Correct 2 ms 2688 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 6 ms 4492 KB Output is correct
78 Correct 6 ms 4180 KB Output is correct
79 Correct 5 ms 4052 KB Output is correct
80 Correct 5 ms 4108 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2644 KB Output is correct
85 Correct 2 ms 2684 KB Output is correct
86 Correct 18 ms 4488 KB Output is correct
87 Correct 18 ms 4392 KB Output is correct
88 Correct 18 ms 4476 KB Output is correct
89 Correct 8 ms 4436 KB Output is correct
90 Correct 7 ms 4108 KB Output is correct
91 Correct 18 ms 4564 KB Output is correct
92 Correct 19 ms 4564 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 67 ms 25308 KB Output is correct
95 Correct 69 ms 25088 KB Output is correct
96 Correct 60 ms 24744 KB Output is correct
97 Correct 63 ms 25144 KB Output is correct
98 Correct 71 ms 25572 KB Output is correct
99 Correct 90 ms 17560 KB Output is correct
100 Correct 88 ms 17556 KB Output is correct
101 Correct 97 ms 17548 KB Output is correct
102 Correct 92 ms 17992 KB Output is correct
103 Correct 77 ms 21380 KB Output is correct
104 Correct 75 ms 21588 KB Output is correct
105 Correct 76 ms 21432 KB Output is correct
106 Correct 102 ms 21476 KB Output is correct
107 Correct 85 ms 21352 KB Output is correct
108 Correct 63 ms 25220 KB Output is correct
109 Correct 61 ms 25224 KB Output is correct
110 Correct 61 ms 17376 KB Output is correct
111 Correct 62 ms 17292 KB Output is correct
112 Correct 84 ms 17440 KB Output is correct
113 Correct 87 ms 17412 KB Output is correct