Submission #967472

#	Time	Username	Problem	Language	Result	Execution time	Memory
967472		Tuanlinh123	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	2072 ms	252340 KiB

bitaro

#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

const ll maxn=100005, s=300;
ll deg[maxn], seen[maxn];
vector <pll> best[maxn];
vector <ll> A[maxn], At[maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, m, q; cin >> n >> m >> q;
    for (ll i=1; i<=m; i++)
    {
        ll u, v; cin >> u >> v;
        A[u].pb(v), At[v].pb(u), deg[v]++;
    }
    queue <ll> Q;
    for (ll i=1; i<=n; i++)
        if (!deg[i]) Q.push(i);
    while (sz(Q))
    {
        ll u=Q.front(); Q.pop();
        if (sz(At[u]))
        {
            vector <pll> val; 
            best[u]=best[At[u][0]];
            for (ll i=1; i<sz(At[u]); i++)
            {
                ll v=At[u][i];
                for (ll p1=0, p2=0; p1<sz(best[u]) || p2<sz(best[v]);)
                {
                    if (p1==sz(best[u]) || (p2<sz(best[v]) && best[u][p1]<best[v][p2]))
                        val.pb(best[v][p2]), p2++;
                    else val.pb(best[u][p1]), p1++;
                }
                best[u].clear();
                for (auto [x, v]:val)
                    if (!seen[v])
                    {
                        seen[v]=1, best[u].pb({x, v});
                        if (sz(best[u])==s) break;
                    }
                for (auto [x, v]:best[u]) seen[v]=0;
                val.clear();
            }
        }
        for (auto &[x, v]:best[u]) x++;
        if (sz(best[u])<s) best[u].pb({0, u});
        for (ll v:A[u])
        {
            deg[v]--;
            if (!deg[v]) Q.push(v);
        }
    }
    for (ll i=1; i<=q; i++)
    {
        ll X, x, ans=-1; cin >> X >> x;
        vector <ll> a(x);
        for (ll &i:a) cin >> i;
        if (x>=s)
        {
            queue <ll> q;
            vector <ll> dp(n+5, 0), deg(n+5, 0);
            for (ll i=1; i<=n; i++) deg[i]=sz(At[i]), !deg[i]?q.push(i),0:0;
            for (ll i:a) dp[i]=-1e9;
            while (sz(q))
            {
                ll u=q.front(); q.pop();
                for (ll v:At[u]) 
                    dp[u]=max(dp[u], dp[v]+1);
                for (ll v:A[u])
                {
                    deg[v]--;
                    if (!deg[v]) q.push(v);
                }
            }
            if (dp[X]>=0) ans=dp[X];
        }
        else
        {
            for (ll j:a) seen[j]=1;
            for (auto [x, v]:best[X])
                if (!seen[v]) {ans=x; break;}
            for (ll j:a) seen[j]=0;
        } 
        cout << ans << "\n";
    }
}

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