oj.uz

Submission #783099

# Submission time Handle Problem Language Result Execution time Memory
783099 2023-07-14T15:25:28 Z 1075508020060209tc Political Development (BOI17_politicaldevelopment) C++14
39 / 100
 1889 ms 26404 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];

void slvk3(){
int ans=1;
for(int i=0;i<=n-1;i++){
    if(st[i].size()>=2){ans=2;break;}
}
for(int i=0;i<=n-1;i++){
    for(auto it=st[i].begin();(*it)<i;it++){
        int v=(*it);
    }
}


}


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);
}

if(K<=3){
    //slvk3();
}

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);
    }
    if(vc.size()>K*3){continue;}
    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 'void slvk3()':
politicaldevelopment.cpp:17:13: warning: unused variable 'v' [-Wunused-variable]
   17 |         int v=(*it);
      |             ^
politicaldevelopment.cpp:11:5: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   11 | int ans=1;
      |     ^~~
politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int j=0;j<vc.size();j++){
      |                 ~^~~~~~~~~~
politicaldevelopment.cpp:71:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |     if(vc.size()>K*3){continue;}
      |        ~~~~~~~~~^~~~
politicaldevelopment.cpp:77:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         for(int j=0;j<vc.size();j++){
      |                     ~^~~~~~~~~~
politicaldevelopment.cpp:81:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |                 for(int k=0;k<vc.size();k++){
      |                             ~^~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 6 ms 3284 KB Output is correct
4 Correct 6 ms 3412 KB Output is correct
5 Correct 6 ms 3412 KB Output is correct
6 Correct 5 ms 3284 KB Output is correct
7 Correct 6 ms 3284 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 3 ms 2900 KB Output is correct
11 Correct 5 ms 3428 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 2 ms 2644 KB Output is correct
16 Correct 4 ms 3368 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 5 ms 3376 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 3 ms 3028 KB Output is correct
21 Correct 3 ms 3028 KB Output is correct
22 Correct 2 ms 2900 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 7 ms 3412 KB Output is correct
26 Correct 6 ms 3412 KB Output is correct
27 Correct 5 ms 3284 KB Output is correct
28 Correct 6 ms 3412 KB Output is correct
29 Correct 4 ms 3284 KB Output is correct
30 Correct 7 ms 3508 KB Output is correct
31 Correct 6 ms 3412 KB Output is correct
32 Correct 5 ms 3480 KB Output is correct
33 Correct 5 ms 3512 KB Output is correct
34 Correct 5 ms 3412 KB Output is correct
35 Correct 3 ms 3028 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 4 ms 3028 KB Output is correct
38 Correct 3 ms 2900 KB Output is correct
39 Correct 3 ms 2900 KB Output is correct
40 Correct 7 ms 3956 KB Output is correct
41 Correct 3 ms 2900 KB Output is correct
42 Correct 9 ms 3924 KB Output is correct
43 Correct 7 ms 3924 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2900 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 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 2 ms 2644 KB Output is correct
11 Correct 1889 ms 26144 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 419 ms 26144 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1855 ms 26136 KB Output is correct
16 Correct 410 ms 26400 KB Output is correct
17 Correct 731 ms 26404 KB Output is correct
18 Correct 929 ms 26400 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 6 ms 3284 KB Output is correct
4 Correct 6 ms 3412 KB Output is correct
5 Correct 6 ms 3412 KB Output is correct
6 Correct 5 ms 3284 KB Output is correct
7 Correct 6 ms 3284 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 3 ms 2900 KB Output is correct
11 Correct 5 ms 3428 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 2 ms 2644 KB Output is correct
16 Correct 4 ms 3368 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 5 ms 3376 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 3 ms 3028 KB Output is correct
21 Correct 3 ms 3028 KB Output is correct
22 Correct 2 ms 2900 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 7 ms 3412 KB Output is correct
26 Correct 6 ms 3412 KB Output is correct
27 Correct 5 ms 3284 KB Output is correct
28 Correct 6 ms 3412 KB Output is correct
29 Correct 4 ms 3284 KB Output is correct
30 Correct 7 ms 3508 KB Output is correct
31 Correct 6 ms 3412 KB Output is correct
32 Correct 5 ms 3480 KB Output is correct
33 Correct 5 ms 3512 KB Output is correct
34 Correct 5 ms 3412 KB Output is correct
35 Correct 3 ms 3028 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 4 ms 3028 KB Output is correct
38 Correct 3 ms 2900 KB Output is correct
39 Correct 3 ms 2900 KB Output is correct
40 Correct 7 ms 3956 KB Output is correct
41 Correct 3 ms 2900 KB Output is correct
42 Correct 9 ms 3924 KB Output is correct
43 Correct 7 ms 3924 KB Output is correct
44 Correct 17 ms 4988 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 13 ms 3848 KB Output is correct
47 Incorrect 442 ms 4972 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 6 ms 3284 KB Output is correct
4 Correct 6 ms 3412 KB Output is correct
5 Correct 6 ms 3412 KB Output is correct
6 Correct 5 ms 3284 KB Output is correct
7 Correct 6 ms 3284 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 3 ms 2900 KB Output is correct
11 Correct 5 ms 3428 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 2 ms 2644 KB Output is correct
16 Correct 4 ms 3368 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 5 ms 3376 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 3 ms 3028 KB Output is correct
21 Correct 3 ms 3028 KB Output is correct
22 Correct 2 ms 2900 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 2 ms 2900 KB Output is correct
25 Correct 7 ms 3412 KB Output is correct
26 Correct 6 ms 3412 KB Output is correct
27 Correct 5 ms 3284 KB Output is correct
28 Correct 6 ms 3412 KB Output is correct
29 Correct 4 ms 3284 KB Output is correct
30 Correct 7 ms 3508 KB Output is correct
31 Correct 6 ms 3412 KB Output is correct
32 Correct 5 ms 3480 KB Output is correct
33 Correct 5 ms 3512 KB Output is correct
34 Correct 5 ms 3412 KB Output is correct
35 Correct 3 ms 3028 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 4 ms 3028 KB Output is correct
38 Correct 3 ms 2900 KB Output is correct
39 Correct 3 ms 2900 KB Output is correct
40 Correct 7 ms 3956 KB Output is correct
41 Correct 3 ms 2900 KB Output is correct
42 Correct 9 ms 3924 KB Output is correct
43 Correct 7 ms 3924 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Incorrect 296 ms 20900 KB Output isn't correct
46 Halted 0 ms 0 KB -