oj.uz

Submission #967331

# Submission time Handle Problem Language Result Execution time Memory
967331 2024-04-22T01:55:16 Z Pring Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 796 ms 282124 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;

namespace {
    const int MXN = 100005, K = 320, INF = 1e9;
    int n, m, q;
    vector<int> edge[MXN], edge_inv[MXN];
    int ns[MXN];
    pii dp[MXN][K + 10];
    pii pd[3][K * 2 + 10];
    bitset<MXN> b;
    int dis[MXN];

    void DP(int id) {
        pd[0][0] = mp(0, id);
        int nn = 1, nnn;
        for (auto &pre : edge_inv[id]) {
            debug(id, pre);
            copy(dp[pre], dp[pre] + ns[pre], pd[2]);
            FOR(i, 0, ns[pre]) pd[2][i].fs++;
            merge(pd[0], pd[0] + nn, pd[2], pd[2] + ns[pre], pd[1], greater<pii>());
            nnn = nn + ns[pre];
            nn = 0;
            FOR(i, 0, nnn) {
                if (b[pd[1][i].sc]) continue;
                b[pd[1][i].sc] = true;
                pd[0][nn] = pd[1][i];
                nn++;
            }
            FOR(i, 0, nn) b[pd[0][i].sc] = false;
            nn = min(nn, K + 1);
        }
        copy(pd[0], pd[0] + nn, dp[id]);
        ns[id] = nn;
    }

    void PRE() {
        FOR(i, 1, n + 1) DP(i);
        // FOR(i, 1, n + 1) {
        //     cout << ns[i] << '\n';
        //     FOR(j, 0, ns[i]) cout << '<' << dp[i][j].fs << ' ' << dp[i][j].sc << '>' << ' ';
        //     cout << '\n';
        // }
    }

    void BAO(int sr) {
        fill(dis + 1, dis + n + 1, -INF);
        dis[sr] = 0;
        for (int id = sr - 1; id; id--) {
            for (auto &i : edge[id]) dis[id] = max(dis[id], dis[i] + 1);
        }
    }

    int calc(int t, vector<int> &v) {
        auto DO = [&]() -> int {
            if (v.size() <= K) {
                FOR(i, 0, ns[t]) {
                    auto [w, x] = dp[t][i];
                    if (!b[x]) return w;
                }
                return -1;
            } else {
                BAO(t);
                int ans = -1;
                FOR(i, 1, t + 1) {
                    if (b[i]) continue;
                    ans = max(ans, dis[i]);
                }
                return ans;
            }
        };
        for (auto &i : v) b[i] = true;
        int x = DO();
        for (auto &i : v) b[i] = false;
        return x;
    }
}

vector<int> solve(int N, int M, int Q, vector<int> &S, vector<int> &E, vector<int> &T, vector<vector<int>> &Y) {
    ::n = N;
    ::m = M;
    ::q = Q;
    FOR(i, 0, M) {
        edge[S[i]].push_back(E[i]);
        edge_inv[E[i]].push_back(S[i]);
    }
    PRE();
    vector<int> ans;
    FOR(i, 0, q) {
        ans.push_back(calc(T[i], Y[i]));
    }
    return ans;
}

void miku() {
    int n, m, q;
    vector<vector<int>> y;
    cin >> n >> m >> q;
    vector<int> s(m), e(m);
    FOR(i, 0, m) cin >> s[i] >> e[i];
    vector<int> t(q);
    FOR(i, 0, q) {
        int k;
        cin >> t[i] >> k;
        y.push_back(vector<int>(k));
        for (auto &i : y.back()) cin >> i;
    }
    vector<int> ans = solve(n, m, q, s, e, t, y);
    for (auto &i : ans) cout << i << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Compilation message

bitaro.cpp: In function 'void {anonymous}::DP(int)':
bitaro.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
bitaro.cpp:35:13: note: in expansion of macro 'debug'
   35 |             debug(id, pre);
      |             ^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7620 KB Output is correct
2 Correct 3 ms 7624 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7768 KB Output is correct
5 Correct 4 ms 9564 KB Output is correct
6 Correct 4 ms 9760 KB Output is correct
7 Correct 5 ms 9564 KB Output is correct
8 Correct 6 ms 9564 KB Output is correct
9 Correct 8 ms 9776 KB Output is correct
10 Correct 6 ms 9560 KB Output is correct
11 Correct 6 ms 9564 KB Output is correct
12 Correct 5 ms 9680 KB Output is correct
13 Correct 6 ms 9564 KB Output is correct
14 Correct 6 ms 9564 KB Output is correct
15 Correct 5 ms 9652 KB Output is correct
16 Correct 6 ms 9564 KB Output is correct
17 Correct 6 ms 9784 KB Output is correct
18 Correct 4 ms 9560 KB Output is correct
19 Correct 6 ms 9560 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7620 KB Output is correct
2 Correct 3 ms 7624 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7768 KB Output is correct
5 Correct 4 ms 9564 KB Output is correct
6 Correct 4 ms 9760 KB Output is correct
7 Correct 5 ms 9564 KB Output is correct
8 Correct 6 ms 9564 KB Output is correct
9 Correct 8 ms 9776 KB Output is correct
10 Correct 6 ms 9560 KB Output is correct
11 Correct 6 ms 9564 KB Output is correct
12 Correct 5 ms 9680 KB Output is correct
13 Correct 6 ms 9564 KB Output is correct
14 Correct 6 ms 9564 KB Output is correct
15 Correct 5 ms 9652 KB Output is correct
16 Correct 6 ms 9564 KB Output is correct
17 Correct 6 ms 9784 KB Output is correct
18 Correct 4 ms 9560 KB Output is correct
19 Correct 6 ms 9560 KB Output is correct
20 Correct 539 ms 15188 KB Output is correct
21 Correct 441 ms 15320 KB Output is correct
22 Correct 554 ms 15296 KB Output is correct
23 Correct 636 ms 15188 KB Output is correct
24 Correct 585 ms 273664 KB Output is correct
25 Correct 593 ms 273644 KB Output is correct
26 Correct 597 ms 273748 KB Output is correct
27 Correct 669 ms 275124 KB Output is correct
28 Correct 643 ms 273992 KB Output is correct
29 Correct 647 ms 274144 KB Output is correct
30 Correct 586 ms 273544 KB Output is correct
31 Correct 606 ms 273484 KB Output is correct
32 Correct 579 ms 271956 KB Output is correct
33 Correct 496 ms 271884 KB Output is correct
34 Correct 421 ms 271836 KB Output is correct
35 Correct 517 ms 272056 KB Output is correct
36 Correct 562 ms 272040 KB Output is correct
37 Correct 522 ms 272100 KB Output is correct
38 Correct 580 ms 271976 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7620 KB Output is correct
2 Correct 3 ms 7624 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7768 KB Output is correct
5 Correct 4 ms 9564 KB Output is correct
6 Correct 4 ms 9760 KB Output is correct
7 Correct 5 ms 9564 KB Output is correct
8 Correct 6 ms 9564 KB Output is correct
9 Correct 8 ms 9776 KB Output is correct
10 Correct 6 ms 9560 KB Output is correct
11 Correct 6 ms 9564 KB Output is correct
12 Correct 5 ms 9680 KB Output is correct
13 Correct 6 ms 9564 KB Output is correct
14 Correct 6 ms 9564 KB Output is correct
15 Correct 5 ms 9652 KB Output is correct
16 Correct 6 ms 9564 KB Output is correct
17 Correct 6 ms 9784 KB Output is correct
18 Correct 4 ms 9560 KB Output is correct
19 Correct 6 ms 9560 KB Output is correct
20 Correct 539 ms 15188 KB Output is correct
21 Correct 441 ms 15320 KB Output is correct
22 Correct 554 ms 15296 KB Output is correct
23 Correct 636 ms 15188 KB Output is correct
24 Correct 585 ms 273664 KB Output is correct
25 Correct 593 ms 273644 KB Output is correct
26 Correct 597 ms 273748 KB Output is correct
27 Correct 669 ms 275124 KB Output is correct
28 Correct 643 ms 273992 KB Output is correct
29 Correct 647 ms 274144 KB Output is correct
30 Correct 586 ms 273544 KB Output is correct
31 Correct 606 ms 273484 KB Output is correct
32 Correct 579 ms 271956 KB Output is correct
33 Correct 496 ms 271884 KB Output is correct
34 Correct 421 ms 271836 KB Output is correct
35 Correct 517 ms 272056 KB Output is correct
36 Correct 562 ms 272040 KB Output is correct
37 Correct 522 ms 272100 KB Output is correct
38 Correct 580 ms 271976 KB Output is correct
39 Correct 621 ms 276960 KB Output is correct
40 Correct 623 ms 274876 KB Output is correct
41 Correct 588 ms 274256 KB Output is correct
42 Correct 634 ms 274164 KB Output is correct
43 Correct 611 ms 274224 KB Output is correct
44 Correct 554 ms 22264 KB Output is correct
45 Correct 591 ms 16784 KB Output is correct
46 Correct 514 ms 15952 KB Output is correct
47 Correct 537 ms 15652 KB Output is correct
48 Correct 531 ms 15304 KB Output is correct
49 Correct 675 ms 281680 KB Output is correct
50 Correct 627 ms 275216 KB Output is correct
51 Correct 480 ms 21956 KB Output is correct
52 Correct 436 ms 16004 KB Output is correct
53 Correct 664 ms 281208 KB Output is correct
54 Correct 572 ms 281584 KB Output is correct
55 Correct 573 ms 274892 KB Output is correct
56 Correct 566 ms 274768 KB Output is correct
57 Correct 543 ms 22208 KB Output is correct
58 Correct 576 ms 22028 KB Output is correct
59 Correct 552 ms 16008 KB Output is correct
60 Correct 533 ms 16024 KB Output is correct
61 Correct 673 ms 275352 KB Output is correct
62 Correct 610 ms 274992 KB Output is correct
63 Correct 556 ms 274980 KB Output is correct
64 Correct 796 ms 275580 KB Output is correct
65 Correct 711 ms 274996 KB Output is correct
66 Correct 640 ms 274792 KB Output is correct
67 Correct 614 ms 275280 KB Output is correct
68 Correct 563 ms 274768 KB Output is correct
69 Correct 562 ms 274708 KB Output is correct
70 Correct 630 ms 275436 KB Output is correct
71 Correct 572 ms 275024 KB Output is correct
72 Correct 521 ms 274900 KB Output is correct
73 Correct 630 ms 275536 KB Output is correct
74 Correct 611 ms 275204 KB Output is correct
75 Correct 548 ms 274932 KB Output is correct
76 Correct 653 ms 282124 KB Output is correct
77 Correct 626 ms 275568 KB Output is correct
78 Correct 645 ms 275604 KB Output is correct
79 Correct 461 ms 22016 KB Output is correct
80 Correct 429 ms 16100 KB Output is correct
81 Correct 430 ms 15184 KB Output is correct
82 Correct 635 ms 281084 KB Output is correct
83 Correct 632 ms 280972 KB Output is correct
84 Correct 560 ms 274844 KB Output is correct
85 Correct 610 ms 274964 KB Output is correct
86 Correct 581 ms 275128 KB Output is correct
87 Correct 609 ms 275248 KB Output is correct
88 Correct 576 ms 22272 KB Output is correct
89 Correct 566 ms 22592 KB Output is correct
90 Correct 525 ms 16096 KB Output is correct
91 Correct 553 ms 15968 KB Output is correct
92 Correct 533 ms 15352 KB Output is correct
93 Correct 539 ms 15340 KB Output is correct
94 Correct 518 ms 280968 KB Output is correct
95 Correct 456 ms 280956 KB Output is correct
96 Correct 487 ms 274848 KB Output is correct
97 Correct 445 ms 274796 KB Output is correct
98 Correct 514 ms 275252 KB Output is correct
99 Correct 417 ms 274908 KB Output is correct
100 Correct 677 ms 22072 KB Output is correct
101 Correct 658 ms 22488 KB Output is correct
102 Correct 657 ms 16132 KB Output is correct
103 Correct 669 ms 16384 KB Output is correct
104 Correct 645 ms 15336 KB Output is correct
105 Correct 657 ms 15352 KB Output is correct
106 Correct 595 ms 281092 KB Output is correct
107 Correct 557 ms 281008 KB Output is correct
108 Correct 575 ms 275280 KB Output is correct
109 Correct 502 ms 275024 KB Output is correct
110 Correct 567 ms 275164 KB Output is correct
111 Correct 525 ms 275092 KB Output is correct
112 Correct 537 ms 22012 KB Output is correct
113 Correct 591 ms 22284 KB Output is correct
114 Correct 512 ms 16204 KB Output is correct
115 Correct 536 ms 15948 KB Output is correct
116 Correct 518 ms 15188 KB Output is correct
117 Correct 528 ms 15444 KB Output is correct
118 Correct 630 ms 275388 KB Output is correct
119 Correct 591 ms 275016 KB Output is correct
120 Correct 518 ms 274896 KB Output is correct
121 Correct 635 ms 275840 KB Output is correct
122 Correct 601 ms 275280 KB Output is correct
123 Correct 535 ms 275020 KB Output is correct
124 Correct 645 ms 275408 KB Output is correct
125 Correct 585 ms 274708 KB Output is correct
126 Correct 529 ms 274584 KB Output is correct