oj.uz

Submission #963275

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

using namespace std;
using ll = long long;

const int w = 150;

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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 872 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 8 ms 2392 KB Output is correct
9 Correct 8 ms 2396 KB Output is correct
10 Correct 10 ms 2396 KB Output is correct
11 Correct 11 ms 2140 KB Output is correct
12 Correct 9 ms 1628 KB Output is correct
13 Correct 12 ms 2152 KB Output is correct
14 Correct 9 ms 1452 KB Output is correct
15 Correct 6 ms 1112 KB Output is correct
16 Correct 8 ms 1624 KB Output is correct
17 Correct 8 ms 1880 KB Output is correct
18 Correct 7 ms 1372 KB Output is correct
19 Correct 9 ms 1884 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 872 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 8 ms 2392 KB Output is correct
9 Correct 8 ms 2396 KB Output is correct
10 Correct 10 ms 2396 KB Output is correct
11 Correct 11 ms 2140 KB Output is correct
12 Correct 9 ms 1628 KB Output is correct
13 Correct 12 ms 2152 KB Output is correct
14 Correct 9 ms 1452 KB Output is correct
15 Correct 6 ms 1112 KB Output is correct
16 Correct 8 ms 1624 KB Output is correct
17 Correct 8 ms 1880 KB Output is correct
18 Correct 7 ms 1372 KB Output is correct
19 Correct 9 ms 1884 KB Output is correct
20 Correct 747 ms 5212 KB Output is correct
21 Correct 747 ms 5256 KB Output is correct
22 Correct 747 ms 5244 KB Output is correct
23 Correct 907 ms 5752 KB Output is correct
24 Correct 1698 ms 157712 KB Output is correct
25 Correct 1794 ms 164416 KB Output is correct
26 Correct 1823 ms 164316 KB Output is correct
27 Correct 1416 ms 219488 KB Output is correct
28 Correct 1410 ms 219612 KB Output is correct
29 Correct 1428 ms 219628 KB Output is correct
30 Correct 1523 ms 218752 KB Output is correct
31 Execution timed out 2073 ms 196972 KB Time limit exceeded
32 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 872 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 8 ms 2392 KB Output is correct
9 Correct 8 ms 2396 KB Output is correct
10 Correct 10 ms 2396 KB Output is correct
11 Correct 11 ms 2140 KB Output is correct
12 Correct 9 ms 1628 KB Output is correct
13 Correct 12 ms 2152 KB Output is correct
14 Correct 9 ms 1452 KB Output is correct
15 Correct 6 ms 1112 KB Output is correct
16 Correct 8 ms 1624 KB Output is correct
17 Correct 8 ms 1880 KB Output is correct
18 Correct 7 ms 1372 KB Output is correct
19 Correct 9 ms 1884 KB Output is correct
20 Correct 747 ms 5212 KB Output is correct
21 Correct 747 ms 5256 KB Output is correct
22 Correct 747 ms 5244 KB Output is correct
23 Correct 907 ms 5752 KB Output is correct
24 Correct 1698 ms 157712 KB Output is correct
25 Correct 1794 ms 164416 KB Output is correct
26 Correct 1823 ms 164316 KB Output is correct
27 Correct 1416 ms 219488 KB Output is correct
28 Correct 1410 ms 219612 KB Output is correct
29 Correct 1428 ms 219628 KB Output is correct
30 Correct 1523 ms 218752 KB Output is correct
31 Execution timed out 2073 ms 196972 KB Time limit exceeded
32 Halted 0 ms 0 KB -