oj.uz

Submission #952196

# Submission time Handle Problem Language Result Execution time Memory
952196 2024-03-23T09:24:52 Z BhavayGoyal Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 824 ms 238584 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];
int blocked[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();
    }

    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 {
            int ans = -1;
            for (auto &i : dp[city]) {
                if (!blocked[i.s]) {ans = i.f; break;}
            }
            cout << ans << endl;
        }
        // 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 1 ms 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 2 ms 5464 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 8 ms 6860 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 7 ms 6492 KB Output is correct
8 Correct 6 ms 7516 KB Output is correct
9 Correct 7 ms 7516 KB Output is correct
10 Correct 7 ms 7516 KB Output is correct
11 Correct 7 ms 7516 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 6 ms 7512 KB Output is correct
14 Correct 7 ms 6480 KB Output is correct
15 Correct 5 ms 6232 KB Output is correct
16 Correct 8 ms 6492 KB Output is correct
17 Correct 5 ms 7000 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 8 ms 7004 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 2 ms 5464 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 8 ms 6860 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 7 ms 6492 KB Output is correct
8 Correct 6 ms 7516 KB Output is correct
9 Correct 7 ms 7516 KB Output is correct
10 Correct 7 ms 7516 KB Output is correct
11 Correct 7 ms 7516 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 6 ms 7512 KB Output is correct
14 Correct 7 ms 6480 KB Output is correct
15 Correct 5 ms 6232 KB Output is correct
16 Correct 8 ms 6492 KB Output is correct
17 Correct 5 ms 7000 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 8 ms 7004 KB Output is correct
20 Correct 560 ms 163336 KB Output is correct
21 Correct 604 ms 163460 KB Output is correct
22 Correct 601 ms 163220 KB Output is correct
23 Correct 550 ms 164284 KB Output is correct
24 Correct 532 ms 186824 KB Output is correct
25 Correct 534 ms 187340 KB Output is correct
26 Correct 546 ms 187920 KB Output is correct
27 Correct 553 ms 238296 KB Output is correct
28 Correct 534 ms 238584 KB Output is correct
29 Correct 570 ms 238300 KB Output is correct
30 Correct 532 ms 238232 KB Output is correct
31 Correct 589 ms 226520 KB Output is correct
32 Correct 532 ms 238300 KB Output is correct
33 Correct 551 ms 146616 KB Output is correct
34 Correct 528 ms 130056 KB Output is correct
35 Correct 505 ms 145120 KB Output is correct
36 Correct 470 ms 194456 KB Output is correct
37 Correct 564 ms 176260 KB Output is correct
38 Correct 496 ms 194248 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 2 ms 5464 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 8 ms 6860 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 7 ms 6492 KB Output is correct
8 Correct 6 ms 7516 KB Output is correct
9 Correct 7 ms 7516 KB Output is correct
10 Correct 7 ms 7516 KB Output is correct
11 Correct 7 ms 7516 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 6 ms 7512 KB Output is correct
14 Correct 7 ms 6480 KB Output is correct
15 Correct 5 ms 6232 KB Output is correct
16 Correct 8 ms 6492 KB Output is correct
17 Correct 5 ms 7000 KB Output is correct
18 Correct 5 ms 6236 KB Output is correct
19 Correct 8 ms 7004 KB Output is correct
20 Correct 560 ms 163336 KB Output is correct
21 Correct 604 ms 163460 KB Output is correct
22 Correct 601 ms 163220 KB Output is correct
23 Correct 550 ms 164284 KB Output is correct
24 Correct 532 ms 186824 KB Output is correct
25 Correct 534 ms 187340 KB Output is correct
26 Correct 546 ms 187920 KB Output is correct
27 Correct 553 ms 238296 KB Output is correct
28 Correct 534 ms 238584 KB Output is correct
29 Correct 570 ms 238300 KB Output is correct
30 Correct 532 ms 238232 KB Output is correct
31 Correct 589 ms 226520 KB Output is correct
32 Correct 532 ms 238300 KB Output is correct
33 Correct 551 ms 146616 KB Output is correct
34 Correct 528 ms 130056 KB Output is correct
35 Correct 505 ms 145120 KB Output is correct
36 Correct 470 ms 194456 KB Output is correct
37 Correct 564 ms 176260 KB Output is correct
38 Correct 496 ms 194248 KB Output is correct
39 Correct 619 ms 184976 KB Output is correct
40 Correct 543 ms 184284 KB Output is correct
41 Correct 824 ms 188260 KB Output is correct
42 Correct 616 ms 190144 KB Output is correct
43 Correct 571 ms 188696 KB Output is correct
44 Incorrect 596 ms 166164 KB Output isn't correct
45 Halted 0 ms 0 KB -