oj.uz

Submission #647961

# Submission time Handle Problem Language Result Execution time Memory
647961 2022-10-04T17:10:43 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
77 / 100
 3000 ms 372404 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);
    int a = 0;
    for(int i = 0; i < n; ++i){
        int d; cin >> d; a += d;
        for(int j = 0; j < d; ++j){
            int x; cin >> x; g[i].pb(x); is[i][x] = 1;
        }
    }
    if(a > N){
        for(int i = 0; i < 1e9; ++i) cout << "f" << endl;
    }
    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: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 16 ms 25188 KB Output is correct
2 Correct 14 ms 25240 KB Output is correct
3 Correct 28 ms 55916 KB Output is correct
4 Correct 30 ms 56024 KB Output is correct
5 Correct 28 ms 55980 KB Output is correct
6 Correct 34 ms 56024 KB Output is correct
7 Correct 54 ms 55960 KB Output is correct
8 Correct 35 ms 55684 KB Output is correct
9 Correct 14 ms 25180 KB Output is correct
10 Correct 32 ms 55836 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25188 KB Output is correct
2 Correct 14 ms 25240 KB Output is correct
3 Correct 28 ms 55916 KB Output is correct
4 Correct 30 ms 56024 KB Output is correct
5 Correct 28 ms 55980 KB Output is correct
6 Correct 34 ms 56024 KB Output is correct
7 Correct 54 ms 55960 KB Output is correct
8 Correct 35 ms 55684 KB Output is correct
9 Correct 14 ms 25180 KB Output is correct
10 Correct 32 ms 55836 KB Output is correct
11 Correct 27 ms 56004 KB Output is correct
12 Correct 48 ms 56012 KB Output is correct
13 Correct 14 ms 25088 KB Output is correct
14 Correct 38 ms 56000 KB Output is correct
15 Correct 15 ms 25216 KB Output is correct
16 Correct 36 ms 55944 KB Output is correct
17 Correct 18 ms 25176 KB Output is correct
18 Correct 26 ms 56020 KB Output is correct
19 Correct 27 ms 55728 KB Output is correct
20 Correct 30 ms 55948 KB Output is correct
21 Correct 29 ms 55968 KB Output is correct
22 Correct 28 ms 55844 KB Output is correct
23 Correct 38 ms 55984 KB Output is correct
24 Correct 35 ms 55740 KB Output is correct
25 Correct 38 ms 56028 KB Output is correct
26 Correct 33 ms 56012 KB Output is correct
27 Correct 34 ms 56352 KB Output is correct
28 Correct 37 ms 56020 KB Output is correct
29 Correct 36 ms 56284 KB Output is correct
30 Correct 28 ms 56012 KB Output is correct
31 Correct 87 ms 56180 KB Output is correct
32 Correct 32 ms 55904 KB Output is correct
33 Correct 29 ms 56164 KB Output is correct
34 Correct 34 ms 56124 KB Output is correct
35 Correct 29 ms 40704 KB Output is correct
36 Correct 23 ms 40668 KB Output is correct
37 Correct 22 ms 40660 KB Output is correct
38 Correct 24 ms 32828 KB Output is correct
39 Correct 22 ms 32856 KB Output is correct
40 Correct 33 ms 55960 KB Output is correct
41 Correct 19 ms 32832 KB Output is correct
42 Correct 32 ms 56092 KB Output is correct
43 Correct 30 ms 55968 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 63860 KB Output is correct
2 Correct 23 ms 33108 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 27 ms 33056 KB Output is correct
5 Correct 27 ms 33108 KB Output is correct
6 Correct 24 ms 33032 KB Output is correct
7 Correct 31 ms 33060 KB Output is correct
8 Correct 27 ms 33108 KB Output is correct
9 Correct 22 ms 33108 KB Output is correct
10 Correct 22 ms 33080 KB Output is correct
11 Correct 778 ms 371856 KB Output is correct
12 Correct 27 ms 33100 KB Output is correct
13 Correct 555 ms 372160 KB Output is correct
14 Correct 24 ms 33108 KB Output is correct
15 Correct 555 ms 372108 KB Output is correct
16 Correct 545 ms 372340 KB Output is correct
17 Correct 597 ms 372404 KB Output is correct
18 Correct 522 ms 372352 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25188 KB Output is correct
2 Correct 14 ms 25240 KB Output is correct
3 Correct 28 ms 55916 KB Output is correct
4 Correct 30 ms 56024 KB Output is correct
5 Correct 28 ms 55980 KB Output is correct
6 Correct 34 ms 56024 KB Output is correct
7 Correct 54 ms 55960 KB Output is correct
8 Correct 35 ms 55684 KB Output is correct
9 Correct 14 ms 25180 KB Output is correct
10 Correct 32 ms 55836 KB Output is correct
11 Correct 27 ms 56004 KB Output is correct
12 Correct 48 ms 56012 KB Output is correct
13 Correct 14 ms 25088 KB Output is correct
14 Correct 38 ms 56000 KB Output is correct
15 Correct 15 ms 25216 KB Output is correct
16 Correct 36 ms 55944 KB Output is correct
17 Correct 18 ms 25176 KB Output is correct
18 Correct 26 ms 56020 KB Output is correct
19 Correct 27 ms 55728 KB Output is correct
20 Correct 30 ms 55948 KB Output is correct
21 Correct 29 ms 55968 KB Output is correct
22 Correct 28 ms 55844 KB Output is correct
23 Correct 38 ms 55984 KB Output is correct
24 Correct 35 ms 55740 KB Output is correct
25 Correct 38 ms 56028 KB Output is correct
26 Correct 33 ms 56012 KB Output is correct
27 Correct 34 ms 56352 KB Output is correct
28 Correct 37 ms 56020 KB Output is correct
29 Correct 36 ms 56284 KB Output is correct
30 Correct 28 ms 56012 KB Output is correct
31 Correct 87 ms 56180 KB Output is correct
32 Correct 32 ms 55904 KB Output is correct
33 Correct 29 ms 56164 KB Output is correct
34 Correct 34 ms 56124 KB Output is correct
35 Correct 29 ms 40704 KB Output is correct
36 Correct 23 ms 40668 KB Output is correct
37 Correct 22 ms 40660 KB Output is correct
38 Correct 24 ms 32828 KB Output is correct
39 Correct 22 ms 32856 KB Output is correct
40 Correct 33 ms 55960 KB Output is correct
41 Correct 19 ms 32832 KB Output is correct
42 Correct 32 ms 56092 KB Output is correct
43 Correct 30 ms 55968 KB Output is correct
44 Correct 244 ms 76308 KB Output is correct
45 Correct 24 ms 33072 KB Output is correct
46 Correct 49 ms 65252 KB Output is correct
47 Correct 68 ms 66460 KB Output is correct
48 Correct 47 ms 65248 KB Output is correct
49 Correct 71 ms 66564 KB Output is correct
50 Correct 67 ms 66436 KB Output is correct
51 Correct 110 ms 69132 KB Output is correct
52 Correct 39 ms 56016 KB Output is correct
53 Correct 2079 ms 69732 KB Output is correct
54 Correct 139 ms 69780 KB Output is correct
55 Correct 45 ms 64480 KB Output is correct
56 Correct 28 ms 55992 KB Output is correct
57 Correct 41 ms 63828 KB Output is correct
58 Correct 2037 ms 69748 KB Output is correct
59 Correct 65 ms 65156 KB Output is correct
60 Correct 48 ms 64476 KB Output is correct
61 Correct 72 ms 65208 KB Output is correct
62 Correct 73 ms 65212 KB Output is correct
63 Correct 317 ms 76284 KB Output is correct
64 Correct 214 ms 70700 KB Output is correct
65 Correct 72 ms 65000 KB Output is correct
66 Correct 79 ms 65444 KB Output is correct
67 Correct 230 ms 67052 KB Output is correct
68 Correct 170 ms 70720 KB Output is correct
69 Correct 58 ms 64972 KB Output is correct
70 Correct 77 ms 66188 KB Output is correct
71 Correct 155 ms 67052 KB Output is correct
72 Correct 120 ms 66868 KB Output is correct
73 Correct 56 ms 64348 KB Output is correct
74 Correct 83 ms 66288 KB Output is correct
75 Correct 99 ms 66944 KB Output is correct
76 Correct 108 ms 65660 KB Output is correct
77 Correct 75 ms 67616 KB Output is correct
78 Correct 70 ms 64432 KB Output is correct
79 Correct 55 ms 50272 KB Output is correct
80 Correct 101 ms 65684 KB Output is correct
81 Correct 69 ms 67648 KB Output is correct
82 Correct 32 ms 40944 KB Output is correct
83 Correct 44 ms 50276 KB Output is correct
84 Correct 83 ms 66948 KB Output is correct
85 Correct 35 ms 40968 KB Output is correct
86 Correct 60 ms 66932 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25188 KB Output is correct
2 Correct 14 ms 25240 KB Output is correct
3 Correct 28 ms 55916 KB Output is correct
4 Correct 30 ms 56024 KB Output is correct
5 Correct 28 ms 55980 KB Output is correct
6 Correct 34 ms 56024 KB Output is correct
7 Correct 54 ms 55960 KB Output is correct
8 Correct 35 ms 55684 KB Output is correct
9 Correct 14 ms 25180 KB Output is correct
10 Correct 32 ms 55836 KB Output is correct
11 Correct 27 ms 56004 KB Output is correct
12 Correct 48 ms 56012 KB Output is correct
13 Correct 14 ms 25088 KB Output is correct
14 Correct 38 ms 56000 KB Output is correct
15 Correct 15 ms 25216 KB Output is correct
16 Correct 36 ms 55944 KB Output is correct
17 Correct 18 ms 25176 KB Output is correct
18 Correct 26 ms 56020 KB Output is correct
19 Correct 27 ms 55728 KB Output is correct
20 Correct 30 ms 55948 KB Output is correct
21 Correct 29 ms 55968 KB Output is correct
22 Correct 28 ms 55844 KB Output is correct
23 Correct 38 ms 55984 KB Output is correct
24 Correct 35 ms 55740 KB Output is correct
25 Correct 38 ms 56028 KB Output is correct
26 Correct 33 ms 56012 KB Output is correct
27 Correct 34 ms 56352 KB Output is correct
28 Correct 37 ms 56020 KB Output is correct
29 Correct 36 ms 56284 KB Output is correct
30 Correct 28 ms 56012 KB Output is correct
31 Correct 87 ms 56180 KB Output is correct
32 Correct 32 ms 55904 KB Output is correct
33 Correct 29 ms 56164 KB Output is correct
34 Correct 34 ms 56124 KB Output is correct
35 Correct 29 ms 40704 KB Output is correct
36 Correct 23 ms 40668 KB Output is correct
37 Correct 22 ms 40660 KB Output is correct
38 Correct 24 ms 32828 KB Output is correct
39 Correct 22 ms 32856 KB Output is correct
40 Correct 33 ms 55960 KB Output is correct
41 Correct 19 ms 32832 KB Output is correct
42 Correct 32 ms 56092 KB Output is correct
43 Correct 30 ms 55968 KB Output is correct
44 Correct 23 ms 32992 KB Output is correct
45 Correct 427 ms 362288 KB Output is correct
46 Execution timed out 3026 ms 352520 KB Time limit exceeded
47 Halted 0 ms 0 KB -