oj.uz

답안 #647977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647977 2022-10-04T17:24:51 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
39 / 100
 316 ms 359044 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<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*100> 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

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 19 ms 36232 KB Output is correct
3 Correct 33 ms 66900 KB Output is correct
4 Correct 38 ms 66904 KB Output is correct
5 Correct 31 ms 66904 KB Output is correct
6 Correct 31 ms 66936 KB Output is correct
7 Correct 30 ms 66920 KB Output is correct
8 Correct 32 ms 66716 KB Output is correct
9 Correct 20 ms 36156 KB Output is correct
10 Correct 34 ms 66776 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 19 ms 36232 KB Output is correct
3 Correct 33 ms 66900 KB Output is correct
4 Correct 38 ms 66904 KB Output is correct
5 Correct 31 ms 66904 KB Output is correct
6 Correct 31 ms 66936 KB Output is correct
7 Correct 30 ms 66920 KB Output is correct
8 Correct 32 ms 66716 KB Output is correct
9 Correct 20 ms 36156 KB Output is correct
10 Correct 34 ms 66776 KB Output is correct
11 Correct 31 ms 66888 KB Output is correct
12 Correct 39 ms 66936 KB Output is correct
13 Correct 19 ms 36216 KB Output is correct
14 Correct 33 ms 66960 KB Output is correct
15 Correct 19 ms 36172 KB Output is correct
16 Correct 33 ms 66888 KB Output is correct
17 Correct 20 ms 36200 KB Output is correct
18 Correct 33 ms 66948 KB Output is correct
19 Correct 31 ms 66664 KB Output is correct
20 Correct 31 ms 66900 KB Output is correct
21 Correct 30 ms 66828 KB Output is correct
22 Correct 29 ms 66804 KB Output is correct
23 Correct 32 ms 66932 KB Output is correct
24 Correct 28 ms 66772 KB Output is correct
25 Correct 31 ms 66880 KB Output is correct
26 Correct 31 ms 67020 KB Output is correct
27 Correct 34 ms 67276 KB Output is correct
28 Correct 36 ms 66984 KB Output is correct
29 Correct 34 ms 67340 KB Output is correct
30 Correct 35 ms 66892 KB Output is correct
31 Correct 42 ms 67028 KB Output is correct
32 Correct 37 ms 66876 KB Output is correct
33 Correct 32 ms 67120 KB Output is correct
34 Correct 32 ms 67080 KB Output is correct
35 Correct 25 ms 51692 KB Output is correct
36 Correct 25 ms 51668 KB Output is correct
37 Correct 33 ms 51568 KB Output is correct
38 Correct 25 ms 43860 KB Output is correct
39 Correct 27 ms 43804 KB Output is correct
40 Correct 38 ms 66980 KB Output is correct
41 Correct 26 ms 43856 KB Output is correct
42 Correct 35 ms 66856 KB Output is correct
43 Correct 31 ms 66900 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 74500 KB Output is correct
2 Correct 26 ms 44056 KB Output is correct
3 Correct 27 ms 44116 KB Output is correct
4 Correct 28 ms 43980 KB Output is correct
5 Correct 31 ms 44116 KB Output is correct
6 Correct 30 ms 44116 KB Output is correct
7 Correct 29 ms 44116 KB Output is correct
8 Correct 28 ms 44092 KB Output is correct
9 Correct 33 ms 44116 KB Output is correct
10 Correct 29 ms 44116 KB Output is correct
11 Correct 297 ms 359004 KB Output is correct
12 Correct 35 ms 44116 KB Output is correct
13 Correct 316 ms 358936 KB Output is correct
14 Correct 38 ms 44204 KB Output is correct
15 Correct 268 ms 359012 KB Output is correct
16 Correct 276 ms 359044 KB Output is correct
17 Correct 301 ms 358892 KB Output is correct
18 Correct 296 ms 358972 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 36180 KB Output is correct
2 Correct 19 ms 36232 KB Output is correct
3 Correct 33 ms 66900 KB Output is correct
4 Correct 38 ms 66904 KB Output is correct
5 Correct 31 ms 66904 KB Output is correct
6 Correct 31 ms 66936 KB Output is correct
7 Correct 30 ms 66920 KB Output is correct
8 Correct 32 ms 66716 KB Output is correct
9 Correct 20 ms 36156 KB Output is correct
10 Correct 34 ms 66776 KB Output is correct
11 Correct 31 ms 66888 KB Output is correct
12 Correct 39 ms 66936 KB Output is correct
13 Correct 19 ms 36216 KB Output is correct
14 Correct 33 ms 66960 KB Output is correct
15 Correct 19 ms 36172 KB Output is correct
16 Correct 33 ms 66888 KB Output is correct
17 Correct 20 ms 36200 KB Output is correct
18 Correct 33 ms 66948 KB Output is correct
19 Correct 31 ms 66664 KB Output is correct
20 Correct 31 ms 66900 KB Output is correct
21 Correct 30 ms 66828 KB Output is correct
22 Correct 29 ms 66804 KB Output is correct
23 Correct 32 ms 66932 KB Output is correct
24 Correct 28 ms 66772 KB Output is correct
25 Correct 31 ms 66880 KB Output is correct
26 Correct 31 ms 67020 KB Output is correct
27 Correct 34 ms 67276 KB Output is correct
28 Correct 36 ms 66984 KB Output is correct
29 Correct 34 ms 67340 KB Output is correct
30 Correct 35 ms 66892 KB Output is correct
31 Correct 42 ms 67028 KB Output is correct
32 Correct 37 ms 66876 KB Output is correct
33 Correct 32 ms 67120 KB Output is correct
34 Correct 32 ms 67080 KB Output is correct
35 Correct 25 ms 51692 KB Output is correct
36 Correct 25 ms 51668 KB Output is correct
37 Correct 33 ms 51568 KB Output is correct
38 Correct 25 ms 43860 KB Output is correct
39 Correct 27 ms 43804 KB Output is correct
40 Correct 38 ms 66980 KB Output is correct
41 Correct 26 ms 43856 KB Output is correct
42 Correct 35 ms 66856 KB Output is correct
43 Correct 31 ms 66900 KB Output is correct
44 Correct 169 ms 81000 KB Output is correct
45 Correct 28 ms 43988 KB Output is correct
46 Incorrect 47 ms 75088 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 19 ms 36232 KB Output is correct
3 Correct 33 ms 66900 KB Output is correct
4 Correct 38 ms 66904 KB Output is correct
5 Correct 31 ms 66904 KB Output is correct
6 Correct 31 ms 66936 KB Output is correct
7 Correct 30 ms 66920 KB Output is correct
8 Correct 32 ms 66716 KB Output is correct
9 Correct 20 ms 36156 KB Output is correct
10 Correct 34 ms 66776 KB Output is correct
11 Correct 31 ms 66888 KB Output is correct
12 Correct 39 ms 66936 KB Output is correct
13 Correct 19 ms 36216 KB Output is correct
14 Correct 33 ms 66960 KB Output is correct
15 Correct 19 ms 36172 KB Output is correct
16 Correct 33 ms 66888 KB Output is correct
17 Correct 20 ms 36200 KB Output is correct
18 Correct 33 ms 66948 KB Output is correct
19 Correct 31 ms 66664 KB Output is correct
20 Correct 31 ms 66900 KB Output is correct
21 Correct 30 ms 66828 KB Output is correct
22 Correct 29 ms 66804 KB Output is correct
23 Correct 32 ms 66932 KB Output is correct
24 Correct 28 ms 66772 KB Output is correct
25 Correct 31 ms 66880 KB Output is correct
26 Correct 31 ms 67020 KB Output is correct
27 Correct 34 ms 67276 KB Output is correct
28 Correct 36 ms 66984 KB Output is correct
29 Correct 34 ms 67340 KB Output is correct
30 Correct 35 ms 66892 KB Output is correct
31 Correct 42 ms 67028 KB Output is correct
32 Correct 37 ms 66876 KB Output is correct
33 Correct 32 ms 67120 KB Output is correct
34 Correct 32 ms 67080 KB Output is correct
35 Correct 25 ms 51692 KB Output is correct
36 Correct 25 ms 51668 KB Output is correct
37 Correct 33 ms 51568 KB Output is correct
38 Correct 25 ms 43860 KB Output is correct
39 Correct 27 ms 43804 KB Output is correct
40 Correct 38 ms 66980 KB Output is correct
41 Correct 26 ms 43856 KB Output is correct
42 Correct 35 ms 66856 KB Output is correct
43 Correct 31 ms 66900 KB Output is correct
44 Correct 28 ms 43988 KB Output is correct
45 Correct 202 ms 355856 KB Output is correct
46 Correct 212 ms 352348 KB Output is correct
47 Correct 233 ms 355920 KB Output is correct
48 Correct 208 ms 355964 KB Output is correct
49 Correct 147 ms 343940 KB Output is correct
50 Correct 198 ms 352464 KB Output is correct
51 Correct 216 ms 355976 KB Output is correct
52 Correct 183 ms 351736 KB Output is correct
53 Correct 145 ms 344076 KB Output is correct
54 Correct 156 ms 350044 KB Output is correct
55 Correct 196 ms 352548 KB Output is correct
56 Correct 148 ms 343752 KB Output is correct
57 Correct 155 ms 351832 KB Output is correct
58 Correct 205 ms 353728 KB Output is correct
59 Correct 149 ms 343708 KB Output is correct
60 Correct 149 ms 351600 KB Output is correct
61 Correct 230 ms 353720 KB Output is correct
62 Correct 166 ms 352904 KB Output is correct
63 Correct 182 ms 354988 KB Output is correct
64 Correct 162 ms 351568 KB Output is correct
65 Correct 217 ms 355632 KB Output is correct
66 Correct 195 ms 352800 KB Output is correct
67 Correct 184 ms 354924 KB Output is correct
68 Correct 211 ms 355484 KB Output is correct
69 Correct 210 ms 355704 KB Output is correct
70 Correct 179 ms 357352 KB Output is correct
71 Correct 210 ms 355444 KB Output is correct
72 Incorrect 191 ms 353820 KB Output isn't correct
73 Halted 0 ms 0 KB -