oj.uz

Submission #647881

# Submission time Handle Problem Language Result Execution time Memory
647881 2022-10-04T11:31:55 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
16 / 100
 3000 ms 386328 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;

        if(n <= 5000){
            for(auto &u: v){
                for(int x: u) in[x] = 1;
                for(int i = 0; i < n; ++i){
                    if(!in[i]){
                        bool ok = 1;
                        for(int d: u){
                            if(!is[d][i]){
                                ok = 0;
                                break;
                            }
                        }
                        if(ok){
                            u.pb(i);
                            t.pb(u);
                            u.pop_back();
                        }
                    }
                }
            }
        }else{
            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:142:16: warning: unused variable 'aa' [-Wunused-variable]
  142 |     int T = 1, aa;
      |                ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23940 KB Output is correct
3 Correct 30 ms 54768 KB Output is correct
4 Correct 25 ms 54740 KB Output is correct
5 Correct 32 ms 54780 KB Output is correct
6 Correct 31 ms 54800 KB Output is correct
7 Correct 28 ms 54788 KB Output is correct
8 Correct 28 ms 54460 KB Output is correct
9 Correct 13 ms 23892 KB Output is correct
10 Correct 23 ms 54552 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23940 KB Output is correct
3 Correct 30 ms 54768 KB Output is correct
4 Correct 25 ms 54740 KB Output is correct
5 Correct 32 ms 54780 KB Output is correct
6 Correct 31 ms 54800 KB Output is correct
7 Correct 28 ms 54788 KB Output is correct
8 Correct 28 ms 54460 KB Output is correct
9 Correct 13 ms 23892 KB Output is correct
10 Correct 23 ms 54552 KB Output is correct
11 Correct 26 ms 54740 KB Output is correct
12 Correct 25 ms 54736 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 27 ms 54760 KB Output is correct
15 Correct 13 ms 23968 KB Output is correct
16 Correct 34 ms 54740 KB Output is correct
17 Correct 13 ms 23892 KB Output is correct
18 Correct 27 ms 54724 KB Output is correct
19 Correct 24 ms 54484 KB Output is correct
20 Correct 27 ms 54692 KB Output is correct
21 Correct 26 ms 54740 KB Output is correct
22 Correct 28 ms 54448 KB Output is correct
23 Correct 30 ms 54740 KB Output is correct
24 Correct 27 ms 54540 KB Output is correct
25 Correct 28 ms 54740 KB Output is correct
26 Correct 28 ms 54792 KB Output is correct
27 Correct 29 ms 55048 KB Output is correct
28 Correct 30 ms 54784 KB Output is correct
29 Correct 31 ms 55120 KB Output is correct
30 Correct 28 ms 54720 KB Output is correct
31 Correct 29 ms 54912 KB Output is correct
32 Correct 28 ms 54740 KB Output is correct
33 Correct 32 ms 54860 KB Output is correct
34 Correct 30 ms 54868 KB Output is correct
35 Correct 22 ms 39452 KB Output is correct
36 Correct 20 ms 39380 KB Output is correct
37 Correct 20 ms 39440 KB Output is correct
38 Correct 17 ms 31616 KB Output is correct
39 Correct 16 ms 31636 KB Output is correct
40 Correct 28 ms 54732 KB Output is correct
41 Correct 17 ms 31572 KB Output is correct
42 Correct 28 ms 54752 KB Output is correct
43 Correct 28 ms 54756 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 54920 KB Output is correct
2 Correct 14 ms 24044 KB Output is correct
3 Correct 13 ms 24020 KB Output is correct
4 Correct 14 ms 24020 KB Output is correct
5 Correct 13 ms 24020 KB Output is correct
6 Correct 14 ms 24020 KB Output is correct
7 Correct 13 ms 24072 KB Output is correct
8 Correct 14 ms 24072 KB Output is correct
9 Correct 14 ms 24100 KB Output is correct
10 Correct 14 ms 24068 KB Output is correct
11 Correct 639 ms 386328 KB Output is correct
12 Incorrect 17 ms 24060 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23940 KB Output is correct
3 Correct 30 ms 54768 KB Output is correct
4 Correct 25 ms 54740 KB Output is correct
5 Correct 32 ms 54780 KB Output is correct
6 Correct 31 ms 54800 KB Output is correct
7 Correct 28 ms 54788 KB Output is correct
8 Correct 28 ms 54460 KB Output is correct
9 Correct 13 ms 23892 KB Output is correct
10 Correct 23 ms 54552 KB Output is correct
11 Correct 26 ms 54740 KB Output is correct
12 Correct 25 ms 54736 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 27 ms 54760 KB Output is correct
15 Correct 13 ms 23968 KB Output is correct
16 Correct 34 ms 54740 KB Output is correct
17 Correct 13 ms 23892 KB Output is correct
18 Correct 27 ms 54724 KB Output is correct
19 Correct 24 ms 54484 KB Output is correct
20 Correct 27 ms 54692 KB Output is correct
21 Correct 26 ms 54740 KB Output is correct
22 Correct 28 ms 54448 KB Output is correct
23 Correct 30 ms 54740 KB Output is correct
24 Correct 27 ms 54540 KB Output is correct
25 Correct 28 ms 54740 KB Output is correct
26 Correct 28 ms 54792 KB Output is correct
27 Correct 29 ms 55048 KB Output is correct
28 Correct 30 ms 54784 KB Output is correct
29 Correct 31 ms 55120 KB Output is correct
30 Correct 28 ms 54720 KB Output is correct
31 Correct 29 ms 54912 KB Output is correct
32 Correct 28 ms 54740 KB Output is correct
33 Correct 32 ms 54860 KB Output is correct
34 Correct 30 ms 54868 KB Output is correct
35 Correct 22 ms 39452 KB Output is correct
36 Correct 20 ms 39380 KB Output is correct
37 Correct 20 ms 39440 KB Output is correct
38 Correct 17 ms 31616 KB Output is correct
39 Correct 16 ms 31636 KB Output is correct
40 Correct 28 ms 54732 KB Output is correct
41 Correct 17 ms 31572 KB Output is correct
42 Correct 28 ms 54752 KB Output is correct
43 Correct 28 ms 54756 KB Output is correct
44 Correct 1340 ms 57396 KB Output is correct
45 Correct 14 ms 23892 KB Output is correct
46 Correct 284 ms 56180 KB Output is correct
47 Incorrect 468 ms 57388 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23940 KB Output is correct
3 Correct 30 ms 54768 KB Output is correct
4 Correct 25 ms 54740 KB Output is correct
5 Correct 32 ms 54780 KB Output is correct
6 Correct 31 ms 54800 KB Output is correct
7 Correct 28 ms 54788 KB Output is correct
8 Correct 28 ms 54460 KB Output is correct
9 Correct 13 ms 23892 KB Output is correct
10 Correct 23 ms 54552 KB Output is correct
11 Correct 26 ms 54740 KB Output is correct
12 Correct 25 ms 54736 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 27 ms 54760 KB Output is correct
15 Correct 13 ms 23968 KB Output is correct
16 Correct 34 ms 54740 KB Output is correct
17 Correct 13 ms 23892 KB Output is correct
18 Correct 27 ms 54724 KB Output is correct
19 Correct 24 ms 54484 KB Output is correct
20 Correct 27 ms 54692 KB Output is correct
21 Correct 26 ms 54740 KB Output is correct
22 Correct 28 ms 54448 KB Output is correct
23 Correct 30 ms 54740 KB Output is correct
24 Correct 27 ms 54540 KB Output is correct
25 Correct 28 ms 54740 KB Output is correct
26 Correct 28 ms 54792 KB Output is correct
27 Correct 29 ms 55048 KB Output is correct
28 Correct 30 ms 54784 KB Output is correct
29 Correct 31 ms 55120 KB Output is correct
30 Correct 28 ms 54720 KB Output is correct
31 Correct 29 ms 54912 KB Output is correct
32 Correct 28 ms 54740 KB Output is correct
33 Correct 32 ms 54860 KB Output is correct
34 Correct 30 ms 54868 KB Output is correct
35 Correct 22 ms 39452 KB Output is correct
36 Correct 20 ms 39380 KB Output is correct
37 Correct 20 ms 39440 KB Output is correct
38 Correct 17 ms 31616 KB Output is correct
39 Correct 16 ms 31636 KB Output is correct
40 Correct 28 ms 54732 KB Output is correct
41 Correct 17 ms 31572 KB Output is correct
42 Correct 28 ms 54752 KB Output is correct
43 Correct 28 ms 54756 KB Output is correct
44 Correct 13 ms 24020 KB Output is correct
45 Correct 486 ms 367964 KB Output is correct
46 Execution timed out 3096 ms 350880 KB Time limit exceeded
47 Halted 0 ms 0 KB -