# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
939929 | pcc | Political Development (BOI17_politicaldevelopment) | C++14 | 2 ms | 4024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 5e4+10;
vector<int> paths[mxn];
set<int> g[mxn];
bitset<mxn> vis;
int deg[mxn];
priority_queue<pii,vector<pii>,less<pii>> pq;
int N,K;
vector<int> v;
int ans = 0;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N>>K;
for(int i = 0;i<N;i++){
int m;
cin>>m;
while(m--){
int b;
cin>>b;
paths[b].push_back(i);
paths[i].push_back(b);
deg[i]++,deg[b]++;
}
}
for(int i = 0;i<N;i++)pq.push(pii(deg[i],i));
while(!pq.empty()){
auto now = pq.top().sc;
pq.pop();
if(vis[now])continue;
vis[now] = true;
v.push_back(now);
for(auto nxt:paths[now]){
deg[nxt]--;
if(!vis[nxt])pq.push({deg[nxt],nxt});
}
}
reverse(v.begin(),v.end());
vis.reset();
for(auto &now:v){
assert(g[now].size()<K);
vis[now] = true;
vector<int> vv;
for(auto &nxt:paths[now]){
if(vis[nxt]){
vv.push_back(nxt);
g[now].insert(nxt);
g[nxt].insert(now);
deg[now]++;
deg[nxt]++;
}
}
for(int i = 1;i<(1<<deg[now]);i++){
vector<int> tar;
for(int j = 0;j<deg[now];j++){
if(i&(1<<j))tar.push_back(vv[j]);
}
bool flag = true;
for(int j = 0;j<tar.size();j++){
for(int k = j+1;k<tar.size();k++){
if(g[j].find(k) == g[j].end())flag = false;
}
}
if(flag)ans = max(ans,__builtin_popcount(i));
}
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |