oj.uz

Submission #967451

# Submission time Handle Problem Language Result Execution time Memory
967451 2024-04-22T06:41:37 Z Tuanlinh123 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 73164 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=60;
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;
        ll sum=0;
        for (ll v:At[u]) sum+=sz(best[v]);
        val.reserve(sum+5), val.pb({-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]) 
            {
                seen[v]=1, best[u].pb({x+1, v});
                if (sz(best[u])==s) break;
            }
        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 3 ms 7260 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 4 ms 7776 KB Output is correct
6 Correct 4 ms 7940 KB Output is correct
7 Correct 4 ms 7812 KB Output is correct
8 Correct 5 ms 8028 KB Output is correct
9 Correct 6 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8028 KB Output is correct
13 Correct 5 ms 7936 KB Output is correct
14 Correct 5 ms 7772 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct
16 Correct 5 ms 7916 KB Output is correct
17 Correct 5 ms 8024 KB Output is correct
18 Correct 5 ms 7772 KB Output is correct
19 Correct 5 ms 8028 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7260 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 4 ms 7776 KB Output is correct
6 Correct 4 ms 7940 KB Output is correct
7 Correct 4 ms 7812 KB Output is correct
8 Correct 5 ms 8028 KB Output is correct
9 Correct 6 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8028 KB Output is correct
13 Correct 5 ms 7936 KB Output is correct
14 Correct 5 ms 7772 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct
16 Correct 5 ms 7916 KB Output is correct
17 Correct 5 ms 8024 KB Output is correct
18 Correct 5 ms 7772 KB Output is correct
19 Correct 5 ms 8028 KB Output is correct
20 Correct 669 ms 11476 KB Output is correct
21 Correct 629 ms 11600 KB Output is correct
22 Correct 648 ms 11712 KB Output is correct
23 Correct 628 ms 11996 KB Output is correct
24 Correct 458 ms 60312 KB Output is correct
25 Correct 476 ms 60484 KB Output is correct
26 Correct 472 ms 60768 KB Output is correct
27 Correct 283 ms 73164 KB Output is correct
28 Correct 305 ms 73068 KB Output is correct
29 Correct 274 ms 73040 KB Output is correct
30 Correct 316 ms 72528 KB Output is correct
31 Correct 377 ms 71220 KB Output is correct
32 Correct 314 ms 72480 KB Output is correct
33 Correct 331 ms 52996 KB Output is correct
34 Correct 324 ms 50276 KB Output is correct
35 Correct 298 ms 52736 KB Output is correct
36 Correct 342 ms 63316 KB Output is correct
37 Correct 394 ms 60956 KB Output is correct
38 Correct 344 ms 63316 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7260 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 4 ms 7776 KB Output is correct
6 Correct 4 ms 7940 KB Output is correct
7 Correct 4 ms 7812 KB Output is correct
8 Correct 5 ms 8028 KB Output is correct
9 Correct 6 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8028 KB Output is correct
13 Correct 5 ms 7936 KB Output is correct
14 Correct 5 ms 7772 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct
16 Correct 5 ms 7916 KB Output is correct
17 Correct 5 ms 8024 KB Output is correct
18 Correct 5 ms 7772 KB Output is correct
19 Correct 5 ms 8028 KB Output is correct
20 Correct 669 ms 11476 KB Output is correct
21 Correct 629 ms 11600 KB Output is correct
22 Correct 648 ms 11712 KB Output is correct
23 Correct 628 ms 11996 KB Output is correct
24 Correct 458 ms 60312 KB Output is correct
25 Correct 476 ms 60484 KB Output is correct
26 Correct 472 ms 60768 KB Output is correct
27 Correct 283 ms 73164 KB Output is correct
28 Correct 305 ms 73068 KB Output is correct
29 Correct 274 ms 73040 KB Output is correct
30 Correct 316 ms 72528 KB Output is correct
31 Correct 377 ms 71220 KB Output is correct
32 Correct 314 ms 72480 KB Output is correct
33 Correct 331 ms 52996 KB Output is correct
34 Correct 324 ms 50276 KB Output is correct
35 Correct 298 ms 52736 KB Output is correct
36 Correct 342 ms 63316 KB Output is correct
37 Correct 394 ms 60956 KB Output is correct
38 Correct 344 ms 63316 KB Output is correct
39 Correct 483 ms 60184 KB Output is correct
40 Correct 508 ms 59984 KB Output is correct
41 Execution timed out 2062 ms 60404 KB Time limit exceeded
42 Halted 0 ms 0 KB -