oj.uz

Submission #786339

# Submission time Handle Problem Language Result Execution time Memory
786339 2023-07-18T06:43:53 Z winter0101 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 713 ms 214760 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
const int maxn=1e5+9;
vector<int>a[maxn];
vector<pii>b[maxn];
bool blk[maxn];
int f[maxn];
int n,m;
int brute(int u,vector<int> &block){
for1(i,1,n){
blk[i]=0;
}
for (auto v:block)blk[v]=1;
for1(i,1,u){
f[i]=0;
if (blk[i])f[i]=-2*n-1;
for (auto v:a[i]){
    f[i]=max(f[i],f[v]+1);
}
}
if (f[u]<0)f[u]=-1;
return f[u];
}
const int block=150;
bool use[maxn];
vector<pii> merge(vector<pii> p, vector<pii> q){
vector<pii>r;
reverse(all(p));
reverse(all(q));
for (auto &v:q){
    v.se++;
}
while (!p.empty()&&!q.empty()){
    if (sz(r)==block){
        break;
    }
    auto u=p.back(),v=q.back();
    if (use[u.fi]){
        p.pop_back();
        continue;
    }
    if (use[v.fi]){
        q.pop_back();
        continue;
    }
    if (u.fi==v.fi&&u.se==v.se){
        r.pb(u);
        use[u.fi]=1;
        p.pop_back();
        q.pop_back();
        continue;
    }
    if (u.fi==v.fi){
        if (u.se>=v.se){
            r.pb(u);
            use[u.fi]=1;
            p.pop_back();
            q.pop_back();
        }
        else {
            r.pb(v);
            use[v.fi]=1;
            p.pop_back();
            q.pop_back();
        }
        continue;
    }
    if (u.se>v.se){
        r.pb(u);
        use[u.fi]=1;
        p.pop_back();
    }
    else {
        r.pb(v);
        use[v.fi]=1;
        q.pop_back();
    }
}
while (sz(r)>block){
    use[r.back().fi]=0;
    r.pop_back();
}
while (!p.empty()){
    if (sz(r)==block)break;
    if (use[p.back().fi]){
        p.pop_back();
        continue;
    }
    r.pb(p.back());
    use[p.back().fi]=1;
    p.pop_back();
}
while (!q.empty()){
    if (sz(r)==block)break;
    if (use[q.back().fi]){
        q.pop_back();
        continue;
    }
    use[q.back().fi]=1;
    r.pb(q.back());
    q.pop_back();
}
for (auto v:r)use[v.fi]=0;
return r;
}
void solve(){
    for1(i,1,n){
    b[i].pb({i,0});
    for (auto u:a[i]){
        b[i]=merge(b[i],b[u]);
    }
    }
}
int an[maxn];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    int q;
    cin>>n>>m>>q;
    for1(i,1,m){
    int u,v;
    cin>>u>>v;
    a[v].pb(u);
    }
    solve();
    for1(i,1,q){
    int x,y;
    cin>>x>>y;
    vector<int>blocked;
    for1(j,1,y){
    int x1;
    cin>>x1;
    blocked.pb(x1);
    }
    if (y>block){
        an[i]=brute(x,blocked);
    }
    else {
        for (auto v:blocked){
            use[v]=1;
        }
        int ans=-1;
        for(auto v:b[x]){
            if (!use[v.fi]){
                //cout<<v.fi<<'\n';
                ans=max(ans,v.se);
            }
        }
        an[i]=ans;
    }
    for (auto v:blocked){
        use[v]=0;
    }
    }
    for1(i,1,q){
    cout<<an[i]<<'\n';
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 4 ms 5460 KB Output is correct
6 Correct 4 ms 5460 KB Output is correct
7 Correct 4 ms 5484 KB Output is correct
8 Correct 6 ms 6868 KB Output is correct
9 Correct 7 ms 6964 KB Output is correct
10 Correct 6 ms 6868 KB Output is correct
11 Correct 6 ms 6740 KB Output is correct
12 Correct 6 ms 6100 KB Output is correct
13 Correct 6 ms 6740 KB Output is correct
14 Correct 7 ms 6100 KB Output is correct
15 Correct 7 ms 5716 KB Output is correct
16 Correct 7 ms 6100 KB Output is correct
17 Correct 8 ms 6336 KB Output is correct
18 Correct 5 ms 5948 KB Output is correct
19 Correct 5 ms 6404 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 4 ms 5460 KB Output is correct
6 Correct 4 ms 5460 KB Output is correct
7 Correct 4 ms 5484 KB Output is correct
8 Correct 6 ms 6868 KB Output is correct
9 Correct 7 ms 6964 KB Output is correct
10 Correct 6 ms 6868 KB Output is correct
11 Correct 6 ms 6740 KB Output is correct
12 Correct 6 ms 6100 KB Output is correct
13 Correct 6 ms 6740 KB Output is correct
14 Correct 7 ms 6100 KB Output is correct
15 Correct 7 ms 5716 KB Output is correct
16 Correct 7 ms 6100 KB Output is correct
17 Correct 8 ms 6336 KB Output is correct
18 Correct 5 ms 5948 KB Output is correct
19 Correct 5 ms 6404 KB Output is correct
20 Correct 320 ms 8008 KB Output is correct
21 Correct 341 ms 7932 KB Output is correct
22 Correct 348 ms 8000 KB Output is correct
23 Correct 331 ms 8008 KB Output is correct
24 Correct 418 ms 151268 KB Output is correct
25 Correct 438 ms 155352 KB Output is correct
26 Correct 482 ms 155596 KB Output is correct
27 Correct 434 ms 210788 KB Output is correct
28 Correct 444 ms 210696 KB Output is correct
29 Correct 425 ms 210760 KB Output is correct
30 Correct 436 ms 210504 KB Output is correct
31 Correct 454 ms 205372 KB Output is correct
32 Correct 441 ms 210404 KB Output is correct
33 Correct 336 ms 132424 KB Output is correct
34 Correct 332 ms 114088 KB Output is correct
35 Correct 333 ms 131656 KB Output is correct
36 Correct 405 ms 171888 KB Output is correct
37 Correct 399 ms 159544 KB Output is correct
38 Correct 403 ms 172240 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 4 ms 5460 KB Output is correct
6 Correct 4 ms 5460 KB Output is correct
7 Correct 4 ms 5484 KB Output is correct
8 Correct 6 ms 6868 KB Output is correct
9 Correct 7 ms 6964 KB Output is correct
10 Correct 6 ms 6868 KB Output is correct
11 Correct 6 ms 6740 KB Output is correct
12 Correct 6 ms 6100 KB Output is correct
13 Correct 6 ms 6740 KB Output is correct
14 Correct 7 ms 6100 KB Output is correct
15 Correct 7 ms 5716 KB Output is correct
16 Correct 7 ms 6100 KB Output is correct
17 Correct 8 ms 6336 KB Output is correct
18 Correct 5 ms 5948 KB Output is correct
19 Correct 5 ms 6404 KB Output is correct
20 Correct 320 ms 8008 KB Output is correct
21 Correct 341 ms 7932 KB Output is correct
22 Correct 348 ms 8000 KB Output is correct
23 Correct 331 ms 8008 KB Output is correct
24 Correct 418 ms 151268 KB Output is correct
25 Correct 438 ms 155352 KB Output is correct
26 Correct 482 ms 155596 KB Output is correct
27 Correct 434 ms 210788 KB Output is correct
28 Correct 444 ms 210696 KB Output is correct
29 Correct 425 ms 210760 KB Output is correct
30 Correct 436 ms 210504 KB Output is correct
31 Correct 454 ms 205372 KB Output is correct
32 Correct 441 ms 210404 KB Output is correct
33 Correct 336 ms 132424 KB Output is correct
34 Correct 332 ms 114088 KB Output is correct
35 Correct 333 ms 131656 KB Output is correct
36 Correct 405 ms 171888 KB Output is correct
37 Correct 399 ms 159544 KB Output is correct
38 Correct 403 ms 172240 KB Output is correct
39 Correct 487 ms 152464 KB Output is correct
40 Correct 442 ms 153128 KB Output is correct
41 Correct 427 ms 153552 KB Output is correct
42 Correct 466 ms 154200 KB Output is correct
43 Correct 425 ms 153096 KB Output is correct
44 Correct 348 ms 8740 KB Output is correct
45 Correct 378 ms 8108 KB Output is correct
46 Correct 324 ms 7956 KB Output is correct
47 Correct 330 ms 8048 KB Output is correct
48 Correct 317 ms 7948 KB Output is correct
49 Correct 559 ms 211072 KB Output is correct
50 Correct 536 ms 210068 KB Output is correct
51 Correct 359 ms 8740 KB Output is correct
52 Correct 324 ms 8028 KB Output is correct
53 Correct 460 ms 171404 KB Output is correct
54 Correct 465 ms 159576 KB Output is correct
55 Correct 422 ms 170692 KB Output is correct
56 Correct 398 ms 162144 KB Output is correct
57 Correct 395 ms 11136 KB Output is correct
58 Correct 354 ms 10968 KB Output is correct
59 Correct 320 ms 9784 KB Output is correct
60 Correct 325 ms 9792 KB Output is correct
61 Correct 562 ms 213108 KB Output is correct
62 Correct 436 ms 174556 KB Output is correct
63 Correct 434 ms 161612 KB Output is correct
64 Correct 643 ms 213312 KB Output is correct
65 Correct 584 ms 173936 KB Output is correct
66 Correct 542 ms 162800 KB Output is correct
67 Correct 713 ms 213172 KB Output is correct
68 Correct 647 ms 174572 KB Output is correct
69 Correct 619 ms 160580 KB Output is correct
70 Correct 546 ms 213364 KB Output is correct
71 Correct 441 ms 174480 KB Output is correct
72 Correct 408 ms 162276 KB Output is correct
73 Correct 549 ms 213284 KB Output is correct
74 Correct 457 ms 174472 KB Output is correct
75 Correct 436 ms 162124 KB Output is correct
76 Correct 580 ms 214760 KB Output is correct
77 Correct 696 ms 213420 KB Output is correct
78 Correct 477 ms 213548 KB Output is correct
79 Correct 363 ms 11136 KB Output is correct
80 Correct 345 ms 9888 KB Output is correct
81 Correct 325 ms 9548 KB Output is correct
82 Correct 610 ms 214548 KB Output is correct
83 Correct 634 ms 209236 KB Output is correct
84 Correct 606 ms 213332 KB Output is correct
85 Correct 624 ms 207900 KB Output is correct
86 Correct 455 ms 213464 KB Output is correct
87 Correct 476 ms 208476 KB Output is correct
88 Correct 356 ms 11224 KB Output is correct
89 Correct 351 ms 11204 KB Output is correct
90 Correct 355 ms 9964 KB Output is correct
91 Correct 358 ms 9980 KB Output is correct
92 Correct 305 ms 9532 KB Output is correct
93 Correct 320 ms 9588 KB Output is correct
94 Correct 416 ms 136552 KB Output is correct
95 Correct 388 ms 117252 KB Output is correct
96 Correct 438 ms 134780 KB Output is correct
97 Correct 425 ms 118404 KB Output is correct
98 Correct 340 ms 135432 KB Output is correct
99 Correct 374 ms 117872 KB Output is correct
100 Correct 354 ms 11284 KB Output is correct
101 Correct 369 ms 11228 KB Output is correct
102 Correct 342 ms 9996 KB Output is correct
103 Correct 333 ms 9940 KB Output is correct
104 Correct 325 ms 9608 KB Output is correct
105 Correct 321 ms 9584 KB Output is correct
106 Correct 492 ms 175228 KB Output is correct
107 Correct 465 ms 163356 KB Output is correct
108 Correct 501 ms 175052 KB Output is correct
109 Correct 520 ms 162140 KB Output is correct
110 Correct 480 ms 175360 KB Output is correct
111 Correct 469 ms 162932 KB Output is correct
112 Correct 358 ms 11240 KB Output is correct
113 Correct 348 ms 11196 KB Output is correct
114 Correct 338 ms 9892 KB Output is correct
115 Correct 411 ms 10032 KB Output is correct
116 Correct 341 ms 9480 KB Output is correct
117 Correct 347 ms 9568 KB Output is correct
118 Correct 526 ms 212628 KB Output is correct
119 Correct 442 ms 174160 KB Output is correct
120 Correct 491 ms 161436 KB Output is correct
121 Correct 514 ms 212656 KB Output is correct
122 Correct 413 ms 173572 KB Output is correct
123 Correct 406 ms 161216 KB Output is correct
124 Correct 523 ms 212548 KB Output is correct
125 Correct 400 ms 174500 KB Output is correct
126 Correct 412 ms 160824 KB Output is correct