oj.uz

Submission #963274

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

using namespace std;
using ll = long long;

const int w = 330;

void solve(){
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<int>> g(n);
    vector<vector<int>> gR(n);
    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v);
        gR[v].push_back(u);
    }
    
    vector<int> topo(n);
    iota(topo.begin(), topo.end(), 0);
    
    vector<vector<array<int, 2>>> dp(n);

    for(auto u : topo){
        vector<int> val(n, -1), aux;
        aux.push_back(u);
        val[u] = 0;

        for(auto v : gR[u]){
            for(auto [value, ind] : dp[v]){
                aux.push_back(ind);
                val[ind] = max(val[ind], value + 1);
            }
        }

        sort(aux.begin(), aux.end());
        aux.erase(unique(aux.begin(), aux.end()), aux.end());
        sort(aux.begin(), aux.end(), [&](int a, int b){
            return val[a] > val[b];
        });
        for(auto el : aux){
            if(dp[u].size() < w){
                dp[u].push_back({val[el], el});
            }
        }
    }
    for(int i = 0; i < q; i++){
        int u, y;
        cin >> u >> y;
        u--;
        vector<bool> c(100'001);
        for(int j = 0; j < y; j++){
            ll a; cin >> a;
            c[--a] = 1;
        }

        int ans = -1;

        if(y < w) {
            for(auto [v, i] : dp[u]){
                if(!c[i]){
                    ans = max(ans, v);
                }
            }
        }
        else {
            vector<int> naive(n);
            for(auto v : topo){
                naive[v] = c[v] ? -1 : 0;
                for(auto el : gR[v]){
                    naive[v] = max(naive[v], naive[el] + (naive[el] != -1));
                }
            }
            ans = naive[u];
        }

        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 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 17 ms 3932 KB Output is correct
9 Correct 17 ms 3892 KB Output is correct
10 Correct 16 ms 3932 KB Output is correct
11 Correct 21 ms 3416 KB Output is correct
12 Correct 10 ms 2136 KB Output is correct
13 Correct 22 ms 3164 KB Output is correct
14 Correct 17 ms 2432 KB Output is correct
15 Correct 10 ms 1628 KB Output is correct
16 Correct 15 ms 2508 KB Output is correct
17 Correct 16 ms 2768 KB Output is correct
18 Correct 9 ms 1672 KB Output is correct
19 Correct 16 ms 2740 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 17 ms 3932 KB Output is correct
9 Correct 17 ms 3892 KB Output is correct
10 Correct 16 ms 3932 KB Output is correct
11 Correct 21 ms 3416 KB Output is correct
12 Correct 10 ms 2136 KB Output is correct
13 Correct 22 ms 3164 KB Output is correct
14 Correct 17 ms 2432 KB Output is correct
15 Correct 10 ms 1628 KB Output is correct
16 Correct 15 ms 2508 KB Output is correct
17 Correct 16 ms 2768 KB Output is correct
18 Correct 9 ms 1672 KB Output is correct
19 Correct 16 ms 2740 KB Output is correct
20 Correct 1324 ms 8588 KB Output is correct
21 Correct 1340 ms 8616 KB Output is correct
22 Correct 1396 ms 8592 KB Output is correct
23 Correct 1766 ms 9556 KB Output is correct
24 Execution timed out 2071 ms 205656 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 17 ms 3932 KB Output is correct
9 Correct 17 ms 3892 KB Output is correct
10 Correct 16 ms 3932 KB Output is correct
11 Correct 21 ms 3416 KB Output is correct
12 Correct 10 ms 2136 KB Output is correct
13 Correct 22 ms 3164 KB Output is correct
14 Correct 17 ms 2432 KB Output is correct
15 Correct 10 ms 1628 KB Output is correct
16 Correct 15 ms 2508 KB Output is correct
17 Correct 16 ms 2768 KB Output is correct
18 Correct 9 ms 1672 KB Output is correct
19 Correct 16 ms 2740 KB Output is correct
20 Correct 1324 ms 8588 KB Output is correct
21 Correct 1340 ms 8616 KB Output is correct
22 Correct 1396 ms 8592 KB Output is correct
23 Correct 1766 ms 9556 KB Output is correct
24 Execution timed out 2071 ms 205656 KB Time limit exceeded
25 Halted 0 ms 0 KB -