oj.uz

Submission #111569

# Submission time Handle Problem Language Result Execution time Memory
111569 2019-05-15T15:47:01 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 150536 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);
    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);
        }
    }
    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);
            }
        }
    }
    int sq = sqrt(100000) - 150;
    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 < n; i++) {
        dp[i][0] = 0;
        idx[i][0] = i;
        sz[i] = 1;
    }
    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 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 7 ms 1764 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 10 ms 1964 KB Output is correct
9 Correct 8 ms 1792 KB Output is correct
10 Correct 11 ms 1764 KB Output is correct
11 Correct 10 ms 1792 KB Output is correct
12 Correct 8 ms 1820 KB Output is correct
13 Correct 8 ms 1816 KB Output is correct
14 Correct 8 ms 1792 KB Output is correct
15 Correct 6 ms 1792 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 8 ms 1792 KB Output is correct
18 Correct 9 ms 1792 KB Output is correct
19 Correct 7 ms 1792 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 7 ms 1764 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 10 ms 1964 KB Output is correct
9 Correct 8 ms 1792 KB Output is correct
10 Correct 11 ms 1764 KB Output is correct
11 Correct 10 ms 1792 KB Output is correct
12 Correct 8 ms 1820 KB Output is correct
13 Correct 8 ms 1816 KB Output is correct
14 Correct 8 ms 1792 KB Output is correct
15 Correct 6 ms 1792 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 8 ms 1792 KB Output is correct
18 Correct 9 ms 1792 KB Output is correct
19 Correct 7 ms 1792 KB Output is correct
20 Correct 451 ms 2948 KB Output is correct
21 Correct 411 ms 2964 KB Output is correct
22 Correct 385 ms 2956 KB Output is correct
23 Correct 409 ms 2972 KB Output is correct
24 Correct 819 ms 146548 KB Output is correct
25 Correct 818 ms 146568 KB Output is correct
26 Correct 763 ms 146516 KB Output is correct
27 Correct 778 ms 147572 KB Output is correct
28 Correct 783 ms 147592 KB Output is correct
29 Correct 820 ms 147588 KB Output is correct
30 Correct 793 ms 146928 KB Output is correct
31 Correct 922 ms 146892 KB Output is correct
32 Correct 818 ms 147060 KB Output is correct
33 Correct 681 ms 147588 KB Output is correct
34 Correct 806 ms 147432 KB Output is correct
35 Correct 728 ms 147464 KB Output is correct
36 Correct 819 ms 147700 KB Output is correct
37 Correct 764 ms 147712 KB Output is correct
38 Correct 808 ms 147824 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 7 ms 1764 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 10 ms 1964 KB Output is correct
9 Correct 8 ms 1792 KB Output is correct
10 Correct 11 ms 1764 KB Output is correct
11 Correct 10 ms 1792 KB Output is correct
12 Correct 8 ms 1820 KB Output is correct
13 Correct 8 ms 1816 KB Output is correct
14 Correct 8 ms 1792 KB Output is correct
15 Correct 6 ms 1792 KB Output is correct
16 Correct 6 ms 1792 KB Output is correct
17 Correct 8 ms 1792 KB Output is correct
18 Correct 9 ms 1792 KB Output is correct
19 Correct 7 ms 1792 KB Output is correct
20 Correct 451 ms 2948 KB Output is correct
21 Correct 411 ms 2964 KB Output is correct
22 Correct 385 ms 2956 KB Output is correct
23 Correct 409 ms 2972 KB Output is correct
24 Correct 819 ms 146548 KB Output is correct
25 Correct 818 ms 146568 KB Output is correct
26 Correct 763 ms 146516 KB Output is correct
27 Correct 778 ms 147572 KB Output is correct
28 Correct 783 ms 147592 KB Output is correct
29 Correct 820 ms 147588 KB Output is correct
30 Correct 793 ms 146928 KB Output is correct
31 Correct 922 ms 146892 KB Output is correct
32 Correct 818 ms 147060 KB Output is correct
33 Correct 681 ms 147588 KB Output is correct
34 Correct 806 ms 147432 KB Output is correct
35 Correct 728 ms 147464 KB Output is correct
36 Correct 819 ms 147700 KB Output is correct
37 Correct 764 ms 147712 KB Output is correct
38 Correct 808 ms 147824 KB Output is correct
39 Correct 908 ms 146212 KB Output is correct
40 Correct 789 ms 146032 KB Output is correct
41 Correct 808 ms 146088 KB Output is correct
42 Correct 1729 ms 146532 KB Output is correct
43 Correct 974 ms 146532 KB Output is correct
44 Correct 400 ms 3336 KB Output is correct
45 Correct 402 ms 3036 KB Output is correct
46 Correct 370 ms 2952 KB Output is correct
47 Correct 400 ms 3064 KB Output is correct
48 Correct 333 ms 2936 KB Output is correct
49 Correct 964 ms 147572 KB Output is correct
50 Correct 755 ms 147064 KB Output is correct
51 Correct 347 ms 3448 KB Output is correct
52 Correct 295 ms 2936 KB Output is correct
53 Correct 878 ms 147560 KB Output is correct
54 Correct 997 ms 150536 KB Output is correct
55 Correct 832 ms 149720 KB Output is correct
56 Correct 910 ms 149716 KB Output is correct
57 Correct 329 ms 5596 KB Output is correct
58 Correct 389 ms 5624 KB Output is correct
59 Correct 385 ms 4856 KB Output is correct
60 Correct 395 ms 4856 KB Output is correct
61 Correct 1199 ms 150140 KB Output is correct
62 Correct 1568 ms 150300 KB Output is correct
63 Correct 1605 ms 150248 KB Output is correct
64 Correct 1364 ms 150248 KB Output is correct
65 Execution timed out 2059 ms 150100 KB Time limit exceeded
66 Halted 0 ms 0 KB -