oj.uz

답안 #966630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966630 2024-04-20T07:15:43 Z Pring Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 13352 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 DP(int id) {
    vector<pii> br, tmp;
    for (auto &i : edge_inv[id]) {
        for (auto &[j, x] : w[i]) br.push_back(mp(j, x + 1));
    }
    sort(br.begin(), br.end());
    for (int i = 0, j = 0; i < br.size(); i = j) {
        while (j < br.size() && br[i].fs == br[j].fs) j++;
        tmp.push_back(br[j - 1]);
    }
    tmp.push_back(mp(id, 0));
    sort(tmp.begin(), tmp.end(), [](pii a, pii b) -> bool {
        return (a.sc == b.sc ? a.fs < b.fs : a.sc > b.sc);
    });
    while (tmp.size() > 321) tmp.pop_back();
    w[id] = tmp;
}

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 DP(int)':
bitaro.cpp:34: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]
   34 |     for (int i = 0, j = 0; i < br.size(); i = j) {
      |                            ~~^~~~~~~~~~~
bitaro.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         while (j < br.size() && br[i].fs == br[j].fs) j++;
      |                ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 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 6 ms 8028 KB Output is correct
6 Correct 6 ms 8284 KB Output is correct
7 Correct 6 ms 8028 KB Output is correct
8 Correct 26 ms 10508 KB Output is correct
9 Correct 24 ms 10320 KB Output is correct
10 Correct 24 ms 10328 KB Output is correct
11 Correct 31 ms 10320 KB Output is correct
12 Correct 14 ms 8796 KB Output is correct
13 Correct 28 ms 9952 KB Output is correct
14 Correct 22 ms 9260 KB Output is correct
15 Correct 14 ms 8796 KB Output is correct
16 Correct 21 ms 9184 KB Output is correct
17 Correct 20 ms 9564 KB Output is correct
18 Correct 13 ms 8832 KB Output is correct
19 Correct 20 ms 9500 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 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 6 ms 8028 KB Output is correct
6 Correct 6 ms 8284 KB Output is correct
7 Correct 6 ms 8028 KB Output is correct
8 Correct 26 ms 10508 KB Output is correct
9 Correct 24 ms 10320 KB Output is correct
10 Correct 24 ms 10328 KB Output is correct
11 Correct 31 ms 10320 KB Output is correct
12 Correct 14 ms 8796 KB Output is correct
13 Correct 28 ms 9952 KB Output is correct
14 Correct 22 ms 9260 KB Output is correct
15 Correct 14 ms 8796 KB Output is correct
16 Correct 21 ms 9184 KB Output is correct
17 Correct 20 ms 9564 KB Output is correct
18 Correct 13 ms 8832 KB Output is correct
19 Correct 20 ms 9500 KB Output is correct
20 Execution timed out 2054 ms 13352 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 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 6 ms 8028 KB Output is correct
6 Correct 6 ms 8284 KB Output is correct
7 Correct 6 ms 8028 KB Output is correct
8 Correct 26 ms 10508 KB Output is correct
9 Correct 24 ms 10320 KB Output is correct
10 Correct 24 ms 10328 KB Output is correct
11 Correct 31 ms 10320 KB Output is correct
12 Correct 14 ms 8796 KB Output is correct
13 Correct 28 ms 9952 KB Output is correct
14 Correct 22 ms 9260 KB Output is correct
15 Correct 14 ms 8796 KB Output is correct
16 Correct 21 ms 9184 KB Output is correct
17 Correct 20 ms 9564 KB Output is correct
18 Correct 13 ms 8832 KB Output is correct
19 Correct 20 ms 9500 KB Output is correct
20 Execution timed out 2054 ms 13352 KB Time limit exceeded
21 Halted 0 ms 0 KB -