Submission #899049

#	Time	Username	Problem	Language	Result	Execution time	Memory
899049		12345678	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	2 ms	3932 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;
int n, m, Q, a, b, sz, l, ans;
vector<int> d[nx], p(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[b].push_back(a);
    while (Q--)
    {
        cin>>l>>sz;
        for (int i=1; i<=sz; i++) cin>>p[i], vs[p[i]]=1;
        for (int i=1; i<=n; i++) dp[i]=0;
        ans=0;
        q.push(l);
        while (!q.empty())
        {
            auto u=q.front();
            q.pop();
            for (auto v:d[u]) if (dp[u]+1>dp[v]) dp[v]=dp[u]+1, q.push(v), ans=max(ans, (!vs[v])?dp[v]:0);
        }
        for (auto vl:p) vs[vl]=0;
        cout<<ans<<'\n';
    }
}

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