UVA 10187 From Dusk Till Dawn /PC 110907

不吐槽。。

#include <iostream>
#include <map>
#include <queue>

//无语的水题。节哀吧。且这道题不严谨，因为没说是无环。算了，不吐槽了。优先队列+BFS 

using namespace std;
const int inf=10000000;
const int MAxN=105;
const int MAXM=2000;
typedef struct ei{
    int v;
    int begin;
    int ends;
}edge;
vector<edge>Edge[MAxN];
typedef struct ci{
    int city;
    int litre;
    int artime;
    bool operator<(const ci &A)const {
        return (litre>A.litre) ;
    }
}City;
City tmp,pushed;
int m,tot;
int start_city,end_city;
int LITRES;

void init(){
    for(int i=0;i<MAxN;i++)
    Edge[i].clear();
}

void addedge(int u,int v,int be,int en){
    Edge[u].push_back((edge){v,be,en});
}

bool slove(){
    int now; int tmptime,pushtime;
    priority_queue<City>que;
    tmp.city=start_city; tmp.artime=18; tmp.litre=0;
    que.push(tmp);
    while(!que.empty()){
        tmp=que.top();
        que.pop();
        now=tmp.city;
        if(now==end_city){
            LITRES=tmp.litre;
            return true;
        }
        for(int e=0;e<Edge[now].size();e++){
             tmptime=tmp.artime; pushtime=Edge[now][e].begin;
             int used=tmp.litre;
            if(pushtime<tmptime){
                used++;
            }
            que.push((City){Edge[now][e].v,used,Edge[now][e].ends});
        }
    }
    return false;
}


int main(){
    int T; int from,to; int Cas=0;
    string start,ends; int stt,edt,waste;
    cin>>T;
    while(T--){
        Cas++;
        init();
        map<string,int>citys;
        cin>>m;
        for (int i = 1; i <= m; i++)
        {
            cin >> start >> ends >> stt >> waste;
            if (citys.find(start) == citys.end())
            {
                from = citys.size();
                citys[start] = from;
            }
            else
                from = citys[start];

            if (citys.find(ends) == citys.end())
            {
                to = citys.size();
                citys[ends] = to;
            }
            else
                to = citys[ends];
            if(((stt>=18)||(stt<=6&&stt>=0))){   //我调了一天，把自己原来写的改得面目全非，对着别人的改啊改
            //都几乎改成别人的了，终于，一道水题，让我过了。当我把(stt>=18&&stt<=24)改成(stt>=18)之后，过了。哈哈哈
            //坑爹的测试数据啊。肯定是有测试数据超过了24。尼玛，还我一早上的时间，kao，一万个操。。 还以为是我的算法错了呢
            //原来是测试数据坑.. 
                if(stt<=6)
                stt+=24;
                edt=stt+waste;
                if(edt<=30){
                Edge[from].push_back((edge){to,stt,edt});
                }
            }

        }
        cin>>start>>ends;
        if(start==ends){
            cout << "Test Case " << Cas << "." << endl;
            cout << "Vladimir needs 0 litre(s) of blood." << endl;
            continue;
        }
            if(citys.find(start)==citys.end()
                ||citys.find(ends)==citys.end()){
            cout << "Test Case " << Cas << "." << endl;
            cout << "There is no route Vladimir can take." << endl;
            continue;
            }
        start_city=citys[start]; end_city=citys[ends];
        if(slove()){
            cout << "Test Case " << Cas << "." << endl;
            cout << "Vladimir needs " << LITRES << " litre(s) of blood." << endl;
        }
        else {
            cout << "Test Case " << Cas << "." << endl;
            cout << "There is no route Vladimir can take." << endl;
        }
    }
    return 0;
}