oj.uz

Submission #171283

# Submission time Handle Problem Language Result Execution time Memory
171283 2019-12-28T07:33:28 Z AM1648 Railway (BOI17_railway) C++17
100 / 100
 503 ms 33784 KB 
/* be name khoda */

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;

#define forifrom(i, s, n) for (ll i = (s); i < (n); ++i)
#define fori(i, n) forifrom(i, 0, n)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= (e); --i)
#define forir(i, n) forirto(i, n, 0)

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F first
#define S second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpii;

const ll maxn = 100010;
const ll maxnlg = 20;

ll n, m, k;
vpii g[maxn];
ll st[maxn], ft[maxn], pars[maxnlg][maxn];
vi vers;
ll ps[maxn];
ll es[maxn];

ll tim = 0;
void dfs_stft(ll x, ll par) {
    st[x] = tim++;
    pars[0][x] = par;
    fori (i, maxnlg - 1) {
        pars[i + 1][x] = pars[i][pars[i][x]];
    }
    for (auto y : g[x]) {
        if (y.F != par) {
            dfs_stft(y.F, x);
        }
    }
    ft[x] = tim;
}

ll LCA(ll a, ll b) {
    if (st[a] > st[b]) swap(a, b);
    if (ft[a] >= ft[b]) return a;
    forir (i, maxnlg) {
        if (ft[pars[i][a]] < ft[b]) a = pars[i][a];
    }
    return pars[0][a];
}

void add_path(ll a, ll b, ll d) {
    ps[a] += d;
    ps[b] += d;
    ps[LCA(a, b)] -= 2 * d;
}

bool st_cmp(ll a, ll b) {
    return st[a] < st[b];
}

void dfs_sum(ll x, ll par) {
    for (auto y : g[x]) {
        if (y.F != par) {
            dfs_sum(y.F, x);
            ps[x] += ps[y.F];
            es[y.S] += ps[y.F];
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    cin >> n >> m >> k;
    fori (i, n - 1) {
        ll a, b; cin >> a >> b;;
        g[a].pb({b, i}), g[b].pb({a, i});
    }

    g[0].pb({1, n});
    dfs_stft(0, 0);

    fori (i, m) {
        ll c; cin >> c;
        vers.clear();
        fori (j, c) {
            ll x; cin >> x;
            vers.pb(x);
        }
        if (c == 1) continue;
        sort(all(vers), st_cmp);
        add_path(vers[0], vers.back(), 2);
        forifrom (i, 1, vers.size() - 1) {
            add_path(vers[i - 1], vers[i], 1);
            add_path(vers.back(), vers[i], 1);
            add_path(vers[i - 1], vers.back(), -1);
        }
    }

    dfs_sum(0, 0);

    ll ans = 0;
    fori (i, n - 1) {
        if (es[i] >= k * 2) ++ans;
    }
    cout << ans << '\n';
    fori (i, n - 1) {
        if (es[i] >= k * 2) cout << i + 1 << ' ';
    }
    cout << '\n';

}

/*
6 3 2
1 3
2 3
3 4
6 4
4 5
4 1 3 2 5
2 6 3
2 3 2
*/

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:9:46: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define forifrom(i, s, n) for (ll i = (s); i < (n); ++i)
                                              ^
railway.cpp:100:9: note: in expansion of macro 'forifrom'
         forifrom (i, 1, vers.size() - 1) {
         ^~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2808 KB Output is correct
2 Correct 13 ms 5284 KB Output is correct
3 Correct 13 ms 5368 KB Output is correct
4 Correct 5 ms 2780 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 13 ms 5624 KB Output is correct
7 Correct 13 ms 5240 KB Output is correct
8 Correct 12 ms 5368 KB Output is correct
9 Correct 12 ms 5368 KB Output is correct
10 Correct 0 ms 2808 KB Output is correct
11 Correct 3 ms 2812 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 5 ms 2808 KB Output is correct
14 Correct 5 ms 2936 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2808 KB Output is correct
2 Correct 13 ms 5284 KB Output is correct
3 Correct 13 ms 5368 KB Output is correct
4 Correct 5 ms 2780 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 13 ms 5624 KB Output is correct
7 Correct 13 ms 5240 KB Output is correct
8 Correct 12 ms 5368 KB Output is correct
9 Correct 12 ms 5368 KB Output is correct
10 Correct 0 ms 2808 KB Output is correct
11 Correct 3 ms 2812 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 5 ms 2808 KB Output is correct
14 Correct 5 ms 2936 KB Output is correct
15 Correct 107 ms 5656 KB Output is correct
16 Correct 105 ms 5664 KB Output is correct
17 Correct 94 ms 5752 KB Output is correct
18 Correct 17 ms 5680 KB Output is correct
19 Correct 9 ms 5368 KB Output is correct
20 Correct 124 ms 5748 KB Output is correct
21 Correct 142 ms 5752 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 13 ms 5240 KB Output is correct
24 Correct 5 ms 5340 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 5 ms 2808 KB Output is correct
27 Correct 13 ms 5752 KB Output is correct
28 Correct 14 ms 5368 KB Output is correct
29 Correct 10 ms 5240 KB Output is correct
30 Correct 12 ms 5240 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 5 ms 2808 KB Output is correct
33 Correct 5 ms 2808 KB Output is correct
34 Correct 7 ms 2808 KB Output is correct
35 Correct 4 ms 2804 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 33460 KB Output is correct
2 Correct 4 ms 2808 KB Output is correct
3 Correct 95 ms 32888 KB Output is correct
4 Correct 91 ms 32632 KB Output is correct
5 Correct 90 ms 33688 KB Output is correct
6 Correct 98 ms 33656 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 30120 KB Output is correct
2 Correct 162 ms 27484 KB Output is correct
3 Correct 205 ms 27256 KB Output is correct
4 Correct 187 ms 26952 KB Output is correct
5 Correct 204 ms 26912 KB Output is correct
6 Correct 126 ms 30072 KB Output is correct
7 Correct 124 ms 30328 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 30120 KB Output is correct
2 Correct 162 ms 27484 KB Output is correct
3 Correct 205 ms 27256 KB Output is correct
4 Correct 187 ms 26952 KB Output is correct
5 Correct 204 ms 26912 KB Output is correct
6 Correct 126 ms 30072 KB Output is correct
7 Correct 124 ms 30328 KB Output is correct
8 Correct 240 ms 30408 KB Output is correct
9 Correct 236 ms 30332 KB Output is correct
10 Correct 106 ms 33656 KB Output is correct
11 Correct 96 ms 33632 KB Output is correct
12 Correct 385 ms 27188 KB Output is correct
13 Correct 448 ms 26996 KB Output is correct
14 Correct 279 ms 27204 KB Output is correct
15 Correct 268 ms 27280 KB Output is correct
16 Correct 204 ms 27160 KB Output is correct
17 Correct 202 ms 27268 KB Output is correct
18 Correct 189 ms 27356 KB Output is correct
19 Correct 168 ms 27512 KB Output is correct
20 Correct 127 ms 30456 KB Output is correct
21 Correct 130 ms 30456 KB Output is correct
22 Correct 130 ms 30340 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2808 KB Output is correct
2 Correct 13 ms 5284 KB Output is correct
3 Correct 13 ms 5368 KB Output is correct
4 Correct 5 ms 2780 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 13 ms 5624 KB Output is correct
7 Correct 13 ms 5240 KB Output is correct
8 Correct 12 ms 5368 KB Output is correct
9 Correct 12 ms 5368 KB Output is correct
10 Correct 0 ms 2808 KB Output is correct
11 Correct 3 ms 2812 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 5 ms 2808 KB Output is correct
14 Correct 5 ms 2936 KB Output is correct
15 Correct 107 ms 5656 KB Output is correct
16 Correct 105 ms 5664 KB Output is correct
17 Correct 94 ms 5752 KB Output is correct
18 Correct 17 ms 5680 KB Output is correct
19 Correct 9 ms 5368 KB Output is correct
20 Correct 124 ms 5748 KB Output is correct
21 Correct 142 ms 5752 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 13 ms 5240 KB Output is correct
24 Correct 5 ms 5340 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 5 ms 2808 KB Output is correct
27 Correct 13 ms 5752 KB Output is correct
28 Correct 14 ms 5368 KB Output is correct
29 Correct 10 ms 5240 KB Output is correct
30 Correct 12 ms 5240 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 5 ms 2808 KB Output is correct
33 Correct 5 ms 2808 KB Output is correct
34 Correct 7 ms 2808 KB Output is correct
35 Correct 4 ms 2804 KB Output is correct
36 Correct 100 ms 33460 KB Output is correct
37 Correct 4 ms 2808 KB Output is correct
38 Correct 95 ms 32888 KB Output is correct
39 Correct 91 ms 32632 KB Output is correct
40 Correct 90 ms 33688 KB Output is correct
41 Correct 98 ms 33656 KB Output is correct
42 Correct 110 ms 30120 KB Output is correct
43 Correct 162 ms 27484 KB Output is correct
44 Correct 205 ms 27256 KB Output is correct
45 Correct 187 ms 26952 KB Output is correct
46 Correct 204 ms 26912 KB Output is correct
47 Correct 126 ms 30072 KB Output is correct
48 Correct 124 ms 30328 KB Output is correct
49 Correct 240 ms 30408 KB Output is correct
50 Correct 236 ms 30332 KB Output is correct
51 Correct 106 ms 33656 KB Output is correct
52 Correct 96 ms 33632 KB Output is correct
53 Correct 385 ms 27188 KB Output is correct
54 Correct 448 ms 26996 KB Output is correct
55 Correct 279 ms 27204 KB Output is correct
56 Correct 268 ms 27280 KB Output is correct
57 Correct 204 ms 27160 KB Output is correct
58 Correct 202 ms 27268 KB Output is correct
59 Correct 189 ms 27356 KB Output is correct
60 Correct 168 ms 27512 KB Output is correct
61 Correct 127 ms 30456 KB Output is correct
62 Correct 130 ms 30456 KB Output is correct
63 Correct 130 ms 30340 KB Output is correct
64 Correct 156 ms 30468 KB Output is correct
65 Correct 272 ms 27428 KB Output is correct
66 Correct 411 ms 27116 KB Output is correct
67 Correct 326 ms 27356 KB Output is correct
68 Correct 287 ms 27256 KB Output is correct
69 Correct 293 ms 26936 KB Output is correct
70 Correct 186 ms 30548 KB Output is correct
71 Correct 294 ms 30448 KB Output is correct
72 Correct 5 ms 2808 KB Output is correct
73 Correct 13 ms 5368 KB Output is correct
74 Correct 12 ms 5368 KB Output is correct
75 Correct 4 ms 2808 KB Output is correct
76 Correct 5 ms 2808 KB Output is correct
77 Correct 13 ms 5624 KB Output is correct
78 Correct 13 ms 5368 KB Output is correct
79 Correct 11 ms 5200 KB Output is correct
80 Correct 12 ms 5368 KB Output is correct
81 Correct 5 ms 2748 KB Output is correct
82 Correct 4 ms 2808 KB Output is correct
83 Correct 5 ms 2808 KB Output is correct
84 Correct 4 ms 2812 KB Output is correct
85 Correct 4 ms 2808 KB Output is correct
86 Correct 91 ms 5720 KB Output is correct
87 Correct 97 ms 5752 KB Output is correct
88 Correct 95 ms 5752 KB Output is correct
89 Correct 12 ms 5624 KB Output is correct
90 Correct 12 ms 5372 KB Output is correct
91 Correct 117 ms 5748 KB Output is correct
92 Correct 147 ms 5496 KB Output is correct
93 Correct 5 ms 2808 KB Output is correct
94 Correct 108 ms 33460 KB Output is correct
95 Correct 154 ms 33272 KB Output is correct
96 Correct 97 ms 32988 KB Output is correct
97 Correct 98 ms 33628 KB Output is correct
98 Correct 99 ms 33756 KB Output is correct
99 Correct 221 ms 27384 KB Output is correct
100 Correct 192 ms 27296 KB Output is correct
101 Correct 193 ms 27336 KB Output is correct
102 Correct 160 ms 27512 KB Output is correct
103 Correct 146 ms 30492 KB Output is correct
104 Correct 139 ms 30556 KB Output is correct
105 Correct 137 ms 30328 KB Output is correct
106 Correct 298 ms 30072 KB Output is correct
107 Correct 231 ms 30332 KB Output is correct
108 Correct 95 ms 33656 KB Output is correct
109 Correct 95 ms 33784 KB Output is correct
110 Correct 503 ms 27064 KB Output is correct
111 Correct 431 ms 26980 KB Output is correct
112 Correct 252 ms 27256 KB Output is correct
113 Correct 257 ms 27256 KB Output is correct