oj.uz

Submission #655698

# Submission time Handle Problem Language Result Execution time Memory
655698 2022-11-05T10:29:02 Z KiriLL1ca Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 314060 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) {
                        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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 169 ms 31188 KB Output is correct
4 Correct 95 ms 31188 KB Output is correct
5 Correct 100 ms 31228 KB Output is correct
6 Correct 128 ms 31188 KB Output is correct
7 Correct 128 ms 31188 KB Output is correct
8 Correct 13 ms 31060 KB Output is correct
9 Correct 1 ms 284 KB Output is correct
10 Correct 14 ms 31060 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 169 ms 31188 KB Output is correct
4 Correct 95 ms 31188 KB Output is correct
5 Correct 100 ms 31228 KB Output is correct
6 Correct 128 ms 31188 KB Output is correct
7 Correct 128 ms 31188 KB Output is correct
8 Correct 13 ms 31060 KB Output is correct
9 Correct 1 ms 284 KB Output is correct
10 Correct 14 ms 31060 KB Output is correct
11 Correct 96 ms 31300 KB Output is correct
12 Correct 99 ms 31208 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 110 ms 31244 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 133 ms 31236 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 132 ms 31256 KB Output is correct
19 Correct 13 ms 31060 KB Output is correct
20 Correct 23 ms 31164 KB Output is correct
21 Correct 23 ms 31232 KB Output is correct
22 Correct 13 ms 31060 KB Output is correct
23 Correct 154 ms 31184 KB Output is correct
24 Correct 13 ms 31060 KB Output is correct
25 Correct 111 ms 31188 KB Output is correct
26 Correct 99 ms 31204 KB Output is correct
27 Correct 41 ms 31188 KB Output is correct
28 Correct 91 ms 31216 KB Output is correct
29 Correct 38 ms 31188 KB Output is correct
30 Correct 49 ms 31188 KB Output is correct
31 Correct 110 ms 31184 KB Output is correct
32 Correct 52 ms 31244 KB Output is correct
33 Correct 82 ms 31188 KB Output is correct
34 Correct 80 ms 31188 KB Output is correct
35 Correct 41 ms 15768 KB Output is correct
36 Correct 43 ms 15700 KB Output is correct
37 Correct 42 ms 15700 KB Output is correct
38 Execution timed out 3060 ms 8020 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31056 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Execution timed out 3086 ms 314060 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 169 ms 31188 KB Output is correct
4 Correct 95 ms 31188 KB Output is correct
5 Correct 100 ms 31228 KB Output is correct
6 Correct 128 ms 31188 KB Output is correct
7 Correct 128 ms 31188 KB Output is correct
8 Correct 13 ms 31060 KB Output is correct
9 Correct 1 ms 284 KB Output is correct
10 Correct 14 ms 31060 KB Output is correct
11 Correct 96 ms 31300 KB Output is correct
12 Correct 99 ms 31208 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 110 ms 31244 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 133 ms 31236 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 132 ms 31256 KB Output is correct
19 Correct 13 ms 31060 KB Output is correct
20 Correct 23 ms 31164 KB Output is correct
21 Correct 23 ms 31232 KB Output is correct
22 Correct 13 ms 31060 KB Output is correct
23 Correct 154 ms 31184 KB Output is correct
24 Correct 13 ms 31060 KB Output is correct
25 Correct 111 ms 31188 KB Output is correct
26 Correct 99 ms 31204 KB Output is correct
27 Correct 41 ms 31188 KB Output is correct
28 Correct 91 ms 31216 KB Output is correct
29 Correct 38 ms 31188 KB Output is correct
30 Correct 49 ms 31188 KB Output is correct
31 Correct 110 ms 31184 KB Output is correct
32 Correct 52 ms 31244 KB Output is correct
33 Correct 82 ms 31188 KB Output is correct
34 Correct 80 ms 31188 KB Output is correct
35 Correct 41 ms 15768 KB Output is correct
36 Correct 43 ms 15700 KB Output is correct
37 Correct 42 ms 15700 KB Output is correct
38 Execution timed out 3060 ms 8020 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 169 ms 31188 KB Output is correct
4 Correct 95 ms 31188 KB Output is correct
5 Correct 100 ms 31228 KB Output is correct
6 Correct 128 ms 31188 KB Output is correct
7 Correct 128 ms 31188 KB Output is correct
8 Correct 13 ms 31060 KB Output is correct
9 Correct 1 ms 284 KB Output is correct
10 Correct 14 ms 31060 KB Output is correct
11 Correct 96 ms 31300 KB Output is correct
12 Correct 99 ms 31208 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 110 ms 31244 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 133 ms 31236 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 132 ms 31256 KB Output is correct
19 Correct 13 ms 31060 KB Output is correct
20 Correct 23 ms 31164 KB Output is correct
21 Correct 23 ms 31232 KB Output is correct
22 Correct 13 ms 31060 KB Output is correct
23 Correct 154 ms 31184 KB Output is correct
24 Correct 13 ms 31060 KB Output is correct
25 Correct 111 ms 31188 KB Output is correct
26 Correct 99 ms 31204 KB Output is correct
27 Correct 41 ms 31188 KB Output is correct
28 Correct 91 ms 31216 KB Output is correct
29 Correct 38 ms 31188 KB Output is correct
30 Correct 49 ms 31188 KB Output is correct
31 Correct 110 ms 31184 KB Output is correct
32 Correct 52 ms 31244 KB Output is correct
33 Correct 82 ms 31188 KB Output is correct
34 Correct 80 ms 31188 KB Output is correct
35 Correct 41 ms 15768 KB Output is correct
36 Correct 43 ms 15700 KB Output is correct
37 Correct 42 ms 15700 KB Output is correct
38 Execution timed out 3060 ms 8020 KB Time limit exceeded
39 Halted 0 ms 0 KB -