oj.uz

Submission #336170

# Submission time Handle Problem Language Result Execution time Memory
336170 2020-12-14T23:30:34 Z 12tqian Railway (BOI17_railway) C++17
100 / 100
 381 ms 59316 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define sz(x) (int) (x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define resz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define f1r(i, a, b) for(int i = (a); i < (b); ++i)
#define f0r(i, a) f1r(i, 0, a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i,0,a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define trav(a, x) for (auto& a : x)

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

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> using V = vector<T>;

#ifdef LOCAL
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define dbg(...) 17;
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) { bool f = true; os << "{"; for (const auto &x : c) { if (!f) os << ", "; f = false; os << x; } return os << "}"; }
template<typename T> void debug(string s, T x) { cerr << s << " = " << x << "\n"; }
template<typename T, typename... Args> void debug(string s, T x, Args... args) { cerr << s.substr(0, s.find(',')) << " = " << x << " | "; debug(s.substr(s.find(',') + 2), args...); }

constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1, T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, int SZ> void re(array<T, SZ>& a);
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) {
        re(t); re(ts...); }
    template<class T> void re(complex<T>& x) { T a, b; re(a, b); x = cd(a, b); }
    template<class T1, class T2> void re(pair<T1, T2>& p) { re(p.f, p.s); }
    template<class T> void re(vector<T>& a) { F0R(i, sz(a)) re(a[i]); }
    template<class T, int SZ> void re(array<T, SZ>& a) { F0R(i, SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    template<class T1, class T2> void pr(const pair<T1, T2>& x);
    template<class T> void pr(const T& x);
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
        pr(t); pr(ts...); }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{", x.f, ", ", x.s, "}"); }
    template<class T> void pr(const T& x) {
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst ? ", " : "", a), fst = 0;
        pr("}"); }
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); }
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(), "r", stdin); }
    void setOut(string s) { freopen(s.c_str(), "w", stdout); }
    void setIO(string s = "") {
        cin.sync_with_stdio(0); cin.tie(0);
        if (sz(s)) { setIn(s + ".in"), setOut(s + ".out"); }
    }
}

using namespace io;

const int MOD = 1e9 + 7; // 998244353;
const ld PI = acos((ld) -1);

typedef std::decay <decltype(MOD)>::type mod_t;
struct mi {
    mod_t val;
    explicit operator mod_t() const { return val; }
    mi() { val = 0; }
    mi(const long long& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD; }
    friend std::istream& operator >> (std::istream& in, mi& a) {
        long long x; std::cin >> x; a = mi(x); return in; }
    friend std::ostream& operator << (std::ostream& os, const mi& a) { return os << a.val; }
    friend bool operator == (const mi& a, const mi& b) { return a.val == b.val; }
    friend bool operator != (const mi& a, const mi& b) { return !(a == b); }
    friend bool operator < (const mi& a, const mi& b) { return a.val < b.val; }
    friend bool operator > (const mi& a, const mi& b) { return a.val > b.val; }
    friend bool operator <= (const mi& a, const mi& b) { return a.val <= b.val; }
    friend bool operator >= (const mi& a, const mi& b) { return a.val >= b.val; }
    mi operator - () const { return mi(-val); }
    mi& operator += (const mi& m) {
        if ((val += m.val) >= MOD) val -= MOD;
        return *this; }
    mi& operator -= (const mi& m) {
        if ((val -= m.val) < 0) val += MOD;
        return *this; }
    mi& operator *= (const mi& m) { val = (long long) val * m.val % MOD;
        return *this; }
    friend mi pow(mi a, long long p) {
        mi ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p & 1) ans *= a;
        return ans; }
    friend mi inv(const mi& a) { assert(a != 0); return pow(a, MOD - 2); }
    mi& operator /= (const mi& m) { return (*this) *= inv(m); }
    friend mi operator + (mi a, const mi& b) { return a += b; }
    friend mi operator - (mi a, const mi& b) { return a -= b; }
    friend mi operator * (mi a, const mi& b) { return a *= b; }
    friend mi operator / (mi a, const mi& b) { return a /= b; }
};
typedef pair<mi, mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

struct LCAJump {
    int n;
    std::vector<std::vector<int>> par;
    std::vector<std::vector<int>> adj;
    std::vector<int> depth;
    void init(int _n) {
        n = _n;
        int d = 1;
        while ((1 << d) < n) d++;
        par.assign(d, std::vector<int>(n));
        adj.resize(n);
        depth.resize(n);
    }
    void ae(int x, int y) {
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    void gen(int root = 0) {
        par[0][root] = root;
        dfs(root);
    }
    void dfs(int src = 0) {
        for (int i = 1; i < par.size(); i++) {
            par[i][src] = par[i - 1][par[i - 1][src]];
        }
        for (int nxt: adj[src]) {
            if (nxt == par[0][src]) continue;
            depth[nxt] = depth[par[0][nxt] = src] + 1;
            dfs(nxt);
        }
    }
    int jump(int x, int d) {
        for (int i = 0; i < par.size(); i++) {
            if ((d >> i) & 1) {
                x = par[i][x];
            }
        }
        return x;
    }
    int lca(int x, int y) {
        if (depth[x] < depth[y]) std::swap(x, y);
        x = jump(x, depth[x] - depth[y]);
        if (x == y) return x;
        for (int i = par.size() - 1; i >= 0; i--) {
            int nx = par[i][x];
            int ny = par[i][y];
            if (nx != ny) x = nx, y = ny;
        }
        return par[0][x];
    }
};
 
int main() {
    setIO("");
    int n, m, k; re(n, m, k);
    vector<vi> adj(n);
    LCAJump L; L.init(n);
    auto cp = [&](int u, int v) -> pi {
        return {min(u, v), max(u, v)};
    };
    map<pi, int> conv;
    f0r(i, n-1) {
        int u, v; re(u, v);
        u--, v--;
        L.ae(u, v);
        adj[u].eb(v);
        adj[v].eb(u);
        conv[cp(u, v)] = i;
    }
    L.gen(0);
    vector<vi> rem(n);
    vector<vi> add(n);
    f0r(i, m) {
        int si; re(si);
        int lca = -1;
        f0r(j, si) {
            int x; re(x);
            x--;
            if (lca == -1) lca = x;
            else lca = L.lca(lca, x);
            add[x].eb(i);
        }
        rem[lca].eb(i);
    }
    vector<set<int>> store(n);
    vi cover(n);
    vi id(n);
    iota(all(id), 0);
    function<void(int, int)> dfs = [&](int src, int par) {
        for (int x : add[src]) 
           store[id[src]].ins(x);
        for (int nxt : adj[src]) {
            if (nxt == par) continue;
            dfs(nxt, src);
            if (sz(store[id[src]]) < sz(store[id[nxt]])) swap(id[src], id[nxt]);
            for (int x : store[id[nxt]]) store[id[src]].ins(x);
        }
        for (int x : rem[src]) {
            store[id[src]].erase(x);
            assert(store[id[src]].find(x) == store[id[src]].end());
        }
        cover[src] = sz(store[id[src]]);
    };
    dfs(0, -1);
    vi ans;
    f1r(i, 1, n) {
        if (cover[i] >= k) {
            int j = L.par[0][i];
            ans.eb(conv[cp(i, j)]);
        }
    }
    ps(sz(ans));
    sort(all(ans));
    for (int x : ans) pr(x+1, " ");
    ps();
    return 0;
}

Compilation message

railway.cpp: In member function 'void LCAJump::dfs(int)':
railway.cpp:229:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  229 |         for (int i = 1; i < par.size(); i++) {
      |                         ~~^~~~~~~~~~~~
railway.cpp: In member function 'int LCAJump::jump(int, int)':
railway.cpp:239:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  239 |         for (int i = 0; i < par.size(); i++) {
      |                         ~~^~~~~~~~~~~~
railway.cpp: In function 'void io::setIn(std::string)':
railway.cpp:153:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  153 |     void setIn(string s) { freopen(s.c_str(), "r", stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
railway.cpp: In function 'void io::setOut(std::string)':
railway.cpp:154:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  154 |     void setOut(string s) { freopen(s.c_str(), "w", stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 3820 KB Output is correct
3 Correct 11 ms 3820 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 12 ms 4588 KB Output is correct
7 Correct 14 ms 3948 KB Output is correct
8 Correct 10 ms 3948 KB Output is correct
9 Correct 11 ms 4076 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 3820 KB Output is correct
3 Correct 11 ms 3820 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 12 ms 4588 KB Output is correct
7 Correct 14 ms 3948 KB Output is correct
8 Correct 10 ms 3948 KB Output is correct
9 Correct 11 ms 4076 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 50 ms 9836 KB Output is correct
16 Correct 52 ms 9964 KB Output is correct
17 Correct 53 ms 10096 KB Output is correct
18 Correct 13 ms 4588 KB Output is correct
19 Correct 12 ms 4096 KB Output is correct
20 Correct 51 ms 9324 KB Output is correct
21 Correct 50 ms 9196 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 11 ms 3832 KB Output is correct
24 Correct 10 ms 3820 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 12 ms 4588 KB Output is correct
28 Correct 11 ms 3948 KB Output is correct
29 Correct 10 ms 4076 KB Output is correct
30 Correct 10 ms 4076 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 57296 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 265 ms 56804 KB Output is correct
4 Correct 252 ms 56364 KB Output is correct
5 Correct 240 ms 55780 KB Output is correct
6 Correct 215 ms 57700 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 48516 KB Output is correct
2 Correct 248 ms 45028 KB Output is correct
3 Correct 289 ms 51300 KB Output is correct
4 Correct 293 ms 51300 KB Output is correct
5 Correct 288 ms 51428 KB Output is correct
6 Correct 212 ms 48612 KB Output is correct
7 Correct 211 ms 48740 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 48516 KB Output is correct
2 Correct 248 ms 45028 KB Output is correct
3 Correct 289 ms 51300 KB Output is correct
4 Correct 293 ms 51300 KB Output is correct
5 Correct 288 ms 51428 KB Output is correct
6 Correct 212 ms 48612 KB Output is correct
7 Correct 211 ms 48740 KB Output is correct
8 Correct 218 ms 48356 KB Output is correct
9 Correct 222 ms 48228 KB Output is correct
10 Correct 204 ms 55396 KB Output is correct
11 Correct 201 ms 55372 KB Output is correct
12 Correct 180 ms 42340 KB Output is correct
13 Correct 175 ms 42340 KB Output is correct
14 Correct 241 ms 46364 KB Output is correct
15 Correct 245 ms 46564 KB Output is correct
16 Correct 281 ms 52324 KB Output is correct
17 Correct 285 ms 52708 KB Output is correct
18 Correct 267 ms 50660 KB Output is correct
19 Correct 255 ms 45668 KB Output is correct
20 Correct 215 ms 48996 KB Output is correct
21 Correct 220 ms 49124 KB Output is correct
22 Correct 219 ms 48960 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 3820 KB Output is correct
3 Correct 11 ms 3820 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 12 ms 4588 KB Output is correct
7 Correct 14 ms 3948 KB Output is correct
8 Correct 10 ms 3948 KB Output is correct
9 Correct 11 ms 4076 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 50 ms 9836 KB Output is correct
16 Correct 52 ms 9964 KB Output is correct
17 Correct 53 ms 10096 KB Output is correct
18 Correct 13 ms 4588 KB Output is correct
19 Correct 12 ms 4096 KB Output is correct
20 Correct 51 ms 9324 KB Output is correct
21 Correct 50 ms 9196 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 11 ms 3832 KB Output is correct
24 Correct 10 ms 3820 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 12 ms 4588 KB Output is correct
28 Correct 11 ms 3948 KB Output is correct
29 Correct 10 ms 4076 KB Output is correct
30 Correct 10 ms 4076 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 279 ms 57296 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 265 ms 56804 KB Output is correct
39 Correct 252 ms 56364 KB Output is correct
40 Correct 240 ms 55780 KB Output is correct
41 Correct 215 ms 57700 KB Output is correct
42 Correct 216 ms 48516 KB Output is correct
43 Correct 248 ms 45028 KB Output is correct
44 Correct 289 ms 51300 KB Output is correct
45 Correct 293 ms 51300 KB Output is correct
46 Correct 288 ms 51428 KB Output is correct
47 Correct 212 ms 48612 KB Output is correct
48 Correct 211 ms 48740 KB Output is correct
49 Correct 218 ms 48356 KB Output is correct
50 Correct 222 ms 48228 KB Output is correct
51 Correct 204 ms 55396 KB Output is correct
52 Correct 201 ms 55372 KB Output is correct
53 Correct 180 ms 42340 KB Output is correct
54 Correct 175 ms 42340 KB Output is correct
55 Correct 241 ms 46364 KB Output is correct
56 Correct 245 ms 46564 KB Output is correct
57 Correct 281 ms 52324 KB Output is correct
58 Correct 285 ms 52708 KB Output is correct
59 Correct 267 ms 50660 KB Output is correct
60 Correct 255 ms 45668 KB Output is correct
61 Correct 215 ms 48996 KB Output is correct
62 Correct 220 ms 49124 KB Output is correct
63 Correct 219 ms 48960 KB Output is correct
64 Correct 233 ms 48868 KB Output is correct
65 Correct 381 ms 59316 KB Output is correct
66 Correct 325 ms 55012 KB Output is correct
67 Correct 298 ms 50532 KB Output is correct
68 Correct 186 ms 40548 KB Output is correct
69 Correct 182 ms 40420 KB Output is correct
70 Correct 240 ms 50276 KB Output is correct
71 Correct 220 ms 48356 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 11 ms 3820 KB Output is correct
74 Correct 14 ms 3820 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 11 ms 4588 KB Output is correct
78 Correct 11 ms 3948 KB Output is correct
79 Correct 10 ms 4076 KB Output is correct
80 Correct 10 ms 4076 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 51 ms 9836 KB Output is correct
87 Correct 52 ms 9964 KB Output is correct
88 Correct 53 ms 9964 KB Output is correct
89 Correct 12 ms 4588 KB Output is correct
90 Correct 12 ms 4076 KB Output is correct
91 Correct 51 ms 9324 KB Output is correct
92 Correct 51 ms 9324 KB Output is correct
93 Correct 1 ms 364 KB Output is correct
94 Correct 271 ms 57188 KB Output is correct
95 Correct 268 ms 56548 KB Output is correct
96 Correct 247 ms 56292 KB Output is correct
97 Correct 242 ms 55780 KB Output is correct
98 Correct 224 ms 57700 KB Output is correct
99 Correct 310 ms 55012 KB Output is correct
100 Correct 286 ms 52196 KB Output is correct
101 Correct 286 ms 52580 KB Output is correct
102 Correct 253 ms 45412 KB Output is correct
103 Correct 217 ms 48612 KB Output is correct
104 Correct 218 ms 49252 KB Output is correct
105 Correct 216 ms 48356 KB Output is correct
106 Correct 217 ms 48740 KB Output is correct
107 Correct 218 ms 48612 KB Output is correct
108 Correct 203 ms 55396 KB Output is correct
109 Correct 205 ms 55396 KB Output is correct
110 Correct 183 ms 42340 KB Output is correct
111 Correct 176 ms 42468 KB Output is correct
112 Correct 248 ms 46252 KB Output is correct
113 Correct 248 ms 46180 KB Output is correct