oj.uz

Submission #952201

# Submission time Handle Problem Language Result Execution time Memory
952201 2024-03-23T09:29:32 Z BhavayGoyal Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 847 ms 238632 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 1e5+5, SQRT = 100;
vi g[N];
vector<pair<int, int>> dp[N];

void sol() {
    int n, m, q; cin >> n >> m >> q;

    for (int i = 1; i <= m; i++) {
        int a, b; cin >> a >> b;
        g[b].pb(a);
    }

    dp[1].pb({0, 1});
    for (int i = 2; i <= n; i++) {
        dp[i].pb({0, i});
        for (auto ch : g[i]) {
            for (auto x : dp[ch]) {x.f++; dp[i].pb(x);}
        }
        sort(all(dp[i])); reverse(all(dp[i]));
        while (dp[i].size() > SQRT) dp[i].pop_back();
        reverse(all(dp[i]));
    }

    vi blocked(n+1, 0);
    while (q--) {
        int city, y; cin >> city >> y;
        vi cities;
        for (int i = 0; i < y; i++) {int x; cin >> x; cities.pb(x); blocked[x] = 1;}
        if (y >= SQRT) {
            vi dpp(n+1);
            for (int i = 1; i <= city; i++) {
                dpp[i] = (blocked[i]?-inf:0);
                for (auto ch : g[i]) {
                    dpp[i] = max(dpp[i], 1+dpp[ch]);
                }
            }
            cout << (dpp[city]<0?-1:dpp[city]) << endl;
        }
        else {
            vector<pii> temp;
            while (dp[city].size() && blocked[dp[city].back().s]) {
                temp.pb(dp[city].back());
                dp[city].pop_back();
            }
            cout << (dp[city].size()?dp[city].back().f:-1) << endl;

            while (temp.size()) {
                dp[city].pb(temp.back());
                temp.pop_back();
            }
        }
        // reset blocked array
        for (auto &i : cities) blocked[i] = 0;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 8 ms 6236 KB Output is correct
7 Correct 6 ms 6492 KB Output is correct
8 Correct 7 ms 7240 KB Output is correct
9 Correct 7 ms 7260 KB Output is correct
10 Correct 7 ms 7256 KB Output is correct
11 Correct 7 ms 7260 KB Output is correct
12 Correct 7 ms 6548 KB Output is correct
13 Correct 7 ms 7260 KB Output is correct
14 Correct 7 ms 6236 KB Output is correct
15 Correct 5 ms 5980 KB Output is correct
16 Correct 7 ms 6236 KB Output is correct
17 Correct 6 ms 6748 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 8 ms 6236 KB Output is correct
7 Correct 6 ms 6492 KB Output is correct
8 Correct 7 ms 7240 KB Output is correct
9 Correct 7 ms 7260 KB Output is correct
10 Correct 7 ms 7256 KB Output is correct
11 Correct 7 ms 7260 KB Output is correct
12 Correct 7 ms 6548 KB Output is correct
13 Correct 7 ms 7260 KB Output is correct
14 Correct 7 ms 6236 KB Output is correct
15 Correct 5 ms 5980 KB Output is correct
16 Correct 7 ms 6236 KB Output is correct
17 Correct 6 ms 6748 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct
20 Correct 610 ms 163004 KB Output is correct
21 Correct 629 ms 163412 KB Output is correct
22 Correct 618 ms 163128 KB Output is correct
23 Correct 600 ms 163784 KB Output is correct
24 Correct 578 ms 186836 KB Output is correct
25 Correct 569 ms 187480 KB Output is correct
26 Correct 585 ms 188088 KB Output is correct
27 Correct 530 ms 238300 KB Output is correct
28 Correct 553 ms 238632 KB Output is correct
29 Correct 566 ms 238540 KB Output is correct
30 Correct 545 ms 238272 KB Output is correct
31 Correct 622 ms 226608 KB Output is correct
32 Correct 535 ms 238452 KB Output is correct
33 Correct 549 ms 146400 KB Output is correct
34 Correct 532 ms 130240 KB Output is correct
35 Correct 531 ms 145252 KB Output is correct
36 Correct 462 ms 194448 KB Output is correct
37 Correct 590 ms 176332 KB Output is correct
38 Correct 500 ms 194304 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 8 ms 6236 KB Output is correct
7 Correct 6 ms 6492 KB Output is correct
8 Correct 7 ms 7240 KB Output is correct
9 Correct 7 ms 7260 KB Output is correct
10 Correct 7 ms 7256 KB Output is correct
11 Correct 7 ms 7260 KB Output is correct
12 Correct 7 ms 6548 KB Output is correct
13 Correct 7 ms 7260 KB Output is correct
14 Correct 7 ms 6236 KB Output is correct
15 Correct 5 ms 5980 KB Output is correct
16 Correct 7 ms 6236 KB Output is correct
17 Correct 6 ms 6748 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct
20 Correct 610 ms 163004 KB Output is correct
21 Correct 629 ms 163412 KB Output is correct
22 Correct 618 ms 163128 KB Output is correct
23 Correct 600 ms 163784 KB Output is correct
24 Correct 578 ms 186836 KB Output is correct
25 Correct 569 ms 187480 KB Output is correct
26 Correct 585 ms 188088 KB Output is correct
27 Correct 530 ms 238300 KB Output is correct
28 Correct 553 ms 238632 KB Output is correct
29 Correct 566 ms 238540 KB Output is correct
30 Correct 545 ms 238272 KB Output is correct
31 Correct 622 ms 226608 KB Output is correct
32 Correct 535 ms 238452 KB Output is correct
33 Correct 549 ms 146400 KB Output is correct
34 Correct 532 ms 130240 KB Output is correct
35 Correct 531 ms 145252 KB Output is correct
36 Correct 462 ms 194448 KB Output is correct
37 Correct 590 ms 176332 KB Output is correct
38 Correct 500 ms 194304 KB Output is correct
39 Correct 637 ms 184956 KB Output is correct
40 Correct 583 ms 184388 KB Output is correct
41 Correct 847 ms 185580 KB Output is correct
42 Correct 670 ms 187460 KB Output is correct
43 Correct 605 ms 185760 KB Output is correct
44 Incorrect 645 ms 163616 KB Output isn't correct
45 Halted 0 ms 0 KB -