论极致压行?

P5008 [yLOI2018] 锦鲤抄

@[Yeasion_Nein](/space/show?uid=60528) 淦你qnqnqnq
by 皎月半洒花 @ 2018-11-06 16:44:53


@[Yeasion_Nein](/space/show?uid=60528) 我不管反正lzr是最强的(逃
by 皎月半洒花 @ 2018-11-06 16:58:12



by Sue_Shallow @ 2018-11-06 17:00:53


@[Yeasion_Nein](/space/show?uid=60528) 你个毒瘤
by 一扶苏一 @ 2018-11-06 18:42:41


@[一扶苏一](/space/show?uid=65363) 噢。(扣鼻
by Sue_Shallow @ 2018-11-06 19:30:17


@[Yeasion_Nein](/space/show?uid=60528) ```cpp #include<cstdio> #include<cstring> #include<algorithm> int read(){ int k=0; char c=getchar(); for(;c<'0'||c>'9';) c=getchar(); for(;c>='0'&&c<='9';c=getchar()) k=k*10+c-48; return k;} struct zzz{ int f,t,nex; }e[2000010]; int head[500010],tot; struct hhh{ int v,pos; }a[500010]; void add(int x,int y){ e[++tot].t=y; e[tot].f=x; e[tot].nex=head[x]; head[x]=tot; } int dfn[500010],low[500010],deep,vis[500010],colnum[500010],belong[500010],col,s[500010],top; int in[500010],ans; bool flag[500010],mapp[500010]; void Tarjan(int now){ dfn[now]=low[now]=++deep; s[++top]=now; vis[now]=1; for(int i=head[now];i;i=e[i].nex){ if(!dfn[e[i].t]){ Tarjan(e[i].t); low[now]=std::min(low[now],low[e[i].t]); } else if(vis[e[i].t]) low[now]=std::min(low[now],dfn[e[i].t]); } if(dfn[now]==low[now]){ col++; int v=0; do{ v=s[top--]; vis[v]=0; colnum[col]++; belong[v]=col; }while(v!=now); } } bool cmp(hhh x,hhh y){ return x.v < y.v; } bool cmp2(hhh x,hhh y){ return x.v > y.v; } int main(){ int n=read(),m=read(),k=read(); for(int i=1;i<=n;i++) a[i].v=read(), a[i].pos=i; for(int i=1;i<=m;i++){ int x=read(),y=read(); add(x,y); } for(int i=1;i<=n;i++) if(!dfn[i]) Tarjan(i); memset(head,0,sizeof(head)); for(int i=1;i<=tot;i++){ if(belong[e[i].f]!=belong[e[i].t]) ++in[belong[e[i].t]]; } std::sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++){ if(!in[belong[a[i].pos]]&&!flag[belong[a[i].pos]]){ flag[belong[a[i].pos]]=1; mapp[a[i].pos]=1; } } int cnt=0; std::sort(a+1,a+n+1,cmp2); for(int i=1;i<=n;i++){ if(cnt==k) break; if(mapp[a[i].pos]) continue; ans+=a[i].v; cnt++; } printf("%d\n", ans); return 0; } ``` 25行
by MorsLin @ 2019-02-17 15:55:06


论极致抄袭(滑稽)?
by __usingnamespace__ @ 2019-03-23 20:21:56


论两个管理?(
by VTloBong @ 2020-04-28 23:14:26


@[Sue_Shallow](/user/60528) 所以lzr和花姐姐是啥(刚来洛谷看不懂)
by 已注销UyX2rX8tqz4TY @ 2020-08-22 20:24:32


上一页 |