oj.uz

Submission #647975

# Submission time Handle Problem Language Result Execution time Memory
647975 2022-10-04T17:22:42 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
39 / 100
 297 ms 348020 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;
}
vector<vector<int>> v;
void dfs2(int vv, int p){
    vis[vv] = 1;
    path.pb(vv);
    for(int u: g[vv]){
        if(u != p){
            if(vis[u]){
                if(path[path.size() - 3] == u){
                    v.pb({vv, path[path.size() - 2], path[path.size() - 3]});
                }
            }else{
                dfs2(u, vv);
            }
        }    
    }
    path.pop_back();
}

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

    bool o = 0;
    for(int i = 0; i < n; ++i) if(g[i].size() > 0) o = 1;
    if(!o){
        cout << 1;
        return;
    }

    for(int i = 0; i < n; ++i) if(!vis[i]) dfs2(i, i);

    if(v.size() == 0){
        cout << 2;
        return;
    }

    for(int j = 4; 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:168:16: warning: unused variable 'aa' [-Wunused-variable]
  168 |     int T = 1, aa;
      |                ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25172 KB Output is correct
2 Correct 15 ms 25140 KB Output is correct
3 Correct 27 ms 55924 KB Output is correct
4 Correct 25 ms 55920 KB Output is correct
5 Correct 26 ms 55892 KB Output is correct
6 Correct 27 ms 55884 KB Output is correct
7 Correct 26 ms 55944 KB Output is correct
8 Correct 25 ms 55764 KB Output is correct
9 Correct 14 ms 25172 KB Output is correct
10 Correct 26 ms 55756 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25172 KB Output is correct
2 Correct 15 ms 25140 KB Output is correct
3 Correct 27 ms 55924 KB Output is correct
4 Correct 25 ms 55920 KB Output is correct
5 Correct 26 ms 55892 KB Output is correct
6 Correct 27 ms 55884 KB Output is correct
7 Correct 26 ms 55944 KB Output is correct
8 Correct 25 ms 55764 KB Output is correct
9 Correct 14 ms 25172 KB Output is correct
10 Correct 26 ms 55756 KB Output is correct
11 Correct 25 ms 55896 KB Output is correct
12 Correct 25 ms 55892 KB Output is correct
13 Correct 13 ms 25180 KB Output is correct
14 Correct 26 ms 55884 KB Output is correct
15 Correct 16 ms 25100 KB Output is correct
16 Correct 28 ms 55880 KB Output is correct
17 Correct 14 ms 25204 KB Output is correct
18 Correct 28 ms 55956 KB Output is correct
19 Correct 26 ms 55764 KB Output is correct
20 Correct 26 ms 55892 KB Output is correct
21 Correct 27 ms 55892 KB Output is correct
22 Correct 25 ms 55764 KB Output is correct
23 Correct 30 ms 55936 KB Output is correct
24 Correct 26 ms 55756 KB Output is correct
25 Correct 27 ms 55892 KB Output is correct
26 Correct 33 ms 55956 KB Output is correct
27 Correct 32 ms 56328 KB Output is correct
28 Correct 28 ms 56004 KB Output is correct
29 Correct 29 ms 56196 KB Output is correct
30 Correct 28 ms 55892 KB Output is correct
31 Correct 29 ms 56132 KB Output is correct
32 Correct 27 ms 55904 KB Output is correct
33 Correct 28 ms 56124 KB Output is correct
34 Correct 31 ms 56012 KB Output is correct
35 Correct 21 ms 40628 KB Output is correct
36 Correct 21 ms 40560 KB Output is correct
37 Correct 21 ms 40660 KB Output is correct
38 Correct 17 ms 32792 KB Output is correct
39 Correct 17 ms 32852 KB Output is correct
40 Correct 31 ms 55912 KB Output is correct
41 Correct 16 ms 32852 KB Output is correct
42 Correct 29 ms 55964 KB Output is correct
43 Correct 30 ms 55880 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 63572 KB Output is correct
2 Correct 21 ms 33096 KB Output is correct
3 Correct 23 ms 33048 KB Output is correct
4 Correct 20 ms 33048 KB Output is correct
5 Correct 20 ms 33108 KB Output is correct
6 Correct 21 ms 33036 KB Output is correct
7 Correct 22 ms 33052 KB Output is correct
8 Correct 22 ms 33132 KB Output is correct
9 Correct 22 ms 33024 KB Output is correct
10 Correct 24 ms 33088 KB Output is correct
11 Correct 221 ms 348020 KB Output is correct
12 Correct 21 ms 33108 KB Output is correct
13 Correct 247 ms 347988 KB Output is correct
14 Correct 22 ms 33124 KB Output is correct
15 Correct 233 ms 347948 KB Output is correct
16 Correct 236 ms 347948 KB Output is correct
17 Correct 228 ms 347948 KB Output is correct
18 Correct 221 ms 347968 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25172 KB Output is correct
2 Correct 15 ms 25140 KB Output is correct
3 Correct 27 ms 55924 KB Output is correct
4 Correct 25 ms 55920 KB Output is correct
5 Correct 26 ms 55892 KB Output is correct
6 Correct 27 ms 55884 KB Output is correct
7 Correct 26 ms 55944 KB Output is correct
8 Correct 25 ms 55764 KB Output is correct
9 Correct 14 ms 25172 KB Output is correct
10 Correct 26 ms 55756 KB Output is correct
11 Correct 25 ms 55896 KB Output is correct
12 Correct 25 ms 55892 KB Output is correct
13 Correct 13 ms 25180 KB Output is correct
14 Correct 26 ms 55884 KB Output is correct
15 Correct 16 ms 25100 KB Output is correct
16 Correct 28 ms 55880 KB Output is correct
17 Correct 14 ms 25204 KB Output is correct
18 Correct 28 ms 55956 KB Output is correct
19 Correct 26 ms 55764 KB Output is correct
20 Correct 26 ms 55892 KB Output is correct
21 Correct 27 ms 55892 KB Output is correct
22 Correct 25 ms 55764 KB Output is correct
23 Correct 30 ms 55936 KB Output is correct
24 Correct 26 ms 55756 KB Output is correct
25 Correct 27 ms 55892 KB Output is correct
26 Correct 33 ms 55956 KB Output is correct
27 Correct 32 ms 56328 KB Output is correct
28 Correct 28 ms 56004 KB Output is correct
29 Correct 29 ms 56196 KB Output is correct
30 Correct 28 ms 55892 KB Output is correct
31 Correct 29 ms 56132 KB Output is correct
32 Correct 27 ms 55904 KB Output is correct
33 Correct 28 ms 56124 KB Output is correct
34 Correct 31 ms 56012 KB Output is correct
35 Correct 21 ms 40628 KB Output is correct
36 Correct 21 ms 40560 KB Output is correct
37 Correct 21 ms 40660 KB Output is correct
38 Correct 17 ms 32792 KB Output is correct
39 Correct 17 ms 32852 KB Output is correct
40 Correct 31 ms 55912 KB Output is correct
41 Correct 16 ms 32852 KB Output is correct
42 Correct 29 ms 55964 KB Output is correct
43 Correct 30 ms 55880 KB Output is correct
44 Correct 110 ms 70016 KB Output is correct
45 Correct 20 ms 33020 KB Output is correct
46 Incorrect 37 ms 64072 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25172 KB Output is correct
2 Correct 15 ms 25140 KB Output is correct
3 Correct 27 ms 55924 KB Output is correct
4 Correct 25 ms 55920 KB Output is correct
5 Correct 26 ms 55892 KB Output is correct
6 Correct 27 ms 55884 KB Output is correct
7 Correct 26 ms 55944 KB Output is correct
8 Correct 25 ms 55764 KB Output is correct
9 Correct 14 ms 25172 KB Output is correct
10 Correct 26 ms 55756 KB Output is correct
11 Correct 25 ms 55896 KB Output is correct
12 Correct 25 ms 55892 KB Output is correct
13 Correct 13 ms 25180 KB Output is correct
14 Correct 26 ms 55884 KB Output is correct
15 Correct 16 ms 25100 KB Output is correct
16 Correct 28 ms 55880 KB Output is correct
17 Correct 14 ms 25204 KB Output is correct
18 Correct 28 ms 55956 KB Output is correct
19 Correct 26 ms 55764 KB Output is correct
20 Correct 26 ms 55892 KB Output is correct
21 Correct 27 ms 55892 KB Output is correct
22 Correct 25 ms 55764 KB Output is correct
23 Correct 30 ms 55936 KB Output is correct
24 Correct 26 ms 55756 KB Output is correct
25 Correct 27 ms 55892 KB Output is correct
26 Correct 33 ms 55956 KB Output is correct
27 Correct 32 ms 56328 KB Output is correct
28 Correct 28 ms 56004 KB Output is correct
29 Correct 29 ms 56196 KB Output is correct
30 Correct 28 ms 55892 KB Output is correct
31 Correct 29 ms 56132 KB Output is correct
32 Correct 27 ms 55904 KB Output is correct
33 Correct 28 ms 56124 KB Output is correct
34 Correct 31 ms 56012 KB Output is correct
35 Correct 21 ms 40628 KB Output is correct
36 Correct 21 ms 40560 KB Output is correct
37 Correct 21 ms 40660 KB Output is correct
38 Correct 17 ms 32792 KB Output is correct
39 Correct 17 ms 32852 KB Output is correct
40 Correct 31 ms 55912 KB Output is correct
41 Correct 16 ms 32852 KB Output is correct
42 Correct 29 ms 55964 KB Output is correct
43 Correct 30 ms 55880 KB Output is correct
44 Correct 25 ms 33060 KB Output is correct
45 Correct 201 ms 344884 KB Output is correct
46 Correct 168 ms 341264 KB Output is correct
47 Correct 199 ms 346756 KB Output is correct
48 Correct 297 ms 346672 KB Output is correct
49 Correct 153 ms 333588 KB Output is correct
50 Correct 216 ms 343792 KB Output is correct
51 Correct 212 ms 346700 KB Output is correct
52 Correct 174 ms 341492 KB Output is correct
53 Correct 143 ms 333672 KB Output is correct
54 Correct 140 ms 339140 KB Output is correct
55 Correct 201 ms 343884 KB Output is correct
56 Correct 149 ms 333132 KB Output is correct
57 Correct 159 ms 341520 KB Output is correct
58 Correct 222 ms 343648 KB Output is correct
59 Correct 146 ms 333152 KB Output is correct
60 Correct 147 ms 341000 KB Output is correct
61 Correct 220 ms 343644 KB Output is correct
62 Correct 182 ms 342588 KB Output is correct
63 Correct 207 ms 345064 KB Output is correct
64 Correct 184 ms 340888 KB Output is correct
65 Correct 255 ms 346092 KB Output is correct
66 Correct 175 ms 342540 KB Output is correct
67 Correct 200 ms 344936 KB Output is correct
68 Correct 209 ms 345736 KB Output is correct
69 Correct 221 ms 346060 KB Output is correct
70 Correct 170 ms 346980 KB Output is correct
71 Correct 216 ms 345712 KB Output is correct
72 Incorrect 195 ms 343864 KB Output isn't correct
73 Halted 0 ms 0 KB -