oj.uz

Submission #963286

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

using namespace std;
using ll = long long;

const int w = 200;

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<vector<array<int, 2>>> dp(n);

    vector<int> val(n, -1);
    set<array<int, 2>> aux;

    for(int u = 0; u < n; u++){
        val.assign(n, -1);
        aux.clear();
        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<array<int, 2>>(aux.begin(), aux.end());
    }

    vector<bool> c(n);
    vector<int> naive(n);
    for(int i = 0; i < q; i++){
        c.assign(n, 0);
        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 {
            naive.assign(n, 0);
            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 1 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 860 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 21 ms 1844 KB Output is correct
9 Correct 26 ms 1960 KB Output is correct
10 Correct 23 ms 1860 KB Output is correct
11 Correct 19 ms 1816 KB Output is correct
12 Correct 13 ms 1112 KB Output is correct
13 Correct 26 ms 1628 KB Output is correct
14 Correct 15 ms 1116 KB Output is correct
15 Correct 11 ms 980 KB Output is correct
16 Correct 18 ms 1148 KB Output is correct
17 Correct 20 ms 1372 KB Output is correct
18 Correct 13 ms 1112 KB Output is correct
19 Correct 17 ms 1368 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 0 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 6 ms 604 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 21 ms 1844 KB Output is correct
9 Correct 26 ms 1960 KB Output is correct
10 Correct 23 ms 1860 KB Output is correct
11 Correct 19 ms 1816 KB Output is correct
12 Correct 13 ms 1112 KB Output is correct
13 Correct 26 ms 1628 KB Output is correct
14 Correct 15 ms 1116 KB Output is correct
15 Correct 11 ms 980 KB Output is correct
16 Correct 18 ms 1148 KB Output is correct
17 Correct 20 ms 1372 KB Output is correct
18 Correct 13 ms 1112 KB Output is correct
19 Correct 17 ms 1368 KB Output is correct
20 Correct 1088 ms 3052 KB Output is correct
21 Correct 1096 ms 2860 KB Output is correct
22 Correct 1095 ms 3040 KB Output is correct
23 Correct 1284 ms 3060 KB Output is correct
24 Execution timed out 2016 ms 44868 KB Time limit exceeded
25 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 0 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 6 ms 604 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 21 ms 1844 KB Output is correct
9 Correct 26 ms 1960 KB Output is correct
10 Correct 23 ms 1860 KB Output is correct
11 Correct 19 ms 1816 KB Output is correct
12 Correct 13 ms 1112 KB Output is correct
13 Correct 26 ms 1628 KB Output is correct
14 Correct 15 ms 1116 KB Output is correct
15 Correct 11 ms 980 KB Output is correct
16 Correct 18 ms 1148 KB Output is correct
17 Correct 20 ms 1372 KB Output is correct
18 Correct 13 ms 1112 KB Output is correct
19 Correct 17 ms 1368 KB Output is correct
20 Correct 1088 ms 3052 KB Output is correct
21 Correct 1096 ms 2860 KB Output is correct
22 Correct 1095 ms 3040 KB Output is correct
23 Correct 1284 ms 3060 KB Output is correct
24 Execution timed out 2016 ms 44868 KB Time limit exceeded
25 Halted 0 ms 0 KB -