oj.uz

Submission #963339

# Submission time Handle Problem Language Result Execution time Memory
963339 2024-04-14T21:08:07 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 130500 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);
                if(!vis[ind]){
                    vis[ind] = 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 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1492 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 3 ms 1372 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 1112 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 4 ms 1112 KB Output is correct
19 Correct 4 ms 1252 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 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1492 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 3 ms 1372 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 1112 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 4 ms 1112 KB Output is correct
19 Correct 4 ms 1252 KB Output is correct
20 Correct 67 ms 3668 KB Output is correct
21 Correct 56 ms 3736 KB Output is correct
22 Correct 63 ms 3664 KB Output is correct
23 Correct 57 ms 3776 KB Output is correct
24 Correct 1786 ms 114708 KB Output is correct
25 Correct 1727 ms 111092 KB Output is correct
26 Correct 1727 ms 110940 KB Output is correct
27 Correct 1634 ms 112444 KB Output is correct
28 Correct 1525 ms 112440 KB Output is correct
29 Correct 1564 ms 112640 KB Output is correct
30 Correct 1614 ms 112384 KB Output is correct
31 Correct 1723 ms 130500 KB Output is correct
32 Correct 1575 ms 112424 KB Output is correct
33 Correct 1509 ms 76468 KB Output is correct
34 Correct 1728 ms 104968 KB Output is correct
35 Correct 1520 ms 76328 KB Output is correct
36 Correct 1543 ms 93332 KB Output is correct
37 Correct 1671 ms 115264 KB Output is correct
38 Correct 1558 ms 93364 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 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1492 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 3 ms 1372 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 1112 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 4 ms 1112 KB Output is correct
19 Correct 4 ms 1252 KB Output is correct
20 Correct 67 ms 3668 KB Output is correct
21 Correct 56 ms 3736 KB Output is correct
22 Correct 63 ms 3664 KB Output is correct
23 Correct 57 ms 3776 KB Output is correct
24 Correct 1786 ms 114708 KB Output is correct
25 Correct 1727 ms 111092 KB Output is correct
26 Correct 1727 ms 110940 KB Output is correct
27 Correct 1634 ms 112444 KB Output is correct
28 Correct 1525 ms 112440 KB Output is correct
29 Correct 1564 ms 112640 KB Output is correct
30 Correct 1614 ms 112384 KB Output is correct
31 Correct 1723 ms 130500 KB Output is correct
32 Correct 1575 ms 112424 KB Output is correct
33 Correct 1509 ms 76468 KB Output is correct
34 Correct 1728 ms 104968 KB Output is correct
35 Correct 1520 ms 76328 KB Output is correct
36 Correct 1543 ms 93332 KB Output is correct
37 Correct 1671 ms 115264 KB Output is correct
38 Correct 1558 ms 93364 KB Output is correct
39 Correct 1969 ms 116888 KB Output is correct
40 Correct 1800 ms 112696 KB Output is correct
41 Correct 1998 ms 113684 KB Output is correct
42 Correct 1801 ms 113660 KB Output is correct
43 Correct 1789 ms 115576 KB Output is correct
44 Correct 202 ms 5456 KB Output is correct
45 Correct 74 ms 4580 KB Output is correct
46 Correct 114 ms 4424 KB Output is correct
47 Correct 73 ms 4268 KB Output is correct
48 Correct 57 ms 4108 KB Output is correct
49 Correct 1756 ms 114396 KB Output is correct
50 Correct 1802 ms 113480 KB Output is correct
51 Correct 210 ms 5064 KB Output is correct
52 Correct 133 ms 4244 KB Output is correct
53 Correct 1763 ms 94464 KB Output is correct
54 Correct 1898 ms 115588 KB Output is correct
55 Correct 1765 ms 94016 KB Output is correct
56 Execution timed out 2011 ms 118680 KB Time limit exceeded
57 Halted 0 ms 0 KB -