oj.uz

Submission #958630

# Submission time Handle Problem Language Result Execution time Memory
958630 2024-04-06T08:48:17 Z steveonalex Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 712 ms 171328 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e5 + 69, INF = 1e9 + 69;
const int BLOCK = 200;
int n, m, q;
vector<int> graph[N];

namespace Solve1{
    int dp[N];
    void solve(int t, vector<int> banned){
        for(int i = 1; i<=t; ++i) dp[i] = 0;
        for(int i: banned) dp[i] = -INF;
        for(int i = 1; i<=t; ++i){
            for(int j: graph[i]) maximize(dp[i], dp[j] + 1);
        }
        cout << max(-1, dp[t]) << "\n";
    }
}


namespace Solve2{
    vector<pair<int, int>> dp[N];
    int max_val[N];
    void init(){
        for(int i = 1; i<=n; ++i) {
            dp[i].reserve(BLOCK);
            max_val[i] = -INF;
        }
        vector<pair<int, int>> tmp;
        vector<int> st;
        st.reserve(n * BLOCK);
        tmp.reserve(n);

        for(int i = 1; i<=n; ++i) {
            for(int j: graph[i]){
                for(pair<int, int> k: dp[j]){
                    if (maximize(max_val[k.second], k.first + 1))
                        st.push_back(k.second);
                }
            }

            for(int j: st) if (max_val[j] != -INF){
                tmp.push_back({max_val[j], j});
                max_val[j] = -INF;
            }
            st.clear();

            tmp.push_back({0, i});

            if (tmp.size() > BLOCK){
                nth_element(tmp.begin(), tmp.begin() + BLOCK, tmp.end(), greater<pair<int, int>>());
                while(tmp.size() > BLOCK) tmp.pop_back();
            }
            dp[i] = tmp;
            tmp.clear();
        }
    }

    void solve(int t, vector<int> banned){
        for(auto i: dp[t]) max_val[i.second] = i.first;
        for(int i: banned) max_val[i] = -INF;
        int ans = -INF;
        for(auto i: dp[t]) {
            maximize(ans, max_val[i.second]);
            max_val[i.second] = -INF;
        }
        cout << max(-1, ans) << "\n";
    }
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m >> q;
    while(m--){
        int u, v; cin >> u >> v;
        if (u > v) swap(u, v);
        graph[v].push_back(u);
    }

    Solve2::init();

    while(q--){
        int t, k; cin >> t >> k;
        vector<int> banned(k);
        for(int &i: banned) cin >> i;

        if (k >= BLOCK) Solve1::solve(t, banned);
        else Solve2::solve(t, banned);
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 4 ms 5880 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 3 ms 7320 KB Output is correct
7 Correct 3 ms 7260 KB Output is correct
8 Correct 5 ms 7260 KB Output is correct
9 Correct 6 ms 7428 KB Output is correct
10 Correct 5 ms 7260 KB Output is correct
11 Correct 5 ms 7260 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 5 ms 7260 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 3 ms 7260 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 4 ms 7256 KB Output is correct
18 Correct 5 ms 7256 KB Output is correct
19 Correct 4 ms 7276 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 4 ms 5880 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 3 ms 7320 KB Output is correct
7 Correct 3 ms 7260 KB Output is correct
8 Correct 5 ms 7260 KB Output is correct
9 Correct 6 ms 7428 KB Output is correct
10 Correct 5 ms 7260 KB Output is correct
11 Correct 5 ms 7260 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 5 ms 7260 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 3 ms 7260 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 4 ms 7256 KB Output is correct
18 Correct 5 ms 7256 KB Output is correct
19 Correct 4 ms 7276 KB Output is correct
20 Correct 54 ms 10064 KB Output is correct
21 Correct 57 ms 10108 KB Output is correct
22 Correct 57 ms 10068 KB Output is correct
23 Correct 58 ms 10076 KB Output is correct
24 Correct 469 ms 169524 KB Output is correct
25 Correct 468 ms 169520 KB Output is correct
26 Correct 463 ms 169556 KB Output is correct
27 Correct 396 ms 170212 KB Output is correct
28 Correct 373 ms 170208 KB Output is correct
29 Correct 379 ms 170432 KB Output is correct
30 Correct 365 ms 170044 KB Output is correct
31 Correct 504 ms 170400 KB Output is correct
32 Correct 374 ms 170208 KB Output is correct
33 Correct 295 ms 169752 KB Output is correct
34 Correct 411 ms 169560 KB Output is correct
35 Correct 300 ms 169540 KB Output is correct
36 Correct 357 ms 169788 KB Output is correct
37 Correct 466 ms 169932 KB Output is correct
38 Correct 366 ms 169796 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5720 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 4 ms 5880 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 3 ms 7320 KB Output is correct
7 Correct 3 ms 7260 KB Output is correct
8 Correct 5 ms 7260 KB Output is correct
9 Correct 6 ms 7428 KB Output is correct
10 Correct 5 ms 7260 KB Output is correct
11 Correct 5 ms 7260 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 5 ms 7260 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 3 ms 7260 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 4 ms 7256 KB Output is correct
18 Correct 5 ms 7256 KB Output is correct
19 Correct 4 ms 7276 KB Output is correct
20 Correct 54 ms 10064 KB Output is correct
21 Correct 57 ms 10108 KB Output is correct
22 Correct 57 ms 10068 KB Output is correct
23 Correct 58 ms 10076 KB Output is correct
24 Correct 469 ms 169524 KB Output is correct
25 Correct 468 ms 169520 KB Output is correct
26 Correct 463 ms 169556 KB Output is correct
27 Correct 396 ms 170212 KB Output is correct
28 Correct 373 ms 170208 KB Output is correct
29 Correct 379 ms 170432 KB Output is correct
30 Correct 365 ms 170044 KB Output is correct
31 Correct 504 ms 170400 KB Output is correct
32 Correct 374 ms 170208 KB Output is correct
33 Correct 295 ms 169752 KB Output is correct
34 Correct 411 ms 169560 KB Output is correct
35 Correct 300 ms 169540 KB Output is correct
36 Correct 357 ms 169788 KB Output is correct
37 Correct 466 ms 169932 KB Output is correct
38 Correct 366 ms 169796 KB Output is correct
39 Correct 545 ms 170524 KB Output is correct
40 Correct 473 ms 169772 KB Output is correct
41 Correct 479 ms 169520 KB Output is correct
42 Correct 565 ms 169540 KB Output is correct
43 Correct 473 ms 169524 KB Output is correct
44 Correct 107 ms 11324 KB Output is correct
45 Correct 71 ms 10524 KB Output is correct
46 Correct 62 ms 10288 KB Output is correct
47 Correct 82 ms 10472 KB Output is correct
48 Correct 55 ms 10056 KB Output is correct
49 Correct 485 ms 171052 KB Output is correct
50 Correct 390 ms 169696 KB Output is correct
51 Correct 104 ms 11056 KB Output is correct
52 Correct 57 ms 10316 KB Output is correct
53 Correct 446 ms 170468 KB Output is correct
54 Correct 561 ms 170396 KB Output is correct
55 Correct 358 ms 169276 KB Output is correct
56 Correct 461 ms 169304 KB Output is correct
57 Correct 105 ms 11064 KB Output is correct
58 Correct 106 ms 11244 KB Output is correct
59 Correct 58 ms 10420 KB Output is correct
60 Correct 59 ms 10640 KB Output is correct
61 Correct 416 ms 169920 KB Output is correct
62 Correct 426 ms 169284 KB Output is correct
63 Correct 532 ms 169272 KB Output is correct
64 Correct 504 ms 170020 KB Output is correct
65 Correct 591 ms 169508 KB Output is correct
66 Correct 712 ms 169276 KB Output is correct
67 Correct 479 ms 169692 KB Output is correct
68 Correct 575 ms 169540 KB Output is correct
69 Correct 666 ms 169660 KB Output is correct
70 Correct 379 ms 170016 KB Output is correct
71 Correct 364 ms 169580 KB Output is correct
72 Correct 470 ms 169536 KB Output is correct
73 Correct 419 ms 169852 KB Output is correct
74 Correct 377 ms 169540 KB Output is correct
75 Correct 490 ms 169524 KB Output is correct
76 Correct 474 ms 171328 KB Output is correct
77 Correct 388 ms 170060 KB Output is correct
78 Correct 400 ms 170216 KB Output is correct
79 Correct 111 ms 11268 KB Output is correct
80 Correct 63 ms 10272 KB Output is correct
81 Correct 54 ms 10064 KB Output is correct
82 Correct 487 ms 171216 KB Output is correct
83 Correct 616 ms 171328 KB Output is correct
84 Correct 391 ms 169948 KB Output is correct
85 Correct 546 ms 169956 KB Output is correct
86 Correct 385 ms 170316 KB Output is correct
87 Correct 502 ms 170056 KB Output is correct
88 Correct 125 ms 11328 KB Output is correct
89 Correct 120 ms 11324 KB Output is correct
90 Correct 60 ms 10320 KB Output is correct
91 Correct 64 ms 10312 KB Output is correct
92 Correct 62 ms 10072 KB Output is correct
93 Correct 65 ms 10152 KB Output is correct
94 Correct 379 ms 170828 KB Output is correct
95 Correct 483 ms 170812 KB Output is correct
96 Correct 326 ms 169596 KB Output is correct
97 Correct 429 ms 169756 KB Output is correct
98 Correct 322 ms 169600 KB Output is correct
99 Correct 409 ms 169716 KB Output is correct
100 Correct 121 ms 11412 KB Output is correct
101 Correct 111 ms 11320 KB Output is correct
102 Correct 71 ms 10384 KB Output is correct
103 Correct 62 ms 10384 KB Output is correct
104 Correct 57 ms 10180 KB Output is correct
105 Correct 59 ms 10016 KB Output is correct
106 Correct 479 ms 170804 KB Output is correct
107 Correct 585 ms 170532 KB Output is correct
108 Correct 397 ms 169568 KB Output is correct
109 Correct 481 ms 169508 KB Output is correct
110 Correct 371 ms 169804 KB Output is correct
111 Correct 479 ms 169764 KB Output is correct
112 Correct 109 ms 11288 KB Output is correct
113 Correct 108 ms 11428 KB Output is correct
114 Correct 61 ms 10260 KB Output is correct
115 Correct 62 ms 10376 KB Output is correct
116 Correct 55 ms 10068 KB Output is correct
117 Correct 55 ms 10320 KB Output is correct
118 Correct 389 ms 169700 KB Output is correct
119 Correct 364 ms 169292 KB Output is correct
120 Correct 477 ms 169484 KB Output is correct
121 Correct 395 ms 169780 KB Output is correct
122 Correct 361 ms 169288 KB Output is correct
123 Correct 498 ms 169280 KB Output is correct
124 Correct 412 ms 169704 KB Output is correct
125 Correct 357 ms 169296 KB Output is correct
126 Correct 493 ms 169344 KB Output is correct