Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Update and rename 3562_unfinished.cpp to 3562.cpp

Browse Source 
God damn it !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
This commit is contained in:
Kirigaya Kazuto 2016-10-12 10:36:29 +08:00 committed by GitHub
parent 48f7c99fc6
commit 0c1c23e400
2 changed files with 98 additions and 97 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

98
SDUTOJ/3562.cpp Normal file
View File

@ -0,0 +1,98 @@
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define INF 0x3f3f3f3f
/** SPFA 单源最短路径算法 不支持负环*/
#define MAXN 1005
int d[MAXN];/// distance [ From S to ... ]
bool v[MAXN];/// visit
int q[MAXN];/// 基于数组的队列(也可用queue等...)
int mp[MAXN][MAXN]; /// mp[i][j] i<--> j is connected.
int n;/// n is the number of max Point .
int path[MAXN];
void spfa(int StartPoint) /// d[i] is the min distance from StartPoint to i ( Both >=1 )
{
for(int i=0; i<=n; i++)
{
if(mp[0][i]!=INF)path[i]=i;//Path Init
d[i]=INF;
v[i]=0;
}
queue<int> bus;
bus.push(StartPoint);
v[StartPoint]=1;
d[StartPoint]=0;
while(!bus.empty())
{
int c=bus.front();
bus.pop();
//v[c]=0;
for(int i=0; i<=n; i++)
{
/// Here : if your mp[i][j] use INF as infinite, then use mp[c][i]!=INF.
/// Or you may use mp[i][j]!=-1 && d[i] > d[c] + mp[c][i]
if( d[i]>d[c]+mp[c][i] )
{
d[i]=d[c]+mp[c][i];
//path[i]=min(path[i],path[c]);
if(!v[i])
{
if(c) path[i]=path[c];
v[i]==1;
bus.push(i);
}
}
if(d[i]==d[c]+mp[c][i])
{
if(c)path[i]=min(path[i],path[c]);
}
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int m;
scanf("%d%d",&n,&m);
if(!n&&!m) break;
n=n+1;
for(int i=0; i<=n; i++)
{
for(int j=0; j<=i; j++)
{
if(i==j) mp[i][j]=0;
else mp[i][j]=mp[j][i]=INF;
}
}
int tu,tv,tw;
for(int i=0; i<m; i++)
{
scanf("%d%d%d",&tu,&tv,&tw);
mp[tu][tv]=tw;
}
spfa(0);
if(d[n]<INF)
{
if(path[n]==n)printf("0\n");
else printf("%d\n",path[n]);
}
else printf("-1\n");
}
return 0;
}

97
SDUTOJ/3562_unfinished.cpp
View File

@ -1,97 +0,0 @@
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
using namespace std;
typedef long long ll;
#define RANGE 1005
#define MAX 0x3f3f3f3f
int cost[RANGE][RANGE];
int d[RANGE];
bool used[RANGE];
int n,m;
int pre[1005];
void spfa(int s)
{
int i,j,now;
for(i=0;i<=n+1;i++)
{
d[i]=MAX;
used[i]=false;
}
int flag=0;
for(i=0;i<=n+1;i++)
{
if(cost[0][i]<MAX)pre[i]=i;//初始化pre数组
}
used[s]=true;
d[s]=0;
queue<int> q;
q.push(s);
while(!q.empty())
{
now=q.front();
q.pop();
for(i=0;i<=n+1;i++)
{
if(d[i]>d[now]+cost[now][i])
{
d[i]=d[now]+cost[now][i];
if(used[i]==0)
{
if(now!=0)pre[i]=pre[now];
used[i]==true;
q.push(i);
}
}
if(d[i]==d[now]+cost[now][i])
{
if(now!=0)pre[i]=min(pre[i],pre[now]);
}
}
}
}
int main()
{
int i,j,a,b,c;
int we;
scanf("%d",&we);
while(we--)
{scanf("%d%d",&n,&m);
if(!n&&!m) break;
for(i=0;i<=n+1;++i)
{
for(j=0;j<=i;j++)
{
if(i==j) cost[i][j]=0;
else cost[i][j]=cost[j][i]=MAX;
}
}
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&c);
cost[a][b]=c;
}
spfa(0);
if(d[n+1]<MAX)
{
if(pre[n+1]==n+1)printf("0\n");
else printf("%d\n",pre[n+1]);
}
else printf("-1\n");
}
return 0;
}