oj.uz

답안 #966669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966669 2024-04-20T07:59:45 Z Pring Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 1823 ms 279656 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2","popcnt","sse4","abm")
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 = 280, 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:32: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]
   32 |     for (int i = 0, j = 0; i < a.size() || j < b.size(); ) {
      |                            ~~^~~~~~~~~~
bitaro.cpp:32: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]
   32 |     for (int i = 0, j = 0; i < a.size() || j < b.size(); ) {
      |                                            ~~^~~~~~~~~~
bitaro.cpp:33: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]
   33 |         if (i == a.size()) c.push_back(b[j++]);
      |             ~~^~~~~~~~~~~
bitaro.cpp:34: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]
   34 |         else if (j == b.size()) c.push_back(a[i++]);
      |                  ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 2 ms 7768 KB Output is correct
5 Correct 11 ms 9476 KB Output is correct
6 Correct 9 ms 9048 KB Output is correct
7 Correct 10 ms 9052 KB Output is correct
8 Correct 22 ms 10584 KB Output is correct
9 Correct 19 ms 10588 KB Output is correct
10 Correct 18 ms 10324 KB Output is correct
11 Correct 17 ms 10328 KB Output is correct
12 Correct 11 ms 9564 KB Output is correct
13 Correct 21 ms 10520 KB Output is correct
14 Correct 11 ms 9052 KB Output is correct
15 Correct 9 ms 8540 KB Output is correct
16 Correct 11 ms 9052 KB Output is correct
17 Correct 14 ms 9816 KB Output is correct
18 Correct 9 ms 8792 KB Output is correct
19 Correct 16 ms 9820 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 2 ms 7768 KB Output is correct
5 Correct 11 ms 9476 KB Output is correct
6 Correct 9 ms 9048 KB Output is correct
7 Correct 10 ms 9052 KB Output is correct
8 Correct 22 ms 10584 KB Output is correct
9 Correct 19 ms 10588 KB Output is correct
10 Correct 18 ms 10324 KB Output is correct
11 Correct 17 ms 10328 KB Output is correct
12 Correct 11 ms 9564 KB Output is correct
13 Correct 21 ms 10520 KB Output is correct
14 Correct 11 ms 9052 KB Output is correct
15 Correct 9 ms 8540 KB Output is correct
16 Correct 11 ms 9052 KB Output is correct
17 Correct 14 ms 9816 KB Output is correct
18 Correct 9 ms 8792 KB Output is correct
19 Correct 16 ms 9820 KB Output is correct
20 Correct 1443 ms 12548 KB Output is correct
21 Correct 1455 ms 12508 KB Output is correct
22 Correct 1452 ms 12852 KB Output is correct
23 Correct 1423 ms 12644 KB Output is correct
24 Correct 1335 ms 218320 KB Output is correct
25 Correct 1318 ms 219148 KB Output is correct
26 Correct 1319 ms 219444 KB Output is correct
27 Correct 1582 ms 278728 KB Output is correct
28 Correct 1611 ms 279376 KB Output is correct
29 Correct 1614 ms 278896 KB Output is correct
30 Correct 1568 ms 278652 KB Output is correct
31 Correct 1562 ms 272544 KB Output is correct
32 Correct 1602 ms 278756 KB Output is correct
33 Correct 1075 ms 169116 KB Output is correct
34 Correct 928 ms 137912 KB Output is correct
35 Correct 1113 ms 172712 KB Output is correct
36 Correct 1375 ms 229812 KB Output is correct
37 Correct 1235 ms 209236 KB Output is correct
38 Correct 1348 ms 230428 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 2 ms 7768 KB Output is correct
5 Correct 11 ms 9476 KB Output is correct
6 Correct 9 ms 9048 KB Output is correct
7 Correct 10 ms 9052 KB Output is correct
8 Correct 22 ms 10584 KB Output is correct
9 Correct 19 ms 10588 KB Output is correct
10 Correct 18 ms 10324 KB Output is correct
11 Correct 17 ms 10328 KB Output is correct
12 Correct 11 ms 9564 KB Output is correct
13 Correct 21 ms 10520 KB Output is correct
14 Correct 11 ms 9052 KB Output is correct
15 Correct 9 ms 8540 KB Output is correct
16 Correct 11 ms 9052 KB Output is correct
17 Correct 14 ms 9816 KB Output is correct
18 Correct 9 ms 8792 KB Output is correct
19 Correct 16 ms 9820 KB Output is correct
20 Correct 1443 ms 12548 KB Output is correct
21 Correct 1455 ms 12508 KB Output is correct
22 Correct 1452 ms 12852 KB Output is correct
23 Correct 1423 ms 12644 KB Output is correct
24 Correct 1335 ms 218320 KB Output is correct
25 Correct 1318 ms 219148 KB Output is correct
26 Correct 1319 ms 219444 KB Output is correct
27 Correct 1582 ms 278728 KB Output is correct
28 Correct 1611 ms 279376 KB Output is correct
29 Correct 1614 ms 278896 KB Output is correct
30 Correct 1568 ms 278652 KB Output is correct
31 Correct 1562 ms 272544 KB Output is correct
32 Correct 1602 ms 278756 KB Output is correct
33 Correct 1075 ms 169116 KB Output is correct
34 Correct 928 ms 137912 KB Output is correct
35 Correct 1113 ms 172712 KB Output is correct
36 Correct 1375 ms 229812 KB Output is correct
37 Correct 1235 ms 209236 KB Output is correct
38 Correct 1348 ms 230428 KB Output is correct
39 Correct 1319 ms 214928 KB Output is correct
40 Correct 1298 ms 218104 KB Output is correct
41 Correct 1296 ms 217612 KB Output is correct
42 Correct 1367 ms 216932 KB Output is correct
43 Correct 1327 ms 216612 KB Output is correct
44 Correct 1439 ms 14704 KB Output is correct
45 Correct 1430 ms 13964 KB Output is correct
46 Correct 1425 ms 14332 KB Output is correct
47 Correct 1450 ms 13532 KB Output is correct
48 Correct 1435 ms 13716 KB Output is correct
49 Correct 1823 ms 279656 KB Output is correct
50 Incorrect 1759 ms 278860 KB Output isn't correct
51 Halted 0 ms 0 KB -