oj.uz

Submission #130309

# Submission time Handle Problem Language Result Execution time Memory
130309 2019-07-14T19:28:12 Z doowey Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1895 ms 214600 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
 
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 
const int N = (int)1e5 + 9;
const int K = 205;
const int inf = (int)1e8;

vector<int> T[N];

int dp[N];
bool ban[N];

pii cur[K + 5];

vector<pii> ret[N];
bool use[N];

void unite(vector<pii> &a, vector<pii> b){
    int z = 0;
    int i = 0, j = 0;
    while(z <= K && i < a.size() && j < b.size()){
        if(use[a[i].se]){
            i ++ ;
            continue;
        }
        if(use[b[j].se]){
            j ++ ;
            continue;
        }
        if(a[i].fi > b[j].fi + 1){
            cur[z ++ ] = mp(a[i].fi, a[i].se);
            use[a[i].se] = true;
            i ++ ;
        }
        else{
            cur[z ++ ] = mp(b[j].fi + 1, b[j].se);
            use[b[j].se] = true;
            j ++ ;
        }
    }
    while(z <= K && i < a.size()){
        if(use[a[i].se]){
            i ++ ;
            continue;
        }
        cur[z ++ ] = mp(a[i].fi, a[i].se);
        use[a[i].se] = true;
        i ++ ;
    }
    while(z <= K && j < b.size()){
        if(use[b[j].se]){
            j ++ ;
            continue;
        }
        cur[z ++ ] = mp(b[j].fi + 1, b[j].se);
        use[b[j].se] = true;
        j ++ ;
    }
    a.clear();
    for(int t = 0 ;t < z ;t ++ ){
        a.push_back(cur[t]);
        use[cur[t].se] = false;
    }
}

int main(){
    fastIO;
    int n, m , q;
    cin >> n >> m >> q;
    int u, v;
    for(int i = 0 ; i < m ; i ++ ){
        cin >> u >> v;
        T[v].push_back(u);
    }
    for(int i = 1; i <= n; i ++ ){
        ret[i].push_back(mp(0, i));
        for(auto p : T[i]){
            unite(ret[i], ret[p]);
        }
    }
    int k;
    int st;
    int y;
    vector<int> lis;
    int res = -1;
    for(int tt = 0 ; tt < q; tt ++ ){
        cin >> st >> k;
        lis.clear();
        for(int t = 0 ;t < k; t ++ ){
            cin >> y;
            ban[y] = true;
            lis.push_back(y);
        }
        if(k >= K){
            for(int i= 1 ;i <= n; i ++ )
                dp[i] = -inf;
            dp[st] = 0;
            res = -1;
            for(int i = n; i >= 1; i -- ){
                if(!ban[i]) res = max(res, dp[i]);
                for(auto vv : T[i]){
                    dp[vv] = max(dp[vv], dp[i] + 1);
                }
            }
        }
        else{
            res = -1;
            for(auto p : ret[st]){
                if(ban[p.se]) continue;
                res = p.fi;
                break;
            }
        }
        cout << res << "\n";
        for(auto p : lis)
            ban[p] = false;
    }
    return 0;
}

Compilation message

bitaro.cpp: In function 'void unite(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >)':
bitaro.cpp:33:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(z <= K && i < a.size() && j < b.size()){
                     ~~^~~~~~~~~~
bitaro.cpp:33:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(z <= K && i < a.size() && j < b.size()){
                                     ~~^~~~~~~~~~
bitaro.cpp:53:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(z <= K && i < a.size()){
                     ~~^~~~~~~~~~
bitaro.cpp:62:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(z <= K && j < b.size()){
                     ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 7 ms 5084 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 9 ms 5468 KB Output is correct
6 Correct 9 ms 5496 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 14 ms 7032 KB Output is correct
9 Correct 14 ms 6928 KB Output is correct
10 Correct 14 ms 7032 KB Output is correct
11 Correct 14 ms 6904 KB Output is correct
12 Correct 12 ms 6264 KB Output is correct
13 Correct 14 ms 6776 KB Output is correct
14 Correct 12 ms 6136 KB Output is correct
15 Correct 10 ms 5624 KB Output is correct
16 Correct 12 ms 6136 KB Output is correct
17 Correct 12 ms 6392 KB Output is correct
18 Correct 11 ms 5884 KB Output is correct
19 Correct 13 ms 6392 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 7 ms 5084 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 9 ms 5468 KB Output is correct
6 Correct 9 ms 5496 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 14 ms 7032 KB Output is correct
9 Correct 14 ms 6928 KB Output is correct
10 Correct 14 ms 7032 KB Output is correct
11 Correct 14 ms 6904 KB Output is correct
12 Correct 12 ms 6264 KB Output is correct
13 Correct 14 ms 6776 KB Output is correct
14 Correct 12 ms 6136 KB Output is correct
15 Correct 10 ms 5624 KB Output is correct
16 Correct 12 ms 6136 KB Output is correct
17 Correct 12 ms 6392 KB Output is correct
18 Correct 11 ms 5884 KB Output is correct
19 Correct 13 ms 6392 KB Output is correct
20 Correct 431 ms 8168 KB Output is correct
21 Correct 426 ms 8088 KB Output is correct
22 Correct 430 ms 8156 KB Output is correct
23 Correct 450 ms 8056 KB Output is correct
24 Correct 796 ms 151044 KB Output is correct
25 Correct 795 ms 155384 KB Output is correct
26 Correct 808 ms 155584 KB Output is correct
27 Correct 850 ms 211032 KB Output is correct
28 Correct 828 ms 211396 KB Output is correct
29 Correct 817 ms 211236 KB Output is correct
30 Correct 827 ms 211172 KB Output is correct
31 Correct 891 ms 205928 KB Output is correct
32 Correct 835 ms 211192 KB Output is correct
33 Correct 654 ms 133212 KB Output is correct
34 Correct 607 ms 114720 KB Output is correct
35 Correct 635 ms 132436 KB Output is correct
36 Correct 752 ms 172412 KB Output is correct
37 Correct 754 ms 160336 KB Output is correct
38 Correct 768 ms 173004 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 7 ms 5084 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 9 ms 5468 KB Output is correct
6 Correct 9 ms 5496 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 14 ms 7032 KB Output is correct
9 Correct 14 ms 6928 KB Output is correct
10 Correct 14 ms 7032 KB Output is correct
11 Correct 14 ms 6904 KB Output is correct
12 Correct 12 ms 6264 KB Output is correct
13 Correct 14 ms 6776 KB Output is correct
14 Correct 12 ms 6136 KB Output is correct
15 Correct 10 ms 5624 KB Output is correct
16 Correct 12 ms 6136 KB Output is correct
17 Correct 12 ms 6392 KB Output is correct
18 Correct 11 ms 5884 KB Output is correct
19 Correct 13 ms 6392 KB Output is correct
20 Correct 431 ms 8168 KB Output is correct
21 Correct 426 ms 8088 KB Output is correct
22 Correct 430 ms 8156 KB Output is correct
23 Correct 450 ms 8056 KB Output is correct
24 Correct 796 ms 151044 KB Output is correct
25 Correct 795 ms 155384 KB Output is correct
26 Correct 808 ms 155584 KB Output is correct
27 Correct 850 ms 211032 KB Output is correct
28 Correct 828 ms 211396 KB Output is correct
29 Correct 817 ms 211236 KB Output is correct
30 Correct 827 ms 211172 KB Output is correct
31 Correct 891 ms 205928 KB Output is correct
32 Correct 835 ms 211192 KB Output is correct
33 Correct 654 ms 133212 KB Output is correct
34 Correct 607 ms 114720 KB Output is correct
35 Correct 635 ms 132436 KB Output is correct
36 Correct 752 ms 172412 KB Output is correct
37 Correct 754 ms 160336 KB Output is correct
38 Correct 768 ms 173004 KB Output is correct
39 Correct 927 ms 152736 KB Output is correct
40 Correct 879 ms 153252 KB Output is correct
41 Correct 908 ms 153720 KB Output is correct
42 Correct 1213 ms 154236 KB Output is correct
43 Correct 910 ms 153340 KB Output is correct
44 Correct 471 ms 8788 KB Output is correct
45 Correct 446 ms 8696 KB Output is correct
46 Correct 436 ms 8512 KB Output is correct
47 Correct 491 ms 8480 KB Output is correct
48 Correct 441 ms 8480 KB Output is correct
49 Correct 985 ms 211184 KB Output is correct
50 Correct 963 ms 212868 KB Output is correct
51 Correct 467 ms 10872 KB Output is correct
52 Correct 436 ms 9848 KB Output is correct
53 Correct 881 ms 174432 KB Output is correct
54 Correct 880 ms 162552 KB Output is correct
55 Correct 848 ms 173432 KB Output is correct
56 Correct 824 ms 162424 KB Output is correct
57 Correct 464 ms 10872 KB Output is correct
58 Correct 461 ms 10812 KB Output is correct
59 Correct 445 ms 10004 KB Output is correct
60 Correct 442 ms 10104 KB Output is correct
61 Correct 1326 ms 213136 KB Output is correct
62 Correct 1125 ms 174648 KB Output is correct
63 Correct 1115 ms 161596 KB Output is correct
64 Correct 1895 ms 213068 KB Output is correct
65 Correct 1740 ms 173932 KB Output is correct
66 Correct 1762 ms 162668 KB Output is correct
67 Correct 1648 ms 213112 KB Output is correct
68 Correct 1364 ms 174572 KB Output is correct
69 Correct 1394 ms 160684 KB Output is correct
70 Correct 989 ms 213304 KB Output is correct
71 Correct 861 ms 174492 KB Output is correct
72 Correct 871 ms 162156 KB Output is correct
73 Correct 1055 ms 213236 KB Output is correct
74 Correct 925 ms 174524 KB Output is correct
75 Correct 935 ms 162196 KB Output is correct
76 Correct 998 ms 214600 KB Output is correct
77 Correct 984 ms 213452 KB Output is correct
78 Correct 894 ms 213728 KB Output is correct
79 Correct 474 ms 10940 KB Output is correct
80 Correct 439 ms 10028 KB Output is correct
81 Correct 438 ms 9656 KB Output is correct
82 Correct 993 ms 214460 KB Output is correct
83 Correct 1046 ms 208888 KB Output is correct
84 Correct 1050 ms 213368 KB Output is correct
85 Correct 1062 ms 207996 KB Output is correct
86 Correct 871 ms 213600 KB Output is correct
87 Correct 1072 ms 208836 KB Output is correct
88 Correct 476 ms 10832 KB Output is correct
89 Correct 477 ms 10872 KB Output is correct
90 Correct 442 ms 10220 KB Output is correct
91 Correct 447 ms 9940 KB Output is correct
92 Correct 435 ms 9576 KB Output is correct
93 Correct 436 ms 9556 KB Output is correct
94 Correct 748 ms 136492 KB Output is correct
95 Correct 685 ms 117112 KB Output is correct
96 Correct 765 ms 134904 KB Output is correct
97 Correct 708 ms 118432 KB Output is correct
98 Correct 674 ms 135672 KB Output is correct
99 Correct 686 ms 118376 KB Output is correct
100 Correct 490 ms 11128 KB Output is correct
101 Correct 494 ms 10932 KB Output is correct
102 Correct 465 ms 10080 KB Output is correct
103 Correct 464 ms 10012 KB Output is correct
104 Correct 453 ms 9688 KB Output is correct
105 Correct 466 ms 9684 KB Output is correct
106 Correct 890 ms 175012 KB Output is correct
107 Correct 893 ms 163312 KB Output is correct
108 Correct 892 ms 175060 KB Output is correct
109 Correct 901 ms 162148 KB Output is correct
110 Correct 840 ms 175392 KB Output is correct
111 Correct 917 ms 163044 KB Output is correct
112 Correct 471 ms 11036 KB Output is correct
113 Correct 464 ms 10872 KB Output is correct
114 Correct 444 ms 10008 KB Output is correct
115 Correct 446 ms 10160 KB Output is correct
116 Correct 433 ms 9516 KB Output is correct
117 Correct 433 ms 9572 KB Output is correct
118 Correct 934 ms 212832 KB Output is correct
119 Correct 833 ms 174352 KB Output is correct
120 Correct 833 ms 161500 KB Output is correct
121 Correct 978 ms 212916 KB Output is correct
122 Correct 873 ms 173880 KB Output is correct
123 Correct 846 ms 161340 KB Output is correct
124 Correct 930 ms 212728 KB Output is correct
125 Correct 872 ms 174556 KB Output is correct
126 Correct 829 ms 161016 KB Output is correct