测试点8,9检测时会检测是否存成了有向图,别问我为啥知道@__@
dijkstra+dfs+路径保存
5,7有个坑,别的同学有写,不写了。
送个测试样例:
10 3 2 3
5 10 0
0 1 1
1 3 1
3 2 1
res:
5 0->1->3->2 5
附代码:
#include<bits/stdc++.h>
using namespace std;
const int N = 510;
int g[N][N];int dist[N];bool st[N];
int node[N];int c,n,s,m;
vector<int>pre[N];
vector<int>res;
vector<int>p;
int res2=0x3f3f3f3f,res1=0x3f3f3f3f;
int dijkstra()
{
memset(dist,0x3f,sizeof dist);
dist[0]=0;
for(int i=0;i<=n;i++)
{
int t=-1;
for(int j=0;j<=n;j++)
if(!st[j]&&(t==-1||dist[t]>dist[j]))
t=j;
for(int j=0;j<=n;j++)
{
if(dist[j]>g[t][j]+dist[t])
{
dist[j]=g[t][j]+dist[t];
pre[j].clear();
}
if(dist[j]==g[t][j]+dist[t])
pre[j].push_back(t);
}
st[t]=true;
}
}
int print(vector<int>t[],int n)
{
if(t[n].size()==0)
{
int sum=0;//cout<<"!!!!";
int n1=0,n2=0;
for(int i=res.size()-1;i>=0;i--)
{
if(node[res[i]]<c/2)
{
int diff=c/2-node[res[i]];
if(n2!=0)
{
if(n2>diff)
{
n2-=diff;diff=0;
}
else
{
diff-=n2;n2=0;n1+=diff;
}
}
else n1+=diff;
}
else
n2+=(node[res[i]]-c/2);
}
if(n1<res1)
{
res1=n1;p=res;res2=n2;
}
else if(n1==res1&&n2<res2)
{
res1=n1;p=res;res2=n2;
}
return 0;
}
for(int i=0;i<t[n].size();i++)
{
//cout<<n<<"!";
res.push_back(n);
print(t,t[n][i]);
res.pop_back();
}
return 0;
}
int main()
{
cin>>c>>n>>s>>m;
memset(g,0x3f,sizeof g);
for(int i=1;i<=n;i++)cin>>node[i];
for(int i=1;i<=m;i++)
{
int a,b,c;
cin>>a>>b>>c;
g[a][b]=g[b][a]=c;
}
dijkstra();
print(pre,s);
//cout<<dist[s]<<"!";
cout<<res1<<" "<<"0";
for(int i=p.size()-1;i>=0;i--)
{
cout<<"->"<<p[i];
}
cout<<" "<<res2;
}