oj.uz

Submission #829337

# Submission time Handle Problem Language Result Execution time Memory
829337 2023-08-18T09:31:19 Z Darren0724 Political Development (BOI17_politicaldevelopment) C++17
23 / 100
 2982 ms 27916 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=50005;
vector<int> adj[N];
vector<int> deg(N);
set<pair<int,int>> s;
int calc(int p){
    int sz=adj[p].size();
    int g[sz]{};
    for(int i=0;i<sz;i++){
        for(int j=0;j<sz;j++){
            if(i==j||s.find({adj[p][i],adj[p][j]})!=s.end()){
                g[i]|=1<<j;
            }
        }
    }
    int ans=0;
    for(int i=1;i<1<<sz;i++){
        int p=i;
        int cnt=0;
        for(int j=0;j<sz;j++){
            if(i&(1<<j)){
                p&=g[j];
                cnt++;
            }
        }
        if(p==i){
            ans=max(ans,cnt);
        }
    }
    return ans;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,k;cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>deg[i];
        adj[i].resize(deg[i]+1);
        adj[i][0]=i;
        for(int j=1;j<=deg[i];j++){
            cin>>adj[i][j];
            s.insert({i,adj[i][j]});
            s.insert({adj[i][j],i});
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        //cout<<calc(i)<<endl;
        ans=max(ans,calc(i));
    }
    cout<<ans<<endl;



    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 12 ms 2340 KB Output is correct
4 Incorrect 558 ms 2408 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 12 ms 2340 KB Output is correct
4 Incorrect 558 ms 2408 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1708 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 2 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 1 ms 1620 KB Output is correct
11 Correct 2982 ms 27808 KB Output is correct
12 Correct 1 ms 1620 KB Output is correct
13 Correct 2918 ms 27820 KB Output is correct
14 Correct 1 ms 1620 KB Output is correct
15 Correct 2955 ms 27808 KB Output is correct
16 Correct 2889 ms 27916 KB Output is correct
17 Correct 2966 ms 27816 KB Output is correct
18 Correct 2958 ms 27820 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 12 ms 2340 KB Output is correct
4 Incorrect 558 ms 2408 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 12 ms 2340 KB Output is correct
4 Incorrect 558 ms 2408 KB Output isn't correct
5 Halted 0 ms 0 KB -