oj.uz

Submission #208540

# Submission time Handle Problem Language Result Execution time Memory
208540 2020-03-11T13:23:50 Z eriksuenderhauf Railway (BOI17_railway) C++11
100 / 100
 132 ms 28532 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 3e5 + 5;
const double eps = 1e-9;
int U[MAXN], V[MAXN], disc[MAXN], cnt[MAXN];
int t = 0, par[17][MAXN], depth[MAXN];
vi adj[MAXN];

void dfs(int u, int p) {
    disc[u] = t++;
    for (int v: adj[u]) {
        if (v == p) continue;
        par[0][v] = u;
        depth[v] = depth[u] + 1;
        dfs(v, u);
    }
}

int lca(int u, int v) {
    if (depth[u] > depth[v])
        swap(u, v);
    int d = depth[v] - depth[u];
    for (int i = 0; i < 17; i++)
        if ((d >> i) & 1)
            v = par[i][v];
    if (u == v) return u;
    for (int i = 16; i > -1; i--)
        if (par[i][u] != par[i][v])
            u = par[i][u], v = par[i][v];
    return par[0][u];
}

void dfs2(int u, int p) {
    for (int v: adj[u]) {
        if (v == p)
            continue;
        dfs2(v, u);
        cnt[u] += cnt[v];
    }
}

int main() {
    int n, m, k;
    scanf("%d %d %d", &n, &m, &k);
    for (int i = 1; i < n; i++) {
        scanf("%d %d", &U[i], &V[i]);
        U[i]--, V[i]--;
        adj[U[i]].pb(V[i]);
        adj[V[i]].pb(U[i]);
    }
    depth[0] = 0;
    dfs(0, -1);
    for (int i = 1; i < 17; i++)
        for (int j = 0; j < n; j++)
            par[i][j] = par[i - 1][par[i - 1][j]];
    for (int i = 0; i < m; i++) {
        vector<int> cur;
        int s;
        scanf("%d", &s);
        for (int j = 0; j < s; j++) {
            int u;
            scanf("%d", &u);
            cur.pb(--u);
        }
        sort(cur.begin(), cur.end(), [](int u, int v){
            return disc[u] < disc[v];
        });
        for (int j = 0; j < s; j++) {
            int l = lca(cur[j], cur[(j+1)%s]);
            cnt[l] -= 2;
            cnt[cur[j]]++, cnt[cur[(j+1)%s]]++;
        }
    }
    dfs2(0, -1);
    vi ans;
    for (int i = 1; i < n; i++) {
        if (disc[U[i]] < disc[V[i]])
            swap(U[i], V[i]);
        if (cnt[U[i]] >= 2 * k)
            ans.pb(i);
    }
    printf("%d\n", ans.size());
    for (int i: ans)
        printf("%d ", i);
    printf("\n");
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:112:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", ans.size());
                    ~~~~~~~~~~^
railway.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &U[i], &V[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:89:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &s);
         ~~~~~^~~~~~~~~~
railway.cpp:92:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &u);
             ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7544 KB Output is correct
2 Correct 15 ms 8824 KB Output is correct
3 Correct 15 ms 8824 KB Output is correct
4 Correct 9 ms 7544 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 15 ms 9208 KB Output is correct
7 Correct 14 ms 8828 KB Output is correct
8 Correct 13 ms 8828 KB Output is correct
9 Correct 14 ms 8824 KB Output is correct
10 Correct 9 ms 7544 KB Output is correct
11 Correct 9 ms 7548 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7544 KB Output is correct
14 Correct 9 ms 7544 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7544 KB Output is correct
2 Correct 15 ms 8824 KB Output is correct
3 Correct 15 ms 8824 KB Output is correct
4 Correct 9 ms 7544 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 15 ms 9208 KB Output is correct
7 Correct 14 ms 8828 KB Output is correct
8 Correct 13 ms 8828 KB Output is correct
9 Correct 14 ms 8824 KB Output is correct
10 Correct 9 ms 7544 KB Output is correct
11 Correct 9 ms 7548 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7544 KB Output is correct
14 Correct 9 ms 7544 KB Output is correct
15 Correct 34 ms 9208 KB Output is correct
16 Correct 33 ms 9208 KB Output is correct
17 Correct 35 ms 9336 KB Output is correct
18 Correct 15 ms 9208 KB Output is correct
19 Correct 14 ms 8824 KB Output is correct
20 Correct 33 ms 9336 KB Output is correct
21 Correct 35 ms 9208 KB Output is correct
22 Correct 9 ms 7544 KB Output is correct
23 Correct 17 ms 8824 KB Output is correct
24 Correct 14 ms 8824 KB Output is correct
25 Correct 9 ms 7544 KB Output is correct
26 Correct 9 ms 7544 KB Output is correct
27 Correct 17 ms 9336 KB Output is correct
28 Correct 15 ms 8824 KB Output is correct
29 Correct 13 ms 8824 KB Output is correct
30 Correct 14 ms 8824 KB Output is correct
31 Correct 9 ms 7548 KB Output is correct
32 Correct 9 ms 7544 KB Output is correct
33 Correct 9 ms 7544 KB Output is correct
34 Correct 9 ms 7544 KB Output is correct
35 Correct 9 ms 7544 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 27888 KB Output is correct
2 Correct 9 ms 7548 KB Output is correct
3 Correct 120 ms 28024 KB Output is correct
4 Correct 117 ms 27256 KB Output is correct
5 Correct 120 ms 28404 KB Output is correct
6 Correct 103 ms 28532 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 23164 KB Output is correct
2 Correct 119 ms 21496 KB Output is correct
3 Correct 122 ms 21112 KB Output is correct
4 Correct 120 ms 21240 KB Output is correct
5 Correct 120 ms 21112 KB Output is correct
6 Correct 97 ms 24440 KB Output is correct
7 Correct 97 ms 24256 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 23164 KB Output is correct
2 Correct 119 ms 21496 KB Output is correct
3 Correct 122 ms 21112 KB Output is correct
4 Correct 120 ms 21240 KB Output is correct
5 Correct 120 ms 21112 KB Output is correct
6 Correct 97 ms 24440 KB Output is correct
7 Correct 97 ms 24256 KB Output is correct
8 Correct 104 ms 24436 KB Output is correct
9 Correct 104 ms 24312 KB Output is correct
10 Correct 97 ms 28276 KB Output is correct
11 Correct 103 ms 28272 KB Output is correct
12 Correct 94 ms 20984 KB Output is correct
13 Correct 90 ms 20984 KB Output is correct
14 Correct 122 ms 21112 KB Output is correct
15 Correct 119 ms 20984 KB Output is correct
16 Correct 120 ms 21240 KB Output is correct
17 Correct 121 ms 21112 KB Output is correct
18 Correct 126 ms 21112 KB Output is correct
19 Correct 112 ms 21368 KB Output is correct
20 Correct 101 ms 24568 KB Output is correct
21 Correct 102 ms 24696 KB Output is correct
22 Correct 101 ms 24568 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7544 KB Output is correct
2 Correct 15 ms 8824 KB Output is correct
3 Correct 15 ms 8824 KB Output is correct
4 Correct 9 ms 7544 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 15 ms 9208 KB Output is correct
7 Correct 14 ms 8828 KB Output is correct
8 Correct 13 ms 8828 KB Output is correct
9 Correct 14 ms 8824 KB Output is correct
10 Correct 9 ms 7544 KB Output is correct
11 Correct 9 ms 7548 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7544 KB Output is correct
14 Correct 9 ms 7544 KB Output is correct
15 Correct 34 ms 9208 KB Output is correct
16 Correct 33 ms 9208 KB Output is correct
17 Correct 35 ms 9336 KB Output is correct
18 Correct 15 ms 9208 KB Output is correct
19 Correct 14 ms 8824 KB Output is correct
20 Correct 33 ms 9336 KB Output is correct
21 Correct 35 ms 9208 KB Output is correct
22 Correct 9 ms 7544 KB Output is correct
23 Correct 17 ms 8824 KB Output is correct
24 Correct 14 ms 8824 KB Output is correct
25 Correct 9 ms 7544 KB Output is correct
26 Correct 9 ms 7544 KB Output is correct
27 Correct 17 ms 9336 KB Output is correct
28 Correct 15 ms 8824 KB Output is correct
29 Correct 13 ms 8824 KB Output is correct
30 Correct 14 ms 8824 KB Output is correct
31 Correct 9 ms 7548 KB Output is correct
32 Correct 9 ms 7544 KB Output is correct
33 Correct 9 ms 7544 KB Output is correct
34 Correct 9 ms 7544 KB Output is correct
35 Correct 9 ms 7544 KB Output is correct
36 Correct 127 ms 27888 KB Output is correct
37 Correct 9 ms 7548 KB Output is correct
38 Correct 120 ms 28024 KB Output is correct
39 Correct 117 ms 27256 KB Output is correct
40 Correct 120 ms 28404 KB Output is correct
41 Correct 103 ms 28532 KB Output is correct
42 Correct 97 ms 23164 KB Output is correct
43 Correct 119 ms 21496 KB Output is correct
44 Correct 122 ms 21112 KB Output is correct
45 Correct 120 ms 21240 KB Output is correct
46 Correct 120 ms 21112 KB Output is correct
47 Correct 97 ms 24440 KB Output is correct
48 Correct 97 ms 24256 KB Output is correct
49 Correct 104 ms 24436 KB Output is correct
50 Correct 104 ms 24312 KB Output is correct
51 Correct 97 ms 28276 KB Output is correct
52 Correct 103 ms 28272 KB Output is correct
53 Correct 94 ms 20984 KB Output is correct
54 Correct 90 ms 20984 KB Output is correct
55 Correct 122 ms 21112 KB Output is correct
56 Correct 119 ms 20984 KB Output is correct
57 Correct 120 ms 21240 KB Output is correct
58 Correct 121 ms 21112 KB Output is correct
59 Correct 126 ms 21112 KB Output is correct
60 Correct 112 ms 21368 KB Output is correct
61 Correct 101 ms 24568 KB Output is correct
62 Correct 102 ms 24696 KB Output is correct
63 Correct 101 ms 24568 KB Output is correct
64 Correct 105 ms 24440 KB Output is correct
65 Correct 131 ms 21112 KB Output is correct
66 Correct 132 ms 21112 KB Output is correct
67 Correct 122 ms 20984 KB Output is correct
68 Correct 81 ms 20984 KB Output is correct
69 Correct 84 ms 20984 KB Output is correct
70 Correct 113 ms 24824 KB Output is correct
71 Correct 108 ms 24184 KB Output is correct
72 Correct 9 ms 7544 KB Output is correct
73 Correct 15 ms 8824 KB Output is correct
74 Correct 14 ms 8824 KB Output is correct
75 Correct 9 ms 7420 KB Output is correct
76 Correct 9 ms 7544 KB Output is correct
77 Correct 15 ms 9208 KB Output is correct
78 Correct 15 ms 8824 KB Output is correct
79 Correct 14 ms 8824 KB Output is correct
80 Correct 13 ms 8828 KB Output is correct
81 Correct 9 ms 7544 KB Output is correct
82 Correct 9 ms 7420 KB Output is correct
83 Correct 9 ms 7548 KB Output is correct
84 Correct 9 ms 7544 KB Output is correct
85 Correct 9 ms 7544 KB Output is correct
86 Correct 34 ms 9208 KB Output is correct
87 Correct 35 ms 9208 KB Output is correct
88 Correct 34 ms 9208 KB Output is correct
89 Correct 16 ms 9212 KB Output is correct
90 Correct 15 ms 8824 KB Output is correct
91 Correct 33 ms 9208 KB Output is correct
92 Correct 35 ms 9208 KB Output is correct
93 Correct 9 ms 7544 KB Output is correct
94 Correct 128 ms 28252 KB Output is correct
95 Correct 118 ms 27896 KB Output is correct
96 Correct 115 ms 27380 KB Output is correct
97 Correct 116 ms 28240 KB Output is correct
98 Correct 105 ms 28532 KB Output is correct
99 Correct 123 ms 21112 KB Output is correct
100 Correct 116 ms 21112 KB Output is correct
101 Correct 119 ms 21112 KB Output is correct
102 Correct 111 ms 21368 KB Output is correct
103 Correct 100 ms 24312 KB Output is correct
104 Correct 102 ms 24696 KB Output is correct
105 Correct 99 ms 24244 KB Output is correct
106 Correct 107 ms 24440 KB Output is correct
107 Correct 103 ms 24312 KB Output is correct
108 Correct 97 ms 28276 KB Output is correct
109 Correct 106 ms 28276 KB Output is correct
110 Correct 94 ms 20984 KB Output is correct
111 Correct 98 ms 20984 KB Output is correct
112 Correct 115 ms 20984 KB Output is correct
113 Correct 120 ms 21048 KB Output is correct