oj.uz

Submission #386966

# Submission time Handle Problem Language Result Execution time Memory
386966 2021-04-07T17:10:59 Z jeroenodb Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 760 ms 85356 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
const int K = 100;
int n;
vi adj[mxN];
pi dp[mxN][K];
int sz[mxN];
pi merger[2*K];
int input[mxN];
bitset<mxN> banned;
int longest[mxN];
pi* mymerge(pi* p1, pi* e1, pi* p2, pi* e2) {
    pi* a= merger;
    while(p1!=e1 and p2!=e2 and a-merger<K) {
        if(banned[p1->second]) p1++;
        else if(banned[p2->second]) p2++;
        else if(*p1 > *p2) {
            banned[p1->second]=true;
            *(a++) = *(p1++);
        } else {
            banned[p2->second]=true;
            *(a++) = *(p2++);
        }

    }
    
    while(p1!=e1) {
        *a = *p1;
        if(!banned[p1++->second]) 
            a++;
    } 
    while(p2!=e2) {
        *a = *p2;
        if(!banned[p2++->second]) 
            a++;
    }
    for(pi* i =merger;i!=a;++i) banned[i->second] = false;
    return a;
}
void precomp() {
    // find best K for every party position
    for(int i=0;i<n;++i) {
        dp[i][0] = {-1,i};
        sz[i] = 1;
        for(int to: adj[i]) {
            auto iter = mymerge(dp[i],dp[i]+sz[i], dp[to],dp[to]+sz[to]);
            // wrong, because answer may be more than one time in the dp array, more difficult merge is needed
            sz[i] = min(K,(int)(iter-merger));
            copy(merger,merger + sz[i], dp[i]); 
        }
        for(int j=0;j<sz[i];++j) dp[i][j].first++;
    }
    
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int m,q; cin >> n >> m >> q;
    while(m--) {
        int a,b; cin >> a >> b; --a,--b;
        adj[b].push_back(a);
    }
    precomp();
    while(q--) {
        int party, y; cin >> party >> y; party--;
        for(int i=0;i<y;++i) {
            cin >> input[i]; input[i]--; 
            banned[input[i]] =true;
        }

        if(y<K) {
            // Have stored the answer already in DP, just pick it out

            int ans = -1;
            for(int i=0;i<sz[party];++i) {
                auto [length,to] = dp[party][i];
                if(!banned[to]) {
                    ans = length;
                    break;
                }
            }
            cout << ans << '\n';

        } else {
            // Do the calculation of longest paths all over. O(M) worstcase, but only happens n/k times
            for(int i=0;i<=party;++i) {
                if(banned[i]) 
                    longest[i] = -oo;
                else longest[i] = 0;
                for(int to: adj[i]) {
                    longest[i] = max(longest[i],longest[to]+1);
                }
            }
            cout << (longest[party]<0?-1:longest[party]) << '\n';
        }
        for(int i=0;i<y;++i) banned[input[i]]=false;
    }
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:87:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   87 |                 auto [length,to] = dp[party][i];
      |                      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 5 ms 3564 KB Output is correct
6 Correct 4 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 5 ms 3564 KB Output is correct
9 Correct 5 ms 3564 KB Output is correct
10 Correct 5 ms 3564 KB Output is correct
11 Correct 5 ms 3564 KB Output is correct
12 Correct 5 ms 3564 KB Output is correct
13 Correct 6 ms 3564 KB Output is correct
14 Correct 5 ms 3564 KB Output is correct
15 Correct 5 ms 3564 KB Output is correct
16 Correct 5 ms 3564 KB Output is correct
17 Correct 5 ms 3564 KB Output is correct
18 Correct 5 ms 3564 KB Output is correct
19 Correct 6 ms 3564 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 5 ms 3564 KB Output is correct
6 Correct 4 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 5 ms 3564 KB Output is correct
9 Correct 5 ms 3564 KB Output is correct
10 Correct 5 ms 3564 KB Output is correct
11 Correct 5 ms 3564 KB Output is correct
12 Correct 5 ms 3564 KB Output is correct
13 Correct 6 ms 3564 KB Output is correct
14 Correct 5 ms 3564 KB Output is correct
15 Correct 5 ms 3564 KB Output is correct
16 Correct 5 ms 3564 KB Output is correct
17 Correct 5 ms 3564 KB Output is correct
18 Correct 5 ms 3564 KB Output is correct
19 Correct 6 ms 3564 KB Output is correct
20 Correct 262 ms 4716 KB Output is correct
21 Correct 257 ms 4716 KB Output is correct
22 Correct 260 ms 4972 KB Output is correct
23 Correct 263 ms 4844 KB Output is correct
24 Correct 379 ms 84716 KB Output is correct
25 Correct 390 ms 84588 KB Output is correct
26 Correct 391 ms 84588 KB Output is correct
27 Correct 352 ms 85100 KB Output is correct
28 Correct 373 ms 85088 KB Output is correct
29 Correct 374 ms 85228 KB Output is correct
30 Correct 371 ms 84844 KB Output is correct
31 Correct 394 ms 84972 KB Output is correct
32 Correct 356 ms 84972 KB Output is correct
33 Correct 297 ms 84332 KB Output is correct
34 Correct 315 ms 84716 KB Output is correct
35 Correct 295 ms 84460 KB Output is correct
36 Correct 332 ms 84716 KB Output is correct
37 Correct 364 ms 84460 KB Output is correct
38 Correct 331 ms 84716 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 5 ms 3564 KB Output is correct
6 Correct 4 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 5 ms 3564 KB Output is correct
9 Correct 5 ms 3564 KB Output is correct
10 Correct 5 ms 3564 KB Output is correct
11 Correct 5 ms 3564 KB Output is correct
12 Correct 5 ms 3564 KB Output is correct
13 Correct 6 ms 3564 KB Output is correct
14 Correct 5 ms 3564 KB Output is correct
15 Correct 5 ms 3564 KB Output is correct
16 Correct 5 ms 3564 KB Output is correct
17 Correct 5 ms 3564 KB Output is correct
18 Correct 5 ms 3564 KB Output is correct
19 Correct 6 ms 3564 KB Output is correct
20 Correct 262 ms 4716 KB Output is correct
21 Correct 257 ms 4716 KB Output is correct
22 Correct 260 ms 4972 KB Output is correct
23 Correct 263 ms 4844 KB Output is correct
24 Correct 379 ms 84716 KB Output is correct
25 Correct 390 ms 84588 KB Output is correct
26 Correct 391 ms 84588 KB Output is correct
27 Correct 352 ms 85100 KB Output is correct
28 Correct 373 ms 85088 KB Output is correct
29 Correct 374 ms 85228 KB Output is correct
30 Correct 371 ms 84844 KB Output is correct
31 Correct 394 ms 84972 KB Output is correct
32 Correct 356 ms 84972 KB Output is correct
33 Correct 297 ms 84332 KB Output is correct
34 Correct 315 ms 84716 KB Output is correct
35 Correct 295 ms 84460 KB Output is correct
36 Correct 332 ms 84716 KB Output is correct
37 Correct 364 ms 84460 KB Output is correct
38 Correct 331 ms 84716 KB Output is correct
39 Correct 423 ms 84588 KB Output is correct
40 Correct 392 ms 84332 KB Output is correct
41 Correct 755 ms 84716 KB Output is correct
42 Correct 487 ms 84636 KB Output is correct
43 Correct 387 ms 84588 KB Output is correct
44 Correct 291 ms 5228 KB Output is correct
45 Correct 288 ms 4844 KB Output is correct
46 Correct 318 ms 4844 KB Output is correct
47 Correct 280 ms 4844 KB Output is correct
48 Correct 281 ms 4844 KB Output is correct
49 Correct 402 ms 85356 KB Output is correct
50 Correct 725 ms 85136 KB Output is correct
51 Correct 293 ms 5100 KB Output is correct
52 Correct 337 ms 4972 KB Output is correct
53 Correct 366 ms 84844 KB Output is correct
54 Correct 404 ms 84588 KB Output is correct
55 Correct 697 ms 84716 KB Output is correct
56 Correct 744 ms 84716 KB Output is correct
57 Correct 295 ms 5228 KB Output is correct
58 Correct 288 ms 5100 KB Output is correct
59 Correct 321 ms 4716 KB Output is correct
60 Correct 319 ms 4716 KB Output is correct
61 Correct 442 ms 85100 KB Output is correct
62 Correct 410 ms 84588 KB Output is correct
63 Correct 444 ms 84616 KB Output is correct
64 Correct 576 ms 85100 KB Output is correct
65 Correct 536 ms 84600 KB Output is correct
66 Correct 627 ms 84588 KB Output is correct
67 Correct 750 ms 85232 KB Output is correct
68 Correct 691 ms 84588 KB Output is correct
69 Correct 719 ms 84588 KB Output is correct
70 Correct 357 ms 84972 KB Output is correct
71 Correct 337 ms 84460 KB Output is correct
72 Correct 384 ms 84588 KB Output is correct
73 Correct 384 ms 85100 KB Output is correct
74 Correct 355 ms 84588 KB Output is correct
75 Correct 382 ms 84588 KB Output is correct
76 Correct 411 ms 85356 KB Output is correct
77 Correct 728 ms 85100 KB Output is correct
78 Correct 383 ms 85100 KB Output is correct
79 Correct 292 ms 5100 KB Output is correct
80 Correct 321 ms 4920 KB Output is correct
81 Correct 259 ms 4716 KB Output is correct
82 Correct 400 ms 85228 KB Output is correct
83 Correct 444 ms 85100 KB Output is correct
84 Correct 685 ms 85228 KB Output is correct
85 Correct 760 ms 85176 KB Output is correct
86 Correct 359 ms 84972 KB Output is correct
87 Correct 405 ms 85100 KB Output is correct
88 Correct 297 ms 5228 KB Output is correct
89 Correct 288 ms 5100 KB Output is correct
90 Correct 322 ms 4844 KB Output is correct
91 Correct 319 ms 4716 KB Output is correct
92 Correct 259 ms 4716 KB Output is correct
93 Correct 256 ms 4844 KB Output is correct
94 Correct 362 ms 84588 KB Output is correct
95 Correct 371 ms 84460 KB Output is correct
96 Correct 615 ms 84460 KB Output is correct
97 Correct 637 ms 84588 KB Output is correct
98 Correct 307 ms 84588 KB Output is correct
99 Correct 330 ms 84716 KB Output is correct
100 Correct 294 ms 5100 KB Output is correct
101 Correct 296 ms 5100 KB Output is correct
102 Correct 311 ms 4844 KB Output is correct
103 Correct 308 ms 4844 KB Output is correct
104 Correct 258 ms 4716 KB Output is correct
105 Correct 259 ms 4844 KB Output is correct
106 Correct 378 ms 84716 KB Output is correct
107 Correct 428 ms 84588 KB Output is correct
108 Correct 701 ms 84716 KB Output is correct
109 Correct 725 ms 84588 KB Output is correct
110 Correct 363 ms 84716 KB Output is correct
111 Correct 380 ms 84664 KB Output is correct
112 Correct 291 ms 5228 KB Output is correct
113 Correct 293 ms 5228 KB Output is correct
114 Correct 321 ms 4844 KB Output is correct
115 Correct 318 ms 4716 KB Output is correct
116 Correct 283 ms 4736 KB Output is correct
117 Correct 258 ms 4844 KB Output is correct
118 Correct 359 ms 84588 KB Output is correct
119 Correct 334 ms 84460 KB Output is correct
120 Correct 366 ms 84332 KB Output is correct
121 Correct 366 ms 84732 KB Output is correct
122 Correct 338 ms 84224 KB Output is correct
123 Correct 370 ms 84200 KB Output is correct
124 Correct 361 ms 84588 KB Output is correct
125 Correct 345 ms 84312 KB Output is correct
126 Correct 378 ms 84356 KB Output is correct