Submission #7509645

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

bool b[110];
long long dis[110][110],len[110];
long long n,m,a,v;
long long s,mb;
long long leng;

void dijkstra()
{
	b[s]=1;
	len[s]=0;
	int mn1,mn2;
	for(int i=1;i<=n;i++)
	{
		mn1=420000000;
		for(int j=1;j<=n;j++)
		{
			if(!b[j]&&len[j]<mn1)
			{
				mn1=len[j];
				mn2=j;
			}
			//cout<<i<<" "<<len[j]<<" "<<mn1<<" "<<mn2<<endl;
		}
		b[mn2]=1;
		for(int j=1;j<=n;j++)
		{
			//cout<<j<<" "<<len[j]<<" "<<mn2<<" "<<dis[mn2][j]<<endl;;
			len[j]=min(len[mn2]+dis[mn2][j],len[j]);
		}
	}
}

int main()
{
	int a,b;
	cin>>a>>b;
	n=3,m=2;
	for(int i=0;i<=n;i++)
		for(int j=0;j<=n;j++)
			dis[i][j]=19260817123;
	for(int i=0;i<=n;i++)
	{
		len[i]=420000000;
	}
	dis[1][2]=a;
	dis[2][3]=-b;
	len[2]=a;
	s=1,mb=3;
	dijkstra();
	cout<<len[mb];
	return 0;
}
/*
5 5
1 2 1
1 3 5
2 4 9
3 4 1
4 5 1
1 5
*/

Submission Info

Judge Result