oj.uz

답안 #982135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982135 2024-05-13T23:51:04 Z blackslex Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 1278 ms 420432 KB 
#include<bits/stdc++.h>
 
using namespace std;
using pii = pair<int, int>;
using P = pair<pii, int>;
 
const int N = 1e5 + 5, K = 320;
int n, m, q, x, y, t, r, ptr[N], cdp[N];
vector<int> v[N], rev[N];
vector<pii> dp[N];
bool f[N], f2[N];
 
int main() {
    scanf("%d %d %d", &n, &m, &q);
    int k = K;
    while (m--) scanf("%d %d", &x, &y), v[x].emplace_back(y), rev[y].emplace_back(x);
    for (int i = 1; i <= n; i++) cdp[i] = -1e9;
    for (int i = 1; i <= n; i++) {
        priority_queue<P> pq;
        pq.emplace(pii(0, i), n + 1);
        for (auto &e: rev[i]) {
            auto [x, y] = dp[e][0];
            pq.emplace(pii(x + 1, y), e);
            ptr[e] = 1;
        }
        while (!pq.empty() && dp[i].size() <= k) {
            auto [x, y] = pq.top(); pq.pop();
            dp[i].emplace_back(x); f2[x.second] = 1;
            while (ptr[y] < dp[y].size()) {
                auto [cx, cy] = dp[y][ptr[y]]; ptr[y]++;
                if (f2[cy]) continue;
                pq.emplace(pii(cx + 1, cy), y);
                break;
            }
        }
        for (auto &[x, y]: dp[i]) f2[y] = 0;
    }
    while (q--) {
        scanf("%d %d", &t, &r);
        vector<int> c(r);
        for (auto &e: c) scanf("%d", &e), f[e] = 1;
        int ans = -1;
        if (r < k) {
            for (auto &[x, y]: dp[t]) if (!f[y]) {ans = x; break;}
        } else {
            cdp[t] = 0;
            for (int i = t; i >= 1; i--) {
                for (auto &e: v[i]) cdp[i] = max(cdp[i], cdp[e] + 1);
                if (!f[i]) ans = max(ans, cdp[i]);
            }
            for (int i = t; i >= 1; i--) cdp[i] = -1e9;
        }
        printf("%d\n", ans);
        for (auto &e: c) f[e] = 0;
    }
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:26:44: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         while (!pq.empty() && dp[i].size() <= k) {
      |                               ~~~~~~~~~~~~~^~~~
bitaro.cpp:29:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             while (ptr[y] < dp[y].size()) {
      |                    ~~~~~~~^~~~~~~~~~~~~~
bitaro.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d %d %d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:16:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     while (m--) scanf("%d %d", &x, &y), v[x].emplace_back(y), rev[y].emplace_back(x);
      |                 ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         scanf("%d %d", &t, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:41:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         for (auto &e: c) scanf("%d", &e), f[e] = 1;
      |                          ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 2 ms 7512 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 4 ms 8028 KB Output is correct
8 Correct 12 ms 10844 KB Output is correct
9 Correct 11 ms 10844 KB Output is correct
10 Correct 11 ms 10840 KB Output is correct
11 Correct 10 ms 10328 KB Output is correct
12 Correct 9 ms 8808 KB Output is correct
13 Correct 10 ms 10196 KB Output is correct
14 Correct 10 ms 9560 KB Output is correct
15 Correct 7 ms 8540 KB Output is correct
16 Correct 8 ms 9312 KB Output is correct
17 Correct 9 ms 9816 KB Output is correct
18 Correct 6 ms 8540 KB Output is correct
19 Correct 9 ms 9752 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 2 ms 7512 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 4 ms 8028 KB Output is correct
8 Correct 12 ms 10844 KB Output is correct
9 Correct 11 ms 10844 KB Output is correct
10 Correct 11 ms 10840 KB Output is correct
11 Correct 10 ms 10328 KB Output is correct
12 Correct 9 ms 8808 KB Output is correct
13 Correct 10 ms 10196 KB Output is correct
14 Correct 10 ms 9560 KB Output is correct
15 Correct 7 ms 8540 KB Output is correct
16 Correct 8 ms 9312 KB Output is correct
17 Correct 9 ms 9816 KB Output is correct
18 Correct 6 ms 8540 KB Output is correct
19 Correct 9 ms 9752 KB Output is correct
20 Correct 85 ms 15456 KB Output is correct
21 Correct 115 ms 15488 KB Output is correct
22 Correct 82 ms 15548 KB Output is correct
23 Correct 75 ms 15188 KB Output is correct
24 Correct 889 ms 260008 KB Output is correct
25 Correct 911 ms 271184 KB Output is correct
26 Correct 915 ms 270544 KB Output is correct
27 Correct 1278 ms 419744 KB Output is correct
28 Correct 1211 ms 419540 KB Output is correct
29 Correct 1203 ms 419536 KB Output is correct
30 Correct 1196 ms 418388 KB Output is correct
31 Correct 1146 ms 403136 KB Output is correct
32 Correct 1206 ms 418356 KB Output is correct
33 Correct 808 ms 261144 KB Output is correct
34 Correct 661 ms 214760 KB Output is correct
35 Correct 770 ms 259368 KB Output is correct
36 Correct 992 ms 339760 KB Output is correct
37 Correct 919 ms 307836 KB Output is correct
38 Correct 988 ms 341320 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 2 ms 7512 KB Output is correct
5 Correct 5 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 4 ms 8028 KB Output is correct
8 Correct 12 ms 10844 KB Output is correct
9 Correct 11 ms 10844 KB Output is correct
10 Correct 11 ms 10840 KB Output is correct
11 Correct 10 ms 10328 KB Output is correct
12 Correct 9 ms 8808 KB Output is correct
13 Correct 10 ms 10196 KB Output is correct
14 Correct 10 ms 9560 KB Output is correct
15 Correct 7 ms 8540 KB Output is correct
16 Correct 8 ms 9312 KB Output is correct
17 Correct 9 ms 9816 KB Output is correct
18 Correct 6 ms 8540 KB Output is correct
19 Correct 9 ms 9752 KB Output is correct
20 Correct 85 ms 15456 KB Output is correct
21 Correct 115 ms 15488 KB Output is correct
22 Correct 82 ms 15548 KB Output is correct
23 Correct 75 ms 15188 KB Output is correct
24 Correct 889 ms 260008 KB Output is correct
25 Correct 911 ms 271184 KB Output is correct
26 Correct 915 ms 270544 KB Output is correct
27 Correct 1278 ms 419744 KB Output is correct
28 Correct 1211 ms 419540 KB Output is correct
29 Correct 1203 ms 419536 KB Output is correct
30 Correct 1196 ms 418388 KB Output is correct
31 Correct 1146 ms 403136 KB Output is correct
32 Correct 1206 ms 418356 KB Output is correct
33 Correct 808 ms 261144 KB Output is correct
34 Correct 661 ms 214760 KB Output is correct
35 Correct 770 ms 259368 KB Output is correct
36 Correct 992 ms 339760 KB Output is correct
37 Correct 919 ms 307836 KB Output is correct
38 Correct 988 ms 341320 KB Output is correct
39 Correct 929 ms 263916 KB Output is correct
40 Correct 926 ms 265056 KB Output is correct
41 Correct 887 ms 268152 KB Output is correct
42 Correct 947 ms 266156 KB Output is correct
43 Correct 887 ms 265384 KB Output is correct
44 Correct 114 ms 16728 KB Output is correct
45 Correct 101 ms 16036 KB Output is correct
46 Correct 89 ms 15876 KB Output is correct
47 Correct 101 ms 15544 KB Output is correct
48 Correct 83 ms 15472 KB Output is correct
49 Correct 1239 ms 420432 KB Output is correct
50 Correct 1204 ms 419440 KB Output is correct
51 Correct 118 ms 16444 KB Output is correct
52 Incorrect 98 ms 15952 KB Output isn't correct
53 Halted 0 ms 0 KB -