oj.uz

Submission #963299

# Submission time Handle Problem Language Result Execution time Memory
963299 2024-04-14T20:31:32 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 90728 KB 
//start-time: 2024-04-14 19:39:32
#include <vector>
#include <set>
#include <iostream>
#include <cassert>
#include <algorithm>

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;
        gR[v - 1].push_back(u - 1);
    }
    
    vector<vector<pair<int, int>>> dp(n);

    for(int u = 0; u < n; u++){
        vector<int> val(n, -1);
        set<pair<int, int>> aux;
        aux.insert({0, u});
        val[u] = 0;

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

        for(auto &v : gR[u]){
            for(auto &[value, ind] : dp[v]){
                aux.insert({val[ind], ind});
                if(aux.size() > w){
                    aux.erase(aux.begin());
                }
            }
        }

        dp[u] = vector<pair<int, int>>(aux.begin(), aux.end());
    }

    while(q--){
        vector<bool> c(n);
        int u, y, ans = -1;
        cin >> u >> y;
        u--;
        for(int j = 0; j < y; j++){
            int a; cin >> a;
            c[--a] = 1;
        }

        if(y < w) {
            for(auto &[v, i] : dp[u]){
                if(!c[i]){
                    ans = max(ans, v);
                }
            }
        }
        else {
            vector<int> naive(n);
            for(int v = 0; v <= u; v++){
                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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 7 ms 804 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 12 ms 1116 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 8 ms 1236 KB Output is correct
11 Correct 10 ms 1116 KB Output is correct
12 Correct 10 ms 860 KB Output is correct
13 Correct 10 ms 1120 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 7 ms 864 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 10 ms 1116 KB Output is correct
18 Correct 9 ms 860 KB Output is correct
19 Correct 10 ms 1112 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 604 KB Output is correct
5 Correct 7 ms 804 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 12 ms 1116 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 8 ms 1236 KB Output is correct
11 Correct 10 ms 1116 KB Output is correct
12 Correct 10 ms 860 KB Output is correct
13 Correct 10 ms 1120 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 7 ms 864 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 10 ms 1116 KB Output is correct
18 Correct 9 ms 860 KB Output is correct
19 Correct 10 ms 1112 KB Output is correct
20 Correct 355 ms 3404 KB Output is correct
21 Correct 353 ms 3704 KB Output is correct
22 Correct 348 ms 3548 KB Output is correct
23 Correct 410 ms 3656 KB Output is correct
24 Correct 1930 ms 71036 KB Output is correct
25 Correct 1887 ms 72188 KB Output is correct
26 Correct 1869 ms 72000 KB Output is correct
27 Correct 1458 ms 90652 KB Output is correct
28 Correct 1435 ms 90552 KB Output is correct
29 Correct 1452 ms 90688 KB Output is correct
30 Correct 1659 ms 90728 KB Output is correct
31 Correct 1825 ms 89144 KB Output is correct
32 Correct 1638 ms 90508 KB Output is correct
33 Correct 1255 ms 61048 KB Output is correct
34 Correct 1371 ms 55064 KB Output is correct
35 Correct 1274 ms 60748 KB Output is correct
36 Correct 1430 ms 75704 KB Output is correct
37 Correct 1846 ms 72096 KB Output is correct
38 Correct 1446 ms 75904 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 604 KB Output is correct
5 Correct 7 ms 804 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 12 ms 1116 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 8 ms 1236 KB Output is correct
11 Correct 10 ms 1116 KB Output is correct
12 Correct 10 ms 860 KB Output is correct
13 Correct 10 ms 1120 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 7 ms 864 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 10 ms 1116 KB Output is correct
18 Correct 9 ms 860 KB Output is correct
19 Correct 10 ms 1112 KB Output is correct
20 Correct 355 ms 3404 KB Output is correct
21 Correct 353 ms 3704 KB Output is correct
22 Correct 348 ms 3548 KB Output is correct
23 Correct 410 ms 3656 KB Output is correct
24 Correct 1930 ms 71036 KB Output is correct
25 Correct 1887 ms 72188 KB Output is correct
26 Correct 1869 ms 72000 KB Output is correct
27 Correct 1458 ms 90652 KB Output is correct
28 Correct 1435 ms 90552 KB Output is correct
29 Correct 1452 ms 90688 KB Output is correct
30 Correct 1659 ms 90728 KB Output is correct
31 Correct 1825 ms 89144 KB Output is correct
32 Correct 1638 ms 90508 KB Output is correct
33 Correct 1255 ms 61048 KB Output is correct
34 Correct 1371 ms 55064 KB Output is correct
35 Correct 1274 ms 60748 KB Output is correct
36 Correct 1430 ms 75704 KB Output is correct
37 Correct 1846 ms 72096 KB Output is correct
38 Correct 1446 ms 75904 KB Output is correct
39 Execution timed out 2037 ms 70912 KB Time limit exceeded
40 Halted 0 ms 0 KB -