oj.uz

Submission #967454

# Submission time Handle Problem Language Result Execution time Memory
967454 2024-04-22T06:45:28 Z Tuanlinh123 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 237256 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=180;
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 7260 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 7988 KB Output is correct
6 Correct 6 ms 8028 KB Output is correct
7 Correct 4 ms 8012 KB Output is correct
8 Correct 11 ms 9564 KB Output is correct
9 Correct 12 ms 9604 KB Output is correct
10 Correct 11 ms 9564 KB Output is correct
11 Correct 11 ms 9308 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 11 ms 9356 KB Output is correct
14 Correct 10 ms 8540 KB Output is correct
15 Correct 7 ms 8284 KB Output is correct
16 Correct 10 ms 8540 KB Output is correct
17 Correct 10 ms 8796 KB Output is correct
18 Correct 7 ms 8540 KB Output is correct
19 Correct 11 ms 9048 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 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 7988 KB Output is correct
6 Correct 6 ms 8028 KB Output is correct
7 Correct 4 ms 8012 KB Output is correct
8 Correct 11 ms 9564 KB Output is correct
9 Correct 12 ms 9604 KB Output is correct
10 Correct 11 ms 9564 KB Output is correct
11 Correct 11 ms 9308 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 11 ms 9356 KB Output is correct
14 Correct 10 ms 8540 KB Output is correct
15 Correct 7 ms 8284 KB Output is correct
16 Correct 10 ms 8540 KB Output is correct
17 Correct 10 ms 8796 KB Output is correct
18 Correct 7 ms 8540 KB Output is correct
19 Correct 11 ms 9048 KB Output is correct
20 Correct 1854 ms 12560 KB Output is correct
21 Correct 1767 ms 12540 KB Output is correct
22 Correct 1799 ms 12224 KB Output is correct
23 Correct 1814 ms 14000 KB Output is correct
24 Correct 1035 ms 170724 KB Output is correct
25 Correct 1035 ms 175956 KB Output is correct
26 Correct 1051 ms 176068 KB Output is correct
27 Correct 787 ms 236748 KB Output is correct
28 Correct 754 ms 237256 KB Output is correct
29 Correct 736 ms 236932 KB Output is correct
30 Correct 826 ms 236260 KB Output is correct
31 Correct 996 ms 230800 KB Output is correct
32 Correct 842 ms 236404 KB Output is correct
33 Correct 834 ms 150540 KB Output is correct
34 Correct 844 ms 130708 KB Output is correct
35 Correct 817 ms 149536 KB Output is correct
36 Correct 995 ms 195132 KB Output is correct
37 Correct 1026 ms 181832 KB Output is correct
38 Correct 995 ms 195620 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 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 7988 KB Output is correct
6 Correct 6 ms 8028 KB Output is correct
7 Correct 4 ms 8012 KB Output is correct
8 Correct 11 ms 9564 KB Output is correct
9 Correct 12 ms 9604 KB Output is correct
10 Correct 11 ms 9564 KB Output is correct
11 Correct 11 ms 9308 KB Output is correct
12 Correct 7 ms 8540 KB Output is correct
13 Correct 11 ms 9356 KB Output is correct
14 Correct 10 ms 8540 KB Output is correct
15 Correct 7 ms 8284 KB Output is correct
16 Correct 10 ms 8540 KB Output is correct
17 Correct 10 ms 8796 KB Output is correct
18 Correct 7 ms 8540 KB Output is correct
19 Correct 11 ms 9048 KB Output is correct
20 Correct 1854 ms 12560 KB Output is correct
21 Correct 1767 ms 12540 KB Output is correct
22 Correct 1799 ms 12224 KB Output is correct
23 Correct 1814 ms 14000 KB Output is correct
24 Correct 1035 ms 170724 KB Output is correct
25 Correct 1035 ms 175956 KB Output is correct
26 Correct 1051 ms 176068 KB Output is correct
27 Correct 787 ms 236748 KB Output is correct
28 Correct 754 ms 237256 KB Output is correct
29 Correct 736 ms 236932 KB Output is correct
30 Correct 826 ms 236260 KB Output is correct
31 Correct 996 ms 230800 KB Output is correct
32 Correct 842 ms 236404 KB Output is correct
33 Correct 834 ms 150540 KB Output is correct
34 Correct 844 ms 130708 KB Output is correct
35 Correct 817 ms 149536 KB Output is correct
36 Correct 995 ms 195132 KB Output is correct
37 Correct 1026 ms 181832 KB Output is correct
38 Correct 995 ms 195620 KB Output is correct
39 Correct 1034 ms 171936 KB Output is correct
40 Correct 1022 ms 173116 KB Output is correct
41 Correct 1066 ms 173324 KB Output is correct
42 Correct 1708 ms 174056 KB Output is correct
43 Correct 1086 ms 173316 KB Output is correct
44 Correct 1829 ms 12444 KB Output is correct
45 Correct 1834 ms 12348 KB Output is correct
46 Correct 1841 ms 12456 KB Output is correct
47 Correct 1862 ms 12296 KB Output is correct
48 Correct 1819 ms 12240 KB Output is correct
49 Correct 921 ms 236456 KB Output is correct
50 Correct 784 ms 235856 KB Output is correct
51 Correct 1790 ms 12432 KB Output is correct
52 Correct 1793 ms 12116 KB Output is correct
53 Correct 1066 ms 194392 KB Output is correct
54 Correct 1048 ms 181076 KB Output is correct
55 Correct 1022 ms 193476 KB Output is correct
56 Correct 1039 ms 181952 KB Output is correct
57 Correct 1831 ms 12784 KB Output is correct
58 Correct 1833 ms 13160 KB Output is correct
59 Correct 1813 ms 12564 KB Output is correct
60 Correct 1803 ms 12988 KB Output is correct
61 Correct 1073 ms 237132 KB Output is correct
62 Correct 1561 ms 195600 KB Output is correct
63 Correct 1571 ms 181032 KB Output is correct
64 Correct 1751 ms 237240 KB Output is correct
65 Execution timed out 2061 ms 194856 KB Time limit exceeded
66 Halted 0 ms 0 KB -