oj.uz

답안 #647886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647886 2022-10-04T11:47:16 Z mychecksedad Political Development (BOI17_politicaldevelopment) C++17
39 / 100
 3000 ms 383224 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;


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){
    return ((a % MOD) + MOD) % MOD;
}

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) % MOD;

    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;
        map<ll, bool> m;

        if(n <= 5000){
            for(auto &u: v){
                ll h = 0;
                for(int x: u) in[x] = 1, h += e[x];
                h = mod(h);
                for(int i = 0; i < n; ++i){
                    if(!in[i]){
                        bool ok = 1;
                        for(int d: u){
                            if(!is[d][i]){
                                ok = 0;
                                break;
                            }
                        }
                        if(ok){
                            h = mod(h + e[i]);
                            if(!m[h]){
                                m[h] = 1;
                                u.pb(i);
                                t.pb(u);
                                u.pop_back();
                            }
                            h = mod(h - e[i]);
                        }
                    }
                }
                for(int x: u) in[x] = 0;
            }
        }else{
            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:167:16: warning: unused variable 'aa' [-Wunused-variable]
  167 |     int T = 1, aa;
      |                ^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23892 KB Output is correct
3 Correct 26 ms 54652 KB Output is correct
4 Correct 24 ms 54688 KB Output is correct
5 Correct 25 ms 54708 KB Output is correct
6 Correct 26 ms 54628 KB Output is correct
7 Correct 24 ms 54672 KB Output is correct
8 Correct 29 ms 54508 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 54540 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23892 KB Output is correct
3 Correct 26 ms 54652 KB Output is correct
4 Correct 24 ms 54688 KB Output is correct
5 Correct 25 ms 54708 KB Output is correct
6 Correct 26 ms 54628 KB Output is correct
7 Correct 24 ms 54672 KB Output is correct
8 Correct 29 ms 54508 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 54540 KB Output is correct
11 Correct 25 ms 54732 KB Output is correct
12 Correct 24 ms 54740 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 27 ms 54708 KB Output is correct
15 Correct 17 ms 23884 KB Output is correct
16 Correct 26 ms 54716 KB Output is correct
17 Correct 15 ms 23892 KB Output is correct
18 Correct 29 ms 54732 KB Output is correct
19 Correct 25 ms 54512 KB Output is correct
20 Correct 30 ms 54612 KB Output is correct
21 Correct 28 ms 54624 KB Output is correct
22 Correct 24 ms 54524 KB Output is correct
23 Correct 26 ms 54740 KB Output is correct
24 Correct 25 ms 54556 KB Output is correct
25 Correct 29 ms 54740 KB Output is correct
26 Correct 28 ms 54820 KB Output is correct
27 Correct 29 ms 54968 KB Output is correct
28 Correct 28 ms 54732 KB Output is correct
29 Correct 26 ms 54996 KB Output is correct
30 Correct 26 ms 54660 KB Output is correct
31 Correct 28 ms 54888 KB Output is correct
32 Correct 28 ms 54636 KB Output is correct
33 Correct 34 ms 54784 KB Output is correct
34 Correct 30 ms 54860 KB Output is correct
35 Correct 23 ms 39380 KB Output is correct
36 Correct 22 ms 39460 KB Output is correct
37 Correct 21 ms 39376 KB Output is correct
38 Correct 17 ms 31548 KB Output is correct
39 Correct 17 ms 31572 KB Output is correct
40 Correct 28 ms 54716 KB Output is correct
41 Correct 16 ms 31520 KB Output is correct
42 Correct 28 ms 54664 KB Output is correct
43 Correct 29 ms 54744 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 62676 KB Output is correct
2 Correct 20 ms 31852 KB Output is correct
3 Correct 20 ms 31816 KB Output is correct
4 Correct 20 ms 31828 KB Output is correct
5 Correct 22 ms 31900 KB Output is correct
6 Correct 24 ms 31828 KB Output is correct
7 Correct 21 ms 31896 KB Output is correct
8 Correct 21 ms 31820 KB Output is correct
9 Correct 20 ms 31852 KB Output is correct
10 Correct 21 ms 31828 KB Output is correct
11 Correct 788 ms 383220 KB Output is correct
12 Correct 23 ms 31824 KB Output is correct
13 Correct 777 ms 383224 KB Output is correct
14 Correct 20 ms 31828 KB Output is correct
15 Correct 813 ms 383212 KB Output is correct
16 Correct 787 ms 383180 KB Output is correct
17 Correct 771 ms 383204 KB Output is correct
18 Correct 713 ms 383188 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23892 KB Output is correct
3 Correct 26 ms 54652 KB Output is correct
4 Correct 24 ms 54688 KB Output is correct
5 Correct 25 ms 54708 KB Output is correct
6 Correct 26 ms 54628 KB Output is correct
7 Correct 24 ms 54672 KB Output is correct
8 Correct 29 ms 54508 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 54540 KB Output is correct
11 Correct 25 ms 54732 KB Output is correct
12 Correct 24 ms 54740 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 27 ms 54708 KB Output is correct
15 Correct 17 ms 23884 KB Output is correct
16 Correct 26 ms 54716 KB Output is correct
17 Correct 15 ms 23892 KB Output is correct
18 Correct 29 ms 54732 KB Output is correct
19 Correct 25 ms 54512 KB Output is correct
20 Correct 30 ms 54612 KB Output is correct
21 Correct 28 ms 54624 KB Output is correct
22 Correct 24 ms 54524 KB Output is correct
23 Correct 26 ms 54740 KB Output is correct
24 Correct 25 ms 54556 KB Output is correct
25 Correct 29 ms 54740 KB Output is correct
26 Correct 28 ms 54820 KB Output is correct
27 Correct 29 ms 54968 KB Output is correct
28 Correct 28 ms 54732 KB Output is correct
29 Correct 26 ms 54996 KB Output is correct
30 Correct 26 ms 54660 KB Output is correct
31 Correct 28 ms 54888 KB Output is correct
32 Correct 28 ms 54636 KB Output is correct
33 Correct 34 ms 54784 KB Output is correct
34 Correct 30 ms 54860 KB Output is correct
35 Correct 23 ms 39380 KB Output is correct
36 Correct 22 ms 39460 KB Output is correct
37 Correct 21 ms 39376 KB Output is correct
38 Correct 17 ms 31548 KB Output is correct
39 Correct 17 ms 31572 KB Output is correct
40 Correct 28 ms 54716 KB Output is correct
41 Correct 16 ms 31520 KB Output is correct
42 Correct 28 ms 54664 KB Output is correct
43 Correct 29 ms 54744 KB Output is correct
44 Execution timed out 3082 ms 79412 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 13 ms 23892 KB Output is correct
3 Correct 26 ms 54652 KB Output is correct
4 Correct 24 ms 54688 KB Output is correct
5 Correct 25 ms 54708 KB Output is correct
6 Correct 26 ms 54628 KB Output is correct
7 Correct 24 ms 54672 KB Output is correct
8 Correct 29 ms 54508 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 54540 KB Output is correct
11 Correct 25 ms 54732 KB Output is correct
12 Correct 24 ms 54740 KB Output is correct
13 Correct 13 ms 23892 KB Output is correct
14 Correct 27 ms 54708 KB Output is correct
15 Correct 17 ms 23884 KB Output is correct
16 Correct 26 ms 54716 KB Output is correct
17 Correct 15 ms 23892 KB Output is correct
18 Correct 29 ms 54732 KB Output is correct
19 Correct 25 ms 54512 KB Output is correct
20 Correct 30 ms 54612 KB Output is correct
21 Correct 28 ms 54624 KB Output is correct
22 Correct 24 ms 54524 KB Output is correct
23 Correct 26 ms 54740 KB Output is correct
24 Correct 25 ms 54556 KB Output is correct
25 Correct 29 ms 54740 KB Output is correct
26 Correct 28 ms 54820 KB Output is correct
27 Correct 29 ms 54968 KB Output is correct
28 Correct 28 ms 54732 KB Output is correct
29 Correct 26 ms 54996 KB Output is correct
30 Correct 26 ms 54660 KB Output is correct
31 Correct 28 ms 54888 KB Output is correct
32 Correct 28 ms 54636 KB Output is correct
33 Correct 34 ms 54784 KB Output is correct
34 Correct 30 ms 54860 KB Output is correct
35 Correct 23 ms 39380 KB Output is correct
36 Correct 22 ms 39460 KB Output is correct
37 Correct 21 ms 39376 KB Output is correct
38 Correct 17 ms 31548 KB Output is correct
39 Correct 17 ms 31572 KB Output is correct
40 Correct 28 ms 54716 KB Output is correct
41 Correct 16 ms 31520 KB Output is correct
42 Correct 28 ms 54664 KB Output is correct
43 Correct 29 ms 54744 KB Output is correct
44 Correct 19 ms 31744 KB Output is correct
45 Correct 557 ms 368656 KB Output is correct
46 Execution timed out 3083 ms 355108 KB Time limit exceeded
47 Halted 0 ms 0 KB -