Submission #906995

#	Time	Username	Problem	Language	Result	Execution time	Memory
906995		12345678	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	2047 ms	9568 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;
int n, m, Q, a, b, sz, l, ans, x;
vector<int> d[nx], vs(nx), dp(nx);
queue<int> q;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>Q;
    for (int i=1; i<=m; i++) cin>>a>>b, d[a].push_back(b);
    while (Q--)
    {
        cin>>l>>sz;
        ans=-1;
        for (int i=1; i<=sz; i++) cin>>x, vs[x]=1;
        for (int i=1; i<=n; i++) dp[i]=INT_MIN;
        dp[l]=0;
        for (int i=l; i>=1; i--) 
        {
            for (auto v:d[i]) dp[i]=max(dp[i], dp[v]+1);
            if (!vs[i]) ans=max(ans, dp[i]);
        }
        for (int i=1; i<=n; i++) vs[i]=0;
        cout<<ans<<'\n';
    }
}

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