oj.uz

Submission #129905

# Submission time Handle Problem Language Result Execution time Memory
129905 2019-07-13T13:30:24 Z Abelyan Railway (BOI17_railway) C++17
100 / 100
 204 ms 25712 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
#define FOR(i,a) for (int i=0;i<(a);++i)
#define FORD(i,a) for (int i=(a)-1;i>=0;i--)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORTD(i,b,a) for (int i=(b);i>=(a);--i)
#define trav(i,v) for (auto i : v)
#define all(v) v.begin(),v.end()
#define ad push_back
#define fr first
#define sc second
#define mpr(a,b) make_pair(a,b)
#define pir pair<int,int>
#define all(v) v.begin(),v.end()
#define make_unique(v) v.erase(unique(all(v)),v.end())
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define srng mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define y1 EsiHancagorcRepa
 
const int N=1e5+10;
const ll MOD=1e9+7;
 
int n,m,k,lg,timer,tin[N],tout[N],anc[N][20],qan[N];;
vector<pir> g[N];
vector<int> ans;
 
void dfs(int v,int par=0){
    tin[v]=timer++;
    anc[v][0]=par;
    FORT(i,1,lg) anc[v][i]=anc[anc[v][i-1]][i-1];
 
    trav(tv,g[v]){
        int to=tv.fr;
        if (to==par){
            continue;
        }
        dfs(to,v);
    }
    tout[v]=timer++;
}
 
bool upper(int a,int b){
    return tin[a]<=tin[b] && tout[b]<=tout[a];
}
 
int lca(int a,int b){
    if (upper(a,b))return a;
    if (upper(b,a))return b;
    FORD(i,lg+1){
        if (!upper(anc[a][i],b)){
            a=anc[a][i];
        }
    }
    return anc[a][0];
}
 
int dfs2(int v,int par=0){
    int tiv=qan[v];
    //cout<<v<<" "<<tiv<<endl;
    trav(tv,g[v]){
        int to=tv.fr;
        if (to==par)continue;
        int cur=dfs2(to,v);
        if (cur>=k){
            ans.ad(tv.sc);
        }
        tiv+=cur;
    }
    return tiv;
}
set<int> st;
int get(int a){
    //cout<<tin[a]<<endl;
    if (st.lower_bound(tin[a])!=st.end() && *st.lower_bound(tin[a])==tin[a]) return a;
    FORD(i,lg+1){
        if (st.lower_bound(tin[anc[a][i]])==st.lower_bound(tout[anc[a][i]]+1)){
            a=anc[a][i];
            //cout<<"hey "<<a<<endl;
        }
    }
    return anc[a][0];
}
 
int main(){
    fastio;
    srng;
    cin>>n>>m>>k;
    FOR(i,n-1){
        int a,b;
        cin>>a>>b;
        a--;
        b--;
        g[a].ad({b,i+1});
        g[b].ad({a,i+1});
    }
    while((1<<lg)<=n)lg++;
    dfs(0);
    FOR(ttt,m){
        int s;
        cin>>s;
        vector<pir> vec;
        FOR(i,s){
            int a;
            cin>>a;
            a--;
            vec.ad({tin[a],a});
        }
        sort(all(vec));
        int lc=vec[0].sc;
        FORT(i,1,s-1){
            lc=lca(lc,vec[i].sc);
        }
        //cout<<lc<<endl;
        st.insert(tin[lc]);
        //cout<<"added "<<tin[lc]<<endl;
        FOR(i,s){
            qan[vec[i].sc]++;
            int verevin=get(vec[i].sc);
            //cout<<vec[i].sc<<" "<<verevin<<endl;
            qan[verevin]--;
            st.insert(tin[vec[i].sc]);
            //cout<<"added "<<tin[vec[i].sc]<<endl;
        }
        st.clear();
 
    }
    assert(dfs2(0)==0);
    cout<<ans.size()<<endl;
    sort(all(ans));
    FOR(i,ans.size()){
        cout<<ans[i]<<" ";
    }
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:8:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i,a) for (int i=0;i<(a);++i)
                                ^
railway.cpp:135:5: note: in expansion of macro 'FOR'
     FOR(i,ans.size()){
     ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 10 ms 4088 KB Output is correct
3 Correct 10 ms 4088 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 11 ms 4604 KB Output is correct
7 Correct 11 ms 4216 KB Output is correct
8 Correct 9 ms 4088 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 10 ms 4088 KB Output is correct
3 Correct 10 ms 4088 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 11 ms 4604 KB Output is correct
7 Correct 11 ms 4216 KB Output is correct
8 Correct 9 ms 4088 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 62 ms 4472 KB Output is correct
16 Correct 56 ms 4472 KB Output is correct
17 Correct 58 ms 4564 KB Output is correct
18 Correct 12 ms 4472 KB Output is correct
19 Correct 11 ms 4212 KB Output is correct
20 Correct 52 ms 4600 KB Output is correct
21 Correct 57 ms 4556 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 10 ms 4088 KB Output is correct
24 Correct 10 ms 4088 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 11 ms 4472 KB Output is correct
28 Correct 10 ms 4216 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 9 ms 4088 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 25404 KB Output is correct
2 Correct 5 ms 2740 KB Output is correct
3 Correct 170 ms 25204 KB Output is correct
4 Correct 138 ms 24436 KB Output is correct
5 Correct 179 ms 25300 KB Output is correct
6 Correct 204 ms 25712 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 20952 KB Output is correct
2 Correct 164 ms 17636 KB Output is correct
3 Correct 147 ms 17332 KB Output is correct
4 Correct 133 ms 17144 KB Output is correct
5 Correct 143 ms 17252 KB Output is correct
6 Correct 127 ms 21088 KB Output is correct
7 Correct 117 ms 20856 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 20952 KB Output is correct
2 Correct 164 ms 17636 KB Output is correct
3 Correct 147 ms 17332 KB Output is correct
4 Correct 133 ms 17144 KB Output is correct
5 Correct 143 ms 17252 KB Output is correct
6 Correct 127 ms 21088 KB Output is correct
7 Correct 117 ms 20856 KB Output is correct
8 Correct 161 ms 21156 KB Output is correct
9 Correct 168 ms 21124 KB Output is correct
10 Correct 194 ms 25456 KB Output is correct
11 Correct 202 ms 25448 KB Output is correct
12 Correct 129 ms 17096 KB Output is correct
13 Correct 128 ms 17064 KB Output is correct
14 Correct 155 ms 17288 KB Output is correct
15 Correct 146 ms 17120 KB Output is correct
16 Correct 134 ms 17260 KB Output is correct
17 Correct 139 ms 17248 KB Output is correct
18 Correct 135 ms 17252 KB Output is correct
19 Correct 137 ms 17712 KB Output is correct
20 Correct 125 ms 21228 KB Output is correct
21 Correct 126 ms 21272 KB Output is correct
22 Correct 131 ms 21268 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 10 ms 4088 KB Output is correct
3 Correct 10 ms 4088 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 11 ms 4604 KB Output is correct
7 Correct 11 ms 4216 KB Output is correct
8 Correct 9 ms 4088 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 62 ms 4472 KB Output is correct
16 Correct 56 ms 4472 KB Output is correct
17 Correct 58 ms 4564 KB Output is correct
18 Correct 12 ms 4472 KB Output is correct
19 Correct 11 ms 4212 KB Output is correct
20 Correct 52 ms 4600 KB Output is correct
21 Correct 57 ms 4556 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 10 ms 4088 KB Output is correct
24 Correct 10 ms 4088 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 11 ms 4472 KB Output is correct
28 Correct 10 ms 4216 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 9 ms 4088 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 139 ms 25404 KB Output is correct
37 Correct 5 ms 2740 KB Output is correct
38 Correct 170 ms 25204 KB Output is correct
39 Correct 138 ms 24436 KB Output is correct
40 Correct 179 ms 25300 KB Output is correct
41 Correct 204 ms 25712 KB Output is correct
42 Correct 122 ms 20952 KB Output is correct
43 Correct 164 ms 17636 KB Output is correct
44 Correct 147 ms 17332 KB Output is correct
45 Correct 133 ms 17144 KB Output is correct
46 Correct 143 ms 17252 KB Output is correct
47 Correct 127 ms 21088 KB Output is correct
48 Correct 117 ms 20856 KB Output is correct
49 Correct 161 ms 21156 KB Output is correct
50 Correct 168 ms 21124 KB Output is correct
51 Correct 194 ms 25456 KB Output is correct
52 Correct 202 ms 25448 KB Output is correct
53 Correct 129 ms 17096 KB Output is correct
54 Correct 128 ms 17064 KB Output is correct
55 Correct 155 ms 17288 KB Output is correct
56 Correct 146 ms 17120 KB Output is correct
57 Correct 134 ms 17260 KB Output is correct
58 Correct 139 ms 17248 KB Output is correct
59 Correct 135 ms 17252 KB Output is correct
60 Correct 137 ms 17712 KB Output is correct
61 Correct 125 ms 21228 KB Output is correct
62 Correct 126 ms 21272 KB Output is correct
63 Correct 131 ms 21268 KB Output is correct
64 Correct 131 ms 21424 KB Output is correct
65 Correct 153 ms 17412 KB Output is correct
66 Correct 159 ms 17224 KB Output is correct
67 Correct 146 ms 17164 KB Output is correct
68 Correct 110 ms 16888 KB Output is correct
69 Correct 110 ms 17088 KB Output is correct
70 Correct 134 ms 21652 KB Output is correct
71 Correct 156 ms 21112 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 10 ms 4048 KB Output is correct
74 Correct 10 ms 4088 KB Output is correct
75 Correct 5 ms 2680 KB Output is correct
76 Correct 4 ms 2680 KB Output is correct
77 Correct 13 ms 4472 KB Output is correct
78 Correct 18 ms 4216 KB Output is correct
79 Correct 9 ms 4092 KB Output is correct
80 Correct 9 ms 4088 KB Output is correct
81 Correct 4 ms 2680 KB Output is correct
82 Correct 4 ms 2748 KB Output is correct
83 Correct 4 ms 2680 KB Output is correct
84 Correct 4 ms 2680 KB Output is correct
85 Correct 4 ms 2680 KB Output is correct
86 Correct 57 ms 4492 KB Output is correct
87 Correct 57 ms 4500 KB Output is correct
88 Correct 58 ms 4496 KB Output is correct
89 Correct 11 ms 4600 KB Output is correct
90 Correct 10 ms 4216 KB Output is correct
91 Correct 52 ms 4600 KB Output is correct
92 Correct 59 ms 4600 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 139 ms 25328 KB Output is correct
95 Correct 140 ms 25048 KB Output is correct
96 Correct 145 ms 24464 KB Output is correct
97 Correct 186 ms 25324 KB Output is correct
98 Correct 203 ms 25672 KB Output is correct
99 Correct 143 ms 17144 KB Output is correct
100 Correct 141 ms 17272 KB Output is correct
101 Correct 141 ms 17252 KB Output is correct
102 Correct 135 ms 17528 KB Output is correct
103 Correct 123 ms 20984 KB Output is correct
104 Correct 123 ms 21432 KB Output is correct
105 Correct 116 ms 20984 KB Output is correct
106 Correct 162 ms 21368 KB Output is correct
107 Correct 159 ms 21112 KB Output is correct
108 Correct 193 ms 25440 KB Output is correct
109 Correct 196 ms 25452 KB Output is correct
110 Correct 125 ms 17016 KB Output is correct
111 Correct 132 ms 17056 KB Output is correct
112 Correct 143 ms 17272 KB Output is correct
113 Correct 140 ms 17156 KB Output is correct