oj.uz

답안 #557532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557532 2022-05-05T12:40:11 Z fatemetmhr Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 876 ms 32068 KB 
// `Be name khoda` //

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb     push_back
#define all(x) x.begin(), x.end()
#define fi     first
#define se     second


const int maxn5 = 2e5 + 10;

set <int> adjset[maxn5];
vector <int> adj[maxn5], ver;
priority_queue <pair<int, int>> av;
bool ed[20][20], mark[maxn5], dp[1 << 20];
int cnt[maxn5];

inline int max_indep(){
    int n = ver.size();
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++)
        if(adjset[ver[i]].find(ver[j]) != adjset[ver[i]].end())
            ed[i][j] = true;
    dp[0] = true;
    int ans = 0;
    for(int mask = 1; mask < (1 << n); mask++){
        int v = -1;
        dp[mask] = true;
        for(int i = 0; i < n; i++) if((mask >> i)&1){
            if(v == -1){
                v = i;
                dp[mask] = dp[mask ^ (1 << i)];
            }
            else
                dp[mask] &= ed[v][i];
        }
        if(dp[mask])
            ans = max(ans, __builtin_popcount(mask));
    }
    return ans;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;
    for(int i = 0; i < n; i++){
        int l; cin >> l;
        cnt[i] = l;
        while(l--){
            int a; cin >> a;
            adj[i].pb(a);
            adjset[i].insert(a);
        }
        av.push({-cnt[i], i});
    }
    for(int i = 0; i < n; i++) for(auto u : adj[i])
        assert(adjset[u].find(i) != adjset[u].end());
    int ans = 0;
    for(int i = 0; i < n; i++){
        ver.clear();
        for(auto u : adj[i])
            ver.pb(u);
        ans = max(ans, max_indep() + 1);
    }
    /*
    for(int i = 0; i < n; i++){
        while(mark[av.top().se])
            av.pop();
        int v = av.top().se;
        av.pop();
        mark[v] = true;
        ver.clear();
        for(auto u : adj[v]) if(!mark[u]){
            cnt[u]--;
            av.push({-cnt[u], u});
            ver.pb(u);
        }
        ans = max(ans, max_indep() + 1);
    }
    */
    cout << ans << endl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 13 ms 15060 KB Output is correct
4 Correct 135 ms 15188 KB Output is correct
5 Correct 164 ms 15240 KB Output is correct
6 Correct 15 ms 15136 KB Output is correct
7 Correct 14 ms 15188 KB Output is correct
8 Correct 10 ms 14548 KB Output is correct
9 Correct 7 ms 14376 KB Output is correct
10 Correct 9 ms 14548 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 13 ms 15060 KB Output is correct
4 Correct 135 ms 15188 KB Output is correct
5 Correct 164 ms 15240 KB Output is correct
6 Correct 15 ms 15136 KB Output is correct
7 Correct 14 ms 15188 KB Output is correct
8 Correct 10 ms 14548 KB Output is correct
9 Correct 7 ms 14376 KB Output is correct
10 Correct 9 ms 14548 KB Output is correct
11 Correct 129 ms 15236 KB Output is correct
12 Correct 140 ms 15232 KB Output is correct
13 Correct 10 ms 14420 KB Output is correct
14 Correct 151 ms 15236 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 15 ms 15196 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 14 ms 15188 KB Output is correct
19 Correct 9 ms 14484 KB Output is correct
20 Correct 10 ms 14820 KB Output is correct
21 Correct 10 ms 14804 KB Output is correct
22 Correct 10 ms 14472 KB Output is correct
23 Correct 13 ms 15204 KB Output is correct
24 Correct 8 ms 14616 KB Output is correct
25 Correct 12 ms 15216 KB Output is correct
26 Correct 13 ms 15164 KB Output is correct
27 Correct 14 ms 15072 KB Output is correct
28 Correct 14 ms 15216 KB Output is correct
29 Correct 12 ms 15188 KB Output is correct
30 Correct 50 ms 15316 KB Output is correct
31 Correct 12 ms 15328 KB Output is correct
32 Correct 46 ms 15364 KB Output is correct
33 Correct 12 ms 15328 KB Output is correct
34 Correct 14 ms 15316 KB Output is correct
35 Correct 10 ms 14804 KB Output is correct
36 Correct 11 ms 14816 KB Output is correct
37 Correct 13 ms 14840 KB Output is correct
38 Runtime error 876 ms 32068 KB Execution killed with signal 11
39 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14552 KB Output is correct
2 Incorrect 7 ms 14420 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 13 ms 15060 KB Output is correct
4 Correct 135 ms 15188 KB Output is correct
5 Correct 164 ms 15240 KB Output is correct
6 Correct 15 ms 15136 KB Output is correct
7 Correct 14 ms 15188 KB Output is correct
8 Correct 10 ms 14548 KB Output is correct
9 Correct 7 ms 14376 KB Output is correct
10 Correct 9 ms 14548 KB Output is correct
11 Correct 129 ms 15236 KB Output is correct
12 Correct 140 ms 15232 KB Output is correct
13 Correct 10 ms 14420 KB Output is correct
14 Correct 151 ms 15236 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 15 ms 15196 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 14 ms 15188 KB Output is correct
19 Correct 9 ms 14484 KB Output is correct
20 Correct 10 ms 14820 KB Output is correct
21 Correct 10 ms 14804 KB Output is correct
22 Correct 10 ms 14472 KB Output is correct
23 Correct 13 ms 15204 KB Output is correct
24 Correct 8 ms 14616 KB Output is correct
25 Correct 12 ms 15216 KB Output is correct
26 Correct 13 ms 15164 KB Output is correct
27 Correct 14 ms 15072 KB Output is correct
28 Correct 14 ms 15216 KB Output is correct
29 Correct 12 ms 15188 KB Output is correct
30 Correct 50 ms 15316 KB Output is correct
31 Correct 12 ms 15328 KB Output is correct
32 Correct 46 ms 15364 KB Output is correct
33 Correct 12 ms 15328 KB Output is correct
34 Correct 14 ms 15316 KB Output is correct
35 Correct 10 ms 14804 KB Output is correct
36 Correct 11 ms 14816 KB Output is correct
37 Correct 13 ms 14840 KB Output is correct
38 Runtime error 876 ms 32068 KB Execution killed with signal 11
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 13 ms 15060 KB Output is correct
4 Correct 135 ms 15188 KB Output is correct
5 Correct 164 ms 15240 KB Output is correct
6 Correct 15 ms 15136 KB Output is correct
7 Correct 14 ms 15188 KB Output is correct
8 Correct 10 ms 14548 KB Output is correct
9 Correct 7 ms 14376 KB Output is correct
10 Correct 9 ms 14548 KB Output is correct
11 Correct 129 ms 15236 KB Output is correct
12 Correct 140 ms 15232 KB Output is correct
13 Correct 10 ms 14420 KB Output is correct
14 Correct 151 ms 15236 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 15 ms 15196 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 14 ms 15188 KB Output is correct
19 Correct 9 ms 14484 KB Output is correct
20 Correct 10 ms 14820 KB Output is correct
21 Correct 10 ms 14804 KB Output is correct
22 Correct 10 ms 14472 KB Output is correct
23 Correct 13 ms 15204 KB Output is correct
24 Correct 8 ms 14616 KB Output is correct
25 Correct 12 ms 15216 KB Output is correct
26 Correct 13 ms 15164 KB Output is correct
27 Correct 14 ms 15072 KB Output is correct
28 Correct 14 ms 15216 KB Output is correct
29 Correct 12 ms 15188 KB Output is correct
30 Correct 50 ms 15316 KB Output is correct
31 Correct 12 ms 15328 KB Output is correct
32 Correct 46 ms 15364 KB Output is correct
33 Correct 12 ms 15328 KB Output is correct
34 Correct 14 ms 15316 KB Output is correct
35 Correct 10 ms 14804 KB Output is correct
36 Correct 11 ms 14816 KB Output is correct
37 Correct 13 ms 14840 KB Output is correct
38 Runtime error 876 ms 32068 KB Execution killed with signal 11
39 Halted 0 ms 0 KB -