oj.uz

Submission #933499

# Submission time Handle Problem Language Result Execution time Memory
933499 2024-02-25T18:57:20 Z LucaIlie Railway (BOI17_railway) C++17
100 / 100
 118 ms 26060 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e5;
const int MAX_LOG_N = 16;

struct edge {
    int u, v;
};

int n;
vector<int> adj[MAX_N + 1];
int parent[MAX_LOG_N + 1][MAX_N + 1], depth[MAX_N + 1], timeIn[MAX_N + 1], timeOut[MAX_N + 1], used[MAX_N + 1], parentEdge[MAX_N + 1];
edge edges[MAX_N];

int timee;
void dfs( int u, int p ) {
    timeIn[u] = ++timee;
    parent[0][u] = p;
    for ( int i = 1; i <= log2( n ); i++ )
        parent[i][u] = parent[i - 1][parent[i - 1][u]];
    depth[u] = depth[p] + 1;
    for ( int v: adj[u] ) {
        if ( v == p )
            continue;
        dfs( v, u );
    }
    timeOut[u] = ++timee;
}

int lca( int u, int v ) {
    if ( depth[u] < depth[v] )
        swap( u, v );

    for ( int p = log2( n ); p >= 0; p-- ) {
        if ( depth[parent[p][u]] >= depth[v] )
            u = parent[p][u];
    }

    if ( u == v )
        return u;

    for ( int p = log2( n ); p >= 0; p-- ) {
        if ( parent[p][u] != parent[p][v] ) {
            u = parent[p][u];
            v = parent[p][v];
        }
    }

    return parent[0][u];
}

bool inSubtree( int u, int v ) {
    return (timeIn[u] <= timeIn[v] && timeOut[v] <= timeOut[u]);
}

vector<int> ans;

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

int main() {
    ios_base::sync_with_stdio( false );
    cin.tie( NULL );

    int m, k;

    cin >> n >> m >> k;
    for ( int i = 1; i < n; i++ ) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back( v );
        adj[v].push_back( u );
        edges[i] = { u, v };
    }

    dfs( 1, 0 );

    for ( int i = 1; i < n; i++ ) {
        if ( depth[edges[i].u] > depth[edges[i].v] )
            swap( edges[i].u, edges[i].v );
        parentEdge[edges[i].v] = i;
    }

    for ( int i = 0; i < m; i++ ) {
        int s;
        cin >> s;

        vector <int> vertices, virtualVertices;
        for ( int j = 0; j < s; j++ ) {
            int v;
            cin >> v;
            vertices.push_back( v );
            virtualVertices.push_back( v );
        }
        sort( vertices.begin(), vertices.end(), []( int u, int v ) {
            return timeIn[u] < timeIn[v];
        } );
        for ( int j = 0; j < s - 1; j++ )
            virtualVertices.push_back( lca( vertices[j], vertices[j + 1] ) );
        sort( virtualVertices.begin(), virtualVertices.end(), []( int u, int v ) {
            return timeIn[u] < timeIn[v];
        } );
        virtualVertices.resize( unique( virtualVertices.begin(), virtualVertices.end() ) - virtualVertices.begin() );

        vector <int> stack;
        stack.push_back( virtualVertices[0] );
        for ( int j = 1; j < virtualVertices.size(); j++ ) {
            int v = virtualVertices[j];

            while ( !inSubtree( stack.back(), v ) )
                stack.pop_back();

            used[stack.back()]--;
            used[v]++;

            stack.push_back( virtualVertices[j] );
        }
    }

    getUsed( 1, 0 );

    for ( int v = 1; v <= n; v++ ) {
        if ( used[v] >= k )
            ans.push_back( parentEdge[v] );
    }

    cout << ans.size() << "\n";
    sort( ans.begin(), ans.end() );
    for ( int e: ans )
        cout << e << " ";

    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:115:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |         for ( int j = 1; j < virtualVertices.size(); j++ ) {
      |                          ~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12208 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 6 ms 13048 KB Output is correct
7 Correct 6 ms 12380 KB Output is correct
8 Correct 6 ms 12476 KB Output is correct
9 Correct 7 ms 12636 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9904 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9740 KB Output is correct
14 Correct 2 ms 9820 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12208 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 6 ms 13048 KB Output is correct
7 Correct 6 ms 12380 KB Output is correct
8 Correct 6 ms 12476 KB Output is correct
9 Correct 7 ms 12636 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9904 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9740 KB Output is correct
14 Correct 2 ms 9820 KB Output is correct
15 Correct 37 ms 12380 KB Output is correct
16 Correct 29 ms 12420 KB Output is correct
17 Correct 31 ms 12428 KB Output is correct
18 Correct 7 ms 12636 KB Output is correct
19 Correct 6 ms 12380 KB Output is correct
20 Correct 24 ms 12464 KB Output is correct
21 Correct 30 ms 12380 KB Output is correct
22 Correct 2 ms 7768 KB Output is correct
23 Correct 6 ms 12380 KB Output is correct
24 Correct 6 ms 12212 KB Output is correct
25 Correct 2 ms 9820 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 6 ms 12892 KB Output is correct
28 Correct 6 ms 12380 KB Output is correct
29 Correct 6 ms 12464 KB Output is correct
30 Correct 6 ms 12380 KB Output is correct
31 Correct 2 ms 9816 KB Output is correct
32 Correct 2 ms 9820 KB Output is correct
33 Correct 2 ms 9820 KB Output is correct
34 Correct 2 ms 9820 KB Output is correct
35 Correct 3 ms 9820 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 24268 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 101 ms 25392 KB Output is correct
4 Correct 89 ms 24912 KB Output is correct
5 Correct 102 ms 25760 KB Output is correct
6 Correct 87 ms 26056 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 19484 KB Output is correct
2 Correct 71 ms 17504 KB Output is correct
3 Correct 90 ms 16980 KB Output is correct
4 Correct 87 ms 17196 KB Output is correct
5 Correct 85 ms 17196 KB Output is correct
6 Correct 73 ms 21136 KB Output is correct
7 Correct 80 ms 21160 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 19484 KB Output is correct
2 Correct 71 ms 17504 KB Output is correct
3 Correct 90 ms 16980 KB Output is correct
4 Correct 87 ms 17196 KB Output is correct
5 Correct 85 ms 17196 KB Output is correct
6 Correct 73 ms 21136 KB Output is correct
7 Correct 80 ms 21160 KB Output is correct
8 Correct 86 ms 21020 KB Output is correct
9 Correct 83 ms 21060 KB Output is correct
10 Correct 86 ms 25760 KB Output is correct
11 Correct 107 ms 25872 KB Output is correct
12 Correct 67 ms 17020 KB Output is correct
13 Correct 69 ms 16980 KB Output is correct
14 Correct 101 ms 17128 KB Output is correct
15 Correct 83 ms 16980 KB Output is correct
16 Correct 83 ms 17208 KB Output is correct
17 Correct 85 ms 16980 KB Output is correct
18 Correct 89 ms 17200 KB Output is correct
19 Correct 77 ms 17376 KB Output is correct
20 Correct 82 ms 21392 KB Output is correct
21 Correct 81 ms 21460 KB Output is correct
22 Correct 75 ms 21400 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12208 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 6 ms 13048 KB Output is correct
7 Correct 6 ms 12380 KB Output is correct
8 Correct 6 ms 12476 KB Output is correct
9 Correct 7 ms 12636 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9904 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9740 KB Output is correct
14 Correct 2 ms 9820 KB Output is correct
15 Correct 37 ms 12380 KB Output is correct
16 Correct 29 ms 12420 KB Output is correct
17 Correct 31 ms 12428 KB Output is correct
18 Correct 7 ms 12636 KB Output is correct
19 Correct 6 ms 12380 KB Output is correct
20 Correct 24 ms 12464 KB Output is correct
21 Correct 30 ms 12380 KB Output is correct
22 Correct 2 ms 7768 KB Output is correct
23 Correct 6 ms 12380 KB Output is correct
24 Correct 6 ms 12212 KB Output is correct
25 Correct 2 ms 9820 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 6 ms 12892 KB Output is correct
28 Correct 6 ms 12380 KB Output is correct
29 Correct 6 ms 12464 KB Output is correct
30 Correct 6 ms 12380 KB Output is correct
31 Correct 2 ms 9816 KB Output is correct
32 Correct 2 ms 9820 KB Output is correct
33 Correct 2 ms 9820 KB Output is correct
34 Correct 2 ms 9820 KB Output is correct
35 Correct 3 ms 9820 KB Output is correct
36 Correct 89 ms 24268 KB Output is correct
37 Correct 2 ms 9820 KB Output is correct
38 Correct 101 ms 25392 KB Output is correct
39 Correct 89 ms 24912 KB Output is correct
40 Correct 102 ms 25760 KB Output is correct
41 Correct 87 ms 26056 KB Output is correct
42 Correct 74 ms 19484 KB Output is correct
43 Correct 71 ms 17504 KB Output is correct
44 Correct 90 ms 16980 KB Output is correct
45 Correct 87 ms 17196 KB Output is correct
46 Correct 85 ms 17196 KB Output is correct
47 Correct 73 ms 21136 KB Output is correct
48 Correct 80 ms 21160 KB Output is correct
49 Correct 86 ms 21020 KB Output is correct
50 Correct 83 ms 21060 KB Output is correct
51 Correct 86 ms 25760 KB Output is correct
52 Correct 107 ms 25872 KB Output is correct
53 Correct 67 ms 17020 KB Output is correct
54 Correct 69 ms 16980 KB Output is correct
55 Correct 101 ms 17128 KB Output is correct
56 Correct 83 ms 16980 KB Output is correct
57 Correct 83 ms 17208 KB Output is correct
58 Correct 85 ms 16980 KB Output is correct
59 Correct 89 ms 17200 KB Output is correct
60 Correct 77 ms 17376 KB Output is correct
61 Correct 82 ms 21392 KB Output is correct
62 Correct 81 ms 21460 KB Output is correct
63 Correct 75 ms 21400 KB Output is correct
64 Correct 78 ms 21332 KB Output is correct
65 Correct 92 ms 17072 KB Output is correct
66 Correct 95 ms 16976 KB Output is correct
67 Correct 109 ms 16980 KB Output is correct
68 Correct 60 ms 16980 KB Output is correct
69 Correct 74 ms 16940 KB Output is correct
70 Correct 101 ms 21652 KB Output is correct
71 Correct 84 ms 20884 KB Output is correct
72 Correct 2 ms 7772 KB Output is correct
73 Correct 8 ms 12376 KB Output is correct
74 Correct 8 ms 12380 KB Output is correct
75 Correct 2 ms 9820 KB Output is correct
76 Correct 2 ms 9820 KB Output is correct
77 Correct 7 ms 12860 KB Output is correct
78 Correct 7 ms 12628 KB Output is correct
79 Correct 6 ms 12380 KB Output is correct
80 Correct 6 ms 12380 KB Output is correct
81 Correct 2 ms 9820 KB Output is correct
82 Correct 2 ms 9820 KB Output is correct
83 Correct 2 ms 9816 KB Output is correct
84 Correct 2 ms 9820 KB Output is correct
85 Correct 3 ms 9820 KB Output is correct
86 Correct 37 ms 12888 KB Output is correct
87 Correct 37 ms 12804 KB Output is correct
88 Correct 30 ms 12888 KB Output is correct
89 Correct 7 ms 12892 KB Output is correct
90 Correct 7 ms 12536 KB Output is correct
91 Correct 24 ms 12892 KB Output is correct
92 Correct 30 ms 12892 KB Output is correct
93 Correct 2 ms 9820 KB Output is correct
94 Correct 96 ms 25768 KB Output is correct
95 Correct 118 ms 25384 KB Output is correct
96 Correct 85 ms 24884 KB Output is correct
97 Correct 90 ms 25800 KB Output is correct
98 Correct 89 ms 26060 KB Output is correct
99 Correct 87 ms 17208 KB Output is correct
100 Correct 84 ms 16980 KB Output is correct
101 Correct 117 ms 17232 KB Output is correct
102 Correct 77 ms 17516 KB Output is correct
103 Correct 74 ms 21152 KB Output is correct
104 Correct 75 ms 21400 KB Output is correct
105 Correct 80 ms 20880 KB Output is correct
106 Correct 89 ms 21124 KB Output is correct
107 Correct 87 ms 21008 KB Output is correct
108 Correct 92 ms 25800 KB Output is correct
109 Correct 88 ms 25804 KB Output is correct
110 Correct 67 ms 17020 KB Output is correct
111 Correct 65 ms 16976 KB Output is correct
112 Correct 88 ms 16980 KB Output is correct
113 Correct 86 ms 16956 KB Output is correct