ZOJ2583/POJ2679(好吧,我竟然会去做想不通的问题...```)

题目链接: http://poj.org/problem?id=2679

              http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1583

 

 

我要刷水题呢,可这是水题么?可能是吧,可于我而言这水分也太涩了一些~忙了一整天再加一个昨晚,可是可是,思路呢,哪里来的,哪里呢``````

 

好吧,引自别人的思路,好不容易啊,不容易~做一些不是很清晰的题感觉那么水深火热,悲剧不都是从不能1YES开始的,也有从庞大复杂的东西绕得懒惰的你投入不了开始的~好吧,外面下雨了...

 

题意: 给你一个有向有权有环图,两个权值weight和distance,只能从当前点走离开该点的weight值最低的路,问从s到t的weight值最少为多少,         并得出在这种情况下distance的最小值.

限于表达能力及不懒惰程度,就不说那么多了吧,最短路问题,要加入环的判断,又专门看了下BellmanFord的判断环的过程.自已实现的代        码如下:

另,此代码引申出了另外一个问题 ,就是DFS和BFS,在判断是否存在路径上的时间效率问题,据这一题来讲,用BFS TLE了,而用DFS 860MS,DFS效率上高了不少,由此引发了和一个队友关于BFS和DFS效率上的争论,呃~具体测试一般情况下BFS和DFS效率上的问题,下次再测试吧~

 

 

8437003 dooder_daodao 2679 Accepted 380K 860MS C++ 3061B 2011-04-05 19:44:27

 

 

#include<stdio.h> #include<string.h> #include<queue> #include<stack> #include<iostream> using namespace std; #define M 1108 #define N 10008 #define INF 0x7ffffff typedef struct{ int u,v,w,l; int next; }Edge; Edge edge[N]; int minw[M],head[M],dis[M],lenth[M]; int numinq[M]; bool inq[M]; int n,m,f,t,e,flag; char str[256]; queue<int>q; int min(int a,int b) { return a>b?b:a; } void AddEdge(int u,int v,int wl,int l,int wr) { if(wl<=minw[u]){ edge[e].u=u;edge[e].v=v;edge[e].l=l; edge[e].w=wl;minw[u]=wl; edge[e].next=head[u];head[u]=e++; } if(wr<=minw[v]){ edge[e].v=u;edge[e].u=v;edge[e].l=l; edge[e].w=wr;minw[v]=wr; edge[e].next=head[v];head[v]=e++; } } void DelEdge() { int tmp,u,pre; for(u=0;u<n;u++){ tmp=head[u],pre=head[u]; while(tmp!=-1){ if(edge[tmp].w!=minw[u]){ if(tmp==head[u]){ head[u]=edge[tmp].next; tmp=pre=head[u]; } else{ edge[pre].next=edge[tmp].next; tmp=edge[tmp].next; } } else{ pre=tmp; tmp=edge[tmp].next; } } } } bool DFS(int from,int to) { bool mark[M]; stack<int>stk; int u,v,tmp; if(from==to) return true; memset(mark,false,sizeof(mark)); stk.push(from); mark[from]=true; while(!stk.empty()){ u=stk.top();stk.pop(); for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(v==to) return true; if(mark[v]) continue; stk.push(v); mark[v]=true; } } return false; } void SPFA() { int i,u,v,tmp; while(!q.empty()) q.pop(); for(i=0;i<n;i++){ inq[i]=false; dis[i]=INF; lenth[i]=0; numinq[i]=0; } dis[f]=0;inq[f]=true; numinq[i]=1; q.push(f); while(!q.empty()){ u=q.front();q.pop(); inq[u]=false; if(numinq[u]>=n) break; for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(dis[v]-dis[u]>=edge[tmp].w){ if(dis[v]-dis[u]>edge[tmp].w) lenth[v]=lenth[u]+edge[tmp].l; else lenth[v]=min(lenth[v],lenth[u]+edge[tmp].l); dis[v]=dis[u]+edge[tmp].w; if(!inq[v]){ inq[v]=true; numinq[v]++; q.push(v); } } } } for(u=0;u<n&&!flag;u++){ for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(dis[v]>dis[u]+edge[tmp].w){ if(DFS(f,u)&&DFS(u,t)){ flag=1; break; } } } } } int main() { int u,v,wl,l,wr; int i; //freopen("abc.txt","r",stdin); //freopen("out.txt","w",stdout); while(scanf("%d%d%d%d",&n,&m,&f,&t)!=EOF){ memset(head,-1,sizeof(head));e=0; for(i=0;i<n;i++) minw[i]=INF; while(m--){ scanf("%s",str); sscanf(str,"(%d,%d,%d[%d]%d)",&u,&v,&wl,&l,&wr); AddEdge(u,v,wl,l,wr); }DelEdge();flag=0; if(!DFS(f,t)){ puts("VOID");continue;} SPFA(); if(flag) {puts("UNBOUND");continue;} printf("%d %d/n",dis[t],lenth[t]); } return 0; } 

 

时间效率上太不可观了,一起做这题的小媛30MS就AC了,我的那个悲啊~附修改过的代码如下:

 

 

2476676 2011-04-05 21:40:24 Accepted 2583 C++      60     404   zzuli_ㄉㄉ

 

 

#include<stdio.h> #include<string.h> #include<queue> #include<stack> #include<iostream> using namespace std; #define M 1108 #define N 10008 #define INF 0x7ffffff typedef struct{ int u,v,w,l; int next; }Edge; Edge edge[N]; int minw[M],head[M],dis[M],lenth[M]; int numinq[M]; bool inq[M]; int n,m,f,t,e,flag; char str[256]; queue<int>q; int min(int a,int b) { return a>b?b:a; } void AddEdge(int u,int v,int wl,int l,int wr) { if(wl<=minw[u]){ edge[e].u=u;edge[e].v=v;edge[e].l=l; edge[e].w=wl;minw[u]=wl; edge[e].next=head[u];head[u]=e++; } if(wr<=minw[v]){ edge[e].v=u;edge[e].u=v;edge[e].l=l; edge[e].w=wr;minw[v]=wr; edge[e].next=head[v];head[v]=e++; } } void DelEdge() { int tmp,u,pre; for(u=0;u<n;u++){ tmp=head[u],pre=head[u]; while(tmp!=-1){ if(edge[tmp].w!=minw[u]){ if(tmp==head[u]){ head[u]=edge[tmp].next; tmp=pre=head[u]; } else{ edge[pre].next=edge[tmp].next; tmp=edge[tmp].next; } } else{ pre=tmp; tmp=edge[tmp].next; } } } } void SPFA() { int i,u,v,tmp,res; while(!q.empty()) q.pop(); for(i=0;i<n;i++){ inq[i]=false; dis[i]=INF; lenth[i]=0; numinq[i]=0; } dis[f]=0;inq[f]=true; numinq[i]=1; q.push(f); while(!q.empty()){//最短路 u=q.front();q.pop(); inq[u]=false; if(numinq[u]>n) break; for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(dis[v]-dis[u]>=edge[tmp].w){ if(dis[v]-dis[u]>edge[tmp].w) lenth[v]=lenth[u]+edge[tmp].l; else lenth[v]=min(lenth[v],lenth[u]+edge[tmp].l); dis[v]=dis[u]+edge[tmp].w; if(!inq[v]){ inq[v]=true; numinq[v]++; q.push(v); } } } } if(dis[t]==INF){ flag=0;return;} res=dis[t]; /* 找负环,由于负环需要很久才能传递到源点,所以用 d[v[j]]=-999999来加速传递 如觉得我表述不清请看: 3 3 2 0 (2,0,100[1]0) (1,2,-1[1]100) (1,1,-1[1]0) 结果应该是: UNBOUND */ for(i=0;i<n;i++){ for(u=0;u<n;u++){ for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(dis[u]!=INF&&dis[v]>dis[u]+edge[tmp].w) dis[v]=-1000000; } } } if(res>dis[t]) flag=1; else flag=2; } int main() { char ans[][12]={"VOID/n","UNBOUND/n","%d %d/n"}; int u,v,wl,l,wr; int i; //freopen("abc.txt","r",stdin); //freopen("out.txt","w",stdout); while(scanf("%d%d%d%d",&n,&m,&f,&t)!=EOF){ memset(head,-1,sizeof(head));e=0; for(i=0;i<n;i++) minw[i]=INF; while(m--){ scanf("%s",str); sscanf(str,"(%d,%d,%d[%d]%d)",&u,&v,&wl,&l,&wr); AddEdge(u,v,wl,l,wr); }DelEdge(); SPFA(); printf(ans[flag],dis[t],lenth[t]); } return 0; }  

 

 

 

这么大的时间差距,总感觉不怎么舒服~嗯,虽然通过了,可一直有个阴隐挥之不去,后来就想到,其实深搜只要一次就可以了,记录下所有终点能到达的结点,记录下逆向边,然后从终点深搜记录能达到的点~终于完成了,40MS~~~

 

#include<stdio.h> #include<string.h> #include<queue> #include<stack> #include<iostream> using namespace std; #define M 1108 #define N 10008 #define INF 0x7ffffff typedef struct{ int u,v,w,l; int next; }Edge; typedef struct{ int u,v,w; int next; }EdgeET; Edge edge[N]; EdgeET edgeET[N]; int minw[M],head[M],dis[M],lenth[M]; int tail[M]; bool jex[M]; int numinq[M]; bool inq[M]; int n,m,f,t,e,flag,et; char str[256]; queue<int>q; int min(int a,int b) { return a>b?b:a; } void AddEdge(int u,int v,int wl,int l,int wr) { if(wl<=minw[u]){ edge[e].u=u;edge[e].v=v;edge[e].l=l; edge[e].w=wl;minw[u]=wl; edge[e].next=head[u];head[u]=e++; } if(wr<=minw[v]){ edge[e].v=u;edge[e].u=v;edge[e].l=l; edge[e].w=wr;minw[v]=wr; edge[e].next=head[v];head[v]=e++; } } void AddEdgeET(int u,int v,int w) { edgeET[et].u=u;edgeET[et].v=v;edgeET[et].w=w; edgeET[et].next=tail[u];tail[u]=et++; } void RevEdge() { int u,tmp; for(u=0;u<n;u++){ for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next) if(edge[tmp].w==minw[u]) AddEdgeET(edge[tmp].v,edge[tmp].u,edge[tmp].w); } } void DelEdge() { int tmp,u,pre; for(u=0;u<n;u++){ tmp=head[u],pre=head[u]; while(tmp!=-1){ if(edge[tmp].w!=minw[u]){ if(tmp==head[u]){ head[u]=edge[tmp].next; tmp=pre=head[u]; } else{ edge[pre].next=edge[tmp].next; tmp=edge[tmp].next; } } else{ pre=tmp; tmp=edge[tmp].next; } } } } bool DFS(int from,int to) { stack<int>stk; int u,v,tmp; memset(jex,false,sizeof(jex)); stk.push(from); jex[from]=true; while(!stk.empty()){ u=stk.top();stk.pop(); for(tmp=tail[u];tmp!=-1;tmp=edgeET[tmp].next){ v=edgeET[tmp].v; if(jex[v]) continue; stk.push(v); jex[v]=true; } } return jex[to]; } void SPFA() { int i,u,v,tmp; while(!q.empty()) q.pop(); for(i=0;i<n;i++){ inq[i]=false; dis[i]=INF; lenth[i]=0; numinq[i]=0; } dis[f]=0;inq[f]=true; numinq[i]=1; q.push(f); while(!q.empty()){ u=q.front();q.pop(); inq[u]=false; if(numinq[u]>=n) break; for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(dis[v]-dis[u]>=edge[tmp].w){ if(dis[v]-dis[u]>edge[tmp].w) lenth[v]=lenth[u]+edge[tmp].l; else lenth[v]=min(lenth[v],lenth[u]+edge[tmp].l); dis[v]=dis[u]+edge[tmp].w; if(!inq[v]){ inq[v]=true; numinq[v]++; q.push(v); } } } } for(u=0;u<n&&!flag;u++){ for(tmp=head[u];tmp!=-1;tmp=edge[tmp].next){ v=edge[tmp].v; if(dis[u]!=INF&&dis[v]>dis[u]+edge[tmp].w){ if(jex[u]){ flag=1; break; } } } } } int main() { int u,v,wl,l,wr; int i; //freopen("abc.txt","r",stdin); //freopen("out.txt","w",stdout); while(scanf("%d%d%d%d",&n,&m,&f,&t)!=EOF){ memset(head,-1,sizeof(head));e=0; memset(tail,-1,sizeof(tail));et=0; for(i=0;i<n;i++) minw[i]=INF; while(m--){ scanf("%s",str); sscanf(str,"(%d,%d,%d[%d]%d)",&u,&v,&wl,&l,&wr); AddEdge(u,v,wl,l,wr); } DelEdge(); RevEdge(); flag=0; if(!DFS(t,f)){ puts("VOID");continue;} SPFA(); if(flag) {puts("UNBOUND");continue;} printf("%d %d/n",dis[t],lenth[t]); } return 0; }