oj.uz

Submission #457997

# Submission time Handle Problem Language Result Execution time Memory
457997 2021-08-07T17:50:03 Z julian33 Political Development (BOI17_politicaldevelopment) C++14
77 / 100
 3000 ms 23876 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=5e4+5; //make sure this is right
const int mod=1e9+7;

/*
transform the directed graph to a bidirectional graph
an edge exists between a and b iff there is an edge a->b and b->a
binary search for the best k
start from the lowest node, only traverse to greater nodes that have degree >= k-1
*/

set<int> graph[mxN];
vector<int> cur;
int n,k;

bool dfs(int s){
    if(!s)
        return 1;
    int at=cur.back();
    for(int i:graph[at]){
        if(sz(graph[i])<s-1)
            continue;
        int bad=0;
        for(int &j:cur){
            if(!graph[j].count(i)){
                bad=1;
                break;
            }
        }
        if(bad)
            continue;
        cur.pb(i);
        if(dfs(s-1))
            return 1;
        cur.pop_back();
    }
    return 0;
}

bool check(int s){
    for(int i=0;i<n;i++){
        if(sz(graph[i])<s-1)
            continue;
        cur={i};
        if(dfs(s-1))
            return 1;
    }
    return 0;
}

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    cin>>n>>k;
    for(int i=0;i<n;i++){
        int d; cin>>d;
        while(d--){
            int x; cin>>x;
            graph[i].insert(x);
        }
    }
    for(int i=0;i<n;i++){
        vector<int> rem;
        for(int j:graph[i]){
            if(!graph[j].count(i) || j<=i)
                rem.pb(j);
        }
        for(int &j:rem)
            graph[i].erase(j);
    }
    int l=1; int r=k;
    int ans=1;
    while(l<=r){
        int mid=(l+r)>>1;
        if(check(mid)){
            ans=mid; l=mid+1;
        } else{
            r=mid-1;
        }
    }
    cout<<ans<<"\n";
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 5 ms 3020 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3020 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 5 ms 3020 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3020 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 5 ms 3160 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 5 ms 3148 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 3140 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 5 ms 3020 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 5 ms 3148 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 5 ms 3264 KB Output is correct
26 Correct 7 ms 3148 KB Output is correct
27 Correct 4 ms 3088 KB Output is correct
28 Correct 6 ms 3148 KB Output is correct
29 Correct 5 ms 3020 KB Output is correct
30 Correct 13 ms 3308 KB Output is correct
31 Correct 6 ms 3276 KB Output is correct
32 Correct 14 ms 3300 KB Output is correct
33 Correct 6 ms 3228 KB Output is correct
34 Correct 6 ms 3276 KB Output is correct
35 Correct 4 ms 2892 KB Output is correct
36 Correct 4 ms 2892 KB Output is correct
37 Correct 4 ms 2892 KB Output is correct
38 Correct 4 ms 2864 KB Output is correct
39 Correct 4 ms 2880 KB Output is correct
40 Correct 11 ms 3532 KB Output is correct
41 Correct 4 ms 2764 KB Output is correct
42 Correct 10 ms 3596 KB Output is correct
43 Correct 8 ms 3604 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 311 ms 23780 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 221 ms 23784 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 301 ms 23780 KB Output is correct
16 Correct 225 ms 23876 KB Output is correct
17 Correct 235 ms 23728 KB Output is correct
18 Correct 253 ms 23688 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 5 ms 3020 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3020 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 5 ms 3160 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 5 ms 3148 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 3140 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 5 ms 3020 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 5 ms 3148 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 5 ms 3264 KB Output is correct
26 Correct 7 ms 3148 KB Output is correct
27 Correct 4 ms 3088 KB Output is correct
28 Correct 6 ms 3148 KB Output is correct
29 Correct 5 ms 3020 KB Output is correct
30 Correct 13 ms 3308 KB Output is correct
31 Correct 6 ms 3276 KB Output is correct
32 Correct 14 ms 3300 KB Output is correct
33 Correct 6 ms 3228 KB Output is correct
34 Correct 6 ms 3276 KB Output is correct
35 Correct 4 ms 2892 KB Output is correct
36 Correct 4 ms 2892 KB Output is correct
37 Correct 4 ms 2892 KB Output is correct
38 Correct 4 ms 2864 KB Output is correct
39 Correct 4 ms 2880 KB Output is correct
40 Correct 11 ms 3532 KB Output is correct
41 Correct 4 ms 2764 KB Output is correct
42 Correct 10 ms 3596 KB Output is correct
43 Correct 8 ms 3604 KB Output is correct
44 Correct 14 ms 4448 KB Output is correct
45 Correct 2 ms 2636 KB Output is correct
46 Correct 8 ms 3532 KB Output is correct
47 Correct 17 ms 4536 KB Output is correct
48 Correct 8 ms 3532 KB Output is correct
49 Correct 17 ms 4460 KB Output is correct
50 Correct 18 ms 4428 KB Output is correct
51 Correct 30 ms 6316 KB Output is correct
52 Correct 7 ms 3020 KB Output is correct
53 Correct 1337 ms 6928 KB Output is correct
54 Correct 36 ms 7212 KB Output is correct
55 Correct 5 ms 3148 KB Output is correct
56 Correct 5 ms 3148 KB Output is correct
57 Correct 2 ms 2636 KB Output is correct
58 Correct 1588 ms 7348 KB Output is correct
59 Correct 10 ms 3788 KB Output is correct
60 Correct 5 ms 3148 KB Output is correct
61 Correct 10 ms 3660 KB Output is correct
62 Correct 8 ms 3708 KB Output is correct
63 Correct 14 ms 4676 KB Output is correct
64 Correct 12 ms 4488 KB Output is correct
65 Correct 8 ms 3532 KB Output is correct
66 Correct 8 ms 3660 KB Output is correct
67 Correct 18 ms 5068 KB Output is correct
68 Correct 13 ms 4488 KB Output is correct
69 Correct 7 ms 3532 KB Output is correct
70 Correct 14 ms 4424 KB Output is correct
71 Correct 18 ms 5068 KB Output is correct
72 Correct 18 ms 4940 KB Output is correct
73 Correct 5 ms 3148 KB Output is correct
74 Correct 18 ms 4560 KB Output is correct
75 Correct 19 ms 5068 KB Output is correct
76 Correct 14 ms 4032 KB Output is correct
77 Correct 29 ms 5624 KB Output is correct
78 Correct 7 ms 3200 KB Output is correct
79 Correct 15 ms 4088 KB Output is correct
80 Correct 21 ms 4068 KB Output is correct
81 Correct 28 ms 5580 KB Output is correct
82 Correct 4 ms 2892 KB Output is correct
83 Correct 15 ms 4044 KB Output is correct
84 Correct 18 ms 4888 KB Output is correct
85 Correct 5 ms 2892 KB Output is correct
86 Correct 16 ms 4940 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 5 ms 3020 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3020 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 5 ms 3160 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 5 ms 3148 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 3140 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 5 ms 3020 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 5 ms 3148 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 5 ms 3264 KB Output is correct
26 Correct 7 ms 3148 KB Output is correct
27 Correct 4 ms 3088 KB Output is correct
28 Correct 6 ms 3148 KB Output is correct
29 Correct 5 ms 3020 KB Output is correct
30 Correct 13 ms 3308 KB Output is correct
31 Correct 6 ms 3276 KB Output is correct
32 Correct 14 ms 3300 KB Output is correct
33 Correct 6 ms 3228 KB Output is correct
34 Correct 6 ms 3276 KB Output is correct
35 Correct 4 ms 2892 KB Output is correct
36 Correct 4 ms 2892 KB Output is correct
37 Correct 4 ms 2892 KB Output is correct
38 Correct 4 ms 2864 KB Output is correct
39 Correct 4 ms 2880 KB Output is correct
40 Correct 11 ms 3532 KB Output is correct
41 Correct 4 ms 2764 KB Output is correct
42 Correct 10 ms 3596 KB Output is correct
43 Correct 8 ms 3604 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 146 ms 16664 KB Output is correct
46 Correct 69 ms 9704 KB Output is correct
47 Correct 170 ms 16760 KB Output is correct
48 Correct 139 ms 16732 KB Output is correct
49 Correct 39 ms 7492 KB Output is correct
50 Execution timed out 3048 ms 21792 KB Time limit exceeded
51 Halted 0 ms 0 KB -