ROADS 深搜+剪枝

#include<stdio.h>
#include<stdlib.h>
#include <string.h>
#include <string>
#include <iostream>
#include <stack>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
using namespace std;
int K,N,R;
struct Road
{
    int d,l,t;
};
vector < vector <Road> > G(110);//邻接表
int totalL;
int minL;
int totalC;
int visited[105];
int midkl[110][10010];//midkl[i][j]表示走到i城市用来j钱的情况下走过的路径长
void dfs(int s)
{
    if(s==N)
    {
        minL = min(minL,totalL);
        return;
    }
    for(int i=0;i<G[s].size();i++)
    {
        Road r = G[s][i];
        if(totalC + r.t > K)
            continue;//可行性剪枝
        if(totalL + r.l >= minL)
            continue;//最优化剪枝
        if(totalL + r.l>=midkl[r.d][totalC+r.t])
            continue;
        if(!(visited[r.d]))
        {
        midkl[r.d][totalC+r.t] = totalL+r.l;
        visited[r.d]=1;
        totalC+=r.t;
        totalL+=r.l;
        dfs(r.d);
        /**回退时候需要把r.d的还原****/
        visited[r.d]=0;
        totalC-=r.t;
        totalL-=r.l;
        }
    }
}
int main()
{
    cin >> K >> N >> R;
    for(int i=0;i<R;i++)
    {
        Road r;
        int s;
        cin >> s >> r.d >> r.l >> r.t;
        G[s].push_back(r);
    }
    /**初始化**/
    minL = 1 << 30;
    totalC = 0;
    totalL = 0;
    memset(visited,0,sizeof(visited));
   for(int i=0;i<110;i++)
    for(int j=0;j<10010;j++)
    midkl[i][j] = 1 << 30 ;
    
    dfs(1);
    if(minL< (1<<30))
    cout<<minL<<endl;
    else
        cout<<-1<<endl;
    return 0;
}