oj.uz

답안 #111667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111667 2019-05-16T01:33:58 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 159224 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#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<vector<int>> G(n);
    int sq = 180;
    vector<vector<int>> dp(n, vector<int>(sq + 1, -INF)),
        idx(n, vector<int>(sq + 1, -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);
    }
    for(int i = 0; i < n; i++) {
        dp[i][0] = 0;
        idx[i][0] = i;
        sz[i] = 1;
    }
    vector<int> ndp(sq + 1, -INF), nid(sq + 1, -1);
    for(int i = 0; i < n; i++) {
        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;
            }
        }
    }
    vector<int> dp2(n, -INF), c(100010);
    while(q--) {
        int t, y;
        cin >> t >> y;
        --t;
        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 {
            for(int i = 0; i < n; i++) {
                if(!vis[i]) {
                    chmax(dp2[i], 0);
                }
                if(i == t) {
                    ans = dp2[t];
                }
                for(auto& e : G[i]) {
                    chmax(dp2[e], dp2[i] + 1);
                }
                dp2[i] = -INF;
            }
        }
        cout << max(ans, -1) << "\n";
        for(int i = 0; i < y; i++) {
            vis[c[i]] = 0;
        }
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 8 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 5 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 10 ms 2304 KB Output is correct
10 Correct 10 ms 2304 KB Output is correct
11 Correct 9 ms 2304 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 9 ms 2304 KB Output is correct
14 Correct 8 ms 2304 KB Output is correct
15 Correct 7 ms 2304 KB Output is correct
16 Correct 5 ms 2304 KB Output is correct
17 Correct 6 ms 2304 KB Output is correct
18 Correct 6 ms 2304 KB Output is correct
19 Correct 7 ms 2304 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 8 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 5 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 10 ms 2304 KB Output is correct
10 Correct 10 ms 2304 KB Output is correct
11 Correct 9 ms 2304 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 9 ms 2304 KB Output is correct
14 Correct 8 ms 2304 KB Output is correct
15 Correct 7 ms 2304 KB Output is correct
16 Correct 5 ms 2304 KB Output is correct
17 Correct 6 ms 2304 KB Output is correct
18 Correct 6 ms 2304 KB Output is correct
19 Correct 7 ms 2304 KB Output is correct
20 Correct 331 ms 3464 KB Output is correct
21 Correct 403 ms 3576 KB Output is correct
22 Correct 352 ms 3448 KB Output is correct
23 Correct 390 ms 3448 KB Output is correct
24 Correct 887 ms 155512 KB Output is correct
25 Correct 826 ms 155512 KB Output is correct
26 Correct 919 ms 155384 KB Output is correct
27 Correct 806 ms 156448 KB Output is correct
28 Correct 723 ms 156664 KB Output is correct
29 Correct 677 ms 156408 KB Output is correct
30 Correct 802 ms 155896 KB Output is correct
31 Correct 864 ms 155896 KB Output is correct
32 Correct 786 ms 155816 KB Output is correct
33 Correct 583 ms 156280 KB Output is correct
34 Correct 650 ms 156316 KB Output is correct
35 Correct 710 ms 156152 KB Output is correct
36 Correct 803 ms 156572 KB Output is correct
37 Correct 746 ms 156536 KB Output is correct
38 Correct 756 ms 156600 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 8 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 5 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 10 ms 2304 KB Output is correct
10 Correct 10 ms 2304 KB Output is correct
11 Correct 9 ms 2304 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 9 ms 2304 KB Output is correct
14 Correct 8 ms 2304 KB Output is correct
15 Correct 7 ms 2304 KB Output is correct
16 Correct 5 ms 2304 KB Output is correct
17 Correct 6 ms 2304 KB Output is correct
18 Correct 6 ms 2304 KB Output is correct
19 Correct 7 ms 2304 KB Output is correct
20 Correct 331 ms 3464 KB Output is correct
21 Correct 403 ms 3576 KB Output is correct
22 Correct 352 ms 3448 KB Output is correct
23 Correct 390 ms 3448 KB Output is correct
24 Correct 887 ms 155512 KB Output is correct
25 Correct 826 ms 155512 KB Output is correct
26 Correct 919 ms 155384 KB Output is correct
27 Correct 806 ms 156448 KB Output is correct
28 Correct 723 ms 156664 KB Output is correct
29 Correct 677 ms 156408 KB Output is correct
30 Correct 802 ms 155896 KB Output is correct
31 Correct 864 ms 155896 KB Output is correct
32 Correct 786 ms 155816 KB Output is correct
33 Correct 583 ms 156280 KB Output is correct
34 Correct 650 ms 156316 KB Output is correct
35 Correct 710 ms 156152 KB Output is correct
36 Correct 803 ms 156572 KB Output is correct
37 Correct 746 ms 156536 KB Output is correct
38 Correct 756 ms 156600 KB Output is correct
39 Correct 878 ms 155700 KB Output is correct
40 Correct 929 ms 155368 KB Output is correct
41 Correct 787 ms 155432 KB Output is correct
42 Correct 1139 ms 155512 KB Output is correct
43 Correct 869 ms 155516 KB Output is correct
44 Correct 412 ms 3832 KB Output is correct
45 Correct 429 ms 3576 KB Output is correct
46 Correct 363 ms 3448 KB Output is correct
47 Correct 448 ms 3580 KB Output is correct
48 Correct 388 ms 3576 KB Output is correct
49 Correct 875 ms 157048 KB Output is correct
50 Correct 784 ms 156536 KB Output is correct
51 Correct 404 ms 3960 KB Output is correct
52 Correct 337 ms 3576 KB Output is correct
53 Correct 883 ms 156840 KB Output is correct
54 Correct 741 ms 156952 KB Output is correct
55 Correct 689 ms 156516 KB Output is correct
56 Correct 740 ms 156444 KB Output is correct
57 Correct 381 ms 3832 KB Output is correct
58 Correct 378 ms 4060 KB Output is correct
59 Correct 452 ms 3448 KB Output is correct
60 Correct 421 ms 3492 KB Output is correct
61 Correct 983 ms 156472 KB Output is correct
62 Correct 881 ms 156536 KB Output is correct
63 Correct 1077 ms 156560 KB Output is correct
64 Correct 1372 ms 156664 KB Output is correct
65 Correct 1746 ms 156476 KB Output is correct
66 Correct 1720 ms 156536 KB Output is correct
67 Correct 1844 ms 156360 KB Output is correct
68 Execution timed out 2041 ms 159224 KB Time limit exceeded
69 Halted 0 ms 0 KB -