oj.uz

Submission #881276

# Submission time Handle Problem Language Result Execution time Memory
881276 2023-12-01T03:15:38 Z bobbilyking Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 1040 ms 467724 KB 
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

#define NN 100010
#define M 1000000007 // 998244353

vector<ll> adj[NN];
ll n;
vector<ll> topo;

bool bad[NN];
ll dpfast[NN];
constexpr ll SN = 200;

vector<pl> dp[NN]; // only keep up to sqrt(N) things in here

int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);
    cin >> n; G(m) G(q)
    while (m--) {
        G(s) G(e) adj[e].push_back(s);
    } 

    {
        bool vis[NN] = {};
        vector<ll> temp;
        auto dfs = [&](auto&& self, ll i) -> void {
            if (vis[i]) return;
            vis[i] = 1;
            for (auto y: adj[i]) self(self, y);
            temp.push_back(i);
        };
        F(i, 1, n+1) if (!vis[i]) {
            temp.clear();
            dfs(dfs, i);
            topo.insert(topo.end(), temp.rbegin(), temp.rend());
        }
    }

    for (auto x: topo) {
        dp[x].emplace_back(0, x);
        for (auto y: adj[x]) {
            for (auto z: dp[y]) dp[x].emplace_back(z.K+1, z.V);
        }
        sort(A(dp[x]), greater());
        while (dp[x].size() > SN) dp[x].pop_back(); 
    }

    while (q--) {
        G(t) G(m)
        vector<ll> v(m);
        for (auto &x: v) {
            cin >> x;
            bad[x]=1;
        }
        if (m >= SN) {
          	memset(dpfast, 0, sizeof dpfast);
            for (auto x: v) dpfast[x] = -1e9;
            for (auto x: topo) {
                for (auto y: adj[x]) dpfast[x] = max(dpfast[x], 1 + dpfast[y]);
            }
            cout << (dpfast[t] < 0 ? -1: dpfast[t]) << '\n';
        } else {
            ll ans = -1;
            for (auto [dist, node]: dp[t]) if (!bad[node]) ans = max(ans, dist);
            cout << ans << '\n';
        }
        for (auto x: v) bad[x] = 0;
    }
    
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5720 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 8 ms 8120 KB Output is correct
6 Correct 7 ms 7772 KB Output is correct
7 Correct 8 ms 7772 KB Output is correct
8 Correct 11 ms 10072 KB Output is correct
9 Correct 10 ms 10124 KB Output is correct
10 Correct 11 ms 10152 KB Output is correct
11 Correct 11 ms 9820 KB Output is correct
12 Correct 9 ms 8336 KB Output is correct
13 Correct 11 ms 9820 KB Output is correct
14 Correct 12 ms 8028 KB Output is correct
15 Correct 7 ms 7004 KB Output is correct
16 Correct 11 ms 7832 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 7 ms 7256 KB Output is correct
19 Correct 10 ms 8796 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5720 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 8 ms 8120 KB Output is correct
6 Correct 7 ms 7772 KB Output is correct
7 Correct 8 ms 7772 KB Output is correct
8 Correct 11 ms 10072 KB Output is correct
9 Correct 10 ms 10124 KB Output is correct
10 Correct 11 ms 10152 KB Output is correct
11 Correct 11 ms 9820 KB Output is correct
12 Correct 9 ms 8336 KB Output is correct
13 Correct 11 ms 9820 KB Output is correct
14 Correct 12 ms 8028 KB Output is correct
15 Correct 7 ms 7004 KB Output is correct
16 Correct 11 ms 7832 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 7 ms 7256 KB Output is correct
19 Correct 10 ms 8796 KB Output is correct
20 Correct 841 ms 318356 KB Output is correct
21 Correct 852 ms 318392 KB Output is correct
22 Correct 813 ms 318048 KB Output is correct
23 Correct 795 ms 319400 KB Output is correct
24 Correct 883 ms 357468 KB Output is correct
25 Correct 850 ms 356588 KB Output is correct
26 Correct 899 ms 358356 KB Output is correct
27 Correct 777 ms 467628 KB Output is correct
28 Correct 765 ms 467724 KB Output is correct
29 Correct 773 ms 467656 KB Output is correct
30 Correct 740 ms 467636 KB Output is correct
31 Correct 897 ms 437876 KB Output is correct
32 Correct 756 ms 467284 KB Output is correct
33 Correct 899 ms 277804 KB Output is correct
34 Correct 816 ms 234780 KB Output is correct
35 Correct 809 ms 274660 KB Output is correct
36 Correct 647 ms 379420 KB Output is correct
37 Correct 913 ms 334288 KB Output is correct
38 Correct 727 ms 379900 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 2 ms 5720 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 8 ms 8120 KB Output is correct
6 Correct 7 ms 7772 KB Output is correct
7 Correct 8 ms 7772 KB Output is correct
8 Correct 11 ms 10072 KB Output is correct
9 Correct 10 ms 10124 KB Output is correct
10 Correct 11 ms 10152 KB Output is correct
11 Correct 11 ms 9820 KB Output is correct
12 Correct 9 ms 8336 KB Output is correct
13 Correct 11 ms 9820 KB Output is correct
14 Correct 12 ms 8028 KB Output is correct
15 Correct 7 ms 7004 KB Output is correct
16 Correct 11 ms 7832 KB Output is correct
17 Correct 9 ms 8796 KB Output is correct
18 Correct 7 ms 7256 KB Output is correct
19 Correct 10 ms 8796 KB Output is correct
20 Correct 841 ms 318356 KB Output is correct
21 Correct 852 ms 318392 KB Output is correct
22 Correct 813 ms 318048 KB Output is correct
23 Correct 795 ms 319400 KB Output is correct
24 Correct 883 ms 357468 KB Output is correct
25 Correct 850 ms 356588 KB Output is correct
26 Correct 899 ms 358356 KB Output is correct
27 Correct 777 ms 467628 KB Output is correct
28 Correct 765 ms 467724 KB Output is correct
29 Correct 773 ms 467656 KB Output is correct
30 Correct 740 ms 467636 KB Output is correct
31 Correct 897 ms 437876 KB Output is correct
32 Correct 756 ms 467284 KB Output is correct
33 Correct 899 ms 277804 KB Output is correct
34 Correct 816 ms 234780 KB Output is correct
35 Correct 809 ms 274660 KB Output is correct
36 Correct 647 ms 379420 KB Output is correct
37 Correct 913 ms 334288 KB Output is correct
38 Correct 727 ms 379900 KB Output is correct
39 Correct 969 ms 352548 KB Output is correct
40 Correct 889 ms 355788 KB Output is correct
41 Correct 957 ms 356416 KB Output is correct
42 Correct 1040 ms 357080 KB Output is correct
43 Correct 924 ms 356032 KB Output is correct
44 Incorrect 831 ms 320152 KB Output isn't correct
45 Halted 0 ms 0 KB -