【HDOJ】1601 Galactic Import

Dijkstra。

/* 1601 */
#include <cstdio>
#include <cstring>
#include <cstdlib>

#define INF 999999

char buf[27];
int map[27][27];
bool visit[27], valid[27];
double val[27];
int path[27];
int n;

void dijkstra() {
    int i, j, k;
    int min, v;
    
    memset(visit, false, sizeof(visit));
    visit[26] = true;
    for (i=0; i<27; ++i)
        path[i] = map[i][26];
    
    for (i=0; i<26; ++i) {
        min = INF;
        for (j=0; j<26; ++j) {
            if (!visit[j] && path[j]<min) {
                min = path[j];
                v = j;
            }
        }
        if (min == INF)
            break;
        visit[v] = true;
        for (j=0; j<26; ++j) {
            if (!visit[j] && path[j]>min+map[v][j]) {
                path[j] = min + map[v][j];
            }
        }
    }
}

int main() {
    int i, j, k, r;
    double v, max;
    char cmd[3], line[30];
    
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    while (scanf("%d",&n)!=EOF) {
        for (i=0; i<27; ++i) {
            for (j=0; j<27; ++j) {
                map[i][j] = INF;
            }
            map[i][i] = 0;
        }
        for (i=0; i<n; ++i) {
            scanf("%s %lf %s", cmd, &v, line);
            j = cmd[0] - 'A';
            val[j] = v;
            for (r=0; line[r]; ++r) {
                if (line[r] == '*')
                    k = 26;
                else
                    k = line[r] - 'A';
                map[j][k] = map[k][j] = 1;
            }
        }
        dijkstra();
        max = -1;
        v = 0;
        for (i=0; i<26; ++i) {
            if (path[i] >= INF)
                continue;
            if (path[i] > 1) {
                j = path[i]-1;
                while (j--) {
                    val[i] *= 0.95;
                }
            }
            if (val[i] > max) {
                max = val[i];
                v = i;
            }
        }
        printf("Import from %c
", (char)v+'A');
    }
    
    return 0;
}