oj.uz

Submission #576263

# Submission time Handle Problem Language Result Execution time Memory
576263 2022-06-12T19:47:28 Z chonka Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1097 ms 273668 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int MAXN = 100007 ;
const int MAGIC = 330 ;

int n , m , q ;
vector < int > v[ MAXN ] ;
pair < int , int > ans[ MAXN ][ MAGIC ] ;
bool used[ MAXN ] ;

bool bad[ MAXN ] ;
pair < int , int > aux[ MAGIC ] ;
int ret[ MAXN ] ;
bool sel[ MAXN ] ;

void unite ( int host , int nw ) {
    int tp = 0 ;
    int pos1 , pos2 ;
    pos1 = pos2 = 0 ;
    while ( tp < MAGIC ) {
        while ( pos1 < MAGIC && sel[ ans[ host ][ pos1 ].first ] == true ) { ++ pos1 ; }
        while ( pos2 < MAGIC && sel[ ans[ nw ][ pos2 ].first ] == true ) { ++ pos2 ; }
        if ( pos1 == MAGIC ) {
            aux[ tp ++ ] = ans[ nw ][ pos2 ++ ] ;
            if ( aux[ tp - 1 ].second >= 0 ) {
                ++ aux[ tp - 1 ].second ;
            }
        }
        else if ( pos2 == MAGIC ) {
            aux[ tp ++ ] = ans[ host ][ pos1 ++ ] ;
        }
        else {
            int cand = ans[ nw ][ pos2 ].second ;
            if ( cand >= 0 ) { ++ cand ; }
            if ( ans[ host ][ pos1 ].second >= cand ) {
                aux[ tp ++ ] = ans[ host ][ pos1 ++ ] ;
            }
            else {
                aux[ tp ++ ] = ans[ nw ][ pos2 ++ ] ;
                if ( aux[ tp - 1 ].second >= 0 ) {
                    ++ aux[ tp - 1 ].second ;
                }
            }
        }
        sel[ aux[ tp - 1 ].first ] = true ;
    }
    for ( int i = 0 ; i < MAGIC ; ++ i ) {
        ans[ host ][ i ] = aux[ i ] ;
        sel[ aux[ i ].first ] = false ;
    }
}

void init ( int vertex ) {
    used[ vertex ] = true ;
    for ( int i = 0 ; i < MAGIC ; ++ i ) {
        ans[ vertex ][ i ] = { 0 , -1 } ;
    }
    ans[ vertex ][ 0 ] = { vertex , 0 } ;
    for ( auto x : v[ vertex ] ) {
        if ( used[ x ] == false ) {
            init ( x ) ;
        }
        unite ( vertex , x ) ;
    }
}

void dfs ( int vertex ) {
    used[ vertex ] = true ;
    ret[ vertex ] = -1 ;
    if ( bad[ vertex ] == false ) { ret[ vertex ] = 0 ; }
    for ( auto x : v[ vertex ] ) {
        if ( used[ x ] == false ) {
            dfs ( x ) ;
        }
        if ( ret[ x ] >= 0 ) {
            ret[ vertex ] = max ( ret[ vertex ] , ret[ x ] + 1 ) ;
        }
    }
}

void input ( ) {
    cin >> n >> m >> q ;
    for ( int x , y , i = 1 ; i <= m ; ++ i ) {
        cin >> x >> y ;
        v[ y ].push_back ( x ) ;
    }
}

int hh[ MAXN ] ;

void solve ( ) {
    for ( int i = n ; i >= 1 ; -- i ) {
        if ( used[ i ] == false ) {
            init ( i ) ;
        }
    }
    while ( q -- ) {
        int ori , sz ;
        cin >> ori >> sz ;
        for ( int i = 0 ; i < sz ; ++ i ) {
            cin >> hh[ i ] ;
            bad[ hh[ i ] ] = true ;
        }
        if ( sz < MAGIC ) {
            bool fl = false ;
            for ( int i = 0 ; i < MAGIC ; ++ i ) {
                if ( ans[ ori ][ i ].second < 0 ) { break ; }
                if ( bad[ ans[ ori ][ i ].first ] == false ) {
                    fl = true ;
                    cout << ans[ ori ][ i ].second << "\n" ;
                    break ;
                }
            }
            if ( fl == false ) { cout << "-1\n" ; }
        }
        else {
            for ( int i = 1 ; i <= n ; ++ i ) {
                used[ i ] = false ;
            }
            dfs ( ori ) ;
            cout << ret[ ori ] << "\n" ;
        }
        for ( int i = 0 ; i < sz ; ++ i ) {
            bad[ hh[ i ] ] = false ;
        }
    }
}

int main ( ) {
    /// freopen ( "in.txt" , "r" , stdin ) ;
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t ;
    /// cin >> t ;
    t = 1 ;
    while ( t -- ) {
        input ( ) ;
        solve ( ) ;
    }
    return 0 ;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2696 KB Output is correct
5 Correct 10 ms 5280 KB Output is correct
6 Correct 11 ms 5332 KB Output is correct
7 Correct 11 ms 5204 KB Output is correct
8 Correct 9 ms 5420 KB Output is correct
9 Correct 8 ms 5332 KB Output is correct
10 Correct 8 ms 5372 KB Output is correct
11 Correct 9 ms 5332 KB Output is correct
12 Correct 10 ms 5332 KB Output is correct
13 Correct 9 ms 5332 KB Output is correct
14 Correct 9 ms 5320 KB Output is correct
15 Correct 11 ms 5332 KB Output is correct
16 Correct 10 ms 5204 KB Output is correct
17 Correct 10 ms 5248 KB Output is correct
18 Correct 11 ms 5244 KB Output is correct
19 Correct 9 ms 5332 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2696 KB Output is correct
5 Correct 10 ms 5280 KB Output is correct
6 Correct 11 ms 5332 KB Output is correct
7 Correct 11 ms 5204 KB Output is correct
8 Correct 9 ms 5420 KB Output is correct
9 Correct 8 ms 5332 KB Output is correct
10 Correct 8 ms 5372 KB Output is correct
11 Correct 9 ms 5332 KB Output is correct
12 Correct 10 ms 5332 KB Output is correct
13 Correct 9 ms 5332 KB Output is correct
14 Correct 9 ms 5320 KB Output is correct
15 Correct 11 ms 5332 KB Output is correct
16 Correct 10 ms 5204 KB Output is correct
17 Correct 10 ms 5248 KB Output is correct
18 Correct 11 ms 5244 KB Output is correct
19 Correct 9 ms 5332 KB Output is correct
20 Correct 571 ms 6616 KB Output is correct
21 Correct 562 ms 6684 KB Output is correct
22 Correct 563 ms 6628 KB Output is correct
23 Correct 577 ms 6548 KB Output is correct
24 Correct 900 ms 264480 KB Output is correct
25 Correct 893 ms 264480 KB Output is correct
26 Correct 873 ms 264416 KB Output is correct
27 Correct 733 ms 269764 KB Output is correct
28 Correct 727 ms 269764 KB Output is correct
29 Correct 720 ms 269896 KB Output is correct
30 Correct 742 ms 265424 KB Output is correct
31 Correct 833 ms 264872 KB Output is correct
32 Correct 808 ms 265696 KB Output is correct
33 Correct 782 ms 264440 KB Output is correct
34 Correct 859 ms 264824 KB Output is correct
35 Correct 804 ms 264632 KB Output is correct
36 Correct 749 ms 264900 KB Output is correct
37 Correct 814 ms 264780 KB Output is correct
38 Correct 732 ms 264784 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2696 KB Output is correct
5 Correct 10 ms 5280 KB Output is correct
6 Correct 11 ms 5332 KB Output is correct
7 Correct 11 ms 5204 KB Output is correct
8 Correct 9 ms 5420 KB Output is correct
9 Correct 8 ms 5332 KB Output is correct
10 Correct 8 ms 5372 KB Output is correct
11 Correct 9 ms 5332 KB Output is correct
12 Correct 10 ms 5332 KB Output is correct
13 Correct 9 ms 5332 KB Output is correct
14 Correct 9 ms 5320 KB Output is correct
15 Correct 11 ms 5332 KB Output is correct
16 Correct 10 ms 5204 KB Output is correct
17 Correct 10 ms 5248 KB Output is correct
18 Correct 11 ms 5244 KB Output is correct
19 Correct 9 ms 5332 KB Output is correct
20 Correct 571 ms 6616 KB Output is correct
21 Correct 562 ms 6684 KB Output is correct
22 Correct 563 ms 6628 KB Output is correct
23 Correct 577 ms 6548 KB Output is correct
24 Correct 900 ms 264480 KB Output is correct
25 Correct 893 ms 264480 KB Output is correct
26 Correct 873 ms 264416 KB Output is correct
27 Correct 733 ms 269764 KB Output is correct
28 Correct 727 ms 269764 KB Output is correct
29 Correct 720 ms 269896 KB Output is correct
30 Correct 742 ms 265424 KB Output is correct
31 Correct 833 ms 264872 KB Output is correct
32 Correct 808 ms 265696 KB Output is correct
33 Correct 782 ms 264440 KB Output is correct
34 Correct 859 ms 264824 KB Output is correct
35 Correct 804 ms 264632 KB Output is correct
36 Correct 749 ms 264900 KB Output is correct
37 Correct 814 ms 264780 KB Output is correct
38 Correct 732 ms 264784 KB Output is correct
39 Correct 915 ms 264936 KB Output is correct
40 Correct 872 ms 264576 KB Output is correct
41 Correct 864 ms 264544 KB Output is correct
42 Correct 873 ms 264824 KB Output is correct
43 Correct 871 ms 264724 KB Output is correct
44 Correct 579 ms 7512 KB Output is correct
45 Correct 566 ms 8592 KB Output is correct
46 Correct 564 ms 8420 KB Output is correct
47 Correct 607 ms 8116 KB Output is correct
48 Correct 582 ms 7952 KB Output is correct
49 Correct 773 ms 272820 KB Output is correct
50 Correct 724 ms 271552 KB Output is correct
51 Correct 607 ms 9100 KB Output is correct
52 Correct 575 ms 8384 KB Output is correct
53 Correct 755 ms 267688 KB Output is correct
54 Correct 833 ms 267580 KB Output is correct
55 Correct 736 ms 266572 KB Output is correct
56 Correct 834 ms 266444 KB Output is correct
57 Correct 588 ms 9164 KB Output is correct
58 Correct 597 ms 9080 KB Output is correct
59 Correct 576 ms 8316 KB Output is correct
60 Correct 571 ms 8256 KB Output is correct
61 Correct 952 ms 273668 KB Output is correct
62 Correct 860 ms 267044 KB Output is correct
63 Correct 860 ms 267136 KB Output is correct
64 Correct 1097 ms 273668 KB Output is correct
65 Correct 1002 ms 267052 KB Output is correct
66 Correct 939 ms 266988 KB Output is correct
67 Correct 736 ms 271568 KB Output is correct
68 Correct 736 ms 266700 KB Output is correct
69 Correct 815 ms 266580 KB Output is correct
70 Correct 752 ms 272904 KB Output is correct
71 Correct 757 ms 267088 KB Output is correct
72 Correct 820 ms 267140 KB Output is correct
73 Correct 808 ms 273464 KB Output is correct
74 Correct 779 ms 267168 KB Output is correct
75 Correct 828 ms 267040 KB Output is correct
76 Correct 779 ms 273220 KB Output is correct
77 Correct 725 ms 271960 KB Output is correct
78 Correct 771 ms 273212 KB Output is correct
79 Correct 583 ms 9344 KB Output is correct
80 Correct 566 ms 8396 KB Output is correct
81 Correct 570 ms 8076 KB Output is correct
82 Correct 773 ms 269332 KB Output is correct
83 Correct 844 ms 268284 KB Output is correct
84 Correct 746 ms 268128 KB Output is correct
85 Correct 810 ms 267196 KB Output is correct
86 Correct 762 ms 268596 KB Output is correct
87 Correct 823 ms 267616 KB Output is correct
88 Correct 581 ms 9240 KB Output is correct
89 Correct 590 ms 9408 KB Output is correct
90 Correct 576 ms 8332 KB Output is correct
91 Correct 565 ms 8352 KB Output is correct
92 Correct 573 ms 7944 KB Output is correct
93 Correct 561 ms 8104 KB Output is correct
94 Correct 771 ms 268076 KB Output is correct
95 Correct 831 ms 267856 KB Output is correct
96 Correct 751 ms 267020 KB Output is correct
97 Correct 776 ms 266896 KB Output is correct
98 Correct 767 ms 267368 KB Output is correct
99 Correct 790 ms 267148 KB Output is correct
100 Correct 582 ms 9376 KB Output is correct
101 Correct 596 ms 9484 KB Output is correct
102 Correct 577 ms 8484 KB Output is correct
103 Correct 571 ms 8400 KB Output is correct
104 Correct 565 ms 8044 KB Output is correct
105 Correct 562 ms 8144 KB Output is correct
106 Correct 763 ms 268196 KB Output is correct
107 Correct 844 ms 267932 KB Output is correct
108 Correct 740 ms 266936 KB Output is correct
109 Correct 827 ms 266872 KB Output is correct
110 Correct 774 ms 267320 KB Output is correct
111 Correct 826 ms 267144 KB Output is correct
112 Correct 582 ms 9328 KB Output is correct
113 Correct 595 ms 9428 KB Output is correct
114 Correct 574 ms 8384 KB Output is correct
115 Correct 571 ms 8320 KB Output is correct
116 Correct 558 ms 7932 KB Output is correct
117 Correct 575 ms 8048 KB Output is correct
118 Correct 734 ms 271600 KB Output is correct
119 Correct 765 ms 266588 KB Output is correct
120 Correct 818 ms 266616 KB Output is correct
121 Correct 755 ms 271548 KB Output is correct
122 Correct 749 ms 266724 KB Output is correct
123 Correct 826 ms 266640 KB Output is correct
124 Correct 732 ms 271552 KB Output is correct
125 Correct 732 ms 266592 KB Output is correct
126 Correct 805 ms 266596 KB Output is correct