oj.uz

Submission #967449

# Submission time Handle Problem Language Result Execution time Memory
967449 2024-04-22T06:34:45 Z Tuanlinh123 Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 15928 KB 
#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=500;
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();
        vector <pll> val={{-1, u}};
        for (ll v:At[u]) 
            for (pll b:best[v])
                val.pb(b);
        sort(val.begin(), val.end(), greater<pll>());
        for (auto [x, v]:val)
            if (!seen[v] && sz(best[u])<s) 
                seen[v]=1, best[u].pb({x+1, v});
        for (auto [x, v]:best[u]) seen[v]=0;
        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.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7256 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 6 ms 8024 KB Output is correct
7 Correct 5 ms 7808 KB Output is correct
8 Correct 20 ms 10840 KB Output is correct
9 Correct 20 ms 10844 KB Output is correct
10 Correct 22 ms 10868 KB Output is correct
11 Correct 20 ms 10332 KB Output is correct
12 Correct 8 ms 8796 KB Output is correct
13 Correct 20 ms 10328 KB Output is correct
14 Correct 21 ms 9556 KB Output is correct
15 Correct 10 ms 8796 KB Output is correct
16 Correct 19 ms 9560 KB Output is correct
17 Correct 16 ms 9820 KB Output is correct
18 Correct 9 ms 8792 KB Output is correct
19 Correct 21 ms 9668 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7256 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 6 ms 8024 KB Output is correct
7 Correct 5 ms 7808 KB Output is correct
8 Correct 20 ms 10840 KB Output is correct
9 Correct 20 ms 10844 KB Output is correct
10 Correct 22 ms 10868 KB Output is correct
11 Correct 20 ms 10332 KB Output is correct
12 Correct 8 ms 8796 KB Output is correct
13 Correct 20 ms 10328 KB Output is correct
14 Correct 21 ms 9556 KB Output is correct
15 Correct 10 ms 8796 KB Output is correct
16 Correct 19 ms 9560 KB Output is correct
17 Correct 16 ms 9820 KB Output is correct
18 Correct 9 ms 8792 KB Output is correct
19 Correct 21 ms 9668 KB Output is correct
20 Execution timed out 2058 ms 15928 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7256 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 6 ms 8024 KB Output is correct
7 Correct 5 ms 7808 KB Output is correct
8 Correct 20 ms 10840 KB Output is correct
9 Correct 20 ms 10844 KB Output is correct
10 Correct 22 ms 10868 KB Output is correct
11 Correct 20 ms 10332 KB Output is correct
12 Correct 8 ms 8796 KB Output is correct
13 Correct 20 ms 10328 KB Output is correct
14 Correct 21 ms 9556 KB Output is correct
15 Correct 10 ms 8796 KB Output is correct
16 Correct 19 ms 9560 KB Output is correct
17 Correct 16 ms 9820 KB Output is correct
18 Correct 9 ms 8792 KB Output is correct
19 Correct 21 ms 9668 KB Output is correct
20 Execution timed out 2058 ms 15928 KB Time limit exceeded
21 Halted 0 ms 0 KB -