Submission #1287877

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287877		putthi_us	Bitaro’s Party (JOI18_bitaro)	C++20	14 / 100	2093 ms	6432 KiB

bitaro

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n,m,q,ans=-1;
    bitset<100005> block=0;
    cin>>n>>m>>q;
    vector<vector<int>> path(n+1);
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        path[a].push_back(b);
    }
    while(q--){
        block=0;
        int t,y,ans=-1;
        cin>>t>>y;
        for(int i=0;i<y;i++){
            int x;
            cin>>x;
            block[x]=1;
        }
        vector<int> dp(t+1,-1);
        // if(block[t]){
        //     cout<<-1<<'\n';continue;
        // }
        dp[t]=0;
        for(int i=t;i>=0;i--){
            
            // if(block[i]){
            //     continue;
            // }
            for(int x:path[i]){
                if(x>t){
                    continue;
                }
                if(dp[x]==-1){
                    continue;
                }
                // cout<<i<<' '<<x<<';';
                dp[i]=max(dp[i],dp[x]+1);
            }

            if(dp[i]==INT_MAX){
                continue;
            }
            if(block[i]){
                continue;
            }
            ans=max(ans,dp[i]);
        }
        cout<<ans<<'\n';
    }
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 0 / 86