oj.uz

Submission #111538

# Submission time Handle Problem Language Result Execution time Memory
111538 2019-05-15T14:56:04 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1676 ms 263604 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);
    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;
                }
                if(a >= sz[i]) {
                    ndp[t] = dp[e][b];
                    nid[t] = idx[e][b];
                    b++;
                } else if(b >= sz[i] || 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++;
                }
                if(nid[t] >= 0) {
                    vis[nid[t]] = 1;
                }
                t++;
            }
            sz[e] = t;
            for(int j = 0; j <= sq; j++) {
                dp[e][j] = ndp[j];
                idx[e][j] = nid[j];
                if(nid[j] >= 0) {
                    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;
        }
        ll 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, -1LL) << endl;
        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 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 8 ms 2944 KB Output is correct
6 Correct 12 ms 2944 KB Output is correct
7 Correct 9 ms 2944 KB Output is correct
8 Correct 9 ms 2944 KB Output is correct
9 Correct 9 ms 2944 KB Output is correct
10 Correct 10 ms 2944 KB Output is correct
11 Correct 10 ms 2944 KB Output is correct
12 Correct 10 ms 2944 KB Output is correct
13 Correct 10 ms 2944 KB Output is correct
14 Correct 10 ms 2944 KB Output is correct
15 Correct 10 ms 2944 KB Output is correct
16 Correct 9 ms 2944 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 9 ms 2944 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 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 8 ms 2944 KB Output is correct
6 Correct 12 ms 2944 KB Output is correct
7 Correct 9 ms 2944 KB Output is correct
8 Correct 9 ms 2944 KB Output is correct
9 Correct 9 ms 2944 KB Output is correct
10 Correct 10 ms 2944 KB Output is correct
11 Correct 10 ms 2944 KB Output is correct
12 Correct 10 ms 2944 KB Output is correct
13 Correct 10 ms 2944 KB Output is correct
14 Correct 10 ms 2944 KB Output is correct
15 Correct 10 ms 2944 KB Output is correct
16 Correct 9 ms 2944 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 9 ms 2944 KB Output is correct
19 Correct 13 ms 2944 KB Output is correct
20 Correct 503 ms 4240 KB Output is correct
21 Correct 514 ms 4092 KB Output is correct
22 Correct 665 ms 4220 KB Output is correct
23 Correct 450 ms 4344 KB Output is correct
24 Correct 1261 ms 262676 KB Output is correct
25 Correct 1172 ms 262484 KB Output is correct
26 Correct 1314 ms 262412 KB Output is correct
27 Correct 1173 ms 263396 KB Output is correct
28 Correct 1012 ms 263512 KB Output is correct
29 Correct 1110 ms 263412 KB Output is correct
30 Correct 1367 ms 262772 KB Output is correct
31 Correct 1360 ms 262764 KB Output is correct
32 Correct 1174 ms 262772 KB Output is correct
33 Correct 1191 ms 263408 KB Output is correct
34 Correct 1153 ms 263264 KB Output is correct
35 Correct 1125 ms 263268 KB Output is correct
36 Correct 1204 ms 263516 KB Output is correct
37 Correct 1255 ms 263604 KB Output is correct
38 Correct 1298 ms 263604 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 8 ms 2944 KB Output is correct
6 Correct 12 ms 2944 KB Output is correct
7 Correct 9 ms 2944 KB Output is correct
8 Correct 9 ms 2944 KB Output is correct
9 Correct 9 ms 2944 KB Output is correct
10 Correct 10 ms 2944 KB Output is correct
11 Correct 10 ms 2944 KB Output is correct
12 Correct 10 ms 2944 KB Output is correct
13 Correct 10 ms 2944 KB Output is correct
14 Correct 10 ms 2944 KB Output is correct
15 Correct 10 ms 2944 KB Output is correct
16 Correct 9 ms 2944 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 9 ms 2944 KB Output is correct
19 Correct 13 ms 2944 KB Output is correct
20 Correct 503 ms 4240 KB Output is correct
21 Correct 514 ms 4092 KB Output is correct
22 Correct 665 ms 4220 KB Output is correct
23 Correct 450 ms 4344 KB Output is correct
24 Correct 1261 ms 262676 KB Output is correct
25 Correct 1172 ms 262484 KB Output is correct
26 Correct 1314 ms 262412 KB Output is correct
27 Correct 1173 ms 263396 KB Output is correct
28 Correct 1012 ms 263512 KB Output is correct
29 Correct 1110 ms 263412 KB Output is correct
30 Correct 1367 ms 262772 KB Output is correct
31 Correct 1360 ms 262764 KB Output is correct
32 Correct 1174 ms 262772 KB Output is correct
33 Correct 1191 ms 263408 KB Output is correct
34 Correct 1153 ms 263264 KB Output is correct
35 Correct 1125 ms 263268 KB Output is correct
36 Correct 1204 ms 263516 KB Output is correct
37 Correct 1255 ms 263604 KB Output is correct
38 Correct 1298 ms 263604 KB Output is correct
39 Correct 1443 ms 262072 KB Output is correct
40 Correct 1258 ms 262028 KB Output is correct
41 Correct 1231 ms 261872 KB Output is correct
42 Correct 1676 ms 262232 KB Output is correct
43 Correct 1271 ms 262384 KB Output is correct
44 Incorrect 680 ms 4572 KB Output isn't correct
45 Halted 0 ms 0 KB -