oj.uz

Submission #959388

# Submission time Handle Problem Language Result Execution time Memory
959388 2024-04-08T06:40:41 Z irmuun Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 20648 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,q;
    cin>>n>>m>>q;
    ll s[m],e[m];
    vector<ll>up[n+5],down[n+5];
    for(ll i=0;i<m;i++){
        cin>>s[i]>>e[i];
        up[s[i]].pb(e[i]);
        down[e[i]].pb(s[i]);
    }
    vector<bool>vis(n+5,1);
    for(ll i=0;i<q;i++){
        ll t,y;
        cin>>t>>y;
        ll c[y];
        for(ll j=0;j<y;j++){
            cin>>c[j];
            vis[c[j]]=false;
        }
        ll ans=-1;
        vector<ll>dp(n+5,-1);
        dp[t]=0;
        for(ll j=t;j>=1;j--){
            if(dp[j]>-1){
                for(auto x:down[j]){
                    dp[x]=max(dp[x],dp[j]+1);
                }
            }
        }
        for(ll j=1;j<=n;j++){
            if(dp[j]>-1&&vis[j]){
                ans=max(ans,dp[j]);
            }
        }
        for(ll j=0;j<y;j++){
            vis[c[j]]=true;
        }
        cout<<ans<<"\n";
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 624 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 636 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 404 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 636 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 624 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 636 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 404 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 636 KB Output is correct
20 Correct 28 ms 9944 KB Output is correct
21 Correct 28 ms 10168 KB Output is correct
22 Correct 35 ms 9904 KB Output is correct
23 Correct 30 ms 10024 KB Output is correct
24 Correct 85 ms 18552 KB Output is correct
25 Correct 70 ms 18592 KB Output is correct
26 Correct 75 ms 18588 KB Output is correct
27 Correct 80 ms 20648 KB Output is correct
28 Correct 72 ms 20308 KB Output is correct
29 Correct 67 ms 20392 KB Output is correct
30 Correct 78 ms 19564 KB Output is correct
31 Correct 74 ms 19636 KB Output is correct
32 Correct 76 ms 19584 KB Output is correct
33 Correct 85 ms 19720 KB Output is correct
34 Correct 70 ms 19528 KB Output is correct
35 Correct 71 ms 19728 KB Output is correct
36 Correct 66 ms 19796 KB Output is correct
37 Correct 70 ms 19688 KB Output is correct
38 Correct 64 ms 19588 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 624 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 636 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 404 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 636 KB Output is correct
20 Correct 28 ms 9944 KB Output is correct
21 Correct 28 ms 10168 KB Output is correct
22 Correct 35 ms 9904 KB Output is correct
23 Correct 30 ms 10024 KB Output is correct
24 Correct 85 ms 18552 KB Output is correct
25 Correct 70 ms 18592 KB Output is correct
26 Correct 75 ms 18588 KB Output is correct
27 Correct 80 ms 20648 KB Output is correct
28 Correct 72 ms 20308 KB Output is correct
29 Correct 67 ms 20392 KB Output is correct
30 Correct 78 ms 19564 KB Output is correct
31 Correct 74 ms 19636 KB Output is correct
32 Correct 76 ms 19584 KB Output is correct
33 Correct 85 ms 19720 KB Output is correct
34 Correct 70 ms 19528 KB Output is correct
35 Correct 71 ms 19728 KB Output is correct
36 Correct 66 ms 19796 KB Output is correct
37 Correct 70 ms 19688 KB Output is correct
38 Correct 64 ms 19588 KB Output is correct
39 Execution timed out 2078 ms 18332 KB Time limit exceeded
40 Halted 0 ms 0 KB -