oj.uz

Submission #963229

# Submission time Handle Problem Language Result Execution time Memory
963229 2024-04-14T19:02:50 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 75744 KB 
//start-time: 2024-04-14 19:39:32
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve(){
    ll n, m, q;
    cin >> n >> m >> q;
    vector<vector<ll>> g(n);
    vector<vector<ll>> gR(n);
    for(ll i = 0; i < m; i++){
        ll u, v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v);
        gR[v].push_back(u);
    }
    
    vector<ll> vis(n), topo;
    auto dfs = [&](ll u, auto&&dfs) -> void {
        vis[u] = 1;
        for(auto v : g[u]){
            if(!vis[v]){
                dfs(v, dfs);
            }
        }
        vis[u] = 2;
        topo.push_back(u);
    };

    for(int i = 0; i < n; i++){
        if(vis[i] == 0){
            dfs(i, dfs);
        }
    }

    reverse(topo.begin(), topo.end());
    
    vector<set<array<ll, 2>>> dp(n);
    vector<bitset<100'001>> cnt(n);
    map<int, map<int, ll>> mp;
    for(auto el : topo){
        dp[el].insert({0, el});
        mp[el][el] = 0;
        cnt[el][el] = 1;
    }
    
    const ll w = round(sqrt(1'000'000)) + 1;

    for(auto u : topo){
        for(auto v : gR[u]){
            for(auto [val, i] : dp[v]){
                cnt[u] |= cnt[v];
                ll o = val + 1;
                if(mp[u][i]) {
                    o = max(o, mp[u][i]);
                    dp[u].erase({mp[u][i], i});
                }
                
                mp[u][i] = o;
                dp[u].insert({o, i});
                if(dp[u].size() > w){
                    auto [V, I] = *dp[u].begin();
                    dp[u].erase(dp[u].begin());
                    mp[u][I] = 0;
                }
            }
        }
    }

    //for(auto ms : dp){
        //for(auto [v, i] : ms){
            //cout << v << ' ' << i << '\n';
        //}
        //cout << endl;
    //}
    //TODO  

    for(ll i = 0; i < q; i++){
        ll u, y;
        cin >> u >> y;
        u--;
        bitset<100'001> c;
        for(ll j = 0; j < y; j++){
            ll a; cin >> a;
            c[--a] = 1;
        }

        if((cnt[u] & c) == cnt[u]){
            cout << -1 << endl;
            continue;
        }

        set<array<ll, 2>> ms = dp[u];
        ll ans = 0;
        for(auto [v, i] : ms){
            if(!c[i]){
                ans = max(ans, v);
            }
        }
        cout << ans << endl;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T = 1;
    //cin >> T;
    while(T--) solve();
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 17536 KB Output is correct
6 Correct 69 ms 17700 KB Output is correct
7 Correct 58 ms 17432 KB Output is correct
8 Correct 819 ms 75564 KB Output is correct
9 Correct 837 ms 75628 KB Output is correct
10 Correct 849 ms 75744 KB Output is correct
11 Correct 526 ms 51160 KB Output is correct
12 Correct 160 ms 26964 KB Output is correct
13 Correct 508 ms 49092 KB Output is correct
14 Correct 660 ms 48844 KB Output is correct
15 Correct 249 ms 25684 KB Output is correct
16 Correct 628 ms 48216 KB Output is correct
17 Correct 479 ms 47336 KB Output is correct
18 Correct 191 ms 25848 KB Output is correct
19 Correct 465 ms 46836 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 17536 KB Output is correct
6 Correct 69 ms 17700 KB Output is correct
7 Correct 58 ms 17432 KB Output is correct
8 Correct 819 ms 75564 KB Output is correct
9 Correct 837 ms 75628 KB Output is correct
10 Correct 849 ms 75744 KB Output is correct
11 Correct 526 ms 51160 KB Output is correct
12 Correct 160 ms 26964 KB Output is correct
13 Correct 508 ms 49092 KB Output is correct
14 Correct 660 ms 48844 KB Output is correct
15 Correct 249 ms 25684 KB Output is correct
16 Correct 628 ms 48216 KB Output is correct
17 Correct 479 ms 47336 KB Output is correct
18 Correct 191 ms 25848 KB Output is correct
19 Correct 465 ms 46836 KB Output is correct
20 Execution timed out 2017 ms 20792 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 17536 KB Output is correct
6 Correct 69 ms 17700 KB Output is correct
7 Correct 58 ms 17432 KB Output is correct
8 Correct 819 ms 75564 KB Output is correct
9 Correct 837 ms 75628 KB Output is correct
10 Correct 849 ms 75744 KB Output is correct
11 Correct 526 ms 51160 KB Output is correct
12 Correct 160 ms 26964 KB Output is correct
13 Correct 508 ms 49092 KB Output is correct
14 Correct 660 ms 48844 KB Output is correct
15 Correct 249 ms 25684 KB Output is correct
16 Correct 628 ms 48216 KB Output is correct
17 Correct 479 ms 47336 KB Output is correct
18 Correct 191 ms 25848 KB Output is correct
19 Correct 465 ms 46836 KB Output is correct
20 Execution timed out 2017 ms 20792 KB Time limit exceeded
21 Halted 0 ms 0 KB -