Security Badge（思维+bfs）

统计一下所有门的编号限制，将其排序，排序后每相邻的两点，一定是最小的区间，假如这个区间范围的点能从期点到终点的话就可以加入总答案。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define endl '\n'
#define lowbit(x) x &(-x)
#define mh(x) memset(x, -1, sizeof h)
#define debug(x) cerr << #x << "=" << x << endl;
const int N = 1e5 + 10;
int read()
{
    int x = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
            f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
        x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int e[N], ne[N], l[N], r[N], h[N], cnt;
void add(int a, int b, int ll, int rr)
{
    e[cnt] = b, l[cnt] = ll, r[cnt] = rr, ne[cnt] = h[a], h[a] = cnt++;
}
bool st[N];
int n, m, mm, s, t;
signed main()
{
    // cin.tie(0)->ios_base::sync_with_stdio(false);
    n = read(), m = read(), mm = read(), s = read(), t = read();
    vector<int> tmp;
    mh(h);
    while (m--)
    {
        int a, b, ll, rr;
        a = read(), b = read(), ll = read(), rr = read();
        add(a, b, ll, rr);
        tmp.push_back(ll - 1), tmp.push_back(rr);
    }
    function<void(int, int)> dfs = [&](int u, int lim)
    {
        for (int i = h[u]; ~i; i = ne[i])
        {
            int v = e[i];
            if (st[v])
                continue;
            if (lim >= l[i] && lim <= r[i])
            {
                st[v] = true;
                dfs(v, lim);
            }
        }
    };
    sort(tmp.begin(), tmp.end());
    int res = 0;
    for (int i = 0; i < tmp.size(); i++)
    {
        memset(st, false, sizeof st);
        dfs(s, tmp[i]);
        if (st[t])
            res += tmp[i] - tmp[i - 1];
    }
    printf("%d\n", res);
    return 0;
}