oj.uz

답안 #631777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631777 2022-08-18T17:29:49 Z mdn2002 Jail (JOI22_jail) C++14
72 / 100
 1350 ms 112364 KB 
#include<bits/stdc++.h>
using namespace std;
int n , m , st [200005][21] , dp [200005] , s [200005] , t [200005] , aaa [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 go ( int x , int p )
{
    aaa [x] = aaa [p];
    if ( ss [x] . size () || tt [x] . size () ) aaa [x] = x;
    for ( auto u : gr [x] )
    {
        if ( u == p ) continue;
        go ( 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;
            aaa [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] );
        }
        go ( 1 , 0 );
        int num = 0;
        for ( int i = 1 ; i <= m ; i ++ )
        {
            int x = s [i] , y = t [i] , z = lca ( x , y );
            while ( true )
            {
                if ( dp [x] < dp [z] ) break;
                if ( ss [x] . size () )
                {
                    if ( ss [x][0] != i )
                    {
                        grr [i] . push_back ( ss [x][0] );
                        num ++;
                    }
                }
                if ( tt [x] . size () )
                {
                    if ( tt [x][0] != i )
                    {
                        grr [ tt [x][0] ] . push_back ( i );
                        num ++;
                    }
                }
                if ( num > 100 * m ) break;
                if ( x == z ) break;
                x = aaa [ st [x][0] ];
            }
            x = t [i];
            while ( true )
            {
                if ( dp [x] < dp [z] ) break;
                if ( ss [x] . size () )
                {
                    if ( ss [x][0] != i )
                    {
                        grr [i] . push_back ( ss [x][0] );
                        num ++;
                    }
                }
                if ( tt [x] . size () )
                {
                    if ( tt [x][0] != i )
                    {
                        grr [ tt [x][0] ] . push_back ( i );
                        num ++;
                    }
                }
                if ( num > 100 * m ) break;
                if ( x == z ) break;
                x = aaa [ 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
*/

Compilation message

jail.cpp: In function 'int main()':
jail.cpp:107:17: warning: unused variable 'a' [-Wunused-variable]
  107 |             int a = lca ( s [i] , t [i] );
      |                 ^
jail.cpp:101:19: warning: unused variable 'sum' [-Wunused-variable]
  101 |         long long sum = 0;
      |                   ^~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19040 KB Output is correct
2 Correct 13 ms 19028 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 33 ms 19028 KB Output is correct
5 Correct 57 ms 19076 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 11 ms 19080 KB Output is correct
8 Correct 15 ms 19156 KB Output is correct
9 Correct 89 ms 21296 KB Output is correct
10 Correct 135 ms 40328 KB Output is correct
11 Correct 22 ms 19156 KB Output is correct
12 Correct 87 ms 19404 KB Output is correct
13 Correct 230 ms 71704 KB Output is correct
14 Correct 258 ms 73440 KB Output is correct
15 Correct 514 ms 70504 KB Output is correct
16 Correct 1350 ms 112364 KB Output is correct
17 Correct 248 ms 68036 KB Output is correct
18 Correct 203 ms 52204 KB Output is correct
19 Correct 217 ms 68460 KB Output is correct
20 Incorrect 239 ms 68500 KB Output isn't correct
21 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 19088 KB Output is correct
4 Correct 13 ms 19156 KB Output is correct
5 Correct 12 ms 19124 KB Output is correct
6 Correct 15 ms 19028 KB Output is correct
7 Correct 13 ms 19156 KB Output is correct
8 Correct 13 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19136 KB Output is correct
11 Correct 13 ms 19080 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 11 ms 19120 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 19088 KB Output is correct
4 Correct 13 ms 19156 KB Output is correct
5 Correct 12 ms 19124 KB Output is correct
6 Correct 15 ms 19028 KB Output is correct
7 Correct 13 ms 19156 KB Output is correct
8 Correct 13 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19136 KB Output is correct
11 Correct 13 ms 19080 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 11 ms 19120 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 11 ms 19028 KB Output is correct
16 Correct 12 ms 19136 KB Output is correct
17 Correct 12 ms 19156 KB Output is correct
18 Correct 14 ms 19156 KB Output is correct
19 Correct 10 ms 19028 KB Output is correct
20 Correct 15 ms 19064 KB Output is correct
21 Correct 13 ms 19156 KB Output is correct
22 Correct 12 ms 19156 KB Output is correct
23 Correct 10 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 12 ms 19156 KB Output is correct
26 Correct 10 ms 19052 KB Output is correct
27 Correct 12 ms 19044 KB Output is correct
28 Correct 10 ms 19064 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 19088 KB Output is correct
4 Correct 13 ms 19156 KB Output is correct
5 Correct 12 ms 19124 KB Output is correct
6 Correct 15 ms 19028 KB Output is correct
7 Correct 13 ms 19156 KB Output is correct
8 Correct 13 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19136 KB Output is correct
11 Correct 13 ms 19080 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 11 ms 19120 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 11 ms 19028 KB Output is correct
16 Correct 12 ms 19136 KB Output is correct
17 Correct 12 ms 19156 KB Output is correct
18 Correct 14 ms 19156 KB Output is correct
19 Correct 10 ms 19028 KB Output is correct
20 Correct 15 ms 19064 KB Output is correct
21 Correct 13 ms 19156 KB Output is correct
22 Correct 12 ms 19156 KB Output is correct
23 Correct 10 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 12 ms 19156 KB Output is correct
26 Correct 10 ms 19052 KB Output is correct
27 Correct 12 ms 19044 KB Output is correct
28 Correct 10 ms 19064 KB Output is correct
29 Correct 14 ms 19156 KB Output is correct
30 Correct 13 ms 19132 KB Output is correct
31 Correct 13 ms 19156 KB Output is correct
32 Correct 12 ms 19156 KB Output is correct
33 Correct 13 ms 19152 KB Output is correct
34 Correct 13 ms 19156 KB Output is correct
35 Correct 15 ms 19164 KB Output is correct
36 Correct 16 ms 19072 KB Output is correct
37 Correct 12 ms 19156 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 19088 KB Output is correct
4 Correct 13 ms 19156 KB Output is correct
5 Correct 12 ms 19124 KB Output is correct
6 Correct 15 ms 19028 KB Output is correct
7 Correct 13 ms 19156 KB Output is correct
8 Correct 13 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19136 KB Output is correct
11 Correct 13 ms 19080 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 11 ms 19120 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 11 ms 19028 KB Output is correct
16 Correct 12 ms 19136 KB Output is correct
17 Correct 12 ms 19156 KB Output is correct
18 Correct 14 ms 19156 KB Output is correct
19 Correct 10 ms 19028 KB Output is correct
20 Correct 15 ms 19064 KB Output is correct
21 Correct 13 ms 19156 KB Output is correct
22 Correct 12 ms 19156 KB Output is correct
23 Correct 10 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 12 ms 19156 KB Output is correct
26 Correct 10 ms 19052 KB Output is correct
27 Correct 12 ms 19044 KB Output is correct
28 Correct 10 ms 19064 KB Output is correct
29 Correct 14 ms 19156 KB Output is correct
30 Correct 13 ms 19132 KB Output is correct
31 Correct 13 ms 19156 KB Output is correct
32 Correct 12 ms 19156 KB Output is correct
33 Correct 13 ms 19152 KB Output is correct
34 Correct 13 ms 19156 KB Output is correct
35 Correct 15 ms 19164 KB Output is correct
36 Correct 16 ms 19072 KB Output is correct
37 Correct 12 ms 19156 KB Output is correct
38 Correct 88 ms 20968 KB Output is correct
39 Correct 106 ms 40028 KB Output is correct
40 Correct 96 ms 21044 KB Output is correct
41 Correct 80 ms 20176 KB Output is correct
42 Correct 80 ms 21072 KB Output is correct
43 Correct 71 ms 20000 KB Output is correct
44 Correct 31 ms 19412 KB Output is correct
45 Correct 133 ms 34124 KB Output is correct
46 Correct 137 ms 34156 KB Output is correct
47 Correct 111 ms 36940 KB Output is correct
48 Correct 132 ms 36920 KB Output is correct
49 Correct 122 ms 34240 KB Output is correct
50 Correct 120 ms 34252 KB Output is correct
51 Correct 119 ms 35188 KB Output is correct
52 Correct 114 ms 35036 KB Output is correct
53 Correct 38 ms 20172 KB Output is correct
54 Correct 171 ms 34108 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 12 ms 19028 KB Output is correct
3 Correct 12 ms 19124 KB Output is correct
4 Correct 11 ms 19028 KB Output is correct
5 Correct 24 ms 19028 KB Output is correct
6 Correct 13 ms 19044 KB Output is correct
7 Correct 12 ms 19076 KB Output is correct
8 Correct 13 ms 19112 KB Output is correct
9 Correct 13 ms 19016 KB Output is correct
10 Correct 13 ms 19028 KB Output is correct
11 Correct 12 ms 19028 KB Output is correct
12 Correct 14 ms 19072 KB Output is correct
13 Correct 55 ms 19152 KB Output is correct
14 Correct 78 ms 19136 KB Output is correct
15 Correct 64 ms 19156 KB Output is correct
16 Correct 139 ms 35288 KB Output is correct
17 Correct 334 ms 44840 KB Output is correct
18 Correct 736 ms 71912 KB Output is correct
19 Correct 160 ms 35908 KB Output is correct
20 Correct 174 ms 36020 KB Output is correct
21 Correct 170 ms 35868 KB Output is correct
22 Correct 271 ms 45156 KB Output is correct
23 Correct 275 ms 45048 KB Output is correct
24 Correct 237 ms 45000 KB Output is correct
25 Correct 235 ms 45376 KB Output is correct
26 Correct 235 ms 45184 KB Output is correct
27 Correct 374 ms 51044 KB Output is correct
28 Correct 341 ms 52544 KB Output is correct
29 Correct 346 ms 49448 KB Output is correct
30 Correct 226 ms 42868 KB Output is correct
31 Correct 224 ms 43264 KB Output is correct
32 Correct 217 ms 42596 KB Output is correct
33 Correct 233 ms 43212 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19040 KB Output is correct
2 Correct 13 ms 19028 KB Output is correct
3 Correct 12 ms 19028 KB Output is correct
4 Correct 33 ms 19028 KB Output is correct
5 Correct 57 ms 19076 KB Output is correct
6 Correct 12 ms 19156 KB Output is correct
7 Correct 11 ms 19080 KB Output is correct
8 Correct 15 ms 19156 KB Output is correct
9 Correct 89 ms 21296 KB Output is correct
10 Correct 135 ms 40328 KB Output is correct
11 Correct 22 ms 19156 KB Output is correct
12 Correct 87 ms 19404 KB Output is correct
13 Correct 230 ms 71704 KB Output is correct
14 Correct 258 ms 73440 KB Output is correct
15 Correct 514 ms 70504 KB Output is correct
16 Correct 1350 ms 112364 KB Output is correct
17 Correct 248 ms 68036 KB Output is correct
18 Correct 203 ms 52204 KB Output is correct
19 Correct 217 ms 68460 KB Output is correct
20 Incorrect 239 ms 68500 KB Output isn't correct
21 Halted 0 ms 0 KB -