oj.uz

답안 #631380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631380 2022-08-18T04:34:51 Z mdn2002 Jail (JOI22_jail) C++14
61 / 100
 1878 ms 75156 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;
        for ( int i = 1 ; i <= m ; i ++ )
        {
            cin >> s [i] >> t [i];
            ss [ s [i] ] . push_back ( i );
            tt [ t [i] ] . push_back ( i );
        }
        if ( m <= 500 )
        {
            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
        {
            for ( int i = 1 ; i <= m ; i ++ )
            {
                int a = lca ( s [i] , t [i] ) , x = s [i];
                while ( true )
                {
                    for ( auto u : ss [x] ) grr [i] . push_back ( u );
                    for ( auto u : tt [x] ) grr [u] . push_back ( i );
                    if ( x == a ) break;
                    x = st [x][0];
                }
                x = t [i];
                while ( true )
                {
                    for ( auto u : ss [x] ) grr [i] . push_back ( u );
                    for ( auto u : tt [x] ) grr [u] . push_back ( i );
                    if ( a == x ) break;
                    x = st [x][0];
                }
            }
        }
        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 11 ms 19164 KB Output is correct
2 Correct 12 ms 19028 KB Output is correct
3 Correct 12 ms 19084 KB Output is correct
4 Correct 32 ms 19064 KB Output is correct
5 Correct 56 ms 19152 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 14 ms 19156 KB Output is correct
8 Correct 27 ms 19180 KB Output is correct
9 Correct 496 ms 22392 KB Output is correct
10 Correct 153 ms 40612 KB Output is correct
11 Correct 28 ms 19108 KB Output is correct
12 Correct 295 ms 19212 KB Output is correct
13 Incorrect 274 ms 73336 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19088 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 13 ms 19156 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 13 ms 19156 KB Output is correct
7 Correct 12 ms 19156 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 14 ms 19132 KB Output is correct
11 Correct 14 ms 19156 KB Output is correct
12 Correct 12 ms 19156 KB Output is correct
13 Correct 12 ms 19156 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 11 ms 19028 KB Output is correct
16 Correct 13 ms 19072 KB Output is correct
17 Correct 15 ms 19044 KB Output is correct
18 Correct 13 ms 19076 KB Output is correct
19 Correct 10 ms 19028 KB Output is correct
20 Correct 12 ms 19156 KB Output is correct
21 Correct 12 ms 19124 KB Output is correct
22 Correct 13 ms 19156 KB Output is correct
23 Correct 11 ms 19092 KB Output is correct
24 Correct 11 ms 19028 KB Output is correct
25 Correct 13 ms 19160 KB Output is correct
26 Correct 10 ms 19116 KB Output is correct
27 Correct 12 ms 19156 KB Output is correct
28 Correct 11 ms 19036 KB Output is correct
29 Correct 30 ms 19160 KB Output is correct
30 Correct 46 ms 19180 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 19168 KB Output is correct
34 Correct 89 ms 19160 KB Output is correct
35 Correct 75 ms 19216 KB Output is correct
36 Correct 68 ms 19148 KB Output is correct
37 Correct 34 ms 19176 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19088 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 13 ms 19156 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 13 ms 19156 KB Output is correct
7 Correct 12 ms 19156 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 14 ms 19132 KB Output is correct
11 Correct 14 ms 19156 KB Output is correct
12 Correct 12 ms 19156 KB Output is correct
13 Correct 12 ms 19156 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 11 ms 19028 KB Output is correct
16 Correct 13 ms 19072 KB Output is correct
17 Correct 15 ms 19044 KB Output is correct
18 Correct 13 ms 19076 KB Output is correct
19 Correct 10 ms 19028 KB Output is correct
20 Correct 12 ms 19156 KB Output is correct
21 Correct 12 ms 19124 KB Output is correct
22 Correct 13 ms 19156 KB Output is correct
23 Correct 11 ms 19092 KB Output is correct
24 Correct 11 ms 19028 KB Output is correct
25 Correct 13 ms 19160 KB Output is correct
26 Correct 10 ms 19116 KB Output is correct
27 Correct 12 ms 19156 KB Output is correct
28 Correct 11 ms 19036 KB Output is correct
29 Correct 30 ms 19160 KB Output is correct
30 Correct 46 ms 19180 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 19168 KB Output is correct
34 Correct 89 ms 19160 KB Output is correct
35 Correct 75 ms 19216 KB Output is correct
36 Correct 68 ms 19148 KB Output is correct
37 Correct 34 ms 19176 KB Output is correct
38 Correct 525 ms 22288 KB Output is correct
39 Correct 156 ms 40540 KB Output is correct
40 Correct 1480 ms 21304 KB Output is correct
41 Correct 1815 ms 20176 KB Output is correct
42 Correct 1878 ms 21624 KB Output is correct
43 Correct 71 ms 19968 KB Output is correct
44 Correct 1657 ms 19548 KB Output is correct
45 Correct 275 ms 33740 KB Output is correct
46 Correct 226 ms 33732 KB Output is correct
47 Correct 189 ms 36532 KB Output is correct
48 Correct 212 ms 36484 KB Output is correct
49 Correct 198 ms 33980 KB Output is correct
50 Correct 188 ms 33896 KB Output is correct
51 Correct 104 ms 34612 KB Output is correct
52 Correct 108 ms 34628 KB Output is correct
53 Correct 1462 ms 20252 KB Output is correct
54 Correct 255 ms 33676 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 13 ms 19028 KB Output is correct
5 Correct 34 ms 19116 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 13 ms 19028 KB Output is correct
8 Correct 13 ms 19000 KB Output is correct
9 Correct 12 ms 19028 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 11 ms 19120 KB Output is correct
12 Correct 79 ms 19156 KB Output is correct
13 Correct 715 ms 19268 KB Output is correct
14 Correct 348 ms 19140 KB Output is correct
15 Correct 591 ms 19156 KB Output is correct
16 Correct 141 ms 34872 KB Output is correct
17 Correct 359 ms 47212 KB Output is correct
18 Correct 776 ms 75156 KB Output is correct
19 Incorrect 166 ms 37452 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19164 KB Output is correct
2 Correct 12 ms 19028 KB Output is correct
3 Correct 12 ms 19084 KB Output is correct
4 Correct 32 ms 19064 KB Output is correct
5 Correct 56 ms 19152 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 14 ms 19156 KB Output is correct
8 Correct 27 ms 19180 KB Output is correct
9 Correct 496 ms 22392 KB Output is correct
10 Correct 153 ms 40612 KB Output is correct
11 Correct 28 ms 19108 KB Output is correct
12 Correct 295 ms 19212 KB Output is correct
13 Incorrect 274 ms 73336 KB Output isn't correct
14 Halted 0 ms 0 KB -