oj.uz

Submission #963338

# Submission time Handle Problem Language Result Execution time Memory
963338 2024-04-14T21:06:48 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 130416 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;
        gR[v - 1].push_back(u - 1);
    }
    
    vector<vector<pair<int, int>>> dp(n);

    for(int u = 0; u < n; u++){
        vector<int> vis(n), val(n), cur;
        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]){
                if(!vis[ind])
                    cur.push_back(ind), vis[ind] = 1;
            }
        }
		for(auto v : cur) dp[u].push_back({val[v],v});
		dp[u].push_back({0,u}); 
        sort(dp[u].rbegin(), dp[u].rend());
		if(dp[u].size()>w) dp[u].erase(dp[u].begin() + w, dp[u].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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 1368 KB Output is correct
9 Correct 3 ms 1496 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 3 ms 1408 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 3 ms 1176 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1260 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 1368 KB Output is correct
9 Correct 3 ms 1496 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 3 ms 1408 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 3 ms 1176 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1260 KB Output is correct
20 Correct 57 ms 3844 KB Output is correct
21 Correct 57 ms 3488 KB Output is correct
22 Correct 58 ms 3424 KB Output is correct
23 Correct 58 ms 3524 KB Output is correct
24 Correct 1767 ms 114684 KB Output is correct
25 Correct 1761 ms 111216 KB Output is correct
26 Correct 1721 ms 110784 KB Output is correct
27 Correct 1550 ms 112648 KB Output is correct
28 Correct 1596 ms 112568 KB Output is correct
29 Correct 1572 ms 112616 KB Output is correct
30 Correct 1551 ms 112616 KB Output is correct
31 Correct 1631 ms 130416 KB Output is correct
32 Correct 1568 ms 112376 KB Output is correct
33 Correct 1491 ms 76628 KB Output is correct
34 Correct 1702 ms 104968 KB Output is correct
35 Correct 1471 ms 76352 KB Output is correct
36 Correct 1564 ms 93340 KB Output is correct
37 Correct 1725 ms 115100 KB Output is correct
38 Correct 1487 ms 93376 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 1368 KB Output is correct
9 Correct 3 ms 1496 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 3 ms 1408 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 3 ms 1176 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1260 KB Output is correct
20 Correct 57 ms 3844 KB Output is correct
21 Correct 57 ms 3488 KB Output is correct
22 Correct 58 ms 3424 KB Output is correct
23 Correct 58 ms 3524 KB Output is correct
24 Correct 1767 ms 114684 KB Output is correct
25 Correct 1761 ms 111216 KB Output is correct
26 Correct 1721 ms 110784 KB Output is correct
27 Correct 1550 ms 112648 KB Output is correct
28 Correct 1596 ms 112568 KB Output is correct
29 Correct 1572 ms 112616 KB Output is correct
30 Correct 1551 ms 112616 KB Output is correct
31 Correct 1631 ms 130416 KB Output is correct
32 Correct 1568 ms 112376 KB Output is correct
33 Correct 1491 ms 76628 KB Output is correct
34 Correct 1702 ms 104968 KB Output is correct
35 Correct 1471 ms 76352 KB Output is correct
36 Correct 1564 ms 93340 KB Output is correct
37 Correct 1725 ms 115100 KB Output is correct
38 Correct 1487 ms 93376 KB Output is correct
39 Correct 1957 ms 117088 KB Output is correct
40 Correct 1843 ms 112564 KB Output is correct
41 Execution timed out 2008 ms 113664 KB Time limit exceeded
42 Halted 0 ms 0 KB -