oj.uz

Submission #963277

# Submission time Handle Problem Language Result Execution time Memory
963277 2024-04-14T20:00:10 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 113800 KB 
//start-time: 2024-04-14 19:39:32
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int w = 100;

void solve(){
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<int>> gR(n);
    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        u--; 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 3 ms 856 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 6 ms 1524 KB Output is correct
11 Correct 7 ms 1272 KB Output is correct
12 Correct 6 ms 1284 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 6 ms 1112 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 6 ms 1112 KB Output is correct
17 Correct 6 ms 1116 KB Output is correct
18 Correct 5 ms 1116 KB Output is correct
19 Correct 6 ms 1236 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 3 ms 856 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 6 ms 1524 KB Output is correct
11 Correct 7 ms 1272 KB Output is correct
12 Correct 6 ms 1284 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 6 ms 1112 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 6 ms 1112 KB Output is correct
17 Correct 6 ms 1116 KB Output is correct
18 Correct 5 ms 1116 KB Output is correct
19 Correct 6 ms 1236 KB Output is correct
20 Correct 573 ms 4332 KB Output is correct
21 Correct 517 ms 4388 KB Output is correct
22 Correct 535 ms 4620 KB Output is correct
23 Correct 614 ms 5048 KB Output is correct
24 Correct 1384 ms 89288 KB Output is correct
25 Correct 1323 ms 90500 KB Output is correct
26 Correct 1349 ms 90308 KB Output is correct
27 Correct 1082 ms 113800 KB Output is correct
28 Correct 1078 ms 111096 KB Output is correct
29 Correct 1118 ms 111016 KB Output is correct
30 Correct 1100 ms 111180 KB Output is correct
31 Correct 1595 ms 109396 KB Output is correct
32 Correct 1065 ms 113768 KB Output is correct
33 Correct 1044 ms 75524 KB Output is correct
34 Correct 1169 ms 68564 KB Output is correct
35 Correct 1037 ms 75544 KB Output is correct
36 Correct 1144 ms 94568 KB Output is correct
37 Correct 1418 ms 89788 KB Output is correct
38 Correct 1148 ms 94820 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 3 ms 856 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 6 ms 1524 KB Output is correct
11 Correct 7 ms 1272 KB Output is correct
12 Correct 6 ms 1284 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 6 ms 1112 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 6 ms 1112 KB Output is correct
17 Correct 6 ms 1116 KB Output is correct
18 Correct 5 ms 1116 KB Output is correct
19 Correct 6 ms 1236 KB Output is correct
20 Correct 573 ms 4332 KB Output is correct
21 Correct 517 ms 4388 KB Output is correct
22 Correct 535 ms 4620 KB Output is correct
23 Correct 614 ms 5048 KB Output is correct
24 Correct 1384 ms 89288 KB Output is correct
25 Correct 1323 ms 90500 KB Output is correct
26 Correct 1349 ms 90308 KB Output is correct
27 Correct 1082 ms 113800 KB Output is correct
28 Correct 1078 ms 111096 KB Output is correct
29 Correct 1118 ms 111016 KB Output is correct
30 Correct 1100 ms 111180 KB Output is correct
31 Correct 1595 ms 109396 KB Output is correct
32 Correct 1065 ms 113768 KB Output is correct
33 Correct 1044 ms 75524 KB Output is correct
34 Correct 1169 ms 68564 KB Output is correct
35 Correct 1037 ms 75544 KB Output is correct
36 Correct 1144 ms 94568 KB Output is correct
37 Correct 1418 ms 89788 KB Output is correct
38 Correct 1148 ms 94820 KB Output is correct
39 Correct 1619 ms 90292 KB Output is correct
40 Correct 1458 ms 89928 KB Output is correct
41 Execution timed out 2020 ms 90608 KB Time limit exceeded
42 Halted 0 ms 0 KB -