oj.uz

Submission #963333

# Submission time Handle Problem Language Result Execution time Memory
963333 2024-04-14T20:58:22 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 130124 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> val(n), vis(n), cur;
        for(auto &v : gR[u]){
            for(auto &[value, ind] : dp[v]){
                if(vis[ind] == u) val[ind] = max(val[ind], value + 1);
                else vis[ind] = u, val[ind] = value + 1, cur.push_back(ind);
            }
        }
		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 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 3 ms 860 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1296 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 4 ms 1368 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1008 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 4 ms 1116 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 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 3 ms 860 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1296 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 4 ms 1368 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1008 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 4 ms 1116 KB Output is correct
20 Correct 50 ms 2516 KB Output is correct
21 Correct 51 ms 2524 KB Output is correct
22 Correct 50 ms 2408 KB Output is correct
23 Correct 51 ms 2640 KB Output is correct
24 Correct 1749 ms 112980 KB Output is correct
25 Correct 1742 ms 110860 KB Output is correct
26 Correct 1752 ms 110612 KB Output is correct
27 Correct 1492 ms 112344 KB Output is correct
28 Correct 1541 ms 112320 KB Output is correct
29 Correct 1552 ms 112376 KB Output is correct
30 Correct 1525 ms 112516 KB Output is correct
31 Correct 1673 ms 130124 KB Output is correct
32 Correct 1581 ms 112188 KB Output is correct
33 Correct 1499 ms 76300 KB Output is correct
34 Correct 1692 ms 104836 KB Output is correct
35 Correct 1460 ms 75968 KB Output is correct
36 Correct 1485 ms 93036 KB Output is correct
37 Correct 1722 ms 114752 KB Output is correct
38 Correct 1563 ms 93448 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 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 3 ms 860 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1296 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 4 ms 1368 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1008 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 4 ms 1116 KB Output is correct
20 Correct 50 ms 2516 KB Output is correct
21 Correct 51 ms 2524 KB Output is correct
22 Correct 50 ms 2408 KB Output is correct
23 Correct 51 ms 2640 KB Output is correct
24 Correct 1749 ms 112980 KB Output is correct
25 Correct 1742 ms 110860 KB Output is correct
26 Correct 1752 ms 110612 KB Output is correct
27 Correct 1492 ms 112344 KB Output is correct
28 Correct 1541 ms 112320 KB Output is correct
29 Correct 1552 ms 112376 KB Output is correct
30 Correct 1525 ms 112516 KB Output is correct
31 Correct 1673 ms 130124 KB Output is correct
32 Correct 1581 ms 112188 KB Output is correct
33 Correct 1499 ms 76300 KB Output is correct
34 Correct 1692 ms 104836 KB Output is correct
35 Correct 1460 ms 75968 KB Output is correct
36 Correct 1485 ms 93036 KB Output is correct
37 Correct 1722 ms 114752 KB Output is correct
38 Correct 1563 ms 93448 KB Output is correct
39 Correct 1934 ms 116836 KB Output is correct
40 Correct 1773 ms 112840 KB Output is correct
41 Execution timed out 2050 ms 113684 KB Time limit exceeded
42 Halted 0 ms 0 KB -