oj.uz

답안 #631379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631379 2022-08-18T04:29:32 Z mdn2002 Jail (JOI22_jail) C++14
61 / 100
 5000 ms 34180 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];
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 ();
            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];
        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 );
            }
        }
        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 6 ms 9688 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 25 ms 9684 KB Output is correct
5 Correct 50 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 7 ms 9732 KB Output is correct
8 Correct 21 ms 9784 KB Output is correct
9 Correct 462 ms 12576 KB Output is correct
10 Correct 138 ms 31180 KB Output is correct
11 Correct 21 ms 9684 KB Output is correct
12 Correct 274 ms 9736 KB Output is correct
13 Execution timed out 5077 ms 34180 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 7 ms 9736 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 8 ms 9692 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 7 ms 9684 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 7 ms 9736 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 8 ms 9692 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 7 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9624 KB Output is correct
16 Correct 7 ms 9660 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 7 ms 9812 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 7 ms 9684 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 7 ms 9736 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 8 ms 9692 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 7 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9624 KB Output is correct
16 Correct 7 ms 9660 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 7 ms 9812 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 7 ms 9684 KB Output is correct
29 Correct 22 ms 9852 KB Output is correct
30 Correct 37 ms 9684 KB Output is correct
31 Correct 24 ms 9792 KB Output is correct
32 Correct 18 ms 9748 KB Output is correct
33 Correct 8 ms 9684 KB Output is correct
34 Correct 73 ms 9760 KB Output is correct
35 Correct 72 ms 9792 KB Output is correct
36 Correct 65 ms 9752 KB Output is correct
37 Correct 29 ms 9764 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 7 ms 9736 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 8 ms 9692 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 7 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9624 KB Output is correct
16 Correct 7 ms 9660 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 7 ms 9812 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 7 ms 9684 KB Output is correct
29 Correct 22 ms 9852 KB Output is correct
30 Correct 37 ms 9684 KB Output is correct
31 Correct 24 ms 9792 KB Output is correct
32 Correct 18 ms 9748 KB Output is correct
33 Correct 8 ms 9684 KB Output is correct
34 Correct 73 ms 9760 KB Output is correct
35 Correct 72 ms 9792 KB Output is correct
36 Correct 65 ms 9752 KB Output is correct
37 Correct 29 ms 9764 KB Output is correct
38 Correct 462 ms 12632 KB Output is correct
39 Correct 138 ms 31180 KB Output is correct
40 Correct 1349 ms 11724 KB Output is correct
41 Correct 1653 ms 10608 KB Output is correct
42 Correct 1659 ms 11808 KB Output is correct
43 Correct 64 ms 10564 KB Output is correct
44 Correct 1558 ms 10096 KB Output is correct
45 Correct 218 ms 24264 KB Output is correct
46 Correct 217 ms 24324 KB Output is correct
47 Correct 174 ms 27024 KB Output is correct
48 Correct 176 ms 27076 KB Output is correct
49 Correct 189 ms 24424 KB Output is correct
50 Correct 184 ms 24528 KB Output is correct
51 Correct 107 ms 25164 KB Output is correct
52 Correct 101 ms 25168 KB Output is correct
53 Correct 1321 ms 10660 KB Output is correct
54 Correct 214 ms 24368 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9708 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 22 ms 9684 KB Output is correct
6 Correct 6 ms 9744 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9644 KB Output is correct
12 Correct 66 ms 9748 KB Output is correct
13 Correct 628 ms 9800 KB Output is correct
14 Correct 324 ms 9732 KB Output is correct
15 Correct 534 ms 9684 KB Output is correct
16 Execution timed out 5094 ms 24804 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9688 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 25 ms 9684 KB Output is correct
5 Correct 50 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 7 ms 9732 KB Output is correct
8 Correct 21 ms 9784 KB Output is correct
9 Correct 462 ms 12576 KB Output is correct
10 Correct 138 ms 31180 KB Output is correct
11 Correct 21 ms 9684 KB Output is correct
12 Correct 274 ms 9736 KB Output is correct
13 Execution timed out 5077 ms 34180 KB Time limit exceeded
14 Halted 0 ms 0 KB -