oj.uz

답안 #135054

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135054 2019-07-23T15:05:06 Z miguel Railway (BOI17_railway) C++14
100 / 100
 171 ms 24180 KB 
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
#define nmax 301
const ll mod = 998244353;
int n, m, k, timer, up[100001][18], tin[100001], tout[100001], cnt[100001];
vi g[100001];
pi ed[100001];

void dfs(int nod, int p){
    tin[nod]=timer++;
    up[nod][0]=p;
    for(int i=1; i<=17; i++) up[nod][i]=up[up[nod][i-1]][i-1];
    for(int i : g[nod]){
        if(i!=p) dfs(i, nod);
    }
    tout[nod]=timer++;
}

bool check(int anc, int x){
    if(tin[anc]<=tin[x] && tout[x]<=tout[anc]) return 1;
    else return 0;
}

int lca(int x, int y){
    if(check(x, y)) return x;
    else if(check(y, x)) return y;
    for(int i=17; i>=0; i--){
        if(check(up[x][i], y)==0) x=up[x][i];
    }
    return up[x][0];
}

void dfs2(int nod, int p){
    for(int i: g[nod]){
        if(i!=p){
            dfs2(i, nod);
            cnt[nod]+=cnt[i];
        }
    }
}

bool cmp(int i, int j){
    return (tin[i]<tin[j]);
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n>>m>>k;
    for(int i=1; i<n; i++){
        int a, b;
        cin>>a>>b;
        g[a].pb(b);
        g[b].pb(a);
        ed[i]={a, b};
    }
    dfs(1, 1);
    //int q; cin>>q; for(int i=1; i<=q; i++){int x, y; cin>>x>>y; cout<<lca(x, y);}
    for(int i=1; i<=m; i++){
        int s;
        vi v;
        cin>>s;
        for(int j=1; j<=s; j++){
            int x;
            cin>>x;
            v.pb(x);
        }
        sort(v.begin(), v.end(), cmp);
        for(int j=0; j<v.size(); j++){
            int x=v[j], y=v[(j+1)%v.size()];
            cnt[x]++, cnt[y]++, cnt[lca(x, y)]-=2;
        }
    }
    dfs2(1, 1);
    vi ans;
    for(int i=1; i<n; i++){
        int a=ed[i].x, b=ed[i].y;
        if(tin[a]>tin[b]) swap(a, b);
        if(cnt[b]>=2*k) ans.pb(i);
    }
    cout<<ans.size()<<"\n";
    for(int i : ans) cout<<i<<" ";
}

Compilation message

railway.cpp: In function 'int32_t main()':
railway.cpp:78:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<v.size(); j++){
                      ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 10 ms 3960 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 2656 KB Output is correct
6 Correct 11 ms 4472 KB Output is correct
7 Correct 10 ms 4088 KB Output is correct
8 Correct 10 ms 4088 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 4 ms 2684 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 10 ms 3960 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 2656 KB Output is correct
6 Correct 11 ms 4472 KB Output is correct
7 Correct 10 ms 4088 KB Output is correct
8 Correct 10 ms 4088 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 4 ms 2684 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 31 ms 4472 KB Output is correct
16 Correct 32 ms 4472 KB Output is correct
17 Correct 31 ms 4472 KB Output is correct
18 Correct 11 ms 4344 KB Output is correct
19 Correct 11 ms 4072 KB Output is correct
20 Correct 37 ms 4692 KB Output is correct
21 Correct 38 ms 4520 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 10 ms 4036 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 4088 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 11 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

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 23856 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 95 ms 23516 KB Output is correct
4 Correct 86 ms 22920 KB Output is correct
5 Correct 93 ms 23916 KB Output is correct
6 Correct 95 ms 24180 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 19832 KB Output is correct
2 Correct 120 ms 17016 KB Output is correct
3 Correct 129 ms 16636 KB Output is correct
4 Correct 121 ms 16772 KB Output is correct
5 Correct 126 ms 16760 KB Output is correct
6 Correct 124 ms 20092 KB Output is correct
7 Correct 105 ms 19836 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 19832 KB Output is correct
2 Correct 120 ms 17016 KB Output is correct
3 Correct 129 ms 16636 KB Output is correct
4 Correct 121 ms 16772 KB Output is correct
5 Correct 126 ms 16760 KB Output is correct
6 Correct 124 ms 20092 KB Output is correct
7 Correct 105 ms 19836 KB Output is correct
8 Correct 123 ms 19924 KB Output is correct
9 Correct 117 ms 19956 KB Output is correct
10 Correct 74 ms 23920 KB Output is correct
11 Correct 92 ms 23952 KB Output is correct
12 Correct 91 ms 16632 KB Output is correct
13 Correct 92 ms 16632 KB Output is correct
14 Correct 116 ms 16692 KB Output is correct
15 Correct 166 ms 16604 KB Output is correct
16 Correct 171 ms 16888 KB Output is correct
17 Correct 118 ms 16888 KB Output is correct
18 Correct 124 ms 16760 KB Output is correct
19 Correct 118 ms 17016 KB Output is correct
20 Correct 105 ms 20112 KB Output is correct
21 Correct 103 ms 20216 KB Output is correct
22 Correct 104 ms 20128 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 10 ms 3960 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 2656 KB Output is correct
6 Correct 11 ms 4472 KB Output is correct
7 Correct 10 ms 4088 KB Output is correct
8 Correct 10 ms 4088 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 4 ms 2684 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2684 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 31 ms 4472 KB Output is correct
16 Correct 32 ms 4472 KB Output is correct
17 Correct 31 ms 4472 KB Output is correct
18 Correct 11 ms 4344 KB Output is correct
19 Correct 11 ms 4072 KB Output is correct
20 Correct 37 ms 4692 KB Output is correct
21 Correct 38 ms 4520 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 10 ms 4036 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 4088 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 11 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 92 ms 23856 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 95 ms 23516 KB Output is correct
39 Correct 86 ms 22920 KB Output is correct
40 Correct 93 ms 23916 KB Output is correct
41 Correct 95 ms 24180 KB Output is correct
42 Correct 103 ms 19832 KB Output is correct
43 Correct 120 ms 17016 KB Output is correct
44 Correct 129 ms 16636 KB Output is correct
45 Correct 121 ms 16772 KB Output is correct
46 Correct 126 ms 16760 KB Output is correct
47 Correct 124 ms 20092 KB Output is correct
48 Correct 105 ms 19836 KB Output is correct
49 Correct 123 ms 19924 KB Output is correct
50 Correct 117 ms 19956 KB Output is correct
51 Correct 74 ms 23920 KB Output is correct
52 Correct 92 ms 23952 KB Output is correct
53 Correct 91 ms 16632 KB Output is correct
54 Correct 92 ms 16632 KB Output is correct
55 Correct 116 ms 16692 KB Output is correct
56 Correct 166 ms 16604 KB Output is correct
57 Correct 171 ms 16888 KB Output is correct
58 Correct 118 ms 16888 KB Output is correct
59 Correct 124 ms 16760 KB Output is correct
60 Correct 118 ms 17016 KB Output is correct
61 Correct 105 ms 20112 KB Output is correct
62 Correct 103 ms 20216 KB Output is correct
63 Correct 104 ms 20128 KB Output is correct
64 Correct 111 ms 20188 KB Output is correct
65 Correct 139 ms 16732 KB Output is correct
66 Correct 133 ms 16660 KB Output is correct
67 Correct 143 ms 16760 KB Output is correct
68 Correct 88 ms 16516 KB Output is correct
69 Correct 95 ms 16700 KB Output is correct
70 Correct 116 ms 20444 KB Output is correct
71 Correct 115 ms 19764 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 10 ms 4088 KB Output is correct
74 Correct 10 ms 4088 KB Output is correct
75 Correct 4 ms 2680 KB Output is correct
76 Correct 5 ms 2680 KB Output is correct
77 Correct 11 ms 4472 KB Output is correct
78 Correct 10 ms 4088 KB Output is correct
79 Correct 9 ms 4124 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 2680 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 2808 KB Output is correct
86 Correct 30 ms 4472 KB Output is correct
87 Correct 31 ms 4524 KB Output is correct
88 Correct 31 ms 4472 KB Output is correct
89 Correct 11 ms 4472 KB Output is correct
90 Correct 10 ms 4088 KB Output is correct
91 Correct 36 ms 4600 KB Output is correct
92 Correct 39 ms 4600 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 92 ms 23776 KB Output is correct
95 Correct 91 ms 23512 KB Output is correct
96 Correct 87 ms 23016 KB Output is correct
97 Correct 87 ms 23792 KB Output is correct
98 Correct 94 ms 24176 KB Output is correct
99 Correct 121 ms 16760 KB Output is correct
100 Correct 115 ms 16760 KB Output is correct
101 Correct 128 ms 16888 KB Output is correct
102 Correct 117 ms 17016 KB Output is correct
103 Correct 104 ms 19952 KB Output is correct
104 Correct 103 ms 20216 KB Output is correct
105 Correct 101 ms 19960 KB Output is correct
106 Correct 114 ms 20120 KB Output is correct
107 Correct 111 ms 19900 KB Output is correct
108 Correct 86 ms 23920 KB Output is correct
109 Correct 86 ms 23916 KB Output is correct
110 Correct 87 ms 16632 KB Output is correct
111 Correct 91 ms 16636 KB Output is correct
112 Correct 123 ms 16620 KB Output is correct
113 Correct 117 ms 16752 KB Output is correct