#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 10;
ll T[maxn], L[maxn], R[maxn], C[maxn], p[maxn], q[maxn], dp[maxn];
int main(){
ios_base::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
for (ll i = 1; i <= m; i++)
cin >> T[i] >> L[i] >> R[i] >> C[i];
if (*max_element(T+1, T+m+1) == 1){
for (ll i = 1; i <= m; i++)
p[i] = i;
sort(p+1, p+m+1, [](ll a, ll b){ return R[a] < R[b]; });
vector<ll> S;
for (ll iit = 1; iit <= m; iit++){
ll i = p[iit];
if (L[i] == 1)
dp[i] = C[i];
else
dp[i] = -1;
if (S.empty()){
if (dp[i] != -1)
S.push_back(i);
continue;
}
ll lo = -1, hi = S.size();
while (hi - lo > 1){
ll mid = (lo + hi) >> 1;
if (R[S[mid]]+1 < L[i])
lo = mid;
else
hi = mid;
}
if (hi == S.size())
continue;
if (dp[i] == -1 or dp[i] > dp[S[hi]] + C[i])
dp[i] = dp[S[hi]] + C[i];
while (!S.empty() and dp[S.back()] >= dp[i])
S.pop_back();
S.push_back(i);
}
ll answer = -1;
for (ll i = 1; i <= m; i++)
if (R[i] == n and dp[i] != -1 and (answer == -1 or answer > dp[i]))
answer = dp[i];
cout << answer << endl;
return 0;
}
for (ll i = 1; i <= m; i++)
p[i] = i, q[i] = i;
sort(p+1, p+m+1, [](ll a, ll b){ return R[a] < R[b]; });
sort(q+1, q+m+1, [](ll a, ll b){ return L[a] < L[b]; });
memset(dp, -1, sizeof dp);
for (ll iit = 1; iit <= m; iit++){
ll i = p[iit];
if (L[i] == 1)
dp[i] = C[i];
for (ll jit = 1; jit < iit; jit++){
ll j = p[jit];
if (abs(T[i]-T[j]) <= R[j]-L[i]+1 and dp[j] != -1)
if (dp[i] == -1 or dp[i] > dp[j] + C[i])
dp[i] = dp[j] + C[i];
}
i = q[iit];
for (ll jit = 1; jit < iit; jit++){
ll j = q[jit];
if (abs(T[i]-T[j]) <= R[j]-L[i]+1 and dp[j] != -1)
if (dp[i] == -1 or dp[i] > dp[j] + C[i])
dp[i] = dp[j] + C[i];
}
}
ll answer = -1;
for (ll i = 1; i <= m; i++)
if (R[i] == n and dp[i] != -1 and (answer == -1 or answer > dp[i]))
answer = dp[i];
cout << answer << endl;
}
Compilation message
treatment.cpp: In function 'int main()':
treatment.cpp:38:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (hi == S.size())
~~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
96 ms |
9400 KB |
Output is correct |
2 |
Correct |
88 ms |
8952 KB |
Output is correct |
3 |
Correct |
89 ms |
7928 KB |
Output is correct |
4 |
Correct |
94 ms |
7952 KB |
Output is correct |
5 |
Correct |
73 ms |
8184 KB |
Output is correct |
6 |
Correct |
76 ms |
8140 KB |
Output is correct |
7 |
Correct |
81 ms |
8348 KB |
Output is correct |
8 |
Correct |
67 ms |
8184 KB |
Output is correct |
9 |
Correct |
69 ms |
8192 KB |
Output is correct |
10 |
Correct |
71 ms |
8316 KB |
Output is correct |
11 |
Correct |
76 ms |
8184 KB |
Output is correct |
12 |
Correct |
81 ms |
8312 KB |
Output is correct |
13 |
Correct |
86 ms |
8200 KB |
Output is correct |
14 |
Correct |
102 ms |
8188 KB |
Output is correct |
15 |
Correct |
96 ms |
8236 KB |
Output is correct |
16 |
Correct |
92 ms |
8264 KB |
Output is correct |
17 |
Correct |
83 ms |
7484 KB |
Output is correct |
18 |
Correct |
67 ms |
7544 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1920 KB |
Output is correct |
2 |
Incorrect |
2 ms |
1968 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1920 KB |
Output is correct |
2 |
Incorrect |
2 ms |
1968 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
96 ms |
9400 KB |
Output is correct |
2 |
Correct |
88 ms |
8952 KB |
Output is correct |
3 |
Correct |
89 ms |
7928 KB |
Output is correct |
4 |
Correct |
94 ms |
7952 KB |
Output is correct |
5 |
Correct |
73 ms |
8184 KB |
Output is correct |
6 |
Correct |
76 ms |
8140 KB |
Output is correct |
7 |
Correct |
81 ms |
8348 KB |
Output is correct |
8 |
Correct |
67 ms |
8184 KB |
Output is correct |
9 |
Correct |
69 ms |
8192 KB |
Output is correct |
10 |
Correct |
71 ms |
8316 KB |
Output is correct |
11 |
Correct |
76 ms |
8184 KB |
Output is correct |
12 |
Correct |
81 ms |
8312 KB |
Output is correct |
13 |
Correct |
86 ms |
8200 KB |
Output is correct |
14 |
Correct |
102 ms |
8188 KB |
Output is correct |
15 |
Correct |
96 ms |
8236 KB |
Output is correct |
16 |
Correct |
92 ms |
8264 KB |
Output is correct |
17 |
Correct |
83 ms |
7484 KB |
Output is correct |
18 |
Correct |
67 ms |
7544 KB |
Output is correct |
19 |
Correct |
2 ms |
1920 KB |
Output is correct |
20 |
Incorrect |
2 ms |
1968 KB |
Output isn't correct |
21 |
Halted |
0 ms |
0 KB |
- |