oj.uz

Submission #111581

# Submission time Handle Problem Language Result Execution time Memory
111581 2019-05-15T16:04:19 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 185456 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#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) - 100;
    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);
            }
        }
    }
    vector<int> ndp(sq + 1, -INF), nid(sq + 1, -1);
    for(auto& i : v) {
        for(auto& e : G[i]) {
            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;
        }
    }
}

Compilation message

bitaro.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
bitaro.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 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 5 ms 2176 KB Output is correct
6 Correct 6 ms 2176 KB Output is correct
7 Correct 5 ms 2176 KB Output is correct
8 Correct 8 ms 2176 KB Output is correct
9 Correct 8 ms 2176 KB Output is correct
10 Correct 9 ms 2176 KB Output is correct
11 Correct 9 ms 2176 KB Output is correct
12 Correct 8 ms 2176 KB Output is correct
13 Correct 9 ms 2176 KB Output is correct
14 Correct 8 ms 2176 KB Output is correct
15 Correct 6 ms 2176 KB Output is correct
16 Correct 7 ms 2176 KB Output is correct
17 Correct 6 ms 2176 KB Output is correct
18 Correct 6 ms 2176 KB Output is correct
19 Correct 7 ms 2176 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 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 5 ms 2176 KB Output is correct
6 Correct 6 ms 2176 KB Output is correct
7 Correct 5 ms 2176 KB Output is correct
8 Correct 8 ms 2176 KB Output is correct
9 Correct 8 ms 2176 KB Output is correct
10 Correct 9 ms 2176 KB Output is correct
11 Correct 9 ms 2176 KB Output is correct
12 Correct 8 ms 2176 KB Output is correct
13 Correct 9 ms 2176 KB Output is correct
14 Correct 8 ms 2176 KB Output is correct
15 Correct 6 ms 2176 KB Output is correct
16 Correct 7 ms 2176 KB Output is correct
17 Correct 6 ms 2176 KB Output is correct
18 Correct 6 ms 2176 KB Output is correct
19 Correct 7 ms 2176 KB Output is correct
20 Correct 476 ms 3344 KB Output is correct
21 Correct 528 ms 3320 KB Output is correct
22 Correct 418 ms 3448 KB Output is correct
23 Correct 435 ms 3320 KB Output is correct
24 Correct 893 ms 184148 KB Output is correct
25 Correct 916 ms 184272 KB Output is correct
26 Correct 991 ms 184236 KB Output is correct
27 Correct 970 ms 185184 KB Output is correct
28 Correct 890 ms 185456 KB Output is correct
29 Correct 1140 ms 185204 KB Output is correct
30 Correct 947 ms 184668 KB Output is correct
31 Correct 1061 ms 184564 KB Output is correct
32 Correct 964 ms 184592 KB Output is correct
33 Correct 798 ms 185160 KB Output is correct
34 Correct 805 ms 185184 KB Output is correct
35 Correct 844 ms 185188 KB Output is correct
36 Correct 945 ms 185176 KB Output is correct
37 Correct 919 ms 185300 KB Output is correct
38 Correct 876 ms 185256 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 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 5 ms 2176 KB Output is correct
6 Correct 6 ms 2176 KB Output is correct
7 Correct 5 ms 2176 KB Output is correct
8 Correct 8 ms 2176 KB Output is correct
9 Correct 8 ms 2176 KB Output is correct
10 Correct 9 ms 2176 KB Output is correct
11 Correct 9 ms 2176 KB Output is correct
12 Correct 8 ms 2176 KB Output is correct
13 Correct 9 ms 2176 KB Output is correct
14 Correct 8 ms 2176 KB Output is correct
15 Correct 6 ms 2176 KB Output is correct
16 Correct 7 ms 2176 KB Output is correct
17 Correct 6 ms 2176 KB Output is correct
18 Correct 6 ms 2176 KB Output is correct
19 Correct 7 ms 2176 KB Output is correct
20 Correct 476 ms 3344 KB Output is correct
21 Correct 528 ms 3320 KB Output is correct
22 Correct 418 ms 3448 KB Output is correct
23 Correct 435 ms 3320 KB Output is correct
24 Correct 893 ms 184148 KB Output is correct
25 Correct 916 ms 184272 KB Output is correct
26 Correct 991 ms 184236 KB Output is correct
27 Correct 970 ms 185184 KB Output is correct
28 Correct 890 ms 185456 KB Output is correct
29 Correct 1140 ms 185204 KB Output is correct
30 Correct 947 ms 184668 KB Output is correct
31 Correct 1061 ms 184564 KB Output is correct
32 Correct 964 ms 184592 KB Output is correct
33 Correct 798 ms 185160 KB Output is correct
34 Correct 805 ms 185184 KB Output is correct
35 Correct 844 ms 185188 KB Output is correct
36 Correct 945 ms 185176 KB Output is correct
37 Correct 919 ms 185300 KB Output is correct
38 Correct 876 ms 185256 KB Output is correct
39 Correct 869 ms 184032 KB Output is correct
40 Correct 947 ms 183784 KB Output is correct
41 Correct 868 ms 183936 KB Output is correct
42 Correct 1519 ms 184156 KB Output is correct
43 Correct 1004 ms 184236 KB Output is correct
44 Correct 454 ms 3704 KB Output is correct
45 Correct 370 ms 3320 KB Output is correct
46 Correct 389 ms 3448 KB Output is correct
47 Correct 415 ms 3448 KB Output is correct
48 Correct 403 ms 3448 KB Output is correct
49 Correct 964 ms 185384 KB Output is correct
50 Correct 1020 ms 184824 KB Output is correct
51 Correct 450 ms 3756 KB Output is correct
52 Correct 473 ms 3320 KB Output is correct
53 Correct 942 ms 185252 KB Output is correct
54 Correct 974 ms 185068 KB Output is correct
55 Correct 897 ms 184984 KB Output is correct
56 Correct 859 ms 184920 KB Output is correct
57 Correct 508 ms 3680 KB Output is correct
58 Correct 476 ms 3804 KB Output is correct
59 Correct 422 ms 3576 KB Output is correct
60 Correct 422 ms 3448 KB Output is correct
61 Correct 1450 ms 185168 KB Output is correct
62 Correct 1902 ms 185336 KB Output is correct
63 Correct 1506 ms 185272 KB Output is correct
64 Correct 1335 ms 185204 KB Output is correct
65 Execution timed out 2062 ms 185404 KB Time limit exceeded
66 Halted 0 ms 0 KB -