oj.uz

답안 #655699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
655699 2022-11-05T10:29:45 Z KiriLL1ca Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 311576 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'
#define mp make_pair
#define vec vector

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef unsigned int uint;

template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T>
using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

inline void solve () {
        const int N = 50005;
        int n, k; cin >> n >> k;
        vector <vector <int>> g (n);
        vector <bitset <N>> bt (n);
        for (int i = 0; i < n; ++i) {
                int k; cin >> k;
                while (k--) {
                        int x; cin >> x;
                        g[i].pb(x); bt[i][x] = 1;
                }
        }
        int ans = 0;
        for (int i = 0; i < n; ++i) {
                for (int msk = 0; msk < pw(sz(g[i])); ++msk) {
                        if (__builtin_popcount(msk) + 1 <= ans) continue;
                        bitset <N> need; need[i] = 1;
                        for (int j = 0; j < sz(g[i]); ++j) if (msk >> j & 1) need[g[i][j]] = 1;
                        bool ok = 1;
                        for (int j = 0; j < sz(g[i]); ++j) {
                                if (!(msk >> j & 1)) continue;
                                need[g[i][j]] = 0;
                                ok &= (need == (bt[g[i][j]] & need));
                                need[g[i][j]] = 1;
                        }
                        if (ok) umax(ans, __builtin_popcount(msk) + 1);
                }
        }
        cout << ans << endl;
}

signed main() {
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        #ifdef LOCAL
                freopen("input.txt", "r", stdin);
                freopen("output.txt", "w", stdout);
        #endif
        int t = 1; // cin >> t;
        while (t--) solve();
        return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 151 ms 31248 KB Output is correct
4 Correct 89 ms 31228 KB Output is correct
5 Correct 90 ms 31188 KB Output is correct
6 Correct 99 ms 31296 KB Output is correct
7 Correct 103 ms 31288 KB Output is correct
8 Correct 14 ms 31060 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 17 ms 31064 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 151 ms 31248 KB Output is correct
4 Correct 89 ms 31228 KB Output is correct
5 Correct 90 ms 31188 KB Output is correct
6 Correct 99 ms 31296 KB Output is correct
7 Correct 103 ms 31288 KB Output is correct
8 Correct 14 ms 31060 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 17 ms 31064 KB Output is correct
11 Correct 92 ms 31276 KB Output is correct
12 Correct 84 ms 31308 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 85 ms 31316 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 103 ms 31256 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 98 ms 31188 KB Output is correct
19 Correct 14 ms 30976 KB Output is correct
20 Correct 15 ms 31244 KB Output is correct
21 Correct 15 ms 31240 KB Output is correct
22 Correct 14 ms 31060 KB Output is correct
23 Correct 71 ms 31180 KB Output is correct
24 Correct 13 ms 31060 KB Output is correct
25 Correct 68 ms 31248 KB Output is correct
26 Correct 65 ms 31188 KB Output is correct
27 Correct 25 ms 31156 KB Output is correct
28 Correct 71 ms 31260 KB Output is correct
29 Correct 31 ms 31188 KB Output is correct
30 Correct 38 ms 31372 KB Output is correct
31 Correct 64 ms 31236 KB Output is correct
32 Correct 35 ms 31208 KB Output is correct
33 Correct 56 ms 31284 KB Output is correct
34 Correct 56 ms 31188 KB Output is correct
35 Correct 29 ms 15700 KB Output is correct
36 Correct 30 ms 15716 KB Output is correct
37 Correct 28 ms 15700 KB Output is correct
38 Execution timed out 3072 ms 8020 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 31060 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Execution timed out 3057 ms 311576 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 151 ms 31248 KB Output is correct
4 Correct 89 ms 31228 KB Output is correct
5 Correct 90 ms 31188 KB Output is correct
6 Correct 99 ms 31296 KB Output is correct
7 Correct 103 ms 31288 KB Output is correct
8 Correct 14 ms 31060 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 17 ms 31064 KB Output is correct
11 Correct 92 ms 31276 KB Output is correct
12 Correct 84 ms 31308 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 85 ms 31316 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 103 ms 31256 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 98 ms 31188 KB Output is correct
19 Correct 14 ms 30976 KB Output is correct
20 Correct 15 ms 31244 KB Output is correct
21 Correct 15 ms 31240 KB Output is correct
22 Correct 14 ms 31060 KB Output is correct
23 Correct 71 ms 31180 KB Output is correct
24 Correct 13 ms 31060 KB Output is correct
25 Correct 68 ms 31248 KB Output is correct
26 Correct 65 ms 31188 KB Output is correct
27 Correct 25 ms 31156 KB Output is correct
28 Correct 71 ms 31260 KB Output is correct
29 Correct 31 ms 31188 KB Output is correct
30 Correct 38 ms 31372 KB Output is correct
31 Correct 64 ms 31236 KB Output is correct
32 Correct 35 ms 31208 KB Output is correct
33 Correct 56 ms 31284 KB Output is correct
34 Correct 56 ms 31188 KB Output is correct
35 Correct 29 ms 15700 KB Output is correct
36 Correct 30 ms 15716 KB Output is correct
37 Correct 28 ms 15700 KB Output is correct
38 Execution timed out 3072 ms 8020 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 151 ms 31248 KB Output is correct
4 Correct 89 ms 31228 KB Output is correct
5 Correct 90 ms 31188 KB Output is correct
6 Correct 99 ms 31296 KB Output is correct
7 Correct 103 ms 31288 KB Output is correct
8 Correct 14 ms 31060 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 17 ms 31064 KB Output is correct
11 Correct 92 ms 31276 KB Output is correct
12 Correct 84 ms 31308 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 85 ms 31316 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 103 ms 31256 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 98 ms 31188 KB Output is correct
19 Correct 14 ms 30976 KB Output is correct
20 Correct 15 ms 31244 KB Output is correct
21 Correct 15 ms 31240 KB Output is correct
22 Correct 14 ms 31060 KB Output is correct
23 Correct 71 ms 31180 KB Output is correct
24 Correct 13 ms 31060 KB Output is correct
25 Correct 68 ms 31248 KB Output is correct
26 Correct 65 ms 31188 KB Output is correct
27 Correct 25 ms 31156 KB Output is correct
28 Correct 71 ms 31260 KB Output is correct
29 Correct 31 ms 31188 KB Output is correct
30 Correct 38 ms 31372 KB Output is correct
31 Correct 64 ms 31236 KB Output is correct
32 Correct 35 ms 31208 KB Output is correct
33 Correct 56 ms 31284 KB Output is correct
34 Correct 56 ms 31188 KB Output is correct
35 Correct 29 ms 15700 KB Output is correct
36 Correct 30 ms 15716 KB Output is correct
37 Correct 28 ms 15700 KB Output is correct
38 Execution timed out 3072 ms 8020 KB Time limit exceeded
39 Halted 0 ms 0 KB -