POJ - 1062昂贵的聘礼最短路或者DFS

1 4
10000 3 2
2 8000
3 5000
1000 2 1
4 200
3000 2 1
4 200
50 2 0

5250

现提供暴力狂搜

/*
 *Author: 2486
 *Memory: 584 KB    Time: 16 MS
 *Language: G++     Result: Accepted
 */

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
const int maxn = 100 + 5;
int n, m, T, V;
typedef pair<int,int> P;
struct obj {
    int val,l,x;
    vector<P> G;
} F[maxn];
bool vis[maxn];
int Min;

void init() {
    for(int i = 1; i <= n; i ++) F[i].G.clear();
}


void DFS(int MR, int LR, int u, int res) {
    if(MR - LR > m)return;
    Min = min(res + F[u].val,Min);
    for(int i = 0; i < F[u].G.size(); i ++) {
        P p = F[u].G[i];
        if(vis[p.first])continue;
        vis[p.first] = true;
        DFS( max(MR, F[p.first].l), min(LR, F[p.first].l), p.first, res + p.second);
        vis[p.first] = false;
    }
}

int main() {
    while(~scanf("%d%d", &m, &n)) {
        for(int i = 1; i <= n; i ++) {
            scanf("%d%d%d", &F[i].val, &F[i].l, &F[i].x);
            for(int j = 1; j <= F[i].x; j ++) {
                scanf("%d%d", &T, &V);
                F[i].G.push_back(P(T, V));
            }
        }
        Min = 0x3f3f3f3f;
        memset(vis, false, sizeof(vis));
        DFS(F[1].l, F[1].l, 1, 0);
        printf("%d\n", Min);
    }
    return 0;
}