oj.uz

답안 #111720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111720 2019-05-16T03:13:14 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1905 ms 270300 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 = 320;
    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 2 ms 768 KB Output is correct
2 Correct 3 ms 896 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 6 ms 3328 KB Output is correct
6 Correct 8 ms 3456 KB Output is correct
7 Correct 6 ms 3328 KB Output is correct
8 Correct 13 ms 3328 KB Output is correct
9 Correct 13 ms 3428 KB Output is correct
10 Correct 9 ms 3476 KB Output is correct
11 Correct 15 ms 3456 KB Output is correct
12 Correct 9 ms 3456 KB Output is correct
13 Correct 15 ms 3476 KB Output is correct
14 Correct 16 ms 3456 KB Output is correct
15 Correct 10 ms 3456 KB Output is correct
16 Correct 10 ms 3328 KB Output is correct
17 Correct 10 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 11 ms 3456 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 896 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 6 ms 3328 KB Output is correct
6 Correct 8 ms 3456 KB Output is correct
7 Correct 6 ms 3328 KB Output is correct
8 Correct 13 ms 3328 KB Output is correct
9 Correct 13 ms 3428 KB Output is correct
10 Correct 9 ms 3476 KB Output is correct
11 Correct 15 ms 3456 KB Output is correct
12 Correct 9 ms 3456 KB Output is correct
13 Correct 15 ms 3476 KB Output is correct
14 Correct 16 ms 3456 KB Output is correct
15 Correct 10 ms 3456 KB Output is correct
16 Correct 10 ms 3328 KB Output is correct
17 Correct 10 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 11 ms 3456 KB Output is correct
20 Correct 679 ms 5312 KB Output is correct
21 Correct 489 ms 5368 KB Output is correct
22 Correct 453 ms 5240 KB Output is correct
23 Correct 553 ms 5368 KB Output is correct
24 Correct 946 ms 265720 KB Output is correct
25 Correct 1166 ms 265692 KB Output is correct
26 Correct 1064 ms 265924 KB Output is correct
27 Correct 1210 ms 266720 KB Output is correct
28 Correct 1185 ms 266840 KB Output is correct
29 Correct 1225 ms 266744 KB Output is correct
30 Correct 1165 ms 266012 KB Output is correct
31 Correct 1322 ms 265984 KB Output is correct
32 Correct 1139 ms 266120 KB Output is correct
33 Correct 1024 ms 266512 KB Output is correct
34 Correct 917 ms 266540 KB Output is correct
35 Correct 989 ms 266588 KB Output is correct
36 Correct 1046 ms 266684 KB Output is correct
37 Correct 1132 ms 266720 KB Output is correct
38 Correct 1162 ms 266744 KB Output is correct

Subtask #3
86.0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 896 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 6 ms 3328 KB Output is correct
6 Correct 8 ms 3456 KB Output is correct
7 Correct 6 ms 3328 KB Output is correct
8 Correct 13 ms 3328 KB Output is correct
9 Correct 13 ms 3428 KB Output is correct
10 Correct 9 ms 3476 KB Output is correct
11 Correct 15 ms 3456 KB Output is correct
12 Correct 9 ms 3456 KB Output is correct
13 Correct 15 ms 3476 KB Output is correct
14 Correct 16 ms 3456 KB Output is correct
15 Correct 10 ms 3456 KB Output is correct
16 Correct 10 ms 3328 KB Output is correct
17 Correct 10 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 11 ms 3456 KB Output is correct
20 Correct 679 ms 5312 KB Output is correct
21 Correct 489 ms 5368 KB Output is correct
22 Correct 453 ms 5240 KB Output is correct
23 Correct 553 ms 5368 KB Output is correct
24 Correct 946 ms 265720 KB Output is correct
25 Correct 1166 ms 265692 KB Output is correct
26 Correct 1064 ms 265924 KB Output is correct
27 Correct 1210 ms 266720 KB Output is correct
28 Correct 1185 ms 266840 KB Output is correct
29 Correct 1225 ms 266744 KB Output is correct
30 Correct 1165 ms 266012 KB Output is correct
31 Correct 1322 ms 265984 KB Output is correct
32 Correct 1139 ms 266120 KB Output is correct
33 Correct 1024 ms 266512 KB Output is correct
34 Correct 917 ms 266540 KB Output is correct
35 Correct 989 ms 266588 KB Output is correct
36 Correct 1046 ms 266684 KB Output is correct
37 Correct 1132 ms 266720 KB Output is correct
38 Correct 1162 ms 266744 KB Output is correct
39 Correct 1131 ms 265936 KB Output is correct
40 Correct 1097 ms 265592 KB Output is correct
41 Correct 1055 ms 265564 KB Output is correct
42 Correct 1492 ms 265596 KB Output is correct
43 Correct 1102 ms 265592 KB Output is correct
44 Correct 595 ms 5572 KB Output is correct
45 Correct 554 ms 4856 KB Output is correct
46 Correct 505 ms 4984 KB Output is correct
47 Correct 507 ms 4984 KB Output is correct
48 Correct 513 ms 4888 KB Output is correct
49 Correct 1259 ms 266980 KB Output is correct
50 Correct 1186 ms 266544 KB Output is correct
51 Correct 547 ms 5240 KB Output is correct
52 Correct 531 ms 4984 KB Output is correct
53 Correct 1210 ms 266728 KB Output is correct
54 Correct 1249 ms 266600 KB Output is correct
55 Correct 1102 ms 266392 KB Output is correct
56 Correct 1200 ms 266332 KB Output is correct
57 Correct 560 ms 5448 KB Output is correct
58 Correct 577 ms 5240 KB Output is correct
59 Correct 467 ms 4856 KB Output is correct
60 Correct 528 ms 4984 KB Output is correct
61 Correct 1431 ms 266232 KB Output is correct
62 Correct 1485 ms 266420 KB Output is correct
63 Correct 1445 ms 266368 KB Output is correct
64 Correct 1732 ms 266500 KB Output is correct
65 Correct 1905 ms 266564 KB Output is correct
66 Correct 1629 ms 266476 KB Output is correct
67 Correct 1317 ms 266388 KB Output is correct
68 Correct 1038 ms 268612 KB Output is correct
69 Correct 1125 ms 268596 KB Output is correct
70 Correct 1237 ms 268724 KB Output is correct
71 Correct 1152 ms 268928 KB Output is correct
72 Correct 1154 ms 268764 KB Output is correct
73 Correct 1267 ms 268764 KB Output is correct
74 Correct 1160 ms 268824 KB Output is correct
75 Correct 1194 ms 268920 KB Output is correct
76 Correct 1236 ms 270300 KB Output is correct
77 Correct 1082 ms 268908 KB Output is correct
78 Correct 1158 ms 268920 KB Output is correct
79 Correct 539 ms 7416 KB Output is correct
80 Correct 566 ms 6648 KB Output is correct
81 Correct 517 ms 6212 KB Output is correct
82 Correct 1366 ms 269524 KB Output is correct
83 Correct 1377 ms 269348 KB Output is correct
84 Correct 1199 ms 268252 KB Output is correct
85 Correct 1375 ms 268156 KB Output is correct
86 Correct 1236 ms 268152 KB Output is correct
87 Correct 1592 ms 268368 KB Output is correct
88 Correct 572 ms 7416 KB Output is correct
89 Correct 539 ms 7416 KB Output is correct
90 Correct 516 ms 6520 KB Output is correct
91 Correct 584 ms 6620 KB Output is correct
92 Correct 575 ms 6136 KB Output is correct
93 Correct 475 ms 6096 KB Output is correct
94 Correct 995 ms 269944 KB Output is correct
95 Correct 919 ms 269832 KB Output is correct
96 Correct 922 ms 268884 KB Output is correct
97 Correct 869 ms 268792 KB Output is correct
98 Correct 1185 ms 268792 KB Output is correct
99 Correct 980 ms 268792 KB Output is correct
100 Correct 680 ms 7416 KB Output is correct
101 Correct 640 ms 7416 KB Output is correct
102 Correct 597 ms 6648 KB Output is correct
103 Correct 573 ms 6648 KB Output is correct
104 Correct 635 ms 6392 KB Output is correct
105 Correct 596 ms 6264 KB Output is correct
106 Correct 1279 ms 270152 KB Output is correct
107 Correct 1169 ms 269932 KB Output is correct
108 Correct 1085 ms 268920 KB Output is correct
109 Correct 1040 ms 268912 KB Output is correct
110 Correct 1273 ms 269048 KB Output is correct
111 Correct 1095 ms 268920 KB Output is correct
112 Correct 573 ms 7544 KB Output is correct
113 Correct 491 ms 7416 KB Output is correct
114 Correct 503 ms 6492 KB Output is correct
115 Correct 593 ms 6464 KB Output is correct
116 Correct 477 ms 6120 KB Output is correct
117 Correct 462 ms 6136 KB Output is correct
118 Correct 1178 ms 268664 KB Output is correct
119 Correct 1176 ms 268792 KB Output is correct
120 Correct 1090 ms 268748 KB Output is correct
121 Correct 1295 ms 268808 KB Output is correct
122 Correct 1213 ms 268616 KB Output is correct
123 Correct 1098 ms 268652 KB Output is correct
124 Correct 1210 ms 268664 KB Output is correct
125 Correct 1147 ms 268788 KB Output is correct
126 Correct 1158 ms 268596 KB Output is correct