Security Badges Gym - 101617H DFS+枚举区间

 

​题意：

 有n个房间，m个门，k个桥，每一个门只允许l到r编号的人通过，问多少人可以从出发点走到终点。

 

枚举区间。DFS

#include <cstdio>
#include <algorithm>
#include <cstring>
#define inf 0x3f3f3f3f
#define mf(x) memset(x,inf,sizeof(x))
#define ms(x) memset(x, 0, sizeof(x))
using namespace std;
const int N = 1234;
struct edge{
    int v, l, r;
    edge(){}
    edge(int _v, int _l, int _r):v(_v),l(_l),r(_r){}
};
vector<edge>E[N];
int a[N*10], st, en;
int vis[N];
int dfs(int u, int fa, int L, int R){
    if(u == en) return 1;
    vis[u]++;
    for(int i=0;i<E[u].size();i++){
        edge now = E[u][i];
        if(vis[now.v]) continue;
//        if(now.v == fa) continue;
        if(now.l<=L&&R<=now.r && dfs(now.v,u,L,R)) return 1;
    }
    return 0;
}
int main(){
    int n, m, k;
    scanf("%d%d%d",&n,&m,&k);
    scanf("%d%d",&st,&en);
    int o = 0;
    for(int i=0;i<m;i++){
        int u, v, l ,r;
        scanf("%d%d%d%d",&u,&v,&l,&r);
        E[u].push_back(edge(v,l,r));
        a[o++] = l;
        a[o++] = r+1;
    }
    sort(a, a+o);
    int sz = unique(a, a+o) - a;
    int sum = 0;
    for(int i=1;i<sz;i++){
        ms(vis);
        if(dfs(st,-1,a[i-1],a[i]-1)){
            sum += a[i] - a[i-1];
        }
    }
    printf("%d\n", sum);
    return 0;
}