oj.uz

Submission #111576

# Submission time Handle Problem Language Result Execution time Memory
111576 2019-05-15T15:53:26 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1964 ms 263648 KB 
#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T>
bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T>
bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for(int i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "\n" : " ");
    }
    return os;
}
template <typename T>
vector<T> make_v(size_t a) {
    return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
    t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
    for(auto& e : t) {
        fill_v(e, v);
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m, q;
    cin >> n >> m >> q;
    vector<int> v, in(n);
    vector<vector<int>> G(n);
    int sq = sqrt(100000);
    auto dp = make_v<int>(n, sq + 1);
    auto idx = make_v<int>(n, sq + 1);
    fill_v(dp, -INF);
    fill_v(idx, -1);
    vector<int> sz(n), vis(n);
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        --a;
        --b;
        G[a].push_back(b);
        in[b]++;
    }
    stack<int> st;
    for(int i = 0; i < n; i++) {
        if(in[i] == 0) {
            st.push(i);
        }
        dp[i][0] = 0;
        idx[i][0] = i;
        sz[i] = 1;
    }
    while(!st.empty()) {
        int i = st.top();
        v.push_back(i);
        st.pop();
        for(auto e : G[i]) {
            in[e]--;
            if(in[e] == 0) {
                st.push(e);
            }
        }
    }
    for(auto& i : v) {
        for(auto& e : G[i]) {
            vector<int> ndp(sq + 1, -INF), nid(sq + 1, -1);
            int a = 0, b = 0, t = 0;
            while(a < sz[i] || b < sz[e]) {
                if(t >= sq) {
                    break;
                }
                while(a < sz[i] && vis[idx[i][a]]) {
                    a++;
                }
                while(b < sz[e] && vis[idx[e][b]]) {
                    b++;
                }
                if(a >= sz[i] && b >= sz[e]) {
                    break;
                }
                if(a >= sz[i]) {
                    ndp[t] = dp[e][b];
                    nid[t] = idx[e][b];
                    b++;
                } else if(b >= sz[e] || dp[i][a] + 1 > dp[e][b]) {
                    ndp[t] = dp[i][a] + 1;
                    nid[t] = idx[i][a];
                    a++;
                } else {
                    ndp[t] = dp[e][b];
                    nid[t] = idx[e][b];
                    b++;
                }
                vis[nid[t]] = 1;
                t++;
            }
            sz[e] = t;
            for(int j = 0; j < t; j++) {
                dp[e][j] = ndp[j];
                idx[e][j] = nid[j];
                vis[nid[j]] = 0;
            }
        }
    }
    while(q--) {
        int t, y;
        cin >> t >> y;
        --t;
        vector<int> c(y);
        for(int i = 0; i < y; i++) {
            cin >> c[i];
            --c[i];
            vis[c[i]] = 1;
        }
        int ans = -INF;
        if(y <= sq) {
            for(int i = 0; i <= sq; i++) {
                if(!vis[idx[t][i]]) {
                    ans = dp[t][i];
                    break;
                }
            }
        } else {
            vector<int> dp2(n, -INF);
            for(auto& i : v) {
                if(!vis[i]) {
                    chmax(dp2[i], 0);
                }
                for(auto e : G[i]) {
                    chmax(dp2[e], dp2[i] + 1);
                }
            }
            ans = dp2[t];
        }
        cout << max(ans, -1) << "\n";
        for(int i = 0; i < y; i++) {
            vis[c[i]] = 0;
        }
    }
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 9 ms 2944 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 7 ms 2944 KB Output is correct
8 Correct 11 ms 2944 KB Output is correct
9 Correct 16 ms 2944 KB Output is correct
10 Correct 12 ms 2944 KB Output is correct
11 Correct 9 ms 2944 KB Output is correct
12 Correct 7 ms 2944 KB Output is correct
13 Correct 9 ms 2944 KB Output is correct
14 Correct 9 ms 2944 KB Output is correct
15 Correct 10 ms 2944 KB Output is correct
16 Correct 10 ms 2944 KB Output is correct
17 Correct 9 ms 2944 KB Output is correct
18 Correct 11 ms 3020 KB Output is correct
19 Correct 13 ms 2944 KB Output is correct
20 Correct 527 ms 4144 KB Output is correct
21 Correct 556 ms 4156 KB Output is correct
22 Correct 657 ms 4140 KB Output is correct
23 Correct 741 ms 4344 KB Output is correct
24 Correct 1305 ms 262528 KB Output is correct
25 Correct 1110 ms 262484 KB Output is correct
26 Correct 1144 ms 262544 KB Output is correct
27 Correct 1266 ms 263628 KB Output is correct
28 Correct 1325 ms 263536 KB Output is correct
29 Correct 1344 ms 263588 KB Output is correct
30 Correct 1397 ms 262856 KB Output is correct
31 Correct 1413 ms 262840 KB Output is correct
32 Correct 1541 ms 262848 KB Output is correct
33 Correct 1217 ms 263268 KB Output is correct
34 Correct 1142 ms 263296 KB Output is correct
35 Correct 1107 ms 263624 KB Output is correct
36 Correct 1343 ms 263612 KB Output is correct
37 Correct 1271 ms 263540 KB Output is correct
38 Correct 1340 ms 263616 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 9 ms 2944 KB Output is correct
6 Correct 7 ms 2944 KB Output is correct
7 Correct 7 ms 2944 KB Output is correct
8 Correct 11 ms 2944 KB Output is correct
9 Correct 16 ms 2944 KB Output is correct
10 Correct 12 ms 2944 KB Output is correct
11 Correct 9 ms 2944 KB Output is correct
12 Correct 7 ms 2944 KB Output is correct
13 Correct 9 ms 2944 KB Output is correct
14 Correct 9 ms 2944 KB Output is correct
15 Correct 10 ms 2944 KB Output is correct
16 Correct 10 ms 2944 KB Output is correct
17 Correct 9 ms 2944 KB Output is correct
18 Correct 11 ms 3020 KB Output is correct
19 Correct 13 ms 2944 KB Output is correct
20 Correct 527 ms 4144 KB Output is correct
21 Correct 556 ms 4156 KB Output is correct
22 Correct 657 ms 4140 KB Output is correct
23 Correct 741 ms 4344 KB Output is correct
24 Correct 1305 ms 262528 KB Output is correct
25 Correct 1110 ms 262484 KB Output is correct
26 Correct 1144 ms 262544 KB Output is correct
27 Correct 1266 ms 263628 KB Output is correct
28 Correct 1325 ms 263536 KB Output is correct
29 Correct 1344 ms 263588 KB Output is correct
30 Correct 1397 ms 262856 KB Output is correct
31 Correct 1413 ms 262840 KB Output is correct
32 Correct 1541 ms 262848 KB Output is correct
33 Correct 1217 ms 263268 KB Output is correct
34 Correct 1142 ms 263296 KB Output is correct
35 Correct 1107 ms 263624 KB Output is correct
36 Correct 1343 ms 263612 KB Output is correct
37 Correct 1271 ms 263540 KB Output is correct
38 Correct 1340 ms 263616 KB Output is correct
39 Correct 1233 ms 262200 KB Output is correct
40 Correct 1107 ms 262232 KB Output is correct
41 Correct 1144 ms 262244 KB Output is correct
42 Correct 1484 ms 262364 KB Output is correct
43 Correct 1150 ms 262448 KB Output is correct
44 Correct 651 ms 4600 KB Output is correct
45 Correct 663 ms 4216 KB Output is correct
46 Correct 597 ms 4216 KB Output is correct
47 Correct 593 ms 4316 KB Output is correct
48 Correct 565 ms 4148 KB Output is correct
49 Correct 1449 ms 263572 KB Output is correct
50 Correct 1355 ms 263156 KB Output is correct
51 Correct 665 ms 4568 KB Output is correct
52 Correct 557 ms 4216 KB Output is correct
53 Correct 1328 ms 263516 KB Output is correct
54 Correct 1366 ms 263416 KB Output is correct
55 Correct 1305 ms 263132 KB Output is correct
56 Correct 1390 ms 263232 KB Output is correct
57 Correct 554 ms 4600 KB Output is correct
58 Correct 590 ms 4528 KB Output is correct
59 Correct 559 ms 4216 KB Output is correct
60 Correct 551 ms 4216 KB Output is correct
61 Correct 1411 ms 263384 KB Output is correct
62 Correct 1803 ms 263648 KB Output is correct
63 Correct 1692 ms 263400 KB Output is correct
64 Incorrect 1964 ms 263544 KB Output isn't correct
65 Halted 0 ms 0 KB -