poj 1724 dfs + 剪枝

#include 
#include 
#include 
using namespace std;

int K, R, N;

struct Road {
    int d, L, t;
}; 

vector< vector < Road> > cityMap(110); //邻接表。citymap【i】 是从点i有路连到城市的集合 

int minLen = 1 << 30;  //当前找到的最优路径的集合 
int totalLen;   //正在走的路径的长度 
int totalCost;  //正在走的路径的花费 
int visited[110];  //标记城市是否走过 
int minL[110][10100];   //minL[i][j]表示从1到i点，花销为j的最短路的长度 

void dfs(int s) {      //从s向N走 
    if ( s == N) {
        minLen = min(minLen, totalLen);
        return;
    }
    for( int i = 0; i < cityMap[s].size(); i++) {
        int d = cityMap[s][i].d;                   //s有路连到d 
        int cost = totalCost + cityMap[s][i].t;
        if ( cost > K )
            continue;
        if ( !visited[d] ) {
            if (totalLen + cityMap[s][i].L >= minLen)
                continue;
            if (totalLen + cityMap[s][i].L >= minL[d][cost])
                continue;
                totalLen += cityMap[s][i].L;
                totalCost += cityMap[s][i].t;
                minL[d][cost] = totalLen;
                visited[d] = 1;
                dfs(d);
                visited[d] = 0;
                totalCost -= cityMap[s][i].t;
                totalLen -= cityMap[s][i].L;
        }
    }
}

int main() {
    
    cin  >> K >> N >> R;
    for ( int i = 0; i < R; i++) {
        int s;
        Road r;
        cin >> s >> r.d >> r.L >> r.t;
        if ( s != r.d )
            cityMap[s].push_back(r);
    }
    for (int i = 0; i < 110; i++)
        for (int j = 0; j < 10100; j++) {
            minL[i][j] = 1 << 30;
        }
    memset(visited, 0, sizeof(visited));
    totalLen = 0;
    totalCost = 0;
    visited[1] = 1;
    minLen = 1 << 30;
    dfs(1);
    if (minLen < (1 << 30))
        cout << minLen << endl;
    else
        cout << "-1" << endl;
    return 0;
}