oj.uz

Submission #967453

# Submission time Handle Problem Language Result Execution time Memory
967453 2024-04-22T06:43:52 Z Tuanlinh123 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 228500 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=130;
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 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7384 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 4 ms 7984 KB Output is correct
7 Correct 5 ms 7992 KB Output is correct
8 Correct 10 ms 9468 KB Output is correct
9 Correct 8 ms 9560 KB Output is correct
10 Correct 8 ms 9564 KB Output is correct
11 Correct 10 ms 9384 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 9 ms 9308 KB Output is correct
14 Correct 8 ms 8540 KB Output is correct
15 Correct 6 ms 8324 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 10 ms 8796 KB Output is correct
18 Correct 6 ms 8556 KB Output is correct
19 Correct 9 ms 8796 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7384 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 4 ms 7984 KB Output is correct
7 Correct 5 ms 7992 KB Output is correct
8 Correct 10 ms 9468 KB Output is correct
9 Correct 8 ms 9560 KB Output is correct
10 Correct 8 ms 9564 KB Output is correct
11 Correct 10 ms 9384 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 9 ms 9308 KB Output is correct
14 Correct 8 ms 8540 KB Output is correct
15 Correct 6 ms 8324 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 10 ms 8796 KB Output is correct
18 Correct 6 ms 8556 KB Output is correct
19 Correct 9 ms 8796 KB Output is correct
20 Correct 1363 ms 11964 KB Output is correct
21 Correct 1342 ms 12348 KB Output is correct
22 Correct 1380 ms 12068 KB Output is correct
23 Correct 1337 ms 13196 KB Output is correct
24 Correct 813 ms 165816 KB Output is correct
25 Correct 835 ms 170836 KB Output is correct
26 Correct 855 ms 170836 KB Output is correct
27 Correct 599 ms 228180 KB Output is correct
28 Correct 602 ms 228192 KB Output is correct
29 Correct 587 ms 228252 KB Output is correct
30 Correct 656 ms 227948 KB Output is correct
31 Correct 788 ms 222212 KB Output is correct
32 Correct 640 ms 227412 KB Output is correct
33 Correct 683 ms 145232 KB Output is correct
34 Correct 605 ms 126580 KB Output is correct
35 Correct 614 ms 144536 KB Output is correct
36 Correct 740 ms 187992 KB Output is correct
37 Correct 798 ms 175160 KB Output is correct
38 Correct 745 ms 188372 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7384 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 4 ms 7984 KB Output is correct
7 Correct 5 ms 7992 KB Output is correct
8 Correct 10 ms 9468 KB Output is correct
9 Correct 8 ms 9560 KB Output is correct
10 Correct 8 ms 9564 KB Output is correct
11 Correct 10 ms 9384 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 9 ms 9308 KB Output is correct
14 Correct 8 ms 8540 KB Output is correct
15 Correct 6 ms 8324 KB Output is correct
16 Correct 8 ms 8540 KB Output is correct
17 Correct 10 ms 8796 KB Output is correct
18 Correct 6 ms 8556 KB Output is correct
19 Correct 9 ms 8796 KB Output is correct
20 Correct 1363 ms 11964 KB Output is correct
21 Correct 1342 ms 12348 KB Output is correct
22 Correct 1380 ms 12068 KB Output is correct
23 Correct 1337 ms 13196 KB Output is correct
24 Correct 813 ms 165816 KB Output is correct
25 Correct 835 ms 170836 KB Output is correct
26 Correct 855 ms 170836 KB Output is correct
27 Correct 599 ms 228180 KB Output is correct
28 Correct 602 ms 228192 KB Output is correct
29 Correct 587 ms 228252 KB Output is correct
30 Correct 656 ms 227948 KB Output is correct
31 Correct 788 ms 222212 KB Output is correct
32 Correct 640 ms 227412 KB Output is correct
33 Correct 683 ms 145232 KB Output is correct
34 Correct 605 ms 126580 KB Output is correct
35 Correct 614 ms 144536 KB Output is correct
36 Correct 740 ms 187992 KB Output is correct
37 Correct 798 ms 175160 KB Output is correct
38 Correct 745 ms 188372 KB Output is correct
39 Correct 906 ms 166388 KB Output is correct
40 Correct 857 ms 167948 KB Output is correct
41 Correct 899 ms 168920 KB Output is correct
42 Correct 1426 ms 168992 KB Output is correct
43 Correct 919 ms 168132 KB Output is correct
44 Correct 1400 ms 12632 KB Output is correct
45 Correct 1379 ms 12036 KB Output is correct
46 Correct 1385 ms 12424 KB Output is correct
47 Correct 1438 ms 11912 KB Output is correct
48 Correct 1367 ms 12172 KB Output is correct
49 Correct 749 ms 227792 KB Output is correct
50 Correct 623 ms 228208 KB Output is correct
51 Correct 1394 ms 12932 KB Output is correct
52 Correct 1342 ms 12456 KB Output is correct
53 Correct 888 ms 187096 KB Output is correct
54 Correct 809 ms 174632 KB Output is correct
55 Correct 793 ms 187712 KB Output is correct
56 Correct 829 ms 175824 KB Output is correct
57 Correct 1384 ms 12392 KB Output is correct
58 Correct 1393 ms 12636 KB Output is correct
59 Correct 1362 ms 12180 KB Output is correct
60 Correct 1372 ms 12804 KB Output is correct
61 Correct 978 ms 228500 KB Output is correct
62 Correct 1433 ms 188288 KB Output is correct
63 Correct 1472 ms 174520 KB Output is correct
64 Correct 1664 ms 228452 KB Output is correct
65 Execution timed out 2066 ms 187444 KB Time limit exceeded
66 Halted 0 ms 0 KB -