#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
const ll Inf = 1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
vector <int> t(m + 1), l(m + 1), r(m + 1), c(m + 2);
for (int i = 1; i <= m; ++i) {
cin >> t[i] >> l[i] >> r[i] >> c[i];
--l[i];
}
vector <vector <int>> g(m + 2);
for (int i = 1; i <= m; ++i) {
if (l[i] == 0) {
g[0].push_back(i);
}
if (r[i] == n) {
g[i].push_back(m + 1);
}
}
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= m; ++j) {
if (i == j) continue;
int tm = abs(t[i] - t[j]);
if (r[i] - tm >= l[j]) g[i].push_back(j);
}
}
vector <ll> d(m + 2, Inf);
d[0] = 0;
vector <int> used(m + 2);
while (true) {
int id = -1;
for (int u = 0; u < m + 2; ++u) {
if (!used[u] && (id == -1 || d[u] < d[id])) {
id = u;
}
}
if (id == -1) break;
used[id] = 1;
for (auto v : g[id]) {
if (d[v] > d[id] + c[v]) {
d[v] = d[id] + c[v];
}
}
}
if (d[m + 1] == Inf) {
cout << "-1\n";
} else {
cout << d[m + 1] << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2262 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
384 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
12 |
Correct |
5 ms |
384 KB |
Output is correct |
13 |
Correct |
4 ms |
384 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
5 ms |
384 KB |
Output is correct |
18 |
Correct |
4 ms |
384 KB |
Output is correct |
19 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
384 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
12 |
Correct |
5 ms |
384 KB |
Output is correct |
13 |
Correct |
4 ms |
384 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
5 ms |
384 KB |
Output is correct |
18 |
Correct |
4 ms |
384 KB |
Output is correct |
19 |
Correct |
4 ms |
384 KB |
Output is correct |
20 |
Correct |
299 ms |
68472 KB |
Output is correct |
21 |
Correct |
305 ms |
68216 KB |
Output is correct |
22 |
Correct |
154 ms |
1912 KB |
Output is correct |
23 |
Correct |
154 ms |
1976 KB |
Output is correct |
24 |
Correct |
235 ms |
50528 KB |
Output is correct |
25 |
Correct |
196 ms |
35324 KB |
Output is correct |
26 |
Correct |
180 ms |
33784 KB |
Output is correct |
27 |
Correct |
194 ms |
40568 KB |
Output is correct |
28 |
Correct |
237 ms |
50300 KB |
Output is correct |
29 |
Correct |
194 ms |
34936 KB |
Output is correct |
30 |
Correct |
197 ms |
38648 KB |
Output is correct |
31 |
Correct |
192 ms |
41464 KB |
Output is correct |
32 |
Correct |
320 ms |
64504 KB |
Output is correct |
33 |
Correct |
308 ms |
102072 KB |
Output is correct |
34 |
Correct |
302 ms |
64120 KB |
Output is correct |
35 |
Correct |
332 ms |
65016 KB |
Output is correct |
36 |
Correct |
311 ms |
101624 KB |
Output is correct |
37 |
Correct |
313 ms |
64248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2262 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |