Submission #883931

#	Time	Username	Problem	Language	Result	Execution time	Memory
883931		LucaIlie	Jail (JOI22_jail)	C++17	0 / 100	19 ms	82524 KiB

jail

#include <iostream>
#include <queue>
#include <vector>

using namespace std;

struct prisoner {
    int b, w;
};

const int MAX_N = 1.2e5;
const int MAX_M = MAX_N;
const int MAX_LOG_N = 16;
const int MAX_V = MAX_M + MAX_N * (MAX_LOG_N + 1);
int parent[MAX_LOG_N + 1][MAX_N + 1], depth[MAX_N + 1], vert[MAX_M], vert1[MAX_LOG_N + 1][MAX_N + 1], vert2[MAX_LOG_N + 1][MAX_N + 1], bedroom[MAX_N + 1], workroom[MAX_N + 1], in[MAX_V + 1];
vector <int> edges[MAX_N + 1], g[MAX_V];
prisoner prisoners[MAX_M + 1];

void dfs( int u, int p ) {
    depth[u] = depth[p] + 1;
    parent[0][u] = p;
    for ( int v: edges[u] ) {
        if ( v == p )
            continue;
        dfs( v, u );
    }
}

int main() {
    int t;

    cin >> t;
    while ( t-- ) {
        int n, m;

        cin >> n;
        for ( int v = 1; v <= n; v++ ) {
            edges[v].clear();
            workroom[v] = 0;
            bedroom[v] = 0;
        }
        for ( int i = 0; i < n - 1; i++ ) {
            int u, v;
            cin >> u >> v;
            edges[u].push_back( v );
            edges[v].push_back( u );
        }
        cin >> m;
        for ( int i = 1; i <= m; i++ )
            cin >> prisoners[i].b >> prisoners[i].w;

        dfs( 1, 0 );

        int V = 0;
        for ( int i = 1; i <= m; i++ )
            vert[i] = V++;
        for ( int l = 0; l <= MAX_LOG_N; l++ ) {
            for ( int v = 1; v <= n; v++ ) {
                vert1[l][v] = V++;
                vert2[l][v] = V++;
            }
        }

        for ( int i = 1; i <= m; i++ ) {
            g[vert[prisoners[i].b]].push_back( vert1[0][prisoners[i].b] );
            g[vert2[0][prisoners[i].w]].push_back( vert[prisoners[i].w] );
        }

        for ( int l = 1; l <= MAX_LOG_N; l++ ) {
            for ( int v = 1; v <= n; v++ ) {
                parent[l][v] = parent[l - 1][parent[l - 1][v]];
                g[vert1[l - 1][v]].push_back( vert1[l][v] );
                g[vert1[l - 1][parent[l - 1][v]]].push_back( vert1[l][v] );
                g[vert2[l][v]].push_back( vert2[l - 1][v] );
                g[vert2[l][v]].push_back( vert2[l - 1][parent[l - 1][v]] );
            }
        }

        for ( int i = 1; i <= m; i++ ) {
            int u = prisoners[i].b, v = prisoners[i].w;

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

            for ( int l = MAX_LOG_N; l >= 0; l-- ) {
                if ( depth[parent[l][u]] >= depth[v] ) {
                    g[vert1[l][u]].push_back( vert[i] );
                    g[vert[i]].push_back( vert2[l][u] );
                    u = parent[l][u];
                }
            }

            for ( int l = MAX_LOG_N; l >= 0; l-- ) {
                if ( parent[l][u] != parent[l][v] ) {
                    g[vert1[l][u]].push_back( vert[i] );
                    g[vert[i]].push_back( vert2[l][u] );
                    g[vert1[l][v]].push_back( vert[i] );
                    g[vert[i]].push_back( vert2[l][v] );
                    u = parent[l][u];
                    v = parent[l][v];
                }
            }

            g[vert1[0][u]].push_back( vert[i] );
            g[vert[i]].push_back( vert2[0][u] );
        }

        for ( int i = 0; i < V; i++ ) {
            for ( int j: g[i] )
                in[j]++;
        }
        queue <int> q;
        for ( int i = 0; i < V; i++ ) {
            if ( in[i] == 0 )
                q.push( i );
        }
        int pasi = 0;
        while ( !q.empty() ) {
            int u = q.front();
            q.pop();
            pasi++;

            for ( int v: g[u] ) {
                in[v]--;
                if ( in[v] == 0 )
                    q.push( v );
            }
        }

        cout << (pasi == V ? "Yes\n" : "No\n");
    }

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 16
• Subtask 4: 0 / 28
• Subtask 5: 0 / 12
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23