oj.uz

답안 #631386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631386 2022-08-18T04:45:16 Z mdn2002 Jail (JOI22_jail) C++14
61 / 100
 1738 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 <= 2000 )
        {
            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 11 ms 19028 KB Output is correct
2 Correct 12 ms 19028 KB Output is correct
3 Correct 10 ms 19052 KB Output is correct
4 Correct 44 ms 19156 KB Output is correct
5 Correct 58 ms 19028 KB Output is correct
6 Correct 12 ms 19148 KB Output is correct
7 Correct 12 ms 19156 KB Output is correct
8 Correct 29 ms 19268 KB Output is correct
9 Correct 484 ms 22260 KB Output is correct
10 Correct 154 ms 40556 KB Output is correct
11 Correct 28 ms 19092 KB Output is correct
12 Correct 280 ms 19232 KB Output is correct
13 Incorrect 157 ms 42740 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 11 ms 18992 KB Output is correct
3 Correct 12 ms 19156 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 13 ms 19156 KB Output is correct
6 Correct 13 ms 19156 KB Output is correct
7 Correct 12 ms 19160 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 19144 KB Output is correct
11 Correct 12 ms 19128 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 11 ms 18992 KB Output is correct
3 Correct 12 ms 19156 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 13 ms 19156 KB Output is correct
6 Correct 13 ms 19156 KB Output is correct
7 Correct 12 ms 19160 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 19144 KB Output is correct
11 Correct 12 ms 19128 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 12 ms 19028 KB Output is correct
16 Correct 13 ms 19156 KB Output is correct
17 Correct 13 ms 19100 KB Output is correct
18 Correct 12 ms 19144 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 12 ms 19156 KB Output is correct
23 Correct 10 ms 19028 KB Output is correct
24 Correct 11 ms 19028 KB Output is correct
25 Correct 13 ms 19160 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 12 ms 19156 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 11 ms 18992 KB Output is correct
3 Correct 12 ms 19156 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 13 ms 19156 KB Output is correct
6 Correct 13 ms 19156 KB Output is correct
7 Correct 12 ms 19160 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 19144 KB Output is correct
11 Correct 12 ms 19128 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 12 ms 19028 KB Output is correct
16 Correct 13 ms 19156 KB Output is correct
17 Correct 13 ms 19100 KB Output is correct
18 Correct 12 ms 19144 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 12 ms 19156 KB Output is correct
23 Correct 10 ms 19028 KB Output is correct
24 Correct 11 ms 19028 KB Output is correct
25 Correct 13 ms 19160 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 12 ms 19156 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct
29 Correct 30 ms 19236 KB Output is correct
30 Correct 52 ms 19164 KB Output is correct
31 Correct 28 ms 19108 KB Output is correct
32 Correct 22 ms 19108 KB Output is correct
33 Correct 13 ms 19156 KB Output is correct
34 Correct 79 ms 19156 KB Output is correct
35 Correct 74 ms 19216 KB Output is correct
36 Correct 76 ms 19148 KB Output is correct
37 Correct 36 ms 19204 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 11 ms 18992 KB Output is correct
3 Correct 12 ms 19156 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 13 ms 19156 KB Output is correct
6 Correct 13 ms 19156 KB Output is correct
7 Correct 12 ms 19160 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 19144 KB Output is correct
11 Correct 12 ms 19128 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 12 ms 19028 KB Output is correct
16 Correct 13 ms 19156 KB Output is correct
17 Correct 13 ms 19100 KB Output is correct
18 Correct 12 ms 19144 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 12 ms 19156 KB Output is correct
23 Correct 10 ms 19028 KB Output is correct
24 Correct 11 ms 19028 KB Output is correct
25 Correct 13 ms 19160 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 12 ms 19156 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct
29 Correct 30 ms 19236 KB Output is correct
30 Correct 52 ms 19164 KB Output is correct
31 Correct 28 ms 19108 KB Output is correct
32 Correct 22 ms 19108 KB Output is correct
33 Correct 13 ms 19156 KB Output is correct
34 Correct 79 ms 19156 KB Output is correct
35 Correct 74 ms 19216 KB Output is correct
36 Correct 76 ms 19148 KB Output is correct
37 Correct 36 ms 19204 KB Output is correct
38 Correct 466 ms 22296 KB Output is correct
39 Correct 148 ms 40780 KB Output is correct
40 Correct 1432 ms 21292 KB Output is correct
41 Correct 1738 ms 20296 KB Output is correct
42 Correct 1716 ms 21616 KB Output is correct
43 Correct 75 ms 19964 KB Output is correct
44 Correct 1615 ms 19756 KB Output is correct
45 Correct 222 ms 33752 KB Output is correct
46 Correct 239 ms 33712 KB Output is correct
47 Correct 197 ms 36516 KB Output is correct
48 Correct 207 ms 36516 KB Output is correct
49 Correct 204 ms 33816 KB Output is correct
50 Correct 205 ms 33928 KB Output is correct
51 Correct 111 ms 34616 KB Output is correct
52 Correct 112 ms 34528 KB Output is correct
53 Correct 1424 ms 20152 KB Output is correct
54 Correct 223 ms 33692 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 10 ms 19028 KB Output is correct
5 Correct 33 ms 19108 KB Output is correct
6 Correct 11 ms 19156 KB Output is correct
7 Correct 11 ms 19052 KB Output is correct
8 Correct 12 ms 19056 KB Output is correct
9 Correct 12 ms 19028 KB Output is correct
10 Correct 13 ms 19120 KB Output is correct
11 Correct 10 ms 19068 KB Output is correct
12 Correct 68 ms 19156 KB Output is correct
13 Correct 698 ms 19200 KB Output is correct
14 Correct 335 ms 19028 KB Output is correct
15 Correct 574 ms 19156 KB Output is correct
16 Correct 128 ms 34548 KB Output is correct
17 Correct 208 ms 38092 KB Output is correct
18 Correct 247 ms 42188 KB Output is correct
19 Incorrect 147 ms 35176 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 12 ms 19028 KB Output is correct
3 Correct 10 ms 19052 KB Output is correct
4 Correct 44 ms 19156 KB Output is correct
5 Correct 58 ms 19028 KB Output is correct
6 Correct 12 ms 19148 KB Output is correct
7 Correct 12 ms 19156 KB Output is correct
8 Correct 29 ms 19268 KB Output is correct
9 Correct 484 ms 22260 KB Output is correct
10 Correct 154 ms 40556 KB Output is correct
11 Correct 28 ms 19092 KB Output is correct
12 Correct 280 ms 19232 KB Output is correct
13 Incorrect 157 ms 42740 KB Output isn't correct
14 Halted 0 ms 0 KB -