oj.uz

Submission #933497

# Submission time Handle Problem Language Result Execution time Memory
933497 2024-02-25T18:50:20 Z LucaIlie Railway (BOI17_railway) C++17
23 / 100
 1000 ms 21528 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 ) {
    //printf( "%d %d: %d %d %d %d\n", u, v,  timeIn[u], timeOut[u], timeIn[v], timeOut[v] );
    return (timeIn[u] <= timeIn[v] && timeOut[v] <= timeOut[u]);
}

int k;
vector<int> ans;

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

    int m;

    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() );

        /*for ( int v: virtualVertices )
            cout << v << " ";
        cout << "\n";*/
        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();

           // printf( "add %d %d\n", stack.back(), v );
            while ( v != stack.back() ) {
                used[v]++;
                v = parent[0][v];
            }

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

    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:111:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         for ( int j = 1; j < virtualVertices.size(); j++ ) {
      |                          ~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7772 KB Output is correct
2 Correct 12 ms 12376 KB Output is correct
3 Correct 10 ms 12376 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 11 ms 12888 KB Output is correct
7 Correct 9 ms 12380 KB Output is correct
8 Correct 8 ms 12380 KB Output is correct
9 Correct 9 ms 12632 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9912 KB Output is correct
13 Correct 2 ms 9820 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 1 ms 7772 KB Output is correct
2 Correct 12 ms 12376 KB Output is correct
3 Correct 10 ms 12376 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 11 ms 12888 KB Output is correct
7 Correct 9 ms 12380 KB Output is correct
8 Correct 8 ms 12380 KB Output is correct
9 Correct 9 ms 12632 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9912 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 2 ms 9820 KB Output is correct
15 Correct 57 ms 12776 KB Output is correct
16 Correct 51 ms 12888 KB Output is correct
17 Correct 43 ms 12756 KB Output is correct
18 Correct 18 ms 12632 KB Output is correct
19 Correct 13 ms 12376 KB Output is correct
20 Correct 39 ms 12892 KB Output is correct
21 Correct 46 ms 12888 KB Output is correct
22 Correct 2 ms 7772 KB Output is correct
23 Correct 9 ms 12460 KB Output is correct
24 Correct 9 ms 12376 KB Output is correct
25 Correct 2 ms 9820 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 15 ms 13012 KB Output is correct
28 Correct 9 ms 12520 KB Output is correct
29 Correct 9 ms 12376 KB Output is correct
30 Correct 12 ms 12520 KB Output is correct
31 Correct 2 ms 9820 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 2 ms 9820 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 21528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 18276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 18276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7772 KB Output is correct
2 Correct 12 ms 12376 KB Output is correct
3 Correct 10 ms 12376 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9820 KB Output is correct
6 Correct 11 ms 12888 KB Output is correct
7 Correct 9 ms 12380 KB Output is correct
8 Correct 8 ms 12380 KB Output is correct
9 Correct 9 ms 12632 KB Output is correct
10 Correct 2 ms 9820 KB Output is correct
11 Correct 2 ms 9820 KB Output is correct
12 Correct 2 ms 9912 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 2 ms 9820 KB Output is correct
15 Correct 57 ms 12776 KB Output is correct
16 Correct 51 ms 12888 KB Output is correct
17 Correct 43 ms 12756 KB Output is correct
18 Correct 18 ms 12632 KB Output is correct
19 Correct 13 ms 12376 KB Output is correct
20 Correct 39 ms 12892 KB Output is correct
21 Correct 46 ms 12888 KB Output is correct
22 Correct 2 ms 7772 KB Output is correct
23 Correct 9 ms 12460 KB Output is correct
24 Correct 9 ms 12376 KB Output is correct
25 Correct 2 ms 9820 KB Output is correct
26 Correct 2 ms 9820 KB Output is correct
27 Correct 15 ms 13012 KB Output is correct
28 Correct 9 ms 12520 KB Output is correct
29 Correct 9 ms 12376 KB Output is correct
30 Correct 12 ms 12520 KB Output is correct
31 Correct 2 ms 9820 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 2 ms 9820 KB Output is correct
36 Execution timed out 1035 ms 21528 KB Time limit exceeded
37 Halted 0 ms 0 KB -