DFS | OceanEye's Blog

@OceanEye7年前

05/26

14:55

BZOJ2730

OceanEye 撰写 DFS 模板模版题点双联通分量无回复

XDDD YY了半天的点双联通忽略了最初点双的性质—-割点可能属于多个块

点双学习Link 1 2 3

~~代码施工中~~

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdlib>
#define ll long long
#define p(x) ('0'<=x&&x<='9')
#define For(i,l,r) for(int i=l;i<=r;i++)

char cc; int C;
template <class T>
void read( T &x )
{
	x=0; cc=getchar(); C=1;
	while(!p(cc)) { if(cc=='-') C=-1; cc=getchar(); }
	while(p(cc)) { x=x*10+cc-48; cc=getchar(); }
	x*=C;
}

using namespace std;
#define SIZ 1010
#define N 1000
struct node
{
	int fa,dfn,mn,childcnt;
	bool iscut;
	vector <int> belong;
	void init()
	{
		belong.clear();
		fa=dfn=mn=childcnt=iscut=0;
	}
}pool[SIZ];
#define FA pool[x].fa
#define MN pool[x].mn
#define DFN pool[x].dfn
#define CNT pool[x].childcnt
#define ISCUT pool[x].iscut
struct Tedge
{
	int from,to;
	bool use;
	Tedge(int _=0,int __=0,bool ___=false) { from=_; to=__; use=false; }
	bool operator != (const Tedge &x) { return (from!=x.from||to!=x.to); }
} edge[N<<1],STA[N];
int TOP;
#define E edge[i]
#define TO E.to
int e_tot,fst[SIZ],cur[SIZ],NXT[N<<1];
void add_e(int a,int b)
{
	edge[e_tot]=Tedge(a,b,false); NXT[e_tot]=fst[a]; fst[a]=e_tot++;
	edge[e_tot]=Tedge(b,a,false); NXT[e_tot]=fst[b]; fst[b]=e_tot++;
}
vector <int> BCC[SIZ];
int siz[SIZ],cnt[SIZ],tot;
int sta[SIZ],top;
bool use[SIZ];
unsigned ll ans1,ans2;

//
void init(int n)
{
	memset(fst,-1,sizeof(fst));
	memset(siz,0,sizeof(siz)); memset(cnt,0,sizeof(cnt));
	e_tot=0; tot=0; ans1=0; ans2=1;
	for(int i=1;i<=N;i++) BCC[i].clear();
	int _,__;
	For(i,1,n)
	{
		read(_); read(__); use[_]|=1; use[__]|=1;
		add_e(_,__);
	}
}

void cp(int &x,int y) { x>y?x=y:x=x; }
int cd;
void tarjan(int x)
{
	use[x]=false; DFN=MN=++cd;
	for(int i=fst[x];~i;i=NXT[i])
	{
		if(TO==FA) continue;
		if(edge[i].use) continue;
		STA[++TOP]=E;
		E.use=true; i^=1; E.use=true; i^=1;
		if(!use[TO]) cp(MN,pool[TO].dfn);
		else
		{
			CNT++;
			pool[TO].fa=x;
			tarjan(TO);
			MN=min(MN,pool[TO].mn);
			if(pool[TO].mn>=DFN)
			{
				Tedge cur;
				tot++;
				ISCUT=true;
				do
				{
					cur=STA[TOP--];
					if(pool[cur.from].belong.size()==0||pool[cur.from].belong.back()!=tot)
					{
						pool[cur.from].belong.push_back(tot);
						BCC[tot].push_back(cur.from);
					}
					if(pool[cur.to].belong.size()==0||pool[cur.to].belong.back()!=tot)
					{
						pool[cur.to].belong.push_back(tot);
						BCC[tot].push_back(cur.to);
					}
				}
				while(cur!=E);
			}
		}
	}
	if(CNT<2&&!FA) ISCUT=false;
}

int time;

void Main(int _)
{
	time++;
	init(_);
	For(i,1,1000) cur[i]=fst[i],pool[i].init();
	For(i,1,1000) if(use[i]) tarjan(i);
	For(i,1,1000)
	{
		if(!pool[i].dfn) continue;
		if(!pool[i].iscut)
		{
			siz[pool[i].belong[0]]++;
			continue;
		}
		for(int j=0;j<pool[i].belong.size();j++) cnt[pool[i].belong[j]]++,siz[pool[i].belong[j]]++;
	}
	For(i,1,tot) if(cnt[i]==1)
	{ ans1++; ans2*=(unsigned ll)(siz[i]==1?1:(siz[i]-1)); }
	else if(cnt[i]==0)
	{ ans1+=min(siz[i],2); ans2*=(unsigned ll)siz[i]*(siz[i]-1)/2; }
	printf("Case %d: %llu %llu\n",time,ans1,ans2);
}

int main()
{
	freopen("BZOJ2730.in","r",stdin);
	memset(cur,-1,sizeof(cur));
	int T; read(T);
	for(;T;read(T)) Main(T);
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <vector>

#include <cstdlib>

#define ll long long

#define p(x) ('0'<=x&&x<='9')

#define For(i,l,r) for(int i=l;i<=r;i++)

char cc; int C;

template <class T>

void read( T &x )

{

x=0; cc=getchar(); C=1;

while(!p(cc)) { if(cc=='-') C=-1; cc=getchar(); }

while(p(cc)) { x=x*10+cc-48; cc=getchar(); }

x*=C;

}

using namespace std;

#define SIZ 1010

#define N 1000

struct node

{

int fa,dfn,mn,childcnt;

bool iscut;

vector <int> belong;

void init()

{

belong.clear();

fa=dfn=mn=childcnt=iscut=0;

}

}pool[SIZ];

#define FA pool[x].fa

#define MN pool[x].mn

#define DFN pool[x].dfn

#define CNT pool[x].childcnt

#define ISCUT pool[x].iscut

struct Tedge

{

int from,to;

bool use;

Tedge(int _=0,int __=0,bool ___=false) { from=_; to=__; use=false; }

bool operator != (const Tedge &x) { return (from!=x.from||to!=x.to); }

} edge[N<<1],STA[N];

int TOP;

#define E edge[i]

#define TO E.to

int e_tot,fst[SIZ],cur[SIZ],NXT[N<<1];

void add_e(int a,int b)

{

edge[e_tot]=Tedge(a,b,false); NXT[e_tot]=fst[a]; fst[a]=e_tot++;

edge[e_tot]=Tedge(b,a,false); NXT[e_tot]=fst[b]; fst[b]=e_tot++;

}

vector <int> BCC[SIZ];

int siz[SIZ],cnt[SIZ],tot;

int sta[SIZ],top;

bool use[SIZ];

unsigned ll ans1,ans2;

void init(int n)

{

memset(fst,-1,sizeof(fst));

memset(siz,0,sizeof(siz)); memset(cnt,0,sizeof(cnt));

e_tot=0; tot=0; ans1=0; ans2=1;

for(int i=1;i<=N;i++) BCC[i].clear();

int _,__;

For(i,1,n)

{

read(_); read(__); use[_]|=1; use[__]|=1;

add_e(_,__);

}

void cp(int &x,int y) { x>y?x=y:x=x; }

int cd;

void tarjan(int x)

{

use[x]=false; DFN=MN=++cd;

for(int i=fst[x];~i;i=NXT[i])

{

if(TO==FA) continue;

if(edge[i].use) continue;

STA[++TOP]=E;

E.use=true; i^=1; E.use=true; i^=1;

if(!use[TO]) cp(MN,pool[TO].dfn);

else

{

CNT++;

pool[TO].fa=x;

tarjan(TO);

MN=min(MN,pool[TO].mn);

if(pool[TO].mn>=DFN)

{

Tedge cur;

tot++;

ISCUT=true;

{

cur=STA[TOP--];

if(pool[cur.from].belong.size()==0||pool[cur.from].belong.back()!=tot)

{

pool[cur.from].belong.push_back(tot);

BCC[tot].push_back(cur.from);

}

if(pool[cur.to].belong.size()==0||pool[cur.to].belong.back()!=tot)

{

pool[cur.to].belong.push_back(tot);

BCC[tot].push_back(cur.to);

}

while(cur!=E);

}

if(CNT<2&&!FA) ISCUT=false;

}

int time;

void Main(int _)

{

time++;

init(_);

For(i,1,1000) cur[i]=fst[i],pool[i].init();

For(i,1,1000) if(use[i]) tarjan(i);

For(i,1,1000)

{

if(!pool[i].dfn) continue;

if(!pool[i].iscut)

{

siz[pool[i].belong[0]]++;

continue;

}

for(int j=0;j<pool[i].belong.size();j++) cnt[pool[i].belong[j]]++,siz[pool[i].belong[j]]++;

}

For(i,1,tot) if(cnt[i]==1)

{ ans1++; ans2*=(unsigned ll)(siz[i]==1?1:(siz[i]-1)); }

else if(cnt[i]==0)

{ ans1+=min(siz[i],2); ans2*=(unsigned ll)siz[i]*(siz[i]-1)/2; }

printf("Case %d: %llu %llu\n",time,ans1,ans2);

}

int main()

{

freopen("BZOJ2730.in","r",stdin);

memset(cur,-1,sizeof(cur));

int T; read(T);

for(;T;read(T)) Main(T);

return 0;

}

BZOJ2730

@OceanEye7年前

04/25

11:23

BZOJ1179

OceanEye 撰写 DFS SPFA 强连通分量无回复

(点我)题目链接

老题。
强连通分量把能一起抢的缩成一个点
然后在图上跑SPFA或者DP都可以
写SPFA写惯了……

/**************************************************************
    Problem: 1179
    User: OceanEYe
    Language: C++
    Result: Accepted
    Time:9392 ms
    Memory:42020 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <iostream>
#define ll long long
#define INF 1000000000
#define p(x) ('0'<=x&&x<='9')
 
char cc; int C;
template <class T>
void read( T &x )
{
    x=0; cc=getchar(); C=1;
    while(!p(cc)) { if(cc=='-') C=-1; cc=getchar(); }
    while(p(cc)) { x=x*10+cc-48; cc=getchar(); }
    x*=C;
}
 
using namespace std;
#define N 500010
 
int fa[N];
#define S 0
#define T n+5
vector <int> G[N];
 
int n,m,val[N],s,TT[N];
bool p[N];
 
void pre()
{
    int _,__;
    read(n); read(m);
    for(int i=1;i<=m;i++)
    {
        read(_); read(__);
        G[_].push_back(__);
    }
    for(int i=1;i<=n;i++)
        read(val[i]);
    read(s); read(__);
    for(int i=1;i<=__;i++)
    {
        read(_); p[_]=true;
    }
}
 
int STA[N],top,SSTA[N],TOP;
int dfn[N],low[N],cur[N],in[N],tot;
bool inSTA[N],vis[N];
 
void Tarjan(int x)
{
    SSTA[++TOP]=x;
    low[x]=dfn[x]=++top;
    STA[top]=x;
    fa[x]=x;
    vis[x]=true;
    inSTA[x]=true;
    bool flag;
    for(;TOP;)
    {
        flag=true;
        int u=SSTA[TOP];
        for(int i=cur[u];i<G[u].size();i++)
        {
            if(!vis[G[u][i]])
            {
                vis[G[u][i]]=true;
                fa[G[u][i]]=u;
                low[G[u][i]]=dfn[G[u][i]]=++top;
                STA[top]=G[u][i];
                inSTA[G[u][i]]=true;
                SSTA[++TOP]=G[u][i];
                cur[u]=i+1;
                flag=false;
                break;
            }
            else continue;
        }
        if(!flag) continue;
        for(int i=0;i<G[u].size();i++)
            if(fa[G[u][i]]==u) low[u]=min(low[u],low[G[u][i]]);
            else if(inSTA[G[u][i]]) low[u]=min(low[u],dfn[G[u][i]]);
        if(low[u]==dfn[u])
        {
            tot++;
            while(top!=dfn[u])
            {
                in[STA[top]]=tot;
                inSTA[STA[top]]=false;
                TT[tot]+=val[STA[top--]];
            }
            in[STA[top]]=tot;
            inSTA[STA[top]]=false;
            TT[tot]+=val[u]; top--;
        }
        TOP--;
    }
}
 
vector <int> MP[N];
bool inq[N];
int dist[N];
 
int solve()
{
    queue <int> Q;
    Q.push(S); inq[S]=true;
    while(!Q.empty())
    {
        int x=Q.front(); inq[x]=false; Q.pop();
        for(int i=0;i<MP[x].size();i++)
        {
            if(dist[MP[x][i]] < dist[x] + TT[MP[x][i]])
            {
                dist[MP[x][i]]=dist[x] + TT[MP[x][i]];
                if(!inq[MP[x][i]]) Q.push(MP[x][i]),inq[MP[x][i]]=true;
            }
        }
    }
    return dist[T];
}
 
int main()
{
    pre();
    Tarjan(s);
    for(int i=1;i<=n;i++)
    {
        if(!in[i]) continue;
        for(int j=0;j<G[i].size();j++)
        {
            if(in[G[i][j]]==in[i]) continue;
            MP[in[i]].push_back(in[G[i][j]]);
        }
    }
    MP[S].push_back(in[s]);
    for(int i=1;i<=n;i++)
        if(p[i]) MP[in[i]].push_back(T);
    printf("%d",solve());
    return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

/**************************************************************

Problem: 1179

User: OceanEYe

Language: C++

Result: Accepted

Time:9392 ms

Memory:42020 kb

****************************************************************/

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <cstdlib>

#include <vector>

#include <queue>

#include <iostream>

#define ll long long

#define INF 1000000000

#define p(x) ('0'<=x&&x<='9')

char cc; int C;

template <class T>

void read( T &x )

{

x=0; cc=getchar(); C=1;

while(!p(cc)) { if(cc=='-') C=-1; cc=getchar(); }

while(p(cc)) { x=x*10+cc-48; cc=getchar(); }

x*=C;

}

using namespace std;

#define N 500010

int fa[N];

#define S 0

#define T n+5

vector <int> G[N];

int n,m,val[N],s,TT[N];

bool p[N];

void pre()

{

int _,__;

read(n); read(m);

for(int i=1;i<=m;i++)

{

read(_); read(__);

G[_].push_back(__);

}

for(int i=1;i<=n;i++)

read(val[i]);

read(s); read(__);

for(int i=1;i<=__;i++)

{

read(_); p[_]=true;

}

int STA[N],top,SSTA[N],TOP;

int dfn[N],low[N],cur[N],in[N],tot;

bool inSTA[N],vis[N];

void Tarjan(int x)

{

SSTA[++TOP]=x;

low[x]=dfn[x]=++top;

STA[top]=x;

fa[x]=x;

vis[x]=true;

inSTA[x]=true;

bool flag;

for(;TOP;)

{

flag=true;

int u=SSTA[TOP];

for(int i=cur[u];i<G[u].size();i++)

{

if(!vis[G[u][i]])

{

vis[G[u][i]]=true;

fa[G[u][i]]=u;

low[G[u][i]]=dfn[G[u][i]]=++top;

STA[top]=G[u][i];

inSTA[G[u][i]]=true;

SSTA[++TOP]=G[u][i];

cur[u]=i+1;

flag=false;

break;

}

else continue;

}

if(!flag) continue;

for(int i=0;i<G[u].size();i++)

if(fa[G[u][i]]==u) low[u]=min(low[u],low[G[u][i]]);

else if(inSTA[G[u][i]]) low[u]=min(low[u],dfn[G[u][i]]);

if(low[u]==dfn[u])

{

tot++;

while(top!=dfn[u])

{

in[STA[top]]=tot;

inSTA[STA[top]]=false;

TT[tot]+=val[STA[top--]];

}

in[STA[top]]=tot;

inSTA[STA[top]]=false;

TT[tot]+=val[u]; top--;

}

TOP--;

}

vector <int> MP[N];

bool inq[N];

int dist[N];

int solve()

{

queue <int> Q;

Q.push(S); inq[S]=true;

while(!Q.empty())

{

int x=Q.front(); inq[x]=false; Q.pop();

for(int i=0;i<MP[x].size();i++)

{

if(dist[MP[x][i]] < dist[x] + TT[MP[x][i]])

{

dist[MP[x][i]]=dist[x] + TT[MP[x][i]];

if(!inq[MP[x][i]]) Q.push(MP[x][i]),inq[MP[x][i]]=true;

}

return dist[T];

}

int main()

{

pre();

Tarjan(s);

for(int i=1;i<=n;i++)

{

if(!in[i]) continue;

for(int j=0;j<G[i].size();j++)

{

if(in[G[i][j]]==in[i]) continue;

MP[in[i]].push_back(in[G[i][j]]);

}

MP[S].push_back(in[s]);

for(int i=1;i<=n;i++)

if(p[i]) MP[in[i]].push_back(T);

printf("%d",solve());

return 0;

}

OceanEye's Blog

很多人即使只见过一面，已经算见过了最后一面。

@OceanEye7年前

BZOJ2730

BZOJ2730

@OceanEye7年前

BZOJ1179

BZOJ1179

友情链接

近期文章

标签