kuangbin_ShortPath I (POJ 2240)

本身很简单的spfa判环 TLE了一把是因为没写map(不会)

看着别人的答案临时学了一发发现只是用的话还是挺简单的 (但是绝对别学别人直接命名为m) 800多MS水过

噢对了这题Pending到超时了三次 POI绝对有毒

#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;

map<string, int> mapp;
double val[][];
int n, m;

bool spfa(int s)
{
    double dis[];
    bool vis[];
    int time[];
    memset(dis, , sizeof dis);
    memset(vis, , sizeof vis);
    memset(time, , sizeof time);

    queue<int> q;
    dis[s] = 1.0;
    vis[s] = true;
    q.push(s);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = ; i <= n; i++){
            if(dis[i] < dis[u] * val[u][i]){
                dis[i] = dis[u] * val[u][i];
                if(!vis[i]){
                    vis[i] = true;
                    q.push(i);
                    if(++time[i] >= n) return true;
                }
            }
        }
    }
    return false;
}
int main()
{
    int kase = ;
    while(){
        cin >> n;
        if(n == ) break;
        memset(val, , sizeof val);
        for(int i = ; i <= n; i++){
            string str;
            cin >> str;
            mapp[str] = i;
        }
        cin >> m;
        for(int i = ; i <= m; i++){
            string str1, str2;
            double value;
            cin >> str1 >> value >> str2;
            val[mapp[str1]][mapp[str2]] = value;
        }
        if(spfa()) cout << "Case " << ++kase << ": Yes" << endl;
        else cout << "Case " << ++kase << ": No" << endl;
    }
    return ;
}