oj.uz

Submission #386956

# Submission time Handle Problem Language Result Execution time Memory
386956 2021-04-07T16:45:43 Z jeroenodb Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 838 ms 88940 KB 
#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) {
        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:84:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |                 auto [length,to] = dp[party][i];
      |                      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 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 5 ms 3564 KB Output is correct
7 Correct 5 ms 3564 KB Output is correct
8 Correct 7 ms 3564 KB Output is correct
9 Correct 6 ms 3564 KB Output is correct
10 Correct 6 ms 3564 KB Output is correct
11 Correct 6 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 6 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 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 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 5 ms 3564 KB Output is correct
7 Correct 5 ms 3564 KB Output is correct
8 Correct 7 ms 3564 KB Output is correct
9 Correct 6 ms 3564 KB Output is correct
10 Correct 6 ms 3564 KB Output is correct
11 Correct 6 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 6 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 277 ms 6236 KB Output is correct
21 Correct 269 ms 6300 KB Output is correct
22 Correct 272 ms 6252 KB Output is correct
23 Correct 271 ms 6656 KB Output is correct
24 Correct 410 ms 87148 KB Output is correct
25 Correct 404 ms 87100 KB Output is correct
26 Correct 395 ms 87020 KB Output is correct
27 Correct 365 ms 87660 KB Output is correct
28 Correct 367 ms 87660 KB Output is correct
29 Correct 407 ms 87660 KB Output is correct
30 Correct 351 ms 87532 KB Output is correct
31 Correct 396 ms 87868 KB Output is correct
32 Correct 355 ms 87532 KB Output is correct
33 Correct 369 ms 87020 KB Output is correct
34 Correct 336 ms 87320 KB Output is correct
35 Correct 300 ms 87020 KB Output is correct
36 Correct 334 ms 87276 KB Output is correct
37 Correct 435 ms 87148 KB Output is correct
38 Correct 328 ms 87148 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 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 5 ms 3564 KB Output is correct
7 Correct 5 ms 3564 KB Output is correct
8 Correct 7 ms 3564 KB Output is correct
9 Correct 6 ms 3564 KB Output is correct
10 Correct 6 ms 3564 KB Output is correct
11 Correct 6 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 6 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 277 ms 6236 KB Output is correct
21 Correct 269 ms 6300 KB Output is correct
22 Correct 272 ms 6252 KB Output is correct
23 Correct 271 ms 6656 KB Output is correct
24 Correct 410 ms 87148 KB Output is correct
25 Correct 404 ms 87100 KB Output is correct
26 Correct 395 ms 87020 KB Output is correct
27 Correct 365 ms 87660 KB Output is correct
28 Correct 367 ms 87660 KB Output is correct
29 Correct 407 ms 87660 KB Output is correct
30 Correct 351 ms 87532 KB Output is correct
31 Correct 396 ms 87868 KB Output is correct
32 Correct 355 ms 87532 KB Output is correct
33 Correct 369 ms 87020 KB Output is correct
34 Correct 336 ms 87320 KB Output is correct
35 Correct 300 ms 87020 KB Output is correct
36 Correct 334 ms 87276 KB Output is correct
37 Correct 435 ms 87148 KB Output is correct
38 Correct 328 ms 87148 KB Output is correct
39 Correct 474 ms 88172 KB Output is correct
40 Correct 404 ms 87148 KB Output is correct
41 Correct 838 ms 87576 KB Output is correct
42 Correct 467 ms 87552 KB Output is correct
43 Correct 400 ms 87404 KB Output is correct
44 Correct 290 ms 7672 KB Output is correct
45 Correct 263 ms 6892 KB Output is correct
46 Correct 328 ms 6764 KB Output is correct
47 Correct 268 ms 6508 KB Output is correct
48 Correct 252 ms 6380 KB Output is correct
49 Correct 408 ms 88428 KB Output is correct
50 Correct 780 ms 87660 KB Output is correct
51 Correct 286 ms 7532 KB Output is correct
52 Correct 325 ms 6636 KB Output is correct
53 Correct 375 ms 88172 KB Output is correct
54 Correct 411 ms 87788 KB Output is correct
55 Correct 716 ms 87252 KB Output is correct
56 Correct 752 ms 87276 KB Output is correct
57 Correct 293 ms 7532 KB Output is correct
58 Correct 286 ms 7532 KB Output is correct
59 Correct 325 ms 6592 KB Output is correct
60 Correct 316 ms 6636 KB Output is correct
61 Correct 467 ms 87788 KB Output is correct
62 Correct 389 ms 87184 KB Output is correct
63 Correct 442 ms 87404 KB Output is correct
64 Correct 599 ms 87788 KB Output is correct
65 Correct 549 ms 87276 KB Output is correct
66 Correct 611 ms 87276 KB Output is correct
67 Correct 745 ms 87660 KB Output is correct
68 Correct 684 ms 87404 KB Output is correct
69 Correct 762 ms 87540 KB Output is correct
70 Correct 379 ms 88044 KB Output is correct
71 Correct 336 ms 87276 KB Output is correct
72 Correct 386 ms 87404 KB Output is correct
73 Correct 375 ms 87788 KB Output is correct
74 Correct 358 ms 87404 KB Output is correct
75 Correct 394 ms 87404 KB Output is correct
76 Correct 402 ms 88812 KB Output is correct
77 Correct 711 ms 88084 KB Output is correct
78 Correct 385 ms 88044 KB Output is correct
79 Correct 288 ms 7660 KB Output is correct
80 Correct 360 ms 6892 KB Output is correct
81 Correct 255 ms 6252 KB Output is correct
82 Correct 402 ms 88940 KB Output is correct
83 Correct 450 ms 88616 KB Output is correct
84 Correct 670 ms 88044 KB Output is correct
85 Correct 762 ms 87916 KB Output is correct
86 Correct 357 ms 87788 KB Output is correct
87 Correct 413 ms 88044 KB Output is correct
88 Correct 290 ms 7660 KB Output is correct
89 Correct 321 ms 7936 KB Output is correct
90 Correct 318 ms 6636 KB Output is correct
91 Correct 325 ms 6764 KB Output is correct
92 Correct 255 ms 6252 KB Output is correct
93 Correct 262 ms 6252 KB Output is correct
94 Correct 339 ms 88224 KB Output is correct
95 Correct 367 ms 88044 KB Output is correct
96 Correct 726 ms 87532 KB Output is correct
97 Correct 697 ms 87532 KB Output is correct
98 Correct 322 ms 87416 KB Output is correct
99 Correct 322 ms 87340 KB Output is correct
100 Correct 295 ms 7916 KB Output is correct
101 Correct 312 ms 7788 KB Output is correct
102 Correct 308 ms 6764 KB Output is correct
103 Correct 303 ms 6764 KB Output is correct
104 Correct 257 ms 6380 KB Output is correct
105 Correct 258 ms 6380 KB Output is correct
106 Correct 379 ms 88428 KB Output is correct
107 Correct 410 ms 88136 KB Output is correct
108 Correct 696 ms 87532 KB Output is correct
109 Correct 772 ms 87404 KB Output is correct
110 Correct 341 ms 87688 KB Output is correct
111 Correct 381 ms 87544 KB Output is correct
112 Correct 300 ms 7788 KB Output is correct
113 Correct 290 ms 7788 KB Output is correct
114 Correct 326 ms 6764 KB Output is correct
115 Correct 345 ms 6636 KB Output is correct
116 Correct 258 ms 6380 KB Output is correct
117 Correct 275 ms 6380 KB Output is correct
118 Correct 365 ms 87276 KB Output is correct
119 Correct 348 ms 87020 KB Output is correct
120 Correct 394 ms 86892 KB Output is correct
121 Correct 372 ms 87308 KB Output is correct
122 Correct 373 ms 86848 KB Output is correct
123 Correct 393 ms 86884 KB Output is correct
124 Correct 367 ms 87148 KB Output is correct
125 Correct 346 ms 86908 KB Output is correct
126 Correct 386 ms 86760 KB Output is correct