请问能否卡掉这份代码

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MaxN = 1e4 + 10;
struct Query {
    int l, r, p, q, w;
};
vector<Query> Q;
int n, m;
int nodeval[MaxN];
signed main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int l, r, p, q, w;
        cin >> l >> r >> p >> q >> w;
        Q.push_back({l, r, p, q, w});
    }
    for (int _ = 1; _ <= n; _++) {
        for (int i = 0; i < Q.size(); i++) {
            int maxval = 0;
            for (int j = Q[i].p; j <= Q[i].q; j++) maxval = max(maxval, nodeval[j]);
            for (int j = Q[i].l; j <= Q[i].r; j++) nodeval[j] = max(0ll, max(nodeval[j], maxval + Q[i].w));
        }
    }
    for (int i = 0; i < Q.size(); i++) {
        int maxval = 0, minval = 1e18;
        for (int j = Q[i].p; j <= Q[i].q; j++) maxval = max(maxval, nodeval[j]);
        for (int j = Q[i].l; j <= Q[i].r; j++) minval = min(minval, nodeval[j]);
        if (minval < maxval + Q[i].w) {
            cout << "No Solution";
            return 0;
        }
    }
    int ans = 0;
    for (int i = 1; i <= m; i++) ans = max(ans, nodeval[i]);
    cout << ans;
}