UVA 11015 - 05-2 Rendezvous

UVA Sep 1, 2020

Problem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : [email protected]                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%I64d",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%I64d%I64d",&a,&b)

#define sfi(t) scanf("%d",&t)
#define sfii(a,b) scanf("%d %d",&a,&b)
#define sfiii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfll(t) scanf("%I64d",&t)
#define sfllll(a,b) scanf("%I64d %I64d",&a,&b)
#define sfllllll(a,b,c) scanf("%I64d %I64d %I64d",&a,&b,&c)
#define sfd(t) scanf("%lf",&t)
#define sfc(c) scanf("%c",&c)
#define sfs(s) scanf("%s",s)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%I64d\n",a)
#define PF(a) printf("%f\n",a)
#define PDB(a) printf("%lf\n",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%I64d ",a)
#define PFN(a) printf("%f ",a)
#define PDBN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%I64d %I64d\n",a,b)
#define PPLN(a,b) printf("%I64d %I64d ",a,b)

#define pfi(a) printf("%d\n",a)
#define pfii(a,b) printf("%d %d\n",a,b)
#define pfiii(a,b,c) printf("%d %d %d\n",a,b,c)
#define pfll(a) printf("%I64d\n",a)
#define pfllll(a,b) printf("%I64d %I64d\n",a,b)
#define pfllllll(a,b,c) printf("%I64d %I64d %I64d\n",a,b,c)
#define pfd(a) printf("%lf\n",a)
#define pfs(a) printf("%s\n",a)
#define pfis(a) printf("%d ",a)
#define pflls(a) printf("%I64d ",a)
#define pfds(a) printf("%lf ",a)

#define CP(a) cout< pii;
typedef  pair piii;
typedef  pair pll;
typedef  pair psi;
typedef  vector vi;
typedef  vector vll;
typedef  vector vpii;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;

//Test Case & New line
#define Case(no) printf("Case %d: ",++no)
#define nl puts("")

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforba(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforba(i,(n)-1,0)
#define rfor1(i,n) rforba(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//Debug
#define dbg(x) cout << #x << " -> " << (x) << endl;
#define dbgsarr(i,a) cout<<#a<<"["< "< "< "<sum)
        {
            res=sum;
            index=i;
        }
    }
    return index;
}
struct Place
{
    string name;
};
int main()
{
    int n,m,no=0;
    while(sii(n,m))
    {
        if(n==0&&m==0)    return 0;
        Place a[100];
        for0(i,n)
        {
            cin>>a[i].name;
        }
        cover(M,63);
        while(m--)
        {
            int x,y,cost;
            si(x),sii(y,cost);
            x--,y--;
            M[x][y]=min(M[x][y],cost);
            M[y][x]=min(M[y][x],cost);
        }
        FloydWarshall(n);
//        db_mat(M,n,n);
        Case(no);
        CP(a[Min(n)].name);
    }
    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11015/11015.cpp

Tags

Great! You've successfully subscribed.
Great! Next, complete checkout for full access.
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.