hdu 1062(DFS)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long LL;
const int INF = 999999999;
const int N = 105;
int m,n;
int MIN;
int graph[N][N];
struct Node{
    int v,level;
}node[105];
bool vis[N];

void dfs(int u,int ans,int level1,int level2){
    vis[u] = true;
    MIN = min(ans+node[u].v,MIN);
    for(int i=1;i<=n;i++){
        if(!vis[i]&&graph[u][i]<INF){
            if(abs(node[i].level-level1)>m) continue;
            if(abs(node[i].level-level2)>m) continue;
            dfs(i,ans+graph[u][i],min(node[i].level,level1),max(level2,node[i].level));
            vis[i] = false;
        }
    }
}
int main()
{
    while(scanf("%d%d",&m,&n)!=EOF){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                graph[i][j] = INF;
                if(i==j) graph[i][j] = 0;
            }
        }
        int LEVEL;
        for(int i=1;i<=n;i++){
            int num;
            scanf("%d%d%d",&node[i].v,&node[i].level,&num);
            for(int j=1;j<=num;j++){
                int a,b;
                scanf("%d%d",&a,&b);
                graph[i][a] = min(b,graph[i][a]);
            }
        }
        LEVEL = node[1].level;
        memset(vis,0,sizeof(vis));
        MIN = 99999999999;
        dfs(1,0,LEVEL,LEVEL);
        printf("%d\n",MIN);
    }
    return 0;
}