oj.uz

Submission #967452

# Submission time Handle Problem Language Result Execution time Memory
967452 2024-04-22T06:42:06 Z Tuanlinh123 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 242632 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=150;
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 2 ms 7480 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 5 ms 7864 KB Output is correct
7 Correct 4 ms 8028 KB Output is correct
8 Correct 10 ms 9412 KB Output is correct
9 Correct 10 ms 9564 KB Output is correct
10 Correct 11 ms 9564 KB Output is correct
11 Correct 14 ms 9460 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 10 ms 9308 KB Output is correct
14 Correct 8 ms 8536 KB Output is correct
15 Correct 6 ms 8284 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 6 ms 8452 KB Output is correct
19 Correct 9 ms 9052 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7480 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 5 ms 7864 KB Output is correct
7 Correct 4 ms 8028 KB Output is correct
8 Correct 10 ms 9412 KB Output is correct
9 Correct 10 ms 9564 KB Output is correct
10 Correct 11 ms 9564 KB Output is correct
11 Correct 14 ms 9460 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 10 ms 9308 KB Output is correct
14 Correct 8 ms 8536 KB Output is correct
15 Correct 6 ms 8284 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 6 ms 8452 KB Output is correct
19 Correct 9 ms 9052 KB Output is correct
20 Correct 1580 ms 12380 KB Output is correct
21 Correct 1565 ms 12188 KB Output is correct
22 Correct 1584 ms 12260 KB Output is correct
23 Correct 1489 ms 13240 KB Output is correct
24 Correct 937 ms 169728 KB Output is correct
25 Correct 952 ms 174892 KB Output is correct
26 Correct 933 ms 175400 KB Output is correct
27 Correct 663 ms 239696 KB Output is correct
28 Correct 648 ms 239432 KB Output is correct
29 Correct 684 ms 239380 KB Output is correct
30 Correct 755 ms 238636 KB Output is correct
31 Correct 885 ms 232220 KB Output is correct
32 Correct 755 ms 238852 KB Output is correct
33 Correct 741 ms 151144 KB Output is correct
34 Correct 701 ms 130720 KB Output is correct
35 Correct 780 ms 150172 KB Output is correct
36 Correct 907 ms 197408 KB Output is correct
37 Correct 906 ms 182512 KB Output is correct
38 Correct 909 ms 197612 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7480 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 5 ms 7864 KB Output is correct
7 Correct 4 ms 8028 KB Output is correct
8 Correct 10 ms 9412 KB Output is correct
9 Correct 10 ms 9564 KB Output is correct
10 Correct 11 ms 9564 KB Output is correct
11 Correct 14 ms 9460 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 10 ms 9308 KB Output is correct
14 Correct 8 ms 8536 KB Output is correct
15 Correct 6 ms 8284 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 6 ms 8452 KB Output is correct
19 Correct 9 ms 9052 KB Output is correct
20 Correct 1580 ms 12380 KB Output is correct
21 Correct 1565 ms 12188 KB Output is correct
22 Correct 1584 ms 12260 KB Output is correct
23 Correct 1489 ms 13240 KB Output is correct
24 Correct 937 ms 169728 KB Output is correct
25 Correct 952 ms 174892 KB Output is correct
26 Correct 933 ms 175400 KB Output is correct
27 Correct 663 ms 239696 KB Output is correct
28 Correct 648 ms 239432 KB Output is correct
29 Correct 684 ms 239380 KB Output is correct
30 Correct 755 ms 238636 KB Output is correct
31 Correct 885 ms 232220 KB Output is correct
32 Correct 755 ms 238852 KB Output is correct
33 Correct 741 ms 151144 KB Output is correct
34 Correct 701 ms 130720 KB Output is correct
35 Correct 780 ms 150172 KB Output is correct
36 Correct 907 ms 197408 KB Output is correct
37 Correct 906 ms 182512 KB Output is correct
38 Correct 909 ms 197612 KB Output is correct
39 Correct 959 ms 170648 KB Output is correct
40 Correct 932 ms 171936 KB Output is correct
41 Correct 930 ms 172632 KB Output is correct
42 Correct 1599 ms 176204 KB Output is correct
43 Correct 978 ms 175120 KB Output is correct
44 Correct 1579 ms 15040 KB Output is correct
45 Correct 1558 ms 13980 KB Output is correct
46 Correct 1561 ms 14160 KB Output is correct
47 Correct 1617 ms 13732 KB Output is correct
48 Correct 1571 ms 13844 KB Output is correct
49 Correct 830 ms 242396 KB Output is correct
50 Correct 698 ms 241368 KB Output is correct
51 Correct 1547 ms 14540 KB Output is correct
52 Correct 1528 ms 14276 KB Output is correct
53 Correct 979 ms 199384 KB Output is correct
54 Correct 917 ms 184692 KB Output is correct
55 Correct 955 ms 198524 KB Output is correct
56 Correct 904 ms 184724 KB Output is correct
57 Correct 1630 ms 15060 KB Output is correct
58 Correct 1569 ms 14696 KB Output is correct
59 Correct 1535 ms 13928 KB Output is correct
60 Correct 1571 ms 14260 KB Output is correct
61 Correct 1008 ms 242348 KB Output is correct
62 Correct 1558 ms 200032 KB Output is correct
63 Correct 1598 ms 184304 KB Output is correct
64 Correct 1773 ms 242632 KB Output is correct
65 Execution timed out 2077 ms 199100 KB Time limit exceeded
66 Halted 0 ms 0 KB -