oj.uz

Submission #647889

# Submission time Handle Problem Language Result Execution time Memory
647889 2022-10-04T11:55:23 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
77 / 100
 3000 ms 370168 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, MO = 9900047;


int n, k;
vector<int> g[N], path;
vector<bool> vis(N);
vector<bitset<50001>> is;
ll e[N];
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();
}

int mod(ll a){
    if(a < 0) a += MO;
    return a >= MO ? a - MO : a;
}

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;
    }

    e[0] = 1;
    for(int i = 1; i < N; ++i) e[i] = (e[i - 1] * 3) % MO;

    vector<vector<int>> v;
    for(int i = 0; i < n; ++i) v.pb({i});
    for(int j = 2; j <= k; ++j){
        bitset<50001> out, in;
        vector<vector<int>> t;
        bitset<N*10> m;

        for(auto &u: v){
            ll h = 0;
            for(int x: u) in[x] = 1, h += e[x];
            h = mod(h%MO);
            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){
                    h = mod(h + e[x]);
                    if(!m[h]){
                        m[h] = 1;
                        u.pb(x);
                        t.pb(u);
                        u.pop_back();
                    }
                    h = mod(h - e[x]);
                }
            }
            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:138:16: warning: unused variable 'aa' [-Wunused-variable]
  138 |     int T = 1, aa;
      |                ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25172 KB Output is correct
2 Correct 13 ms 25172 KB Output is correct
3 Correct 28 ms 55884 KB Output is correct
4 Correct 29 ms 55948 KB Output is correct
5 Correct 25 ms 55964 KB Output is correct
6 Correct 26 ms 55904 KB Output is correct
7 Correct 26 ms 55988 KB Output is correct
8 Correct 31 ms 55668 KB Output is correct
9 Correct 13 ms 25140 KB Output is correct
10 Correct 25 ms 55780 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25172 KB Output is correct
2 Correct 13 ms 25172 KB Output is correct
3 Correct 28 ms 55884 KB Output is correct
4 Correct 29 ms 55948 KB Output is correct
5 Correct 25 ms 55964 KB Output is correct
6 Correct 26 ms 55904 KB Output is correct
7 Correct 26 ms 55988 KB Output is correct
8 Correct 31 ms 55668 KB Output is correct
9 Correct 13 ms 25140 KB Output is correct
10 Correct 25 ms 55780 KB Output is correct
11 Correct 26 ms 55888 KB Output is correct
12 Correct 25 ms 55900 KB Output is correct
13 Correct 13 ms 25104 KB Output is correct
14 Correct 25 ms 55904 KB Output is correct
15 Correct 14 ms 25092 KB Output is correct
16 Correct 26 ms 55896 KB Output is correct
17 Correct 15 ms 25164 KB Output is correct
18 Correct 30 ms 55912 KB Output is correct
19 Correct 30 ms 55704 KB Output is correct
20 Correct 31 ms 55884 KB Output is correct
21 Correct 25 ms 55892 KB Output is correct
22 Correct 24 ms 55732 KB Output is correct
23 Correct 27 ms 55924 KB Output is correct
24 Correct 25 ms 55748 KB Output is correct
25 Correct 31 ms 55944 KB Output is correct
26 Correct 27 ms 56012 KB Output is correct
27 Correct 27 ms 56276 KB Output is correct
28 Correct 28 ms 55952 KB Output is correct
29 Correct 28 ms 56276 KB Output is correct
30 Correct 26 ms 55872 KB Output is correct
31 Correct 28 ms 56064 KB Output is correct
32 Correct 29 ms 55968 KB Output is correct
33 Correct 29 ms 56020 KB Output is correct
34 Correct 34 ms 56148 KB Output is correct
35 Correct 26 ms 40568 KB Output is correct
36 Correct 21 ms 40604 KB Output is correct
37 Correct 20 ms 40572 KB Output is correct
38 Correct 16 ms 32768 KB Output is correct
39 Correct 16 ms 32852 KB Output is correct
40 Correct 27 ms 55968 KB Output is correct
41 Correct 16 ms 32836 KB Output is correct
42 Correct 27 ms 55944 KB Output is correct
43 Correct 29 ms 55868 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63944 KB Output is correct
2 Correct 21 ms 33108 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 20 ms 32980 KB Output is correct
5 Correct 20 ms 33028 KB Output is correct
6 Correct 21 ms 33024 KB Output is correct
7 Correct 22 ms 33128 KB Output is correct
8 Correct 21 ms 33124 KB Output is correct
9 Correct 22 ms 33064 KB Output is correct
10 Correct 22 ms 33048 KB Output is correct
11 Correct 464 ms 370100 KB Output is correct
12 Correct 21 ms 33108 KB Output is correct
13 Correct 470 ms 370168 KB Output is correct
14 Correct 20 ms 33108 KB Output is correct
15 Correct 445 ms 370072 KB Output is correct
16 Correct 455 ms 370116 KB Output is correct
17 Correct 460 ms 370052 KB Output is correct
18 Correct 458 ms 369980 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25172 KB Output is correct
2 Correct 13 ms 25172 KB Output is correct
3 Correct 28 ms 55884 KB Output is correct
4 Correct 29 ms 55948 KB Output is correct
5 Correct 25 ms 55964 KB Output is correct
6 Correct 26 ms 55904 KB Output is correct
7 Correct 26 ms 55988 KB Output is correct
8 Correct 31 ms 55668 KB Output is correct
9 Correct 13 ms 25140 KB Output is correct
10 Correct 25 ms 55780 KB Output is correct
11 Correct 26 ms 55888 KB Output is correct
12 Correct 25 ms 55900 KB Output is correct
13 Correct 13 ms 25104 KB Output is correct
14 Correct 25 ms 55904 KB Output is correct
15 Correct 14 ms 25092 KB Output is correct
16 Correct 26 ms 55896 KB Output is correct
17 Correct 15 ms 25164 KB Output is correct
18 Correct 30 ms 55912 KB Output is correct
19 Correct 30 ms 55704 KB Output is correct
20 Correct 31 ms 55884 KB Output is correct
21 Correct 25 ms 55892 KB Output is correct
22 Correct 24 ms 55732 KB Output is correct
23 Correct 27 ms 55924 KB Output is correct
24 Correct 25 ms 55748 KB Output is correct
25 Correct 31 ms 55944 KB Output is correct
26 Correct 27 ms 56012 KB Output is correct
27 Correct 27 ms 56276 KB Output is correct
28 Correct 28 ms 55952 KB Output is correct
29 Correct 28 ms 56276 KB Output is correct
30 Correct 26 ms 55872 KB Output is correct
31 Correct 28 ms 56064 KB Output is correct
32 Correct 29 ms 55968 KB Output is correct
33 Correct 29 ms 56020 KB Output is correct
34 Correct 34 ms 56148 KB Output is correct
35 Correct 26 ms 40568 KB Output is correct
36 Correct 21 ms 40604 KB Output is correct
37 Correct 20 ms 40572 KB Output is correct
38 Correct 16 ms 32768 KB Output is correct
39 Correct 16 ms 32852 KB Output is correct
40 Correct 27 ms 55968 KB Output is correct
41 Correct 16 ms 32836 KB Output is correct
42 Correct 27 ms 55944 KB Output is correct
43 Correct 29 ms 55868 KB Output is correct
44 Correct 189 ms 76012 KB Output is correct
45 Correct 20 ms 32980 KB Output is correct
46 Correct 45 ms 65112 KB Output is correct
47 Correct 53 ms 66304 KB Output is correct
48 Correct 42 ms 65032 KB Output is correct
49 Correct 54 ms 66340 KB Output is correct
50 Correct 59 ms 66324 KB Output is correct
51 Correct 102 ms 68736 KB Output is correct
52 Correct 29 ms 55852 KB Output is correct
53 Correct 1827 ms 69312 KB Output is correct
54 Correct 109 ms 69252 KB Output is correct
55 Correct 41 ms 64304 KB Output is correct
56 Correct 26 ms 55960 KB Output is correct
57 Correct 35 ms 63864 KB Output is correct
58 Correct 1887 ms 69376 KB Output is correct
59 Correct 53 ms 65036 KB Output is correct
60 Correct 43 ms 64312 KB Output is correct
61 Correct 51 ms 65124 KB Output is correct
62 Correct 47 ms 65088 KB Output is correct
63 Correct 200 ms 76092 KB Output is correct
64 Correct 126 ms 70532 KB Output is correct
65 Correct 45 ms 65016 KB Output is correct
66 Correct 52 ms 65364 KB Output is correct
67 Correct 122 ms 66812 KB Output is correct
68 Correct 118 ms 70428 KB Output is correct
69 Correct 43 ms 64972 KB Output is correct
70 Correct 64 ms 66068 KB Output is correct
71 Correct 125 ms 66788 KB Output is correct
72 Correct 88 ms 66716 KB Output is correct
73 Correct 38 ms 64364 KB Output is correct
74 Correct 63 ms 66112 KB Output is correct
75 Correct 93 ms 66644 KB Output is correct
76 Correct 90 ms 65528 KB Output is correct
77 Correct 59 ms 67392 KB Output is correct
78 Correct 37 ms 64308 KB Output is correct
79 Correct 43 ms 50188 KB Output is correct
80 Correct 93 ms 65516 KB Output is correct
81 Correct 59 ms 67368 KB Output is correct
82 Correct 27 ms 40960 KB Output is correct
83 Correct 43 ms 50192 KB Output is correct
84 Correct 55 ms 66700 KB Output is correct
85 Correct 28 ms 40916 KB Output is correct
86 Correct 56 ms 66692 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25172 KB Output is correct
2 Correct 13 ms 25172 KB Output is correct
3 Correct 28 ms 55884 KB Output is correct
4 Correct 29 ms 55948 KB Output is correct
5 Correct 25 ms 55964 KB Output is correct
6 Correct 26 ms 55904 KB Output is correct
7 Correct 26 ms 55988 KB Output is correct
8 Correct 31 ms 55668 KB Output is correct
9 Correct 13 ms 25140 KB Output is correct
10 Correct 25 ms 55780 KB Output is correct
11 Correct 26 ms 55888 KB Output is correct
12 Correct 25 ms 55900 KB Output is correct
13 Correct 13 ms 25104 KB Output is correct
14 Correct 25 ms 55904 KB Output is correct
15 Correct 14 ms 25092 KB Output is correct
16 Correct 26 ms 55896 KB Output is correct
17 Correct 15 ms 25164 KB Output is correct
18 Correct 30 ms 55912 KB Output is correct
19 Correct 30 ms 55704 KB Output is correct
20 Correct 31 ms 55884 KB Output is correct
21 Correct 25 ms 55892 KB Output is correct
22 Correct 24 ms 55732 KB Output is correct
23 Correct 27 ms 55924 KB Output is correct
24 Correct 25 ms 55748 KB Output is correct
25 Correct 31 ms 55944 KB Output is correct
26 Correct 27 ms 56012 KB Output is correct
27 Correct 27 ms 56276 KB Output is correct
28 Correct 28 ms 55952 KB Output is correct
29 Correct 28 ms 56276 KB Output is correct
30 Correct 26 ms 55872 KB Output is correct
31 Correct 28 ms 56064 KB Output is correct
32 Correct 29 ms 55968 KB Output is correct
33 Correct 29 ms 56020 KB Output is correct
34 Correct 34 ms 56148 KB Output is correct
35 Correct 26 ms 40568 KB Output is correct
36 Correct 21 ms 40604 KB Output is correct
37 Correct 20 ms 40572 KB Output is correct
38 Correct 16 ms 32768 KB Output is correct
39 Correct 16 ms 32852 KB Output is correct
40 Correct 27 ms 55968 KB Output is correct
41 Correct 16 ms 32836 KB Output is correct
42 Correct 27 ms 55944 KB Output is correct
43 Correct 29 ms 55868 KB Output is correct
44 Correct 23 ms 33000 KB Output is correct
45 Correct 351 ms 360432 KB Output is correct
46 Execution timed out 3090 ms 351560 KB Time limit exceeded
47 Halted 0 ms 0 KB -