oj.uz

Submission #158187

# Submission time Handle Problem Language Result Execution time Memory
158187 2019-10-15T09:38:27 Z fedoseevtimofey Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1863 ms 425560 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 1e5 + 7;
const int Inf = 1e9;

vector <int> g[N];
vector <int> rg[N];
bool used[N];
int dp[N];
int ban[N];
bool have[N];

vector <pair <int, int>> best[N];

vector <int> ts;

void dfs(int u) {
    used[u] = 1;
    for (int v : g[u]) {
        if (!used[v]) {
            dfs(v);
        }
    }
    ts.push_back(u);
}

const int K = 300;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        g[u].push_back(v);
        rg[v].push_back(u);
    }
    for (int i = 0; i < n; ++i) {
        if (!used[i]) {
            dfs(i);
        }
    }

    for (int i = (int)ts.size() - 1; i >= 0; --i) { 
        int u = ts[i];
        int sz = rg[u].size();
        vector <int> uk(sz);
        while (true) {
            pair <int, int> mx = {0, u};
            int id = -1;
            for (int i = 0; i < sz; ++i) {
                while (uk[i] < (int)best[rg[u][i]].size() && have[best[rg[u][i]][uk[i]].second]) {
                    ++uk[i];
                }   
                if (uk[i] < (int)best[rg[u][i]].size()) {
                    auto cp = best[rg[u][i]][uk[i]];
                    ++cp.first;
                    if (cp > mx) {
                        mx = cp;
                        id = i;
                    }
                }
            }
            if (id == -1) {
                best[u].push_back(mx);
                break;
            } else {
                best[u].push_back(mx);
                ++uk[id];
                have[mx.second] = 1;
                if ((int)best[u].size() == K) break;
            }
        }
        for (int v : rg[u]) {
            for (auto p : best[v]) {
                have[p.second] = 0;
            }
        }
    }

    while (q--) {
        int t;
        cin >> t;
        --t;   
        int y;
        cin >> y;
        vector <int> who;
        for (int i = 0; i < y; ++i) {
            int x;
            cin >> x;
            --x;
            who.push_back(x);
            ban[x] = 1;
        }
        if (y >= K) {
            fill(dp, dp + n, -Inf);
            dp[t] = 0;
            for (int x : ts) {
                for (int v : g[x]) {
                    dp[x] = max(dp[x], dp[v] + 1);
                }
            }
            int ans = -1;
            for (int i = 0; i < n; ++i) if (!ban[i]) ans = max(ans, dp[i]);
            cout << ans << '\n';
        } else {
            int ans = -1;
            for (auto p : best[t]) {
                if (!ban[p.second]) {
                    ans = max(ans, p.first);
                }
            }
            cout << ans << '\n';
        }
        for (int x : who) ban[x] = 0;
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 11 ms 7928 KB Output is correct
6 Correct 11 ms 7928 KB Output is correct
7 Correct 11 ms 7800 KB Output is correct
8 Correct 20 ms 10872 KB Output is correct
9 Correct 20 ms 10872 KB Output is correct
10 Correct 20 ms 10872 KB Output is correct
11 Correct 17 ms 10488 KB Output is correct
12 Correct 13 ms 8696 KB Output is correct
13 Correct 17 ms 10232 KB Output is correct
14 Correct 16 ms 9468 KB Output is correct
15 Correct 13 ms 8440 KB Output is correct
16 Correct 16 ms 9324 KB Output is correct
17 Correct 16 ms 9720 KB Output is correct
18 Correct 14 ms 8696 KB Output is correct
19 Correct 17 ms 9720 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 11 ms 7928 KB Output is correct
6 Correct 11 ms 7928 KB Output is correct
7 Correct 11 ms 7800 KB Output is correct
8 Correct 20 ms 10872 KB Output is correct
9 Correct 20 ms 10872 KB Output is correct
10 Correct 20 ms 10872 KB Output is correct
11 Correct 17 ms 10488 KB Output is correct
12 Correct 13 ms 8696 KB Output is correct
13 Correct 17 ms 10232 KB Output is correct
14 Correct 16 ms 9468 KB Output is correct
15 Correct 13 ms 8440 KB Output is correct
16 Correct 16 ms 9324 KB Output is correct
17 Correct 16 ms 9720 KB Output is correct
18 Correct 14 ms 8696 KB Output is correct
19 Correct 17 ms 9720 KB Output is correct
20 Correct 597 ms 13224 KB Output is correct
21 Correct 576 ms 13188 KB Output is correct
22 Correct 602 ms 13364 KB Output is correct
23 Correct 680 ms 13116 KB Output is correct
24 Correct 1068 ms 256276 KB Output is correct
25 Correct 1140 ms 267712 KB Output is correct
26 Correct 1155 ms 267016 KB Output is correct
27 Correct 1337 ms 422860 KB Output is correct
28 Correct 1334 ms 423048 KB Output is correct
29 Correct 1333 ms 422952 KB Output is correct
30 Correct 1321 ms 417380 KB Output is correct
31 Correct 1376 ms 402828 KB Output is correct
32 Correct 1376 ms 417220 KB Output is correct
33 Correct 946 ms 260980 KB Output is correct
34 Correct 825 ms 214040 KB Output is correct
35 Correct 980 ms 259108 KB Output is correct
36 Correct 1206 ms 339944 KB Output is correct
37 Correct 1156 ms 307480 KB Output is correct
38 Correct 1165 ms 340796 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 11 ms 7928 KB Output is correct
6 Correct 11 ms 7928 KB Output is correct
7 Correct 11 ms 7800 KB Output is correct
8 Correct 20 ms 10872 KB Output is correct
9 Correct 20 ms 10872 KB Output is correct
10 Correct 20 ms 10872 KB Output is correct
11 Correct 17 ms 10488 KB Output is correct
12 Correct 13 ms 8696 KB Output is correct
13 Correct 17 ms 10232 KB Output is correct
14 Correct 16 ms 9468 KB Output is correct
15 Correct 13 ms 8440 KB Output is correct
16 Correct 16 ms 9324 KB Output is correct
17 Correct 16 ms 9720 KB Output is correct
18 Correct 14 ms 8696 KB Output is correct
19 Correct 17 ms 9720 KB Output is correct
20 Correct 597 ms 13224 KB Output is correct
21 Correct 576 ms 13188 KB Output is correct
22 Correct 602 ms 13364 KB Output is correct
23 Correct 680 ms 13116 KB Output is correct
24 Correct 1068 ms 256276 KB Output is correct
25 Correct 1140 ms 267712 KB Output is correct
26 Correct 1155 ms 267016 KB Output is correct
27 Correct 1337 ms 422860 KB Output is correct
28 Correct 1334 ms 423048 KB Output is correct
29 Correct 1333 ms 422952 KB Output is correct
30 Correct 1321 ms 417380 KB Output is correct
31 Correct 1376 ms 402828 KB Output is correct
32 Correct 1376 ms 417220 KB Output is correct
33 Correct 946 ms 260980 KB Output is correct
34 Correct 825 ms 214040 KB Output is correct
35 Correct 980 ms 259108 KB Output is correct
36 Correct 1206 ms 339944 KB Output is correct
37 Correct 1156 ms 307480 KB Output is correct
38 Correct 1165 ms 340796 KB Output is correct
39 Correct 1293 ms 261180 KB Output is correct
40 Correct 1152 ms 263472 KB Output is correct
41 Correct 1102 ms 266560 KB Output is correct
42 Correct 1419 ms 265196 KB Output is correct
43 Correct 1124 ms 264352 KB Output is correct
44 Correct 669 ms 15924 KB Output is correct
45 Correct 616 ms 15224 KB Output is correct
46 Correct 627 ms 14912 KB Output is correct
47 Correct 636 ms 14852 KB Output is correct
48 Correct 601 ms 14596 KB Output is correct
49 Correct 1441 ms 424676 KB Output is correct
50 Correct 1358 ms 423768 KB Output is correct
51 Correct 653 ms 15692 KB Output is correct
52 Correct 599 ms 14952 KB Output is correct
53 Correct 1292 ms 340184 KB Output is correct
54 Correct 1335 ms 309284 KB Output is correct
55 Correct 1135 ms 339748 KB Output is correct
56 Correct 1164 ms 309264 KB Output is correct
57 Correct 670 ms 15908 KB Output is correct
58 Correct 680 ms 15920 KB Output is correct
59 Correct 598 ms 14932 KB Output is correct
60 Correct 606 ms 14840 KB Output is correct
61 Correct 1586 ms 424032 KB Output is correct
62 Correct 1365 ms 341128 KB Output is correct
63 Correct 1420 ms 308004 KB Output is correct
64 Correct 1807 ms 424016 KB Output is correct
65 Correct 1784 ms 339828 KB Output is correct
66 Correct 1863 ms 309788 KB Output is correct
67 Correct 1323 ms 423628 KB Output is correct
68 Correct 1143 ms 340796 KB Output is correct
69 Correct 1108 ms 305456 KB Output is correct
70 Correct 1348 ms 424220 KB Output is correct
71 Correct 1167 ms 341492 KB Output is correct
72 Correct 1176 ms 309452 KB Output is correct
73 Correct 1366 ms 424092 KB Output is correct
74 Correct 1203 ms 341296 KB Output is correct
75 Correct 1228 ms 309240 KB Output is correct
76 Correct 1451 ms 425560 KB Output is correct
77 Correct 1317 ms 424224 KB Output is correct
78 Correct 1376 ms 424764 KB Output is correct
79 Correct 663 ms 16092 KB Output is correct
80 Correct 596 ms 15036 KB Output is correct
81 Correct 581 ms 14656 KB Output is correct
82 Correct 1423 ms 419640 KB Output is correct
83 Correct 1598 ms 405136 KB Output is correct
84 Correct 1356 ms 418208 KB Output is correct
85 Correct 1399 ms 403576 KB Output is correct
86 Correct 1335 ms 418840 KB Output is correct
87 Correct 1399 ms 404976 KB Output is correct
88 Correct 660 ms 15964 KB Output is correct
89 Correct 670 ms 16012 KB Output is correct
90 Correct 603 ms 14912 KB Output is correct
91 Correct 607 ms 14992 KB Output is correct
92 Correct 591 ms 14628 KB Output is correct
93 Correct 602 ms 14648 KB Output is correct
94 Correct 1074 ms 263376 KB Output is correct
95 Correct 930 ms 215388 KB Output is correct
96 Correct 981 ms 260848 KB Output is correct
97 Correct 844 ms 218064 KB Output is correct
98 Correct 973 ms 262388 KB Output is correct
99 Correct 835 ms 217964 KB Output is correct
100 Correct 737 ms 15980 KB Output is correct
101 Correct 753 ms 16064 KB Output is correct
102 Correct 692 ms 15032 KB Output is correct
103 Correct 703 ms 15264 KB Output is correct
104 Correct 671 ms 14760 KB Output is correct
105 Correct 685 ms 14832 KB Output is correct
106 Correct 1290 ms 341160 KB Output is correct
107 Correct 1260 ms 310268 KB Output is correct
108 Correct 1245 ms 342196 KB Output is correct
109 Correct 1138 ms 308800 KB Output is correct
110 Correct 1237 ms 342952 KB Output is correct
111 Correct 1257 ms 310296 KB Output is correct
112 Correct 683 ms 15996 KB Output is correct
113 Correct 668 ms 15868 KB Output is correct
114 Correct 614 ms 15032 KB Output is correct
115 Correct 612 ms 14900 KB Output is correct
116 Correct 595 ms 14568 KB Output is correct
117 Correct 609 ms 14632 KB Output is correct
118 Correct 1360 ms 423448 KB Output is correct
119 Correct 1165 ms 341412 KB Output is correct
120 Correct 1197 ms 308056 KB Output is correct
121 Correct 1410 ms 423620 KB Output is correct
122 Correct 1182 ms 340160 KB Output is correct
123 Correct 1131 ms 308176 KB Output is correct
124 Correct 1317 ms 423524 KB Output is correct
125 Correct 1185 ms 341780 KB Output is correct
126 Correct 1153 ms 307160 KB Output is correct