oj.uz

Submission #786700

# Submission time Handle Problem Language Result Execution time Memory
786700 2023-07-18T11:27:25 Z PanosPask Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 915 ms 262460 KB 
#include <bits/stdc++.h>
#define pb push_back

using namespace std;

typedef pair<int, int> pi;

int N, M, Q;
vector<vector<pi>> dist;
vector<vector<int>> adj_list;
int BLOCK_SIZE;
vector<bool> ban;
vector<int> curbanned;
vector<int> dp;
vector<bool> use;

int find(int i, vector<int>& v)
{
    int p = lower_bound(v.begin(), v.end(), i) - v.begin();

    if (p < v.size() && v[p] == i)
        return true;
    else
        return false;
}

int naive_dp(int dest, vector<bool>& banned)
{
    dp.assign(N, -1);

    for (int i = 0; i < N; i++) {
        if (!banned[i]) {
            dp[i] = max(dp[i], 0);
        }
        if (dp[i] == -1) {
            continue;
        }

        for (auto v : adj_list[i])
            dp[v] = max(dp[v], dp[i] + 1);
    }

    return dp[dest];
}

int find_from_precalculate(int c, vector<bool>& banned)
{
    int ans = -1;
    for (auto v : dist[c]) {

        if (!banned[v.first])
            ans = max(ans, v.second);
    }

    return ans;
}

void merge(vector<pi>& a, vector<pi>& b)
{
    vector<pi> c;

    int p_a = 0;
    int p_b = 0;
    int ins = 0;

    while (p_a < a.size() && p_b < b.size() && ins < BLOCK_SIZE) {
        if (a[p_a].second >= b[p_b].second + 1) {
            if (!use[a[p_a].first]) {
                use[a[p_a].first] = true;
                c.push_back(a[p_a]);
                ins++;
            }
            p_a++;
        }
        else {
            if (!use[b[p_b].first]) {
                use[b[p_b].first] = true;
                ins++;
                c.push_back(b[p_b]);
                c.back().second++;
            }
            p_b++;
        }
    }

    while (p_a < a.size() && ins < BLOCK_SIZE) {
        if (!use[a[p_a].first]) {
            use[a[p_a].first] = true;
            c.push_back(a[p_a]);
            ins++;
        }
        p_a++;
    }
    while (p_b < b.size() && ins < BLOCK_SIZE) {
        if (!use[b[p_b].first]) {
            use[b[p_b].first] = true;
            ins++;
            c.push_back(b[p_b]);
            c.back().second++;
        }
        p_b++;
    }


    a = c;
    for (auto v : a)
        use[v.first] = false;
}

int main(void)
{
    scanf("%d %d %d", &N, &M, &Q);

    BLOCK_SIZE = ceil(sqrt(N));

    adj_list.resize(N);
    dist.resize(N);
    ban.resize(N);
    use.resize(N);

    for (int i = 0; i < M; i++) {
        int u, v;
        scanf("%d %d", &u, &v);
        u--; v--;

        adj_list[u].pb(v);
    }

    // Precalculate best cities
    for (int i = 0; i < N; i++) {
        if (dist[i].size() < BLOCK_SIZE)
            dist[i].push_back({i, 0});

        for (auto neigh : adj_list[i]) {
            merge(dist[neigh], dist[i]);
        }
    }


    for (int i = 0; i < Q; i++) {
        int T, Y;
        scanf("%d %d", &T, &Y);
        T--;

        for (int j = 0; j < Y; j++) {
            int c;
            scanf("%d", &c);
            c--;

            curbanned.push_back(c);
            ban[c] = true;
        }
        sort(curbanned.begin(), curbanned.end());

        int ans = 0;
        if (Y >= BLOCK_SIZE)
            ans = naive_dp(T, ban);
        else
            ans = find_from_precalculate(T, ban);

        while (curbanned.size()) {
            ban[curbanned.back()] = false;
            curbanned.pop_back();
        }

        printf("%d\n", ans);
    }

    return 0;
}

Compilation message

bitaro.cpp: In function 'int find(int, std::vector<int>&)':
bitaro.cpp:21:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if (p < v.size() && v[p] == i)
      |         ~~^~~~~~~~~~
bitaro.cpp: In function 'void merge(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
bitaro.cpp:66:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while (p_a < a.size() && p_b < b.size() && ins < BLOCK_SIZE) {
      |            ~~~~^~~~~~~~~~
bitaro.cpp:66:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while (p_a < a.size() && p_b < b.size() && ins < BLOCK_SIZE) {
      |                              ~~~~^~~~~~~~~~
bitaro.cpp:86:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     while (p_a < a.size() && ins < BLOCK_SIZE) {
      |            ~~~~^~~~~~~~~~
bitaro.cpp:94:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     while (p_b < b.size() && ins < BLOCK_SIZE) {
      |            ~~~~^~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:131:28: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  131 |         if (dist[i].size() < BLOCK_SIZE)
      |             ~~~~~~~~~~~~~~~^~~~~~~~~~~~
bitaro.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |     scanf("%d %d %d", &N, &M, &Q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:123:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  123 |         scanf("%d %d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:142:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  142 |         scanf("%d %d", &T, &Y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:147:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  147 |             scanf("%d", &c);
      |             ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 3 ms 656 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 3 ms 656 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 119 ms 1804 KB Output is correct
21 Correct 101 ms 1824 KB Output is correct
22 Correct 101 ms 1788 KB Output is correct
23 Correct 113 ms 1784 KB Output is correct
24 Correct 591 ms 221896 KB Output is correct
25 Correct 591 ms 228476 KB Output is correct
26 Correct 586 ms 228464 KB Output is correct
27 Correct 711 ms 259748 KB Output is correct
28 Correct 710 ms 259752 KB Output is correct
29 Correct 725 ms 259740 KB Output is correct
30 Correct 701 ms 259612 KB Output is correct
31 Correct 623 ms 258580 KB Output is correct
32 Correct 661 ms 259544 KB Output is correct
33 Correct 508 ms 163312 KB Output is correct
34 Correct 431 ms 145384 KB Output is correct
35 Correct 507 ms 161980 KB Output is correct
36 Correct 597 ms 212492 KB Output is correct
37 Correct 521 ms 202660 KB Output is correct
38 Correct 597 ms 213068 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 3 ms 656 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 119 ms 1804 KB Output is correct
21 Correct 101 ms 1824 KB Output is correct
22 Correct 101 ms 1788 KB Output is correct
23 Correct 113 ms 1784 KB Output is correct
24 Correct 591 ms 221896 KB Output is correct
25 Correct 591 ms 228476 KB Output is correct
26 Correct 586 ms 228464 KB Output is correct
27 Correct 711 ms 259748 KB Output is correct
28 Correct 710 ms 259752 KB Output is correct
29 Correct 725 ms 259740 KB Output is correct
30 Correct 701 ms 259612 KB Output is correct
31 Correct 623 ms 258580 KB Output is correct
32 Correct 661 ms 259544 KB Output is correct
33 Correct 508 ms 163312 KB Output is correct
34 Correct 431 ms 145384 KB Output is correct
35 Correct 507 ms 161980 KB Output is correct
36 Correct 597 ms 212492 KB Output is correct
37 Correct 521 ms 202660 KB Output is correct
38 Correct 597 ms 213068 KB Output is correct
39 Correct 667 ms 223112 KB Output is correct
40 Correct 583 ms 225268 KB Output is correct
41 Correct 583 ms 226056 KB Output is correct
42 Correct 751 ms 228056 KB Output is correct
43 Correct 595 ms 225660 KB Output is correct
44 Correct 138 ms 2864 KB Output is correct
45 Correct 109 ms 2620 KB Output is correct
46 Correct 325 ms 2664 KB Output is correct
47 Correct 128 ms 2508 KB Output is correct
48 Correct 102 ms 2580 KB Output is correct
49 Correct 796 ms 259680 KB Output is correct
50 Correct 684 ms 259004 KB Output is correct
51 Correct 133 ms 2880 KB Output is correct
52 Correct 284 ms 2600 KB Output is correct
53 Correct 708 ms 212060 KB Output is correct
54 Correct 596 ms 202504 KB Output is correct
55 Correct 612 ms 211524 KB Output is correct
56 Correct 518 ms 204448 KB Output is correct
57 Correct 132 ms 4380 KB Output is correct
58 Correct 132 ms 4488 KB Output is correct
59 Correct 268 ms 3628 KB Output is correct
60 Correct 266 ms 3592 KB Output is correct
61 Correct 798 ms 261404 KB Output is correct
62 Correct 671 ms 214732 KB Output is correct
63 Correct 629 ms 203424 KB Output is correct
64 Correct 915 ms 261352 KB Output is correct
65 Correct 834 ms 213216 KB Output is correct
66 Correct 757 ms 205992 KB Output is correct
67 Correct 695 ms 260964 KB Output is correct
68 Correct 595 ms 214084 KB Output is correct
69 Correct 560 ms 202088 KB Output is correct
70 Correct 709 ms 261584 KB Output is correct
71 Correct 645 ms 213656 KB Output is correct
72 Correct 526 ms 204348 KB Output is correct
73 Correct 706 ms 261484 KB Output is correct
74 Correct 636 ms 214268 KB Output is correct
75 Correct 538 ms 203416 KB Output is correct
76 Correct 796 ms 262460 KB Output is correct
77 Correct 717 ms 261088 KB Output is correct
78 Correct 692 ms 261720 KB Output is correct
79 Correct 143 ms 4620 KB Output is correct
80 Correct 323 ms 3728 KB Output is correct
81 Correct 104 ms 3336 KB Output is correct
82 Correct 753 ms 261916 KB Output is correct
83 Correct 731 ms 261216 KB Output is correct
84 Correct 666 ms 260844 KB Output is correct
85 Correct 609 ms 259516 KB Output is correct
86 Correct 657 ms 261408 KB Output is correct
87 Correct 636 ms 261240 KB Output is correct
88 Correct 137 ms 4684 KB Output is correct
89 Correct 142 ms 4616 KB Output is correct
90 Correct 284 ms 3640 KB Output is correct
91 Correct 281 ms 3656 KB Output is correct
92 Correct 102 ms 3364 KB Output is correct
93 Correct 101 ms 3336 KB Output is correct
94 Correct 590 ms 165968 KB Output is correct
95 Correct 497 ms 147272 KB Output is correct
96 Correct 540 ms 163836 KB Output is correct
97 Correct 418 ms 148240 KB Output is correct
98 Correct 531 ms 164872 KB Output is correct
99 Correct 463 ms 148152 KB Output is correct
100 Correct 136 ms 4564 KB Output is correct
101 Correct 139 ms 4596 KB Output is correct
102 Correct 311 ms 3696 KB Output is correct
103 Correct 300 ms 3680 KB Output is correct
104 Correct 112 ms 3328 KB Output is correct
105 Correct 103 ms 3340 KB Output is correct
106 Correct 728 ms 214644 KB Output is correct
107 Correct 682 ms 205092 KB Output is correct
108 Correct 618 ms 214644 KB Output is correct
109 Correct 516 ms 203816 KB Output is correct
110 Correct 609 ms 215112 KB Output is correct
111 Correct 545 ms 205544 KB Output is correct
112 Correct 139 ms 4556 KB Output is correct
113 Correct 134 ms 4592 KB Output is correct
114 Correct 296 ms 3700 KB Output is correct
115 Correct 283 ms 3716 KB Output is correct
116 Correct 103 ms 3352 KB Output is correct
117 Correct 106 ms 3404 KB Output is correct
118 Correct 684 ms 260944 KB Output is correct
119 Correct 596 ms 214112 KB Output is correct
120 Correct 518 ms 203360 KB Output is correct
121 Correct 698 ms 261180 KB Output is correct
122 Correct 612 ms 213392 KB Output is correct
123 Correct 535 ms 202472 KB Output is correct
124 Correct 687 ms 260916 KB Output is correct
125 Correct 604 ms 214904 KB Output is correct
126 Correct 539 ms 202696 KB Output is correct