oj.uz

Submission #619314

# Submission time Handle Problem Language Result Execution time Memory
619314 2022-08-02T11:06:07 Z Soul234 Railway (BOI17_railway) C++14
100 / 100
 127 ms 24508 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#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 each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

struct BIT {
    int N;
    vi bit;
    void init(int _N) {
        N = _N;
        bit.assign(N+7, 0);
    }
    void upd(int p, int val) {
        for(; p<=N; p+=p&-p) bit[p] += val;
    }
    int query(int l, int r) {
        int res = 0;
        for(; r>0; r -= r&-r) res += bit[r];
        for(--l; l>0; l -= l&-l) res -= bit[l];
        return res;
    }
} fen;

const int MX = 1e5+5, LG = 19;
int N, M, K, tin[MX], tout[MX], dep[MX], par[MX][LG], tt, edgeID[MX];
V<pi> adj[MX];

void dfs(int u, int p) {
    tin[u] = ++tt;
    each(ed, adj[u]) if(ed.first != p) {
        int v = ed.first;
        dep[v] = dep[par[v][0] = u] + 1;
        edgeID[v] = ed.second;
        dfs(v, u);
    }
    tout[u] = tt;
}

int get_lca(int a, int b) {
    if(dep[a] < dep[b]) swap(a,b);
    int d = dep[a] - dep[b];
    R0F(i,LG) if(d>>i&1) a = par[a][i];
    if(a == b) return a;
    R0F(i,LG) if(par[a][i] != par[b][i]) {
        a = par[a][i];
        b = par[b][i];
    }
    return par[a][0];
}

bool cmp(const int &a, const int &b) {
    return tin[a] < tin[b];
}

void solve() {
    cin>>N>>M>>K;
    fen.init(N+5);
    F0R(i,N-1) {
        int u,v;
        cin>>u>>v;
        adj[u].pb({v, i+1});
        adj[v].pb({u, i+1});
    }
    par[1][0] = 1;
    dep[1] = 0;
    dfs(1, -1);
    FOR(j,1,LG) FOR(i,1,N+1) par[i][j] = par[par[i][j-1]][j-1];
    F0R(_, M) {
        int amt; cin>>amt;
        vi lst;
        F0R(i, amt) {
            int v; cin>>v;
            lst.pb(v);
        }
        sort(all(lst), cmp);
        F0R(i,sz(lst)) {
            int nxt = (i+1)%sz(lst);
            fen.upd(tin[lst[i]], 1);
            fen.upd(tin[lst[nxt]], 1);
            fen.upd(tin[get_lca(lst[i], lst[nxt])], -2);
        }
    }
    vi ans;
    FOR(i,2,N+1) if(fen.query(tin[i], tout[i]) >= 2*K) {
        ans.pb(edgeID[i]);
    }
    sort(all(ans));
    cout << sz(ans) << nl;
    each(v, ans) cout << v << " ";
    cout << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

railway.cpp: In function 'void setIO(std::string)':
railway.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2680 KB Output is correct
2 Correct 5 ms 4016 KB Output is correct
3 Correct 6 ms 4052 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4132 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 1 ms 2688 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2680 KB Output is correct
2 Correct 5 ms 4016 KB Output is correct
3 Correct 6 ms 4052 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4132 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 1 ms 2688 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 24 ms 4468 KB Output is correct
16 Correct 25 ms 4488 KB Output is correct
17 Correct 24 ms 4468 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 25 ms 4564 KB Output is correct
21 Correct 30 ms 4488 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 9 ms 4052 KB Output is correct
24 Correct 6 ms 4052 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 4180 KB Output is correct
29 Correct 6 ms 4140 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 2 ms 2692 KB Output is correct
33 Correct 2 ms 2748 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 24120 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 87 ms 23848 KB Output is correct
4 Correct 90 ms 23268 KB Output is correct
5 Correct 93 ms 24132 KB Output is correct
6 Correct 92 ms 24508 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 20600 KB Output is correct
2 Correct 83 ms 17912 KB Output is correct
3 Correct 83 ms 17576 KB Output is correct
4 Correct 85 ms 17484 KB Output is correct
5 Correct 82 ms 17468 KB Output is correct
6 Correct 72 ms 20708 KB Output is correct
7 Correct 77 ms 20660 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 20600 KB Output is correct
2 Correct 83 ms 17912 KB Output is correct
3 Correct 83 ms 17576 KB Output is correct
4 Correct 85 ms 17484 KB Output is correct
5 Correct 82 ms 17468 KB Output is correct
6 Correct 72 ms 20708 KB Output is correct
7 Correct 77 ms 20660 KB Output is correct
8 Correct 82 ms 20712 KB Output is correct
9 Correct 78 ms 20840 KB Output is correct
10 Correct 95 ms 24244 KB Output is correct
11 Correct 82 ms 24120 KB Output is correct
12 Correct 71 ms 17288 KB Output is correct
13 Correct 67 ms 17352 KB Output is correct
14 Correct 79 ms 17484 KB Output is correct
15 Correct 78 ms 17456 KB Output is correct
16 Correct 83 ms 17600 KB Output is correct
17 Correct 107 ms 17576 KB Output is correct
18 Correct 86 ms 17476 KB Output is correct
19 Correct 95 ms 17896 KB Output is correct
20 Correct 78 ms 20972 KB Output is correct
21 Correct 74 ms 21064 KB Output is correct
22 Correct 73 ms 20968 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2680 KB Output is correct
2 Correct 5 ms 4016 KB Output is correct
3 Correct 6 ms 4052 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 6 ms 4180 KB Output is correct
8 Correct 5 ms 4132 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 1 ms 2688 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 24 ms 4468 KB Output is correct
16 Correct 25 ms 4488 KB Output is correct
17 Correct 24 ms 4468 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4180 KB Output is correct
20 Correct 25 ms 4564 KB Output is correct
21 Correct 30 ms 4488 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 9 ms 4052 KB Output is correct
24 Correct 6 ms 4052 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 4180 KB Output is correct
29 Correct 6 ms 4140 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 2 ms 2692 KB Output is correct
33 Correct 2 ms 2748 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 115 ms 24120 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 87 ms 23848 KB Output is correct
39 Correct 90 ms 23268 KB Output is correct
40 Correct 93 ms 24132 KB Output is correct
41 Correct 92 ms 24508 KB Output is correct
42 Correct 72 ms 20600 KB Output is correct
43 Correct 83 ms 17912 KB Output is correct
44 Correct 83 ms 17576 KB Output is correct
45 Correct 85 ms 17484 KB Output is correct
46 Correct 82 ms 17468 KB Output is correct
47 Correct 72 ms 20708 KB Output is correct
48 Correct 77 ms 20660 KB Output is correct
49 Correct 82 ms 20712 KB Output is correct
50 Correct 78 ms 20840 KB Output is correct
51 Correct 95 ms 24244 KB Output is correct
52 Correct 82 ms 24120 KB Output is correct
53 Correct 71 ms 17288 KB Output is correct
54 Correct 67 ms 17352 KB Output is correct
55 Correct 79 ms 17484 KB Output is correct
56 Correct 78 ms 17456 KB Output is correct
57 Correct 83 ms 17600 KB Output is correct
58 Correct 107 ms 17576 KB Output is correct
59 Correct 86 ms 17476 KB Output is correct
60 Correct 95 ms 17896 KB Output is correct
61 Correct 78 ms 20972 KB Output is correct
62 Correct 74 ms 21064 KB Output is correct
63 Correct 73 ms 20968 KB Output is correct
64 Correct 86 ms 20836 KB Output is correct
65 Correct 96 ms 17580 KB Output is correct
66 Correct 97 ms 17484 KB Output is correct
67 Correct 90 ms 17448 KB Output is correct
68 Correct 63 ms 17232 KB Output is correct
69 Correct 69 ms 17164 KB Output is correct
70 Correct 78 ms 21140 KB Output is correct
71 Correct 78 ms 20460 KB Output is correct
72 Correct 1 ms 2644 KB Output is correct
73 Correct 5 ms 4180 KB Output is correct
74 Correct 6 ms 4052 KB Output is correct
75 Correct 2 ms 2684 KB Output is correct
76 Correct 1 ms 2644 KB Output is correct
77 Correct 6 ms 4436 KB Output is correct
78 Correct 5 ms 4104 KB Output is correct
79 Correct 5 ms 4052 KB Output is correct
80 Correct 5 ms 4052 KB Output is correct
81 Correct 1 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 1 ms 2644 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 24 ms 4448 KB Output is correct
87 Correct 25 ms 4488 KB Output is correct
88 Correct 24 ms 4484 KB Output is correct
89 Correct 6 ms 4436 KB Output is correct
90 Correct 6 ms 4104 KB Output is correct
91 Correct 26 ms 4576 KB Output is correct
92 Correct 37 ms 4536 KB Output is correct
93 Correct 1 ms 2644 KB Output is correct
94 Correct 115 ms 24116 KB Output is correct
95 Correct 96 ms 23796 KB Output is correct
96 Correct 103 ms 23224 KB Output is correct
97 Correct 106 ms 24112 KB Output is correct
98 Correct 101 ms 24500 KB Output is correct
99 Correct 123 ms 17540 KB Output is correct
100 Correct 103 ms 17580 KB Output is correct
101 Correct 79 ms 17580 KB Output is correct
102 Correct 80 ms 17888 KB Output is correct
103 Correct 97 ms 20708 KB Output is correct
104 Correct 91 ms 21060 KB Output is correct
105 Correct 78 ms 20632 KB Output is correct
106 Correct 85 ms 20812 KB Output is correct
107 Correct 119 ms 20724 KB Output is correct
108 Correct 93 ms 24240 KB Output is correct
109 Correct 127 ms 24132 KB Output is correct
110 Correct 72 ms 17248 KB Output is correct
111 Correct 87 ms 17372 KB Output is correct
112 Correct 98 ms 17456 KB Output is correct
113 Correct 87 ms 17464 KB Output is correct