oj.uz

Submission #783090

# Submission time Handle Problem Language Result Execution time Memory
783090 2023-07-14T15:14:22 Z 1075508020060209tc Political Development (BOI17_politicaldevelopment) C++14
27 / 100
 3000 ms 26700 KB 
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
int n;int K;
set<int>st[50100];
int tbl[5010][5010];
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>K;
for(int i=0;i<n;i++){
    int d;
    cin>>d;
    for(int j=1;j<=d;j++){
        int v;
        cin>>v;
        if(v<i){
            if(st[v].find(i)==st[v].end()){continue;}
        }
        st[i].insert(v);
     //   tbl[i][v]=1;
    }
   // tbl[i][i]=1;
    st[i].insert(i);
}

for(int i=n-1;i>=0;i--){
        vector<int>vc;
    for(auto it=st[i].begin();it!=st[i].end();it++){
        int v=*it;
        if(v>i){
            if(st[v].find(i)==st[v].end()){vc.push_back(v);}
        }
    }
    for(int j=0;j<vc.size();j++){
        st[i].erase(vc[j]);
    }
}


int ans=1;


for(int i=0;i<n;i++){
    vector<int>vc;
    for(auto it=st[i].begin();it!=st[i].end();it++){
        vc.push_back(*it);
    }
    for(int A=0;A<(1<<vc.size());A++){
        if(__builtin_popcount(A)<=ans){continue;}
        if(__builtin_popcount(A)>K){continue;}
        int ok=1;
       // cout<<A<<"A\n";
        for(int j=0;j<vc.size();j++){
           // cout<<vc[j]<<" "<<ok<<endl;;
            if(!ok){break;}
            if(((A&(1<<j))!=0)){
                for(int k=0;k<vc.size();k++){
                    if(!ok){break;}
                    if( ((A&(1<<k))==0) ){continue;}
                    //cout<<A<<" "<<k<<endl;
                    if(st[vc[j]].find(vc[k])==st[vc[j]].end()){ok=0;}
                   // cout<<A<<" "<<vc[j]<<" "<<vc[k];
                    //if(tbl[vc[j]][vc[k]]==0){ok=0;}
                    //cout<<" "<<ok<<endl;
                }
            }
        }
        //cout<<ok<<endl;
        if((ok&&(__builtin_popcount(A)>ans)) ){
            ans=__builtin_popcount(A);
        }
    }
}
cout<<ans<<endl;
//return 0;
/*
for(int i=0;i<ans.size();i++){
    cout<<ans[i]<<" ";
}*/

}

Compilation message

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int j=0;j<vc.size();j++){
      |                 ~^~~~~~~~~~
politicaldevelopment.cpp:56:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(int j=0;j<vc.size();j++){
      |                     ~^~~~~~~~~~
politicaldevelopment.cpp:60:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |                 for(int k=0;k<vc.size();k++){
      |                             ~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 3340 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3412 KB Output is correct
6 Correct 4 ms 3320 KB Output is correct
7 Correct 4 ms 3336 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 3340 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3412 KB Output is correct
6 Correct 4 ms 3320 KB Output is correct
7 Correct 4 ms 3336 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 4 ms 3412 KB Output is correct
12 Correct 4 ms 3412 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 4 ms 3412 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 5 ms 3332 KB Output is correct
17 Correct 1 ms 2684 KB Output is correct
18 Correct 4 ms 3412 KB Output is correct
19 Correct 2 ms 2812 KB Output is correct
20 Correct 3 ms 3072 KB Output is correct
21 Correct 4 ms 3156 KB Output is correct
22 Correct 2 ms 2820 KB Output is correct
23 Correct 5 ms 3484 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 5 ms 3540 KB Output is correct
26 Correct 6 ms 3464 KB Output is correct
27 Correct 4 ms 3408 KB Output is correct
28 Correct 6 ms 3412 KB Output is correct
29 Correct 4 ms 3412 KB Output is correct
30 Correct 6 ms 3540 KB Output is correct
31 Correct 7 ms 3540 KB Output is correct
32 Correct 5 ms 3632 KB Output is correct
33 Correct 6 ms 3540 KB Output is correct
34 Correct 5 ms 3584 KB Output is correct
35 Correct 3 ms 3072 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 3 ms 3076 KB Output is correct
38 Execution timed out 3081 ms 2900 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2900 KB Output is correct
2 Correct 2 ms 2684 KB Output is correct
3 Correct 2 ms 2672 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2684 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1563 ms 26660 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 320 ms 26564 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1562 ms 26652 KB Output is correct
16 Correct 351 ms 26700 KB Output is correct
17 Correct 660 ms 26660 KB Output is correct
18 Correct 749 ms 26652 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 3340 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3412 KB Output is correct
6 Correct 4 ms 3320 KB Output is correct
7 Correct 4 ms 3336 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 4 ms 3412 KB Output is correct
12 Correct 4 ms 3412 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 4 ms 3412 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 5 ms 3332 KB Output is correct
17 Correct 1 ms 2684 KB Output is correct
18 Correct 4 ms 3412 KB Output is correct
19 Correct 2 ms 2812 KB Output is correct
20 Correct 3 ms 3072 KB Output is correct
21 Correct 4 ms 3156 KB Output is correct
22 Correct 2 ms 2820 KB Output is correct
23 Correct 5 ms 3484 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 5 ms 3540 KB Output is correct
26 Correct 6 ms 3464 KB Output is correct
27 Correct 4 ms 3408 KB Output is correct
28 Correct 6 ms 3412 KB Output is correct
29 Correct 4 ms 3412 KB Output is correct
30 Correct 6 ms 3540 KB Output is correct
31 Correct 7 ms 3540 KB Output is correct
32 Correct 5 ms 3632 KB Output is correct
33 Correct 6 ms 3540 KB Output is correct
34 Correct 5 ms 3584 KB Output is correct
35 Correct 3 ms 3072 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 3 ms 3076 KB Output is correct
38 Execution timed out 3081 ms 2900 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 3340 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3412 KB Output is correct
6 Correct 4 ms 3320 KB Output is correct
7 Correct 4 ms 3336 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 4 ms 3412 KB Output is correct
12 Correct 4 ms 3412 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 4 ms 3412 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 5 ms 3332 KB Output is correct
17 Correct 1 ms 2684 KB Output is correct
18 Correct 4 ms 3412 KB Output is correct
19 Correct 2 ms 2812 KB Output is correct
20 Correct 3 ms 3072 KB Output is correct
21 Correct 4 ms 3156 KB Output is correct
22 Correct 2 ms 2820 KB Output is correct
23 Correct 5 ms 3484 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 5 ms 3540 KB Output is correct
26 Correct 6 ms 3464 KB Output is correct
27 Correct 4 ms 3408 KB Output is correct
28 Correct 6 ms 3412 KB Output is correct
29 Correct 4 ms 3412 KB Output is correct
30 Correct 6 ms 3540 KB Output is correct
31 Correct 7 ms 3540 KB Output is correct
32 Correct 5 ms 3632 KB Output is correct
33 Correct 6 ms 3540 KB Output is correct
34 Correct 5 ms 3584 KB Output is correct
35 Correct 3 ms 3072 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 3 ms 3076 KB Output is correct
38 Execution timed out 3081 ms 2900 KB Time limit exceeded
39 Halted 0 ms 0 KB -