聚会(party.c/cpp/pas)
8.28
思路:
首先,认识的人数小于d的人一定不会被邀请,于是将这些人删去,实际上删去所有不满足条件的人之后,显然在剩下之中选一个最大的连通块即可,多组答案随便控制一下就好。注意这道题的删人过程中,删去一些人之后可能会有新的人需要被删去,所以就是用类似于拓扑排序的方法,存个队列来进行删人过程。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int N = 200010, M = 200010;
int idx=0, idc=1, n, m, d, cnt=0, MOD;
int head[N], e[M<<1];
int dfn[N], low[N], place[N], wgh[N], mn[N];
int in[N], vis[N], prs[N], du[N], q[N];
bool ins[N], del[N];
stack <int> state;
struct Edge{
int to, next;
}ed[M<<1];
bool cmp(int a, int b){
return a < b;
}
void adde(int u, int v) {
ed[++idc].to = v;
ed[idc].next = head[u];
head[u] = idc;
}
void tarjan(int u){
dfn[u] = low[u] = ++idx;
vis[u] = ins[u] = 1;
state.push(u);
for(int i=head[u]; i; i=ed[i].next){
int v = ed[i].to;
if(del[v] == 1) continue;
if( !vis[v] ){
tarjan(v);
low[u] = min(low[u], low[v]);
}
else if( ins[v] ){
low[u] = min(low[u], dfn[v]);
}
}
if(dfn[u] == low[u]){
cnt++; int t=-1;
while(t != u){
t = state.top();
place[t] = cnt;
ins[t] = 0;
wgh[cnt]++;
mn[cnt] = min(mn[cnt], t);
state.pop();
}
}
}
int main () {
freopen ("party.in", "r", stdin);
freopen ("party.out", "w", stdout);
int u, v;
scanf("%d%d%d", &n, &m, &d);
for(int i=1; i<=m; i++) {
scanf("%d%d", &u, &v);
adde(u, v); adde(v, u);
du[u]++; du[v]++;
}
for(int i=1; i<=N; i++) mn[i] = 2000000;
int l=1, r=0;
for(int i=1; i<=n; i++)
if(du[i] < d) q[++r] = i, del[i] = 1;
while (l <= r){
int u = q[l++];
for(int i=head[u]; i; i=ed[i].next){
int v = ed[i].to; --du[v];
if(du[v] < d && del[v] == 0)
q[++r] = v, del[v] = 1;
}
}
for(int i=1; i<=n; i++)
if( !dfn[i] && !del[i] ) tarjan(i);//缩点
int minn = 2000000, ans = 0;
for(int i=1; i<=cnt; i++){
if(wgh[i] > wgh[ans]) minn = mn[i], ans = i;
else if(wgh[i] == wgh[ans] && minn > mn[i]) ans = i, minn = mn[i];
}
printf("%d\n", wgh[ans]); int cc=0;
for(int i=1; i<=n; i++)
if(place[i] == ans) prs[++cc] = i;
sort(prs+1, prs+cc+1, cmp);
for(int i=1; i<cc; i++) printf("%d ", prs[i]);
printf("%d", prs[cc]);
return 0;
}