Submission #829348

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
8293482023-08-18 09:41:28Darren0724Political Development (BOI17_politicaldevelopment)C++17
100 / 100
1018 ms28924 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=50005;
vector<int> adj[N],adj1[N];
vector<int> deg(N);
set<pair<int,int>> s;
vector<int> active(N,1);
int calc(int p){
int sz=adj[p].size();
//cout<<sz<<endl;
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);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...