oj.uz

답안 #647880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647880 2022-10-04T11:23:23 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
39 / 100
 3000 ms 524288 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;


int n, k;
vector<int> g[N], path;
vector<bool> vis(N);
vector<bitset<50001>> is;
void dfs(int v, int p){
    vis[v] = 1;
    path.pb(v);
    for(int u: g[v]){
        if(u != p){
            if(vis[u]){
                if(path[path.size() - 3] == u){
                    cout << 3;
                    exit(0);
                }
            }else{
                dfs(u, v);
            }
        }    
    }
    path.pop_back();
}

void solve(){
    cin >> n >> k;
    is.resize(n+1);
    for(int i = 0; i < n; ++i){
        int d; cin >> d;
        for(int j = 0; j < d; ++j){
            int x; cin >> x; g[i].pb(x); is[i][x] = 1;
        }
    }
    if(k <= 2){
        for(int i = 0; i < n; ++i){
            if(g[i].size()){
                cout << 2;
                return;
            }
        }
        cout << 1;
        return;
    }
    if(k <= 3){
        for(int i = 0; i < n; ++i) if(!vis[i]) dfs(i, i);
        for(int i = 0; i < n; ++i){
            if(g[i].size()){
                cout << 2;
                return;
            }
        }
        cout << 1;
        return;
    }
    vector<vector<int>> v;
    for(int i = 0; i < n; ++i) v.pb({i});
    for(int j = 2; j <= k; ++j){
        bitset<50001> in, out;
        vector<vector<int>> t;

        for(auto &u: v){
            for(int x: u) in[x] = 1;
            vector<int> extend;
            for(int x: u){
                for(int e: g[x]){
                    if(!out[e] && !in[e]){
                        out[e] = 1;
                        extend.pb(e);
                    }
                }
            }
            for(int x: extend){
                out[x] = 0;
                bool ok = 1;
                for(int p: u){
                    if(!is[p][x]){
                        ok = 0;
                        break;
                    }
                }
                if(ok){
                    u.pb(x);
                    t.pb(u);
                    u.pop_back();
                }
            }
            for(int x: u) in[x] = 0;
        }

        if(t.size() == 0){
            cout << j - 1;
            return;
        }
        v = t;
    }
    cout << k;
}   





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:121:16: warning: unused variable 'aa' [-Wunused-variable]
  121 |     int T = 1, aa;
      |                ^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24020 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 28 ms 54696 KB Output is correct
4 Correct 26 ms 54732 KB Output is correct
5 Correct 26 ms 54688 KB Output is correct
6 Correct 30 ms 54732 KB Output is correct
7 Correct 26 ms 54700 KB Output is correct
8 Correct 23 ms 54544 KB Output is correct
9 Correct 15 ms 23892 KB Output is correct
10 Correct 28 ms 54484 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24020 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 28 ms 54696 KB Output is correct
4 Correct 26 ms 54732 KB Output is correct
5 Correct 26 ms 54688 KB Output is correct
6 Correct 30 ms 54732 KB Output is correct
7 Correct 26 ms 54700 KB Output is correct
8 Correct 23 ms 54544 KB Output is correct
9 Correct 15 ms 23892 KB Output is correct
10 Correct 28 ms 54484 KB Output is correct
11 Correct 25 ms 54800 KB Output is correct
12 Correct 26 ms 54764 KB Output is correct
13 Correct 13 ms 23860 KB Output is correct
14 Correct 26 ms 54804 KB Output is correct
15 Correct 13 ms 23940 KB Output is correct
16 Correct 26 ms 54764 KB Output is correct
17 Correct 12 ms 23932 KB Output is correct
18 Correct 29 ms 54740 KB Output is correct
19 Correct 28 ms 54464 KB Output is correct
20 Correct 27 ms 54640 KB Output is correct
21 Correct 29 ms 54652 KB Output is correct
22 Correct 27 ms 54556 KB Output is correct
23 Correct 28 ms 54800 KB Output is correct
24 Correct 23 ms 54484 KB Output is correct
25 Correct 26 ms 54800 KB Output is correct
26 Correct 26 ms 54796 KB Output is correct
27 Correct 35 ms 55136 KB Output is correct
28 Correct 29 ms 54860 KB Output is correct
29 Correct 28 ms 55152 KB Output is correct
30 Correct 29 ms 54740 KB Output is correct
31 Correct 27 ms 54932 KB Output is correct
32 Correct 27 ms 54784 KB Output is correct
33 Correct 28 ms 54860 KB Output is correct
34 Correct 29 ms 54868 KB Output is correct
35 Correct 24 ms 39372 KB Output is correct
36 Correct 21 ms 39404 KB Output is correct
37 Correct 24 ms 39376 KB Output is correct
38 Correct 16 ms 31576 KB Output is correct
39 Correct 15 ms 31572 KB Output is correct
40 Correct 27 ms 54740 KB Output is correct
41 Correct 16 ms 31580 KB Output is correct
42 Correct 27 ms 54740 KB Output is correct
43 Correct 30 ms 54752 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 54796 KB Output is correct
2 Correct 13 ms 24020 KB Output is correct
3 Correct 12 ms 24020 KB Output is correct
4 Correct 13 ms 23932 KB Output is correct
5 Correct 13 ms 24024 KB Output is correct
6 Correct 16 ms 24020 KB Output is correct
7 Correct 14 ms 24068 KB Output is correct
8 Correct 13 ms 24092 KB Output is correct
9 Correct 13 ms 24020 KB Output is correct
10 Correct 14 ms 24032 KB Output is correct
11 Correct 642 ms 388568 KB Output is correct
12 Correct 14 ms 24020 KB Output is correct
13 Correct 1297 ms 402108 KB Output is correct
14 Correct 14 ms 23976 KB Output is correct
15 Correct 698 ms 388580 KB Output is correct
16 Correct 790 ms 388504 KB Output is correct
17 Correct 1217 ms 402124 KB Output is correct
18 Correct 693 ms 388540 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24020 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 28 ms 54696 KB Output is correct
4 Correct 26 ms 54732 KB Output is correct
5 Correct 26 ms 54688 KB Output is correct
6 Correct 30 ms 54732 KB Output is correct
7 Correct 26 ms 54700 KB Output is correct
8 Correct 23 ms 54544 KB Output is correct
9 Correct 15 ms 23892 KB Output is correct
10 Correct 28 ms 54484 KB Output is correct
11 Correct 25 ms 54800 KB Output is correct
12 Correct 26 ms 54764 KB Output is correct
13 Correct 13 ms 23860 KB Output is correct
14 Correct 26 ms 54804 KB Output is correct
15 Correct 13 ms 23940 KB Output is correct
16 Correct 26 ms 54764 KB Output is correct
17 Correct 12 ms 23932 KB Output is correct
18 Correct 29 ms 54740 KB Output is correct
19 Correct 28 ms 54464 KB Output is correct
20 Correct 27 ms 54640 KB Output is correct
21 Correct 29 ms 54652 KB Output is correct
22 Correct 27 ms 54556 KB Output is correct
23 Correct 28 ms 54800 KB Output is correct
24 Correct 23 ms 54484 KB Output is correct
25 Correct 26 ms 54800 KB Output is correct
26 Correct 26 ms 54796 KB Output is correct
27 Correct 35 ms 55136 KB Output is correct
28 Correct 29 ms 54860 KB Output is correct
29 Correct 28 ms 55152 KB Output is correct
30 Correct 29 ms 54740 KB Output is correct
31 Correct 27 ms 54932 KB Output is correct
32 Correct 27 ms 54784 KB Output is correct
33 Correct 28 ms 54860 KB Output is correct
34 Correct 29 ms 54868 KB Output is correct
35 Correct 24 ms 39372 KB Output is correct
36 Correct 21 ms 39404 KB Output is correct
37 Correct 24 ms 39376 KB Output is correct
38 Correct 16 ms 31576 KB Output is correct
39 Correct 15 ms 31572 KB Output is correct
40 Correct 27 ms 54740 KB Output is correct
41 Correct 16 ms 31580 KB Output is correct
42 Correct 27 ms 54740 KB Output is correct
43 Correct 30 ms 54752 KB Output is correct
44 Runtime error 1339 ms 524288 KB Execution killed with signal 9
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24020 KB Output is correct
2 Correct 12 ms 23892 KB Output is correct
3 Correct 28 ms 54696 KB Output is correct
4 Correct 26 ms 54732 KB Output is correct
5 Correct 26 ms 54688 KB Output is correct
6 Correct 30 ms 54732 KB Output is correct
7 Correct 26 ms 54700 KB Output is correct
8 Correct 23 ms 54544 KB Output is correct
9 Correct 15 ms 23892 KB Output is correct
10 Correct 28 ms 54484 KB Output is correct
11 Correct 25 ms 54800 KB Output is correct
12 Correct 26 ms 54764 KB Output is correct
13 Correct 13 ms 23860 KB Output is correct
14 Correct 26 ms 54804 KB Output is correct
15 Correct 13 ms 23940 KB Output is correct
16 Correct 26 ms 54764 KB Output is correct
17 Correct 12 ms 23932 KB Output is correct
18 Correct 29 ms 54740 KB Output is correct
19 Correct 28 ms 54464 KB Output is correct
20 Correct 27 ms 54640 KB Output is correct
21 Correct 29 ms 54652 KB Output is correct
22 Correct 27 ms 54556 KB Output is correct
23 Correct 28 ms 54800 KB Output is correct
24 Correct 23 ms 54484 KB Output is correct
25 Correct 26 ms 54800 KB Output is correct
26 Correct 26 ms 54796 KB Output is correct
27 Correct 35 ms 55136 KB Output is correct
28 Correct 29 ms 54860 KB Output is correct
29 Correct 28 ms 55152 KB Output is correct
30 Correct 29 ms 54740 KB Output is correct
31 Correct 27 ms 54932 KB Output is correct
32 Correct 27 ms 54784 KB Output is correct
33 Correct 28 ms 54860 KB Output is correct
34 Correct 29 ms 54868 KB Output is correct
35 Correct 24 ms 39372 KB Output is correct
36 Correct 21 ms 39404 KB Output is correct
37 Correct 24 ms 39376 KB Output is correct
38 Correct 16 ms 31576 KB Output is correct
39 Correct 15 ms 31572 KB Output is correct
40 Correct 27 ms 54740 KB Output is correct
41 Correct 16 ms 31580 KB Output is correct
42 Correct 27 ms 54740 KB Output is correct
43 Correct 30 ms 54752 KB Output is correct
44 Correct 16 ms 24020 KB Output is correct
45 Correct 511 ms 368844 KB Output is correct
46 Execution timed out 3112 ms 351660 KB Time limit exceeded
47 Halted 0 ms 0 KB -