답안 #771908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771908	2023-07-03T11:43:03 Z	GrindMachine	Political Development (BOI17_politicaldevelopment)	C++17	4 / 100	3000 ms	8012 KB

politicaldevelopment

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e4 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> adj[N];

void solve(int test_case)
{
    int n,k; cin >> n >> k;
    rep(i,n){
        int s; cin >> s;
        rep(j,s){
            int v; cin >> v;
            adj[i].pb(v);
        }
        adj[i].pb(i);
        sort(all(adj[i]));
    }

    int ans = 0;

    rep(s,n){
        auto nodes = adj[s];
        int siz = sz(nodes);
        vector<bool> dp(1<<siz);
        dp[0] = 1;

        rep1(mask,(1<<siz)-1){
            vector<int> picked;
            rep(i,siz){
                if(mask & (1 << i)){
                    int u = nodes[i];
                    picked.pb(u);
                }
            }

            int msb = -1;
            rev(bit,siz-1,0){
                if(mask & (1<<bit)){
                    msb = bit;
                    break;
                }
            }

            int u = nodes[msb];

            bool ok = true;
            trav(v,picked){
                if(!binary_search(all(adj[u]),v)){
                    ok = false;
                    break;
                }
            }

            if(ok){
                dp[mask] = dp[mask^(1<<msb)];
            }
        }

        rep(mask,1<<siz){
            if(dp[mask]){
                int cnt = setbits(mask);
                amax(ans,cnt);
            }
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1364 KB	Output is correct
2	Correct	1 ms	1364 KB	Output is correct
3	Correct	15 ms	1620 KB	Output is correct
4	Correct	4 ms	1620 KB	Output is correct
5	Correct	4 ms	1620 KB	Output is correct
6	Correct	9 ms	1620 KB	Output is correct
7	Correct	9 ms	1620 KB	Output is correct
8	Correct	1 ms	1620 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1620 KB	Output is correct

Subtask #2
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1364 KB	Output is correct
2	Correct	1 ms	1364 KB	Output is correct
3	Correct	15 ms	1620 KB	Output is correct
4	Correct	4 ms	1620 KB	Output is correct
5	Correct	4 ms	1620 KB	Output is correct
6	Correct	9 ms	1620 KB	Output is correct
7	Correct	9 ms	1620 KB	Output is correct
8	Correct	1 ms	1620 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1620 KB	Output is correct
11	Correct	5 ms	1620 KB	Output is correct
12	Correct	4 ms	1620 KB	Output is correct
13	Correct	1 ms	1492 KB	Output is correct
14	Correct	4 ms	1620 KB	Output is correct
15	Correct	1 ms	1492 KB	Output is correct
16	Correct	9 ms	1620 KB	Output is correct
17	Correct	1 ms	1492 KB	Output is correct
18	Correct	9 ms	1688 KB	Output is correct
19	Correct	2 ms	1620 KB	Output is correct
20	Correct	3 ms	1620 KB	Output is correct
21	Correct	2 ms	1620 KB	Output is correct
22	Correct	1 ms	1620 KB	Output is correct
23	Correct	11 ms	1668 KB	Output is correct
24	Correct	2 ms	1620 KB	Output is correct
25	Correct	12 ms	1664 KB	Output is correct
26	Correct	9 ms	1620 KB	Output is correct
27	Correct	4 ms	1620 KB	Output is correct
28	Correct	9 ms	1664 KB	Output is correct
29	Correct	4 ms	1620 KB	Output is correct
30	Correct	6 ms	1620 KB	Output is correct
31	Correct	9 ms	1664 KB	Output is correct
32	Correct	6 ms	1620 KB	Output is correct
33	Correct	8 ms	1672 KB	Output is correct
34	Correct	9 ms	1620 KB	Output is correct
35	Correct	5 ms	1492 KB	Output is correct
36	Correct	5 ms	1492 KB	Output is correct
37	Correct	4 ms	1492 KB	Output is correct
38	Runtime error	4 ms	3028 KB	Execution killed with signal 6
39	Halted	0 ms	0 KB	-

Subtask #3
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1620 KB	Output is correct
2	Correct	1 ms	1492 KB	Output is correct
3	Correct	1 ms	1492 KB	Output is correct
4	Correct	1 ms	1444 KB	Output is correct
5	Correct	1 ms	1364 KB	Output is correct
6	Correct	1 ms	1504 KB	Output is correct
7	Correct	1 ms	1492 KB	Output is correct
8	Correct	1 ms	1492 KB	Output is correct
9	Correct	1 ms	1492 KB	Output is correct
10	Correct	1 ms	1492 KB	Output is correct
11	Execution timed out	3064 ms	8012 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4
0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1364 KB	Output is correct
2	Correct	1 ms	1364 KB	Output is correct
3	Correct	15 ms	1620 KB	Output is correct
4	Correct	4 ms	1620 KB	Output is correct
5	Correct	4 ms	1620 KB	Output is correct
6	Correct	9 ms	1620 KB	Output is correct
7	Correct	9 ms	1620 KB	Output is correct
8	Correct	1 ms	1620 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1620 KB	Output is correct
11	Correct	5 ms	1620 KB	Output is correct
12	Correct	4 ms	1620 KB	Output is correct
13	Correct	1 ms	1492 KB	Output is correct
14	Correct	4 ms	1620 KB	Output is correct
15	Correct	1 ms	1492 KB	Output is correct
16	Correct	9 ms	1620 KB	Output is correct
17	Correct	1 ms	1492 KB	Output is correct
18	Correct	9 ms	1688 KB	Output is correct
19	Correct	2 ms	1620 KB	Output is correct
20	Correct	3 ms	1620 KB	Output is correct
21	Correct	2 ms	1620 KB	Output is correct
22	Correct	1 ms	1620 KB	Output is correct
23	Correct	11 ms	1668 KB	Output is correct
24	Correct	2 ms	1620 KB	Output is correct
25	Correct	12 ms	1664 KB	Output is correct
26	Correct	9 ms	1620 KB	Output is correct
27	Correct	4 ms	1620 KB	Output is correct
28	Correct	9 ms	1664 KB	Output is correct
29	Correct	4 ms	1620 KB	Output is correct
30	Correct	6 ms	1620 KB	Output is correct
31	Correct	9 ms	1664 KB	Output is correct
32	Correct	6 ms	1620 KB	Output is correct
33	Correct	8 ms	1672 KB	Output is correct
34	Correct	9 ms	1620 KB	Output is correct
35	Correct	5 ms	1492 KB	Output is correct
36	Correct	5 ms	1492 KB	Output is correct
37	Correct	4 ms	1492 KB	Output is correct
38	Runtime error	4 ms	3028 KB	Execution killed with signal 6
39	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1364 KB	Output is correct
2	Correct	1 ms	1364 KB	Output is correct
3	Correct	15 ms	1620 KB	Output is correct
4	Correct	4 ms	1620 KB	Output is correct
5	Correct	4 ms	1620 KB	Output is correct
6	Correct	9 ms	1620 KB	Output is correct
7	Correct	9 ms	1620 KB	Output is correct
8	Correct	1 ms	1620 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1620 KB	Output is correct
11	Correct	5 ms	1620 KB	Output is correct
12	Correct	4 ms	1620 KB	Output is correct
13	Correct	1 ms	1492 KB	Output is correct
14	Correct	4 ms	1620 KB	Output is correct
15	Correct	1 ms	1492 KB	Output is correct
16	Correct	9 ms	1620 KB	Output is correct
17	Correct	1 ms	1492 KB	Output is correct
18	Correct	9 ms	1688 KB	Output is correct
19	Correct	2 ms	1620 KB	Output is correct
20	Correct	3 ms	1620 KB	Output is correct
21	Correct	2 ms	1620 KB	Output is correct
22	Correct	1 ms	1620 KB	Output is correct
23	Correct	11 ms	1668 KB	Output is correct
24	Correct	2 ms	1620 KB	Output is correct
25	Correct	12 ms	1664 KB	Output is correct
26	Correct	9 ms	1620 KB	Output is correct
27	Correct	4 ms	1620 KB	Output is correct
28	Correct	9 ms	1664 KB	Output is correct
29	Correct	4 ms	1620 KB	Output is correct
30	Correct	6 ms	1620 KB	Output is correct
31	Correct	9 ms	1664 KB	Output is correct
32	Correct	6 ms	1620 KB	Output is correct
33	Correct	8 ms	1672 KB	Output is correct
34	Correct	9 ms	1620 KB	Output is correct
35	Correct	5 ms	1492 KB	Output is correct
36	Correct	5 ms	1492 KB	Output is correct
37	Correct	4 ms	1492 KB	Output is correct
38	Runtime error	4 ms	3028 KB	Execution killed with signal 6
39	Halted	0 ms	0 KB	-

답안 #771908

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 0 / 12.0

Subtask #3 0 / 23.0

Subtask #4 0 / 38.0

Subtask #5 0 / 23.0

Subtask #1
4.0 / 4.0

Subtask #2
0 / 12.0

Subtask #3
0 / 23.0

Subtask #4
0 / 38.0

Subtask #5
0 / 23.0