답안 #783024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783024 2023-07-14T14:21:42 Z 1075508020060209tc Political Development (BOI17_politicaldevelopment) C++14
4 / 100
3000 ms 28692 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>>n>>K;
for(int i=0;i<n;i++){
    int d;
    cin>>d;
    for(int j=1;j<=d;j++){
        int v;
        cin>>v;
        st[i].insert(v);
     //   tbl[i][v]=1;
    }
   // tbl[i][i]=1;
    st[i].insert(i);
}
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++){
        int ok=1;
       // cout<<A<<"A\n";
        for(int j=0;j<vc.size();j++){
           // cout<<vc[j]<<" "<<ok<<endl;;
            if(!ok){continue;}
            if(((A&(1<<j))!=0)){
                for(int k=0;k<vc.size();k++){
                    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:34:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(int j=0;j<vc.size();j++){
      |                     ~^~~~~~~~~~
politicaldevelopment.cpp:38:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |                 for(int k=0;k<vc.size();k++){
      |                             ~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 14 ms 3364 KB Output is correct
4 Correct 7 ms 3388 KB Output is correct
5 Correct 10 ms 3364 KB Output is correct
6 Correct 14 ms 3360 KB Output is correct
7 Correct 11 ms 3364 KB Output is correct
8 Correct 2 ms 2892 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 14 ms 3364 KB Output is correct
4 Correct 7 ms 3388 KB Output is correct
5 Correct 10 ms 3364 KB Output is correct
6 Correct 14 ms 3360 KB Output is correct
7 Correct 11 ms 3364 KB Output is correct
8 Correct 2 ms 2892 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 8 ms 3444 KB Output is correct
12 Correct 7 ms 3412 KB Output is correct
13 Correct 1 ms 2660 KB Output is correct
14 Correct 8 ms 3528 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 11 ms 3312 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 11 ms 3316 KB Output is correct
19 Correct 4 ms 2800 KB Output is correct
20 Correct 4 ms 3156 KB Output is correct
21 Correct 4 ms 3156 KB Output is correct
22 Correct 3 ms 2796 KB Output is correct
23 Correct 12 ms 3540 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 13 ms 3556 KB Output is correct
26 Correct 11 ms 3412 KB Output is correct
27 Correct 6 ms 3412 KB Output is correct
28 Correct 11 ms 3412 KB Output is correct
29 Correct 7 ms 3384 KB Output is correct
30 Correct 9 ms 3624 KB Output is correct
31 Correct 11 ms 3540 KB Output is correct
32 Correct 10 ms 3540 KB Output is correct
33 Correct 10 ms 3540 KB Output is correct
34 Correct 10 ms 3576 KB Output is correct
35 Correct 6 ms 3028 KB Output is correct
36 Correct 6 ms 3056 KB Output is correct
37 Correct 6 ms 3028 KB Output is correct
38 Execution timed out 3064 ms 2936 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2660 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2664 KB Output is correct
7 Correct 2 ms 2664 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Execution timed out 3067 ms 28692 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 14 ms 3364 KB Output is correct
4 Correct 7 ms 3388 KB Output is correct
5 Correct 10 ms 3364 KB Output is correct
6 Correct 14 ms 3360 KB Output is correct
7 Correct 11 ms 3364 KB Output is correct
8 Correct 2 ms 2892 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 8 ms 3444 KB Output is correct
12 Correct 7 ms 3412 KB Output is correct
13 Correct 1 ms 2660 KB Output is correct
14 Correct 8 ms 3528 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 11 ms 3312 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 11 ms 3316 KB Output is correct
19 Correct 4 ms 2800 KB Output is correct
20 Correct 4 ms 3156 KB Output is correct
21 Correct 4 ms 3156 KB Output is correct
22 Correct 3 ms 2796 KB Output is correct
23 Correct 12 ms 3540 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 13 ms 3556 KB Output is correct
26 Correct 11 ms 3412 KB Output is correct
27 Correct 6 ms 3412 KB Output is correct
28 Correct 11 ms 3412 KB Output is correct
29 Correct 7 ms 3384 KB Output is correct
30 Correct 9 ms 3624 KB Output is correct
31 Correct 11 ms 3540 KB Output is correct
32 Correct 10 ms 3540 KB Output is correct
33 Correct 10 ms 3540 KB Output is correct
34 Correct 10 ms 3576 KB Output is correct
35 Correct 6 ms 3028 KB Output is correct
36 Correct 6 ms 3056 KB Output is correct
37 Correct 6 ms 3028 KB Output is correct
38 Execution timed out 3064 ms 2936 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 14 ms 3364 KB Output is correct
4 Correct 7 ms 3388 KB Output is correct
5 Correct 10 ms 3364 KB Output is correct
6 Correct 14 ms 3360 KB Output is correct
7 Correct 11 ms 3364 KB Output is correct
8 Correct 2 ms 2892 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 8 ms 3444 KB Output is correct
12 Correct 7 ms 3412 KB Output is correct
13 Correct 1 ms 2660 KB Output is correct
14 Correct 8 ms 3528 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 11 ms 3312 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 11 ms 3316 KB Output is correct
19 Correct 4 ms 2800 KB Output is correct
20 Correct 4 ms 3156 KB Output is correct
21 Correct 4 ms 3156 KB Output is correct
22 Correct 3 ms 2796 KB Output is correct
23 Correct 12 ms 3540 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 13 ms 3556 KB Output is correct
26 Correct 11 ms 3412 KB Output is correct
27 Correct 6 ms 3412 KB Output is correct
28 Correct 11 ms 3412 KB Output is correct
29 Correct 7 ms 3384 KB Output is correct
30 Correct 9 ms 3624 KB Output is correct
31 Correct 11 ms 3540 KB Output is correct
32 Correct 10 ms 3540 KB Output is correct
33 Correct 10 ms 3540 KB Output is correct
34 Correct 10 ms 3576 KB Output is correct
35 Correct 6 ms 3028 KB Output is correct
36 Correct 6 ms 3056 KB Output is correct
37 Correct 6 ms 3028 KB Output is correct
38 Execution timed out 3064 ms 2936 KB Time limit exceeded
39 Halted 0 ms 0 KB -