oj.uz

답안 #631387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631387 2022-08-18T04:45:54 Z mdn2002 Jail (JOI22_jail) C++14
61 / 100
 1837 ms 42740 KB 
#include<bits/stdc++.h>
using namespace std;
int n , m , st [200005][21] , dp [200005] , s [200005] , t [200005] , vis [200005] , ff;
vector < int > gr [200005] , grr [200005] , ss [200005] , tt [200005];
void dfs ( int x , int p )
{
    dp [x] = dp [p] + 1;
    st [x][0] = p;
    for ( auto u : gr [x] )
    {
        if ( u == p ) continue;
        dfs ( u , x );
    }
}
void dfss ( int x )
{
    vis [x] = 1;
    for ( auto u : grr [x] )
    {
        if ( vis [u] == 1 )
        {
            ff = 1;
            continue;
        }
        else if ( vis [u] == 2 ) continue;
        else dfss ( u );
    }
    vis [x] = 2;
}
int lca ( int x , int y )
{
    if ( dp [x] > dp [y] ) swap ( x , y );
    int dif = dp [y] - dp [x];
    for ( int i = 0 ; i <= 20 ; i ++ )
    {
        if ( ( dif & ( 1 << i ) ) ) y = st [y][i];
    }
    if ( x == y ) return x;
    for ( int i = 20 ; i >= 0 ; i -- )
    {
        if ( st [x][i] != st [y][i] )
        {
            x = st [x][i];
            y = st [y][i];
        }
    }
    return st [x][0];
}
int inbet ( int x , int y , int z )
{
    if ( dp [z] > dp [x] && dp [z] > dp [y] ) return 0;
    int aa = lca ( x , y );
    if ( dp [aa] > dp [z] ) return 0;
    int a = lca ( x , z );
    int b = lca ( y , z );
    if ( a == z || b == z ) return 1;
    return 0;
}
int main()
{
    int q;
    cin >> q;
    while ( q -- )
    {
        ff = 0;
        cin >> n;
        for ( int i = 1 ; i <= n ; i ++ )
        {
            gr [i] . clear ();
            grr [i] . clear ();
            ss [i] . clear ();
            tt [i] . clear ();
            dp [i] = 0;
            vis [i] = 0;
            for ( int j = 0 ; j <= 20 ; j ++ ) st [i][j] = 0;
        }
        for ( int i = 0 ; i < n - 1 ; i ++ )
        {
            int x , y;
            cin >> x >> y;
            gr [x] . push_back ( y );
            gr [y] . push_back ( x );
        }
        dfs ( 1 , 0 );
        for ( int i = 1 ; i <= 20 ; i ++ )
        {
            for ( int j = 1 ; j <= n ; j ++ ) st [j][i] = st [ st [j][ i - 1 ] ][ i - 1 ];
        }
        cin >> m;
        long long sum = 0;
        for ( int i = 1 ; i <= m ; i ++ )
        {
            cin >> s [i] >> t [i];
            ss [ s [i] ] . push_back ( i );
            tt [ t [i] ] . push_back ( i );
            int a = lca ( s [i] , t [i] );
            sum += dp [ s [i] ] - dp [a] + dp [ t [i] ] - dp [a];
        }
        if ( m <= 2000 )
        {
            for ( int i = 1 ; i <= m ; i ++ )
            {
                for ( int j = 1 ; j <= m ; j ++ )
                {
                    if ( i == j ) continue;
                    if ( inbet ( s [i] , t [i] , s [j] ) ) grr [i] . push_back ( j );
                    if ( inbet ( s [i] , t [i] , t [j] ) ) grr [j] . push_back ( i );
                }
            }
        }
        else if ( sum <= 20000 )
        {
            for ( int i = 1 ; i <= m ; i ++ )
            {
                int a = lca ( s [i] , t [i] ) , x = s [i];
                while ( true )
                {
                    for ( auto u : ss [x] )
                    {
                        if ( u != i ) grr [i] . push_back ( u );
                    }
                    for ( auto u : tt [x] )
                    {
                        if ( u != i ) grr [u] . push_back ( i );
                    }
                    if ( x == a ) break;
                    x = st [x][0];
                }
                x = t [i];
                while ( true )
                {
                    for ( auto u : ss [x] )
                    {
                        if ( u != i ) grr [i] . push_back ( u );
                    }
                    for ( auto u : tt [x] )
                    {
                        if ( u != i ) grr [u] . push_back ( i );
                    }
                    if ( a == x ) break;
                    x = st [x][0];
                }
            }
        }
        else
        {
            cout << "No" << endl;
            continue;
        }
        for ( int i = 1 ; i <= m ; i ++ )
        {
            if ( vis [i] == 0 ) dfss ( i );
        }
        if ( ff ) cout << "No" << endl;
        else cout << "Yes" << endl;
    }
}

/*
1
4
1 2
2 3
3 4
2
1 3
4 2
*/

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 14 ms 19028 KB Output is correct
4 Correct 38 ms 19144 KB Output is correct
5 Correct 69 ms 19028 KB Output is correct
6 Correct 13 ms 19048 KB Output is correct
7 Correct 12 ms 19156 KB Output is correct
8 Correct 28 ms 19224 KB Output is correct
9 Correct 496 ms 22400 KB Output is correct
10 Correct 155 ms 40540 KB Output is correct
11 Correct 29 ms 19124 KB Output is correct
12 Correct 305 ms 19336 KB Output is correct
13 Incorrect 143 ms 42740 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 12 ms 19164 KB Output is correct
4 Correct 12 ms 19092 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 14 ms 19156 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19124 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19120 KB Output is correct
12 Correct 13 ms 19040 KB Output is correct
13 Correct 13 ms 19152 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 12 ms 19164 KB Output is correct
4 Correct 12 ms 19092 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 14 ms 19156 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19124 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19120 KB Output is correct
12 Correct 13 ms 19040 KB Output is correct
13 Correct 13 ms 19152 KB Output is correct
14 Correct 12 ms 19060 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 12 ms 19124 KB Output is correct
17 Correct 13 ms 19156 KB Output is correct
18 Correct 14 ms 19156 KB Output is correct
19 Correct 11 ms 19040 KB Output is correct
20 Correct 14 ms 19156 KB Output is correct
21 Correct 14 ms 19048 KB Output is correct
22 Correct 12 ms 19156 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 13 ms 19028 KB Output is correct
25 Correct 14 ms 19116 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 13 ms 19156 KB Output is correct
28 Correct 11 ms 19072 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 12 ms 19164 KB Output is correct
4 Correct 12 ms 19092 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 14 ms 19156 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19124 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19120 KB Output is correct
12 Correct 13 ms 19040 KB Output is correct
13 Correct 13 ms 19152 KB Output is correct
14 Correct 12 ms 19060 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 12 ms 19124 KB Output is correct
17 Correct 13 ms 19156 KB Output is correct
18 Correct 14 ms 19156 KB Output is correct
19 Correct 11 ms 19040 KB Output is correct
20 Correct 14 ms 19156 KB Output is correct
21 Correct 14 ms 19048 KB Output is correct
22 Correct 12 ms 19156 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 13 ms 19028 KB Output is correct
25 Correct 14 ms 19116 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 13 ms 19156 KB Output is correct
28 Correct 11 ms 19072 KB Output is correct
29 Correct 30 ms 19228 KB Output is correct
30 Correct 53 ms 19172 KB Output is correct
31 Correct 28 ms 19156 KB Output is correct
32 Correct 22 ms 19156 KB Output is correct
33 Correct 15 ms 19124 KB Output is correct
34 Correct 84 ms 19172 KB Output is correct
35 Correct 73 ms 19220 KB Output is correct
36 Correct 72 ms 19140 KB Output is correct
37 Correct 35 ms 19176 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 12 ms 19164 KB Output is correct
4 Correct 12 ms 19092 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 14 ms 19156 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19124 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19120 KB Output is correct
12 Correct 13 ms 19040 KB Output is correct
13 Correct 13 ms 19152 KB Output is correct
14 Correct 12 ms 19060 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 12 ms 19124 KB Output is correct
17 Correct 13 ms 19156 KB Output is correct
18 Correct 14 ms 19156 KB Output is correct
19 Correct 11 ms 19040 KB Output is correct
20 Correct 14 ms 19156 KB Output is correct
21 Correct 14 ms 19048 KB Output is correct
22 Correct 12 ms 19156 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 13 ms 19028 KB Output is correct
25 Correct 14 ms 19116 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 13 ms 19156 KB Output is correct
28 Correct 11 ms 19072 KB Output is correct
29 Correct 30 ms 19228 KB Output is correct
30 Correct 53 ms 19172 KB Output is correct
31 Correct 28 ms 19156 KB Output is correct
32 Correct 22 ms 19156 KB Output is correct
33 Correct 15 ms 19124 KB Output is correct
34 Correct 84 ms 19172 KB Output is correct
35 Correct 73 ms 19220 KB Output is correct
36 Correct 72 ms 19140 KB Output is correct
37 Correct 35 ms 19176 KB Output is correct
38 Correct 486 ms 22296 KB Output is correct
39 Correct 145 ms 40656 KB Output is correct
40 Correct 1438 ms 21328 KB Output is correct
41 Correct 1837 ms 20288 KB Output is correct
42 Correct 1731 ms 21648 KB Output is correct
43 Correct 78 ms 19964 KB Output is correct
44 Correct 1631 ms 19476 KB Output is correct
45 Correct 228 ms 33740 KB Output is correct
46 Correct 300 ms 33708 KB Output is correct
47 Correct 191 ms 36556 KB Output is correct
48 Correct 219 ms 36472 KB Output is correct
49 Correct 217 ms 33868 KB Output is correct
50 Correct 193 ms 33776 KB Output is correct
51 Correct 110 ms 34564 KB Output is correct
52 Correct 115 ms 34536 KB Output is correct
53 Correct 1430 ms 20288 KB Output is correct
54 Correct 293 ms 33744 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19116 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 10 ms 19128 KB Output is correct
5 Correct 29 ms 19124 KB Output is correct
6 Correct 15 ms 19156 KB Output is correct
7 Correct 11 ms 19032 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 12 ms 19028 KB Output is correct
10 Correct 11 ms 19028 KB Output is correct
11 Correct 10 ms 19080 KB Output is correct
12 Correct 68 ms 19140 KB Output is correct
13 Correct 654 ms 19200 KB Output is correct
14 Correct 340 ms 19136 KB Output is correct
15 Correct 578 ms 19272 KB Output is correct
16 Correct 120 ms 34492 KB Output is correct
17 Correct 194 ms 38096 KB Output is correct
18 Correct 261 ms 42288 KB Output is correct
19 Incorrect 138 ms 35272 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 14 ms 19028 KB Output is correct
4 Correct 38 ms 19144 KB Output is correct
5 Correct 69 ms 19028 KB Output is correct
6 Correct 13 ms 19048 KB Output is correct
7 Correct 12 ms 19156 KB Output is correct
8 Correct 28 ms 19224 KB Output is correct
9 Correct 496 ms 22400 KB Output is correct
10 Correct 155 ms 40540 KB Output is correct
11 Correct 29 ms 19124 KB Output is correct
12 Correct 305 ms 19336 KB Output is correct
13 Incorrect 143 ms 42740 KB Output isn't correct
14 Halted 0 ms 0 KB -