oj.uz

Submission #963290

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

using namespace std;
using ll = long long;

const int w = 330;

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());
    }

    for(int i = 0; i < q; i++){
        vector<bool> c(n);
        int u, y;
        cin >> u >> y;
        u--;
        for(int j = 0; j < y; j++){
            int 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(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 0 ms 596 KB Output is correct
2 Correct 0 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 6 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 25 ms 2652 KB Output is correct
9 Correct 27 ms 2612 KB Output is correct
10 Correct 25 ms 2648 KB Output is correct
11 Correct 32 ms 2228 KB Output is correct
12 Correct 16 ms 1372 KB Output is correct
13 Correct 31 ms 2240 KB Output is correct
14 Correct 23 ms 1796 KB Output is correct
15 Correct 15 ms 1116 KB Output is correct
16 Correct 28 ms 1716 KB Output is correct
17 Correct 25 ms 2028 KB Output is correct
18 Correct 17 ms 1116 KB Output is correct
19 Correct 25 ms 1920 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 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 6 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 25 ms 2652 KB Output is correct
9 Correct 27 ms 2612 KB Output is correct
10 Correct 25 ms 2648 KB Output is correct
11 Correct 32 ms 2228 KB Output is correct
12 Correct 16 ms 1372 KB Output is correct
13 Correct 31 ms 2240 KB Output is correct
14 Correct 23 ms 1796 KB Output is correct
15 Correct 15 ms 1116 KB Output is correct
16 Correct 28 ms 1716 KB Output is correct
17 Correct 25 ms 2028 KB Output is correct
18 Correct 17 ms 1116 KB Output is correct
19 Correct 25 ms 1920 KB Output is correct
20 Correct 969 ms 3820 KB Output is correct
21 Correct 942 ms 3736 KB Output is correct
22 Correct 1010 ms 3824 KB Output is correct
23 Correct 1238 ms 3760 KB Output is correct
24 Execution timed out 2017 ms 84524 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 596 KB Output is correct
2 Correct 0 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 6 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 25 ms 2652 KB Output is correct
9 Correct 27 ms 2612 KB Output is correct
10 Correct 25 ms 2648 KB Output is correct
11 Correct 32 ms 2228 KB Output is correct
12 Correct 16 ms 1372 KB Output is correct
13 Correct 31 ms 2240 KB Output is correct
14 Correct 23 ms 1796 KB Output is correct
15 Correct 15 ms 1116 KB Output is correct
16 Correct 28 ms 1716 KB Output is correct
17 Correct 25 ms 2028 KB Output is correct
18 Correct 17 ms 1116 KB Output is correct
19 Correct 25 ms 1920 KB Output is correct
20 Correct 969 ms 3820 KB Output is correct
21 Correct 942 ms 3736 KB Output is correct
22 Correct 1010 ms 3824 KB Output is correct
23 Correct 1238 ms 3760 KB Output is correct
24 Execution timed out 2017 ms 84524 KB Time limit exceeded
25 Halted 0 ms 0 KB -