oj.uz

답안 #171261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171261 2019-12-28T06:20:02 Z mehrdad_sohrabi Railway (BOI17_railway) C++14
100 / 100
 599 ms 47184 KB 
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
using namespace std;
/// khodaya komak kon
/// ya navid navid
const int N=2e5+100,M=22;
vector <int> g[N];
ll par[N][22];
ll hi[N];
ll st[N];
ll fn[N],tss=1;
ll dfs(ll v,ll p,ll h){
    hi[v]=h;
    st[v]=tss;
    for (int i=0;i<g[v].size();i++){
        ll u=g[v][i];
        if (u==p) continue;
        par[u][0]=v;
        tss++;
        dfs(u,v,h+1);
    }
    tss++;
    fn[v]=tss;
}
ll getpar(ll v,ll h){
    if (h==-1 || h==0){
        return v;
    }
    for(int i=0;i<M;i++){
        if (h & (1 << i)) v = par[v][i];
    }
    return v;
}
int lca(int v, int u) {
    if (hi[v]<hi[u]){
        ll y=v;
        v=u;
        u=y;
    }
    v = getpar(v,hi[v]-hi[u]);
    if (v==u){
        return v;
    }
    for(int i=20;i>=0;i--){
        if (par[v][i] != par[u][i]) {
            v=par[v][i];
            u=par[u][i];
        }

    }
    return par[v][0];
}
ll vis[N];
ll val[N];
ll dp[N];
ll dfss(ll v,ll p){
    dp[v]=val[v];
    for (int i=0;i<g[v].size();i++){
        ll u=g[v][i];
        if (u==p) continue;
        dfss(u,v);
        dp[v]+=dp[u];
    }
}
map <pii,int> mp;
int32_t main(){
    ll n,m,k;
    cin >> n >> m >> k;
    for (int i=0;i<n-1;i++){
        ll u,v;
        cin >> u >> v;
        g[v].pb(u);
        g[u].pb(v);
        mp[{u,v}]=i+1;
        mp[{v,u}]=i+1;
    }
    dfs(1,1,1);
    par[1][0]=1;
    for (int i=1;i<M;i++){
        for (int j=1;j<=n;j++){
            par[j][i]=par[par[j][i-1]][i-1];
        }
    }
    for (int i=0;i<m;i++){
        ll x;
        cin >> x;
        vector <pair <pii,int> > a,d;
        for (int j=0;j<x;j++){
            ll v;
            cin >> v;
            a.pb({{st[v],fn[v]},v});
        }
        sort(a.begin(),a.end());
        for (int i=0;i<a.size();i++){
            vis[a[i].S]=1;
            d.pb(a[i]);
        }
        if (a.size()){
            a.pb(a[0]);
        }
        for (int i=1;i<a.size();i++){
            ll v=a[i].S,u=a[i-1].S;
            ll f=lca(v,u);
            //cout << v << " " << u << " f " << f << endl;
            if (!vis[f]) d.pb({{st[f],fn[f]},f});
            vis[f]=1;
        }
        sort(d.begin(),d.end());
        vector <pii> b;
        b.pb({1e9+100,0});
        for (int i=0;i<d.size();i++){
            while(d[i].F.S>=b.back().F) b.pop_back();
            ll v=b.back().S;
            if (v!=0){
                /// yrkari monde
                val[d[i].S]++;
                val[v]--;
                //cout << d[i].S << " yal " << v << endl;
            }

            b.pb({d[i].F.S,d[i].S});
        }
        for (int i=0;i<d.size();i++){
            vis[d[i].S]=0;
        }
    }

    dfss(1,1);
    ll ans=0;
    vector <int> p;
    for (int i=1;i<=n;i++){
        if (dp[i]>=k){
            ans++;
            p.pb(mp[{i,par[i][0]}]);
        }
    }
    sort(p.begin(),p.end());
    cout << ans << endl;
    for (int i=0;i<p.size();i++){
        cout << p[i] << " " ;
    }
}

Compilation message

railway.cpp: In function 'll dfs(ll, ll, ll)':
railway.cpp:25:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<g[v].size();i++){
                  ~^~~~~~~~~~~~
railway.cpp:34:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
railway.cpp: In function 'll dfss(ll, ll)':
railway.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<g[v].size();i++){
                  ~^~~~~~~~~~~~
railway.cpp:74:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
railway.cpp: In function 'int32_t main()':
railway.cpp:104:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<a.size();i++){
                      ~^~~~~~~~~
railway.cpp:111:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=1;i<a.size();i++){
                      ~^~~~~~~~~
railway.cpp:121:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<d.size();i++){
                      ~^~~~~~~~~
railway.cpp:133:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<d.size();i++){
                      ~^~~~~~~~~
railway.cpp:149:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<p.size();i++){
                  ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 32 ms 8824 KB Output is correct
3 Correct 28 ms 8824 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 12 ms 5112 KB Output is correct
6 Correct 30 ms 9080 KB Output is correct
7 Correct 32 ms 9080 KB Output is correct
8 Correct 27 ms 8952 KB Output is correct
9 Correct 19 ms 8952 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 32 ms 8824 KB Output is correct
3 Correct 28 ms 8824 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 12 ms 5112 KB Output is correct
6 Correct 30 ms 9080 KB Output is correct
7 Correct 32 ms 9080 KB Output is correct
8 Correct 27 ms 8952 KB Output is correct
9 Correct 19 ms 8952 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 88 ms 8976 KB Output is correct
16 Correct 90 ms 9100 KB Output is correct
17 Correct 92 ms 9080 KB Output is correct
18 Correct 33 ms 9080 KB Output is correct
19 Correct 31 ms 8952 KB Output is correct
20 Correct 89 ms 9096 KB Output is correct
21 Correct 94 ms 8952 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 32 ms 8952 KB Output is correct
24 Correct 30 ms 8824 KB Output is correct
25 Correct 8 ms 5112 KB Output is correct
26 Correct 7 ms 5112 KB Output is correct
27 Correct 33 ms 9212 KB Output is correct
28 Correct 37 ms 8984 KB Output is correct
29 Correct 26 ms 8952 KB Output is correct
30 Correct 35 ms 8860 KB Output is correct
31 Correct 0 ms 5112 KB Output is correct
32 Correct 7 ms 5112 KB Output is correct
33 Correct 21 ms 5112 KB Output is correct
34 Correct 6 ms 5112 KB Output is correct
35 Correct 7 ms 5112 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 448 ms 47000 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 438 ms 46428 KB Output is correct
4 Correct 415 ms 45508 KB Output is correct
5 Correct 420 ms 47056 KB Output is correct
6 Correct 412 ms 47176 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 43908 KB Output is correct
2 Correct 476 ms 43356 KB Output is correct
3 Correct 518 ms 43384 KB Output is correct
4 Correct 482 ms 43356 KB Output is correct
5 Correct 513 ms 43228 KB Output is correct
6 Correct 482 ms 44152 KB Output is correct
7 Correct 402 ms 44024 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 43908 KB Output is correct
2 Correct 476 ms 43356 KB Output is correct
3 Correct 518 ms 43384 KB Output is correct
4 Correct 482 ms 43356 KB Output is correct
5 Correct 513 ms 43228 KB Output is correct
6 Correct 482 ms 44152 KB Output is correct
7 Correct 402 ms 44024 KB Output is correct
8 Correct 433 ms 44972 KB Output is correct
9 Correct 428 ms 44920 KB Output is correct
10 Correct 426 ms 47184 KB Output is correct
11 Correct 457 ms 47112 KB Output is correct
12 Correct 332 ms 43512 KB Output is correct
13 Correct 365 ms 43636 KB Output is correct
14 Correct 450 ms 43256 KB Output is correct
15 Correct 474 ms 43384 KB Output is correct
16 Correct 599 ms 43348 KB Output is correct
17 Correct 560 ms 43308 KB Output is correct
18 Correct 579 ms 43308 KB Output is correct
19 Correct 539 ms 43340 KB Output is correct
20 Correct 478 ms 44328 KB Output is correct
21 Correct 468 ms 44540 KB Output is correct
22 Correct 439 ms 44404 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 32 ms 8824 KB Output is correct
3 Correct 28 ms 8824 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 12 ms 5112 KB Output is correct
6 Correct 30 ms 9080 KB Output is correct
7 Correct 32 ms 9080 KB Output is correct
8 Correct 27 ms 8952 KB Output is correct
9 Correct 19 ms 8952 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 88 ms 8976 KB Output is correct
16 Correct 90 ms 9100 KB Output is correct
17 Correct 92 ms 9080 KB Output is correct
18 Correct 33 ms 9080 KB Output is correct
19 Correct 31 ms 8952 KB Output is correct
20 Correct 89 ms 9096 KB Output is correct
21 Correct 94 ms 8952 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 32 ms 8952 KB Output is correct
24 Correct 30 ms 8824 KB Output is correct
25 Correct 8 ms 5112 KB Output is correct
26 Correct 7 ms 5112 KB Output is correct
27 Correct 33 ms 9212 KB Output is correct
28 Correct 37 ms 8984 KB Output is correct
29 Correct 26 ms 8952 KB Output is correct
30 Correct 35 ms 8860 KB Output is correct
31 Correct 0 ms 5112 KB Output is correct
32 Correct 7 ms 5112 KB Output is correct
33 Correct 21 ms 5112 KB Output is correct
34 Correct 6 ms 5112 KB Output is correct
35 Correct 7 ms 5112 KB Output is correct
36 Correct 448 ms 47000 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct
38 Correct 438 ms 46428 KB Output is correct
39 Correct 415 ms 45508 KB Output is correct
40 Correct 420 ms 47056 KB Output is correct
41 Correct 412 ms 47176 KB Output is correct
42 Correct 385 ms 43908 KB Output is correct
43 Correct 476 ms 43356 KB Output is correct
44 Correct 518 ms 43384 KB Output is correct
45 Correct 482 ms 43356 KB Output is correct
46 Correct 513 ms 43228 KB Output is correct
47 Correct 482 ms 44152 KB Output is correct
48 Correct 402 ms 44024 KB Output is correct
49 Correct 433 ms 44972 KB Output is correct
50 Correct 428 ms 44920 KB Output is correct
51 Correct 426 ms 47184 KB Output is correct
52 Correct 457 ms 47112 KB Output is correct
53 Correct 332 ms 43512 KB Output is correct
54 Correct 365 ms 43636 KB Output is correct
55 Correct 450 ms 43256 KB Output is correct
56 Correct 474 ms 43384 KB Output is correct
57 Correct 599 ms 43348 KB Output is correct
58 Correct 560 ms 43308 KB Output is correct
59 Correct 579 ms 43308 KB Output is correct
60 Correct 539 ms 43340 KB Output is correct
61 Correct 478 ms 44328 KB Output is correct
62 Correct 468 ms 44540 KB Output is correct
63 Correct 439 ms 44404 KB Output is correct
64 Correct 425 ms 44960 KB Output is correct
65 Correct 502 ms 43492 KB Output is correct
66 Correct 569 ms 43380 KB Output is correct
67 Correct 575 ms 43364 KB Output is correct
68 Correct 429 ms 43752 KB Output is correct
69 Correct 384 ms 43640 KB Output is correct
70 Correct 491 ms 45340 KB Output is correct
71 Correct 446 ms 44536 KB Output is correct
72 Correct 8 ms 5112 KB Output is correct
73 Correct 35 ms 8804 KB Output is correct
74 Correct 36 ms 8824 KB Output is correct
75 Correct 8 ms 5112 KB Output is correct
76 Correct 7 ms 5112 KB Output is correct
77 Correct 31 ms 9208 KB Output is correct
78 Correct 31 ms 8956 KB Output is correct
79 Correct 26 ms 8924 KB Output is correct
80 Correct 30 ms 8952 KB Output is correct
81 Correct 7 ms 5112 KB Output is correct
82 Correct 6 ms 5112 KB Output is correct
83 Correct 6 ms 5112 KB Output is correct
84 Correct 9 ms 5112 KB Output is correct
85 Correct 6 ms 5112 KB Output is correct
86 Correct 87 ms 8952 KB Output is correct
87 Correct 86 ms 8952 KB Output is correct
88 Correct 89 ms 9080 KB Output is correct
89 Correct 37 ms 9080 KB Output is correct
90 Correct 34 ms 9080 KB Output is correct
91 Correct 90 ms 9080 KB Output is correct
92 Correct 89 ms 8952 KB Output is correct
93 Correct 6 ms 5112 KB Output is correct
94 Correct 441 ms 47012 KB Output is correct
95 Correct 425 ms 46360 KB Output is correct
96 Correct 408 ms 45688 KB Output is correct
97 Correct 411 ms 46960 KB Output is correct
98 Correct 405 ms 47092 KB Output is correct
99 Correct 501 ms 43380 KB Output is correct
100 Correct 472 ms 43384 KB Output is correct
101 Correct 576 ms 43392 KB Output is correct
102 Correct 502 ms 43384 KB Output is correct
103 Correct 417 ms 44000 KB Output is correct
104 Correct 438 ms 44720 KB Output is correct
105 Correct 433 ms 43852 KB Output is correct
106 Correct 434 ms 45100 KB Output is correct
107 Correct 484 ms 45040 KB Output is correct
108 Correct 392 ms 47068 KB Output is correct
109 Correct 400 ms 47104 KB Output is correct
110 Correct 352 ms 43576 KB Output is correct
111 Correct 335 ms 43512 KB Output is correct
112 Correct 454 ms 43384 KB Output is correct
113 Correct 449 ms 43384 KB Output is correct