HDU 1546 Idiomatic Phrases Game(Dijkstra)

HDU 1546 Idiomatic Phrases Game(Dijkstra)

http://acm.hdu.edu.cn/showproblem.php?pid=1546

题意:

        给你一个有0-9和A-F字符组成单词的字典.字典中的两个单词a与b ,如果a的后4个字符与b的前4个字符相同,那么存在一条从a到b的代价为val[a]的有向边.现在要你找出从第一个单词到最后一个单词的最小花费.如果不存在有向边,那么输出-1.

分析:

        其实就是把每个单词看成一个点,然后在点之间建图.然后用DIjkstra求最短路后,输出从0号点到n-1号点的最短距离即可.

AC代码:    (要用g++提交,C++提交会编译错误)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn=1000+10;
#define INF 1e9

struct Point
{
    int val;
    string str;
    bool link(Point& rhs)const
    {
        for(int i=0;i<4;i++)
            if(str[str.size()-4+i] != rhs.str[i])
                return false;
        return true;
    }
}points[maxn];

struct Edge
{
    int from,to,dist;
    Edge(int f,int t,int d):from(f),to(t),dist(d){}
};

struct HeapNode
{
    int d,u;
    HeapNode(int d,int u):d(d),u(u){}
    bool operator <(const HeapNode& rhs)const
    {
        return d > rhs.d;
    }
};

struct Dijkstra
{
    int n,m;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool done[maxn];
    int d[maxn];

    void init(int n)
    {
        this->n=n;
        for(int i=0;i<n;i++) G[i].clear();
        edges.clear();
    }

    void AddEdge(int from,int to,int dist)
    {
        edges.push_back(Edge(from,to,dist));
        m=edges.size();
        G[from].push_back(m-1);
    }

    int dijkstra()
    {
        priority_queue<HeapNode> Q;
        for(int i=0;i<n;i++) d[i]=INF;
        d[0]=0;
        Q.push(HeapNode(d[0],0));
        memset(done,0,sizeof(done));

        while(!Q.empty())
        {
            HeapNode x=Q.top(); Q.pop();
            int u=x.u;
            if(done[u]) continue;
            done[u]=true;

            for(int i=0;i<G[u].size();i++)
            {
                Edge &e=edges[G[u][i]];
                if(d[e.to] > d[u]+e.dist)
                {
                    d[e.to]=d[u]+e.dist;
                    Q.push(HeapNode(d[e.to],e.to));
                }
            }
        }
        if(d[n-1]==INF) return -1;
        return d[n-1];
    }
}DJ;

int main()
{
    int n;
    while(scanf("%d",&n)==1&&n)
    {
        for(int i=0;i<n;i++)
            cin>>points[i].val>>points[i].str;

        DJ.init(n);

        for(int i=0;i<n;i++)
        for(int j=i+1;j<n;j++)
        {
            if(points[i].link(points[j]))
                DJ.AddEdge(i,j,points[i].val);
            if(points[j].link(points[i]))
                DJ.AddEdge(j,i,points[j].val);
        }

        printf("%d\n",DJ.dijkstra());
    }
    return 0;
}