oj.uz

Submission #966667

# Submission time Handle Problem Language Result Execution time Memory
966667 2024-04-20T07:56:24 Z Pring Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 305636 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;

const int MXN = 100005, K = 320, INF = 1e9;
int n, m, q;
vector<int> edge[MXN], edge_inv[MXN];
bitset<MXN> b;
int dis[MXN];
vector<pii> w[MXN];

void MERGE(vector<pii> &a, vector<pii> &b, vector<pii> &c) {
    c.clear();
    for (int i = 0, j = 0; i < a.size() || j < b.size(); ) {
        if (i == a.size()) c.push_back(b[j++]);
        else if (j == b.size()) c.push_back(a[i++]);
        else if (a[i].sc < b[i].sc) c.push_back(b[j++]);
        else c.push_back(a[i++]);
    }
}

void DP(int id) {
    vector<pii> a, bb, c;
    a.push_back(mp(id, 0));
    for (auto pre : edge_inv[id]) {
        for (auto [id, len] : w[pre]) bb.push_back(mp(id, len + 1));
        MERGE(a, bb, c);
        a.clear();
        bb.clear();
        for (auto [id, len] : c) {
            if (b[id]) continue;
            a.push_back(mp(id, len));
        }
        while (a.size() > K + 1) a.pop_back();
    }
    w[id] = a;
}

void TS(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) {
    if (v.size() <= K) {
        for (auto [i, x] : w[t]) {
            if (b[i]) continue;
            return x;
        }
        return -1;
    } else {
        TS(t);
        int ans = -1;
        FOR(i, 1, t + 1) {
            if (b[i]) continue;
            ans = max(ans, dis[i]);
        }
        return ans;
    }
    return 0;
}

void miku() {
    cin >> n >> m >> q;
    while (m--) {
        int x, y;
        cin >> x >> y;
        edge[x].push_back(y);
        edge_inv[y].push_back(x);
    }
    FOR(i, 1, n + 1) DP(i);
    while (q--) {
        int t, y;
        vector<int> v;
        cin >> t >> y;
        v.resize(y);
        for (auto &i : v) {
            cin >> i;
            b[i] = true;
        }
        cout << calc(t, v) << '\n';
        for (auto &i : v) {
            b[i] = false;
        }
    }
    // FOR(i, 1, n + 1) {
    //     debug(i);
    //     for (auto &[id, x] : w[i]) debug(id, x);
    // }
}

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

Compilation message

bitaro.cpp: In function 'void MERGE(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
bitaro.cpp:30:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0, j = 0; i < a.size() || j < b.size(); ) {
      |                            ~~^~~~~~~~~~
bitaro.cpp:30:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0, j = 0; i < a.size() || j < b.size(); ) {
      |                                            ~~^~~~~~~~~~
bitaro.cpp:31:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         if (i == a.size()) c.push_back(b[j++]);
      |             ~~^~~~~~~~~~~
bitaro.cpp:32:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         else if (j == b.size()) c.push_back(a[i++]);
      |                  ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7768 KB Output is correct
3 Correct 2 ms 7748 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 11 ms 9412 KB Output is correct
6 Correct 11 ms 9308 KB Output is correct
7 Correct 10 ms 9404 KB Output is correct
8 Correct 20 ms 10840 KB Output is correct
9 Correct 21 ms 10828 KB Output is correct
10 Correct 20 ms 10588 KB Output is correct
11 Correct 19 ms 10584 KB Output is correct
12 Correct 12 ms 9820 KB Output is correct
13 Correct 19 ms 10588 KB Output is correct
14 Correct 14 ms 9344 KB Output is correct
15 Correct 8 ms 8540 KB Output is correct
16 Correct 12 ms 9308 KB Output is correct
17 Correct 15 ms 9948 KB Output is correct
18 Correct 12 ms 9136 KB Output is correct
19 Correct 15 ms 10072 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7768 KB Output is correct
3 Correct 2 ms 7748 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 11 ms 9412 KB Output is correct
6 Correct 11 ms 9308 KB Output is correct
7 Correct 10 ms 9404 KB Output is correct
8 Correct 20 ms 10840 KB Output is correct
9 Correct 21 ms 10828 KB Output is correct
10 Correct 20 ms 10588 KB Output is correct
11 Correct 19 ms 10584 KB Output is correct
12 Correct 12 ms 9820 KB Output is correct
13 Correct 19 ms 10588 KB Output is correct
14 Correct 14 ms 9344 KB Output is correct
15 Correct 8 ms 8540 KB Output is correct
16 Correct 12 ms 9308 KB Output is correct
17 Correct 15 ms 9948 KB Output is correct
18 Correct 12 ms 9136 KB Output is correct
19 Correct 15 ms 10072 KB Output is correct
20 Correct 1641 ms 14328 KB Output is correct
21 Correct 1630 ms 14368 KB Output is correct
22 Correct 1643 ms 14352 KB Output is correct
23 Correct 1626 ms 14496 KB Output is correct
24 Correct 1449 ms 238828 KB Output is correct
25 Correct 1477 ms 238308 KB Output is correct
26 Correct 1435 ms 238472 KB Output is correct
27 Correct 1737 ms 303920 KB Output is correct
28 Correct 1780 ms 304236 KB Output is correct
29 Correct 1742 ms 303912 KB Output is correct
30 Correct 1744 ms 303468 KB Output is correct
31 Correct 1658 ms 296532 KB Output is correct
32 Correct 1734 ms 303668 KB Output is correct
33 Correct 1168 ms 185240 KB Output is correct
34 Correct 1006 ms 150864 KB Output is correct
35 Correct 1176 ms 185608 KB Output is correct
36 Correct 1502 ms 249848 KB Output is correct
37 Correct 1364 ms 227192 KB Output is correct
38 Correct 1487 ms 250560 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7768 KB Output is correct
3 Correct 2 ms 7748 KB Output is correct
4 Correct 2 ms 7772 KB Output is correct
5 Correct 11 ms 9412 KB Output is correct
6 Correct 11 ms 9308 KB Output is correct
7 Correct 10 ms 9404 KB Output is correct
8 Correct 20 ms 10840 KB Output is correct
9 Correct 21 ms 10828 KB Output is correct
10 Correct 20 ms 10588 KB Output is correct
11 Correct 19 ms 10584 KB Output is correct
12 Correct 12 ms 9820 KB Output is correct
13 Correct 19 ms 10588 KB Output is correct
14 Correct 14 ms 9344 KB Output is correct
15 Correct 8 ms 8540 KB Output is correct
16 Correct 12 ms 9308 KB Output is correct
17 Correct 15 ms 9948 KB Output is correct
18 Correct 12 ms 9136 KB Output is correct
19 Correct 15 ms 10072 KB Output is correct
20 Correct 1641 ms 14328 KB Output is correct
21 Correct 1630 ms 14368 KB Output is correct
22 Correct 1643 ms 14352 KB Output is correct
23 Correct 1626 ms 14496 KB Output is correct
24 Correct 1449 ms 238828 KB Output is correct
25 Correct 1477 ms 238308 KB Output is correct
26 Correct 1435 ms 238472 KB Output is correct
27 Correct 1737 ms 303920 KB Output is correct
28 Correct 1780 ms 304236 KB Output is correct
29 Correct 1742 ms 303912 KB Output is correct
30 Correct 1744 ms 303468 KB Output is correct
31 Correct 1658 ms 296532 KB Output is correct
32 Correct 1734 ms 303668 KB Output is correct
33 Correct 1168 ms 185240 KB Output is correct
34 Correct 1006 ms 150864 KB Output is correct
35 Correct 1176 ms 185608 KB Output is correct
36 Correct 1502 ms 249848 KB Output is correct
37 Correct 1364 ms 227192 KB Output is correct
38 Correct 1487 ms 250560 KB Output is correct
39 Correct 1436 ms 233816 KB Output is correct
40 Correct 1474 ms 237304 KB Output is correct
41 Correct 1403 ms 236156 KB Output is correct
42 Correct 1469 ms 235584 KB Output is correct
43 Correct 1402 ms 235256 KB Output is correct
44 Correct 1660 ms 15700 KB Output is correct
45 Correct 1665 ms 14868 KB Output is correct
46 Correct 1639 ms 14852 KB Output is correct
47 Correct 1664 ms 14632 KB Output is correct
48 Correct 1631 ms 14432 KB Output is correct
49 Execution timed out 2017 ms 305636 KB Time limit exceeded
50 Halted 0 ms 0 KB -