oj.uz

답안 #647978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647978 2022-10-04T17:29:07 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
39 / 100
 236 ms 359104 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 = 99000007;


int n, k;
vector<int> g[N], path;
vector<bool> vis(N);
vector<bitset<50005>> 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){
    return ((a%MO)+MO)%MO;
}
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);
    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] * 5) % 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<50005> out, in;
        vector<vector<int>> t;
        bitset<N*100> m;

        for(auto &u: v){
            ll h = 0;
            for(int x: u) in[x] = 1, h += e[x];
            h = mod(h);
            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:166:16: warning: unused variable 'aa' [-Wunused-variable]
  166 |     int T = 1, aa;
      |                ^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 18 ms 36180 KB Output is correct
3 Correct 32 ms 66900 KB Output is correct
4 Correct 31 ms 66972 KB Output is correct
5 Correct 30 ms 67028 KB Output is correct
6 Correct 34 ms 66872 KB Output is correct
7 Correct 31 ms 66900 KB Output is correct
8 Correct 29 ms 66680 KB Output is correct
9 Correct 18 ms 36124 KB Output is correct
10 Correct 29 ms 66720 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 18 ms 36180 KB Output is correct
3 Correct 32 ms 66900 KB Output is correct
4 Correct 31 ms 66972 KB Output is correct
5 Correct 30 ms 67028 KB Output is correct
6 Correct 34 ms 66872 KB Output is correct
7 Correct 31 ms 66900 KB Output is correct
8 Correct 29 ms 66680 KB Output is correct
9 Correct 18 ms 36124 KB Output is correct
10 Correct 29 ms 66720 KB Output is correct
11 Correct 34 ms 66916 KB Output is correct
12 Correct 30 ms 66936 KB Output is correct
13 Correct 18 ms 36180 KB Output is correct
14 Correct 32 ms 66944 KB Output is correct
15 Correct 22 ms 36176 KB Output is correct
16 Correct 33 ms 67004 KB Output is correct
17 Correct 18 ms 36196 KB Output is correct
18 Correct 30 ms 66900 KB Output is correct
19 Correct 30 ms 66684 KB Output is correct
20 Correct 31 ms 66900 KB Output is correct
21 Correct 29 ms 66912 KB Output is correct
22 Correct 34 ms 66784 KB Output is correct
23 Correct 30 ms 66900 KB Output is correct
24 Correct 29 ms 66792 KB Output is correct
25 Correct 31 ms 66932 KB Output is correct
26 Correct 30 ms 67024 KB Output is correct
27 Correct 31 ms 67244 KB Output is correct
28 Correct 31 ms 67028 KB Output is correct
29 Correct 30 ms 67312 KB Output is correct
30 Correct 31 ms 66900 KB Output is correct
31 Correct 31 ms 67020 KB Output is correct
32 Correct 33 ms 66916 KB Output is correct
33 Correct 31 ms 67112 KB Output is correct
34 Correct 32 ms 67156 KB Output is correct
35 Correct 24 ms 51624 KB Output is correct
36 Correct 25 ms 51572 KB Output is correct
37 Correct 30 ms 51660 KB Output is correct
38 Correct 21 ms 43756 KB Output is correct
39 Correct 21 ms 43860 KB Output is correct
40 Correct 34 ms 66948 KB Output is correct
41 Correct 21 ms 43808 KB Output is correct
42 Correct 33 ms 66976 KB Output is correct
43 Correct 33 ms 66900 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 74612 KB Output is correct
2 Correct 26 ms 44116 KB Output is correct
3 Correct 25 ms 44032 KB Output is correct
4 Correct 28 ms 44068 KB Output is correct
5 Correct 29 ms 44028 KB Output is correct
6 Correct 29 ms 44048 KB Output is correct
7 Correct 29 ms 44064 KB Output is correct
8 Correct 26 ms 44036 KB Output is correct
9 Correct 29 ms 44020 KB Output is correct
10 Correct 27 ms 44068 KB Output is correct
11 Correct 225 ms 359104 KB Output is correct
12 Correct 28 ms 44088 KB Output is correct
13 Correct 236 ms 358952 KB Output is correct
14 Correct 28 ms 44104 KB Output is correct
15 Correct 226 ms 358952 KB Output is correct
16 Correct 235 ms 358988 KB Output is correct
17 Correct 229 ms 358908 KB Output is correct
18 Correct 228 ms 358992 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 18 ms 36180 KB Output is correct
3 Correct 32 ms 66900 KB Output is correct
4 Correct 31 ms 66972 KB Output is correct
5 Correct 30 ms 67028 KB Output is correct
6 Correct 34 ms 66872 KB Output is correct
7 Correct 31 ms 66900 KB Output is correct
8 Correct 29 ms 66680 KB Output is correct
9 Correct 18 ms 36124 KB Output is correct
10 Correct 29 ms 66720 KB Output is correct
11 Correct 34 ms 66916 KB Output is correct
12 Correct 30 ms 66936 KB Output is correct
13 Correct 18 ms 36180 KB Output is correct
14 Correct 32 ms 66944 KB Output is correct
15 Correct 22 ms 36176 KB Output is correct
16 Correct 33 ms 67004 KB Output is correct
17 Correct 18 ms 36196 KB Output is correct
18 Correct 30 ms 66900 KB Output is correct
19 Correct 30 ms 66684 KB Output is correct
20 Correct 31 ms 66900 KB Output is correct
21 Correct 29 ms 66912 KB Output is correct
22 Correct 34 ms 66784 KB Output is correct
23 Correct 30 ms 66900 KB Output is correct
24 Correct 29 ms 66792 KB Output is correct
25 Correct 31 ms 66932 KB Output is correct
26 Correct 30 ms 67024 KB Output is correct
27 Correct 31 ms 67244 KB Output is correct
28 Correct 31 ms 67028 KB Output is correct
29 Correct 30 ms 67312 KB Output is correct
30 Correct 31 ms 66900 KB Output is correct
31 Correct 31 ms 67020 KB Output is correct
32 Correct 33 ms 66916 KB Output is correct
33 Correct 31 ms 67112 KB Output is correct
34 Correct 32 ms 67156 KB Output is correct
35 Correct 24 ms 51624 KB Output is correct
36 Correct 25 ms 51572 KB Output is correct
37 Correct 30 ms 51660 KB Output is correct
38 Correct 21 ms 43756 KB Output is correct
39 Correct 21 ms 43860 KB Output is correct
40 Correct 34 ms 66948 KB Output is correct
41 Correct 21 ms 43808 KB Output is correct
42 Correct 33 ms 66976 KB Output is correct
43 Correct 33 ms 66900 KB Output is correct
44 Correct 125 ms 81056 KB Output is correct
45 Correct 26 ms 43988 KB Output is correct
46 Incorrect 41 ms 75092 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 18 ms 36180 KB Output is correct
3 Correct 32 ms 66900 KB Output is correct
4 Correct 31 ms 66972 KB Output is correct
5 Correct 30 ms 67028 KB Output is correct
6 Correct 34 ms 66872 KB Output is correct
7 Correct 31 ms 66900 KB Output is correct
8 Correct 29 ms 66680 KB Output is correct
9 Correct 18 ms 36124 KB Output is correct
10 Correct 29 ms 66720 KB Output is correct
11 Correct 34 ms 66916 KB Output is correct
12 Correct 30 ms 66936 KB Output is correct
13 Correct 18 ms 36180 KB Output is correct
14 Correct 32 ms 66944 KB Output is correct
15 Correct 22 ms 36176 KB Output is correct
16 Correct 33 ms 67004 KB Output is correct
17 Correct 18 ms 36196 KB Output is correct
18 Correct 30 ms 66900 KB Output is correct
19 Correct 30 ms 66684 KB Output is correct
20 Correct 31 ms 66900 KB Output is correct
21 Correct 29 ms 66912 KB Output is correct
22 Correct 34 ms 66784 KB Output is correct
23 Correct 30 ms 66900 KB Output is correct
24 Correct 29 ms 66792 KB Output is correct
25 Correct 31 ms 66932 KB Output is correct
26 Correct 30 ms 67024 KB Output is correct
27 Correct 31 ms 67244 KB Output is correct
28 Correct 31 ms 67028 KB Output is correct
29 Correct 30 ms 67312 KB Output is correct
30 Correct 31 ms 66900 KB Output is correct
31 Correct 31 ms 67020 KB Output is correct
32 Correct 33 ms 66916 KB Output is correct
33 Correct 31 ms 67112 KB Output is correct
34 Correct 32 ms 67156 KB Output is correct
35 Correct 24 ms 51624 KB Output is correct
36 Correct 25 ms 51572 KB Output is correct
37 Correct 30 ms 51660 KB Output is correct
38 Correct 21 ms 43756 KB Output is correct
39 Correct 21 ms 43860 KB Output is correct
40 Correct 34 ms 66948 KB Output is correct
41 Correct 21 ms 43808 KB Output is correct
42 Correct 33 ms 66976 KB Output is correct
43 Correct 33 ms 66900 KB Output is correct
44 Correct 26 ms 44020 KB Output is correct
45 Correct 197 ms 355888 KB Output is correct
46 Correct 168 ms 352332 KB Output is correct
47 Correct 199 ms 355928 KB Output is correct
48 Correct 199 ms 355932 KB Output is correct
49 Correct 136 ms 343948 KB Output is correct
50 Correct 187 ms 352420 KB Output is correct
51 Correct 195 ms 355964 KB Output is correct
52 Correct 148 ms 351820 KB Output is correct
53 Correct 134 ms 344020 KB Output is correct
54 Correct 132 ms 350064 KB Output is correct
55 Correct 190 ms 352548 KB Output is correct
56 Correct 143 ms 343736 KB Output is correct
57 Correct 160 ms 351808 KB Output is correct
58 Correct 187 ms 353704 KB Output is correct
59 Correct 139 ms 343688 KB Output is correct
60 Correct 151 ms 351704 KB Output is correct
61 Correct 179 ms 353668 KB Output is correct
62 Correct 160 ms 352896 KB Output is correct
63 Correct 188 ms 354920 KB Output is correct
64 Correct 146 ms 351536 KB Output is correct
65 Correct 198 ms 355616 KB Output is correct
66 Correct 175 ms 352816 KB Output is correct
67 Correct 180 ms 355012 KB Output is correct
68 Correct 188 ms 355376 KB Output is correct
69 Correct 196 ms 355756 KB Output is correct
70 Correct 162 ms 357444 KB Output is correct
71 Correct 187 ms 355416 KB Output is correct
72 Incorrect 176 ms 353868 KB Output isn't correct
73 Halted 0 ms 0 KB -