#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#define upmax(a, b) a = max(a, b);
#define upmin(a, b) a = min(a, b);
#define pr(x) cout << x << endl;
#define wpr(x) cout << #x << ": " << x << endl;
#define rep(i, s, e) for(ll i = s; i < e; i++)
#define rep(i, e) for(ll i = 0; i < e; i++)
using namespace std;
using ll = short int;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pll = pair<ll, ll>;
const ll inf = 1e9;
ll n, m;
vvll d, have; // [place][sky ind]
vll s, p;
vvb vis;
void bfs()
{
deque<pll> q; // {place, sky ind}
q.push_front({ s[0], 0 });
d[s[0]][0] = 0;
while (!q.empty()) {
ll b = q.front().first;
ll ind = q.front().second;
//wpr(b);
//wpr(ind);
//cout << "dist: " << d[b][ind] << endl;
q.pop_front();
if (vis[b][ind]) continue;
vis[b][ind] = true;
rep(i, have[b].size()) {
if (d[b][have[b][i]] != inf) continue;
d[b][have[b][i]] = d[b][ind];
q.push_front({ b, have[b][i] });
}
have[b].clear();
ll jump = p[ind];
if (b - jump >= 0 && d[b-jump][ind] == inf) {
d[b - jump][ind] = d[b][ind] + 1;
q.push_back({ b - jump, ind });
}
if (b + jump < n && d[b + jump][ind] == inf) {
d[b + jump][ind] = d[b][ind] + 1;
q.push_back({ b + jump, ind });
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
s.resize(m);
p.resize(m);
have.resize(n);
rep(i, m) {
cin >> s[i] >> p[i];
have[s[i]].push_back(i);
}
d.resize(n, vll(m, inf));
vis.resize(n, vb(m, 0));
bfs();
ll ans = d[s[1]][1];
if (ans == inf) ans = -1;
pr(ans);
}
/*
5 3
0 2
1 1
4 1
*/
Compilation message
skyscraper.cpp:11: warning: "rep" redefined
11 | #define rep(i, e) for(ll i = 0; i < e; i++)
|
skyscraper.cpp:10: note: this is the location of the previous definition
10 | #define rep(i, s, e) for(ll i = s; i < e; i++)
|
skyscraper.cpp:23:16: warning: overflow in conversion from 'double' to 'll' {aka 'short int'} changes value from '1.0e+9' to '32767' [-Woverflow]
23 | const ll inf = 1e9;
| ^~~
skyscraper.cpp: In function 'void bfs()':
skyscraper.cpp:11:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'short int'} and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
11 | #define rep(i, e) for(ll i = 0; i < e; i++)
......
45 | rep(i, have[b].size()) {
| ~~~~~~~~~~~~~~~~~
skyscraper.cpp:45:3: note: in expansion of macro 'rep'
45 | rep(i, have[b].size()) {
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
308 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
312 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
312 KB |
Output is correct |
11 |
Correct |
2 ms |
716 KB |
Output is correct |
12 |
Correct |
6 ms |
716 KB |
Output is correct |
13 |
Correct |
7 ms |
716 KB |
Output is correct |
14 |
Correct |
2 ms |
716 KB |
Output is correct |
15 |
Correct |
2 ms |
716 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
312 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
716 KB |
Output is correct |
12 |
Correct |
6 ms |
700 KB |
Output is correct |
13 |
Correct |
6 ms |
704 KB |
Output is correct |
14 |
Correct |
2 ms |
716 KB |
Output is correct |
15 |
Correct |
2 ms |
716 KB |
Output is correct |
16 |
Correct |
2 ms |
700 KB |
Output is correct |
17 |
Correct |
4 ms |
3148 KB |
Output is correct |
18 |
Correct |
3 ms |
4044 KB |
Output is correct |
19 |
Correct |
3 ms |
2740 KB |
Output is correct |
20 |
Correct |
169 ms |
8960 KB |
Output is correct |
21 |
Correct |
2 ms |
1228 KB |
Output is correct |
22 |
Correct |
3 ms |
3148 KB |
Output is correct |
23 |
Correct |
3 ms |
3660 KB |
Output is correct |
24 |
Correct |
6 ms |
8012 KB |
Output is correct |
25 |
Correct |
6 ms |
8908 KB |
Output is correct |
26 |
Correct |
91 ms |
8908 KB |
Output is correct |
27 |
Correct |
87 ms |
8908 KB |
Output is correct |
28 |
Correct |
8 ms |
8964 KB |
Output is correct |
29 |
Correct |
7 ms |
3668 KB |
Output is correct |
30 |
Correct |
3 ms |
1204 KB |
Output is correct |
31 |
Correct |
4 ms |
2892 KB |
Output is correct |
32 |
Correct |
3 ms |
2508 KB |
Output is correct |
33 |
Correct |
16 ms |
8912 KB |
Output is correct |
34 |
Correct |
14 ms |
8908 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
308 KB |
Output is correct |
11 |
Correct |
2 ms |
700 KB |
Output is correct |
12 |
Correct |
6 ms |
716 KB |
Output is correct |
13 |
Correct |
6 ms |
780 KB |
Output is correct |
14 |
Correct |
2 ms |
716 KB |
Output is correct |
15 |
Correct |
2 ms |
716 KB |
Output is correct |
16 |
Correct |
1 ms |
588 KB |
Output is correct |
17 |
Correct |
4 ms |
3148 KB |
Output is correct |
18 |
Correct |
3 ms |
4044 KB |
Output is correct |
19 |
Correct |
3 ms |
2764 KB |
Output is correct |
20 |
Correct |
181 ms |
8964 KB |
Output is correct |
21 |
Correct |
2 ms |
1340 KB |
Output is correct |
22 |
Correct |
4 ms |
3148 KB |
Output is correct |
23 |
Correct |
4 ms |
3660 KB |
Output is correct |
24 |
Correct |
6 ms |
8068 KB |
Output is correct |
25 |
Correct |
6 ms |
8908 KB |
Output is correct |
26 |
Correct |
90 ms |
8916 KB |
Output is correct |
27 |
Correct |
87 ms |
8908 KB |
Output is correct |
28 |
Correct |
9 ms |
8908 KB |
Output is correct |
29 |
Correct |
6 ms |
3648 KB |
Output is correct |
30 |
Correct |
3 ms |
1228 KB |
Output is correct |
31 |
Correct |
4 ms |
3000 KB |
Output is correct |
32 |
Correct |
4 ms |
2508 KB |
Output is correct |
33 |
Correct |
15 ms |
8908 KB |
Output is correct |
34 |
Correct |
14 ms |
8908 KB |
Output is correct |
35 |
Correct |
63 ms |
77600 KB |
Output is correct |
36 |
Correct |
9 ms |
11212 KB |
Output is correct |
37 |
Correct |
79 ms |
79044 KB |
Output is correct |
38 |
Correct |
99 ms |
125500 KB |
Output is correct |
39 |
Correct |
102 ms |
125708 KB |
Output is correct |
40 |
Correct |
100 ms |
125636 KB |
Output is correct |
41 |
Correct |
98 ms |
125568 KB |
Output is correct |
42 |
Execution timed out |
1095 ms |
125968 KB |
Time limit exceeded |
43 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
308 KB |
Output is correct |
6 |
Correct |
1 ms |
308 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
716 KB |
Output is correct |
12 |
Correct |
6 ms |
716 KB |
Output is correct |
13 |
Correct |
7 ms |
716 KB |
Output is correct |
14 |
Correct |
2 ms |
716 KB |
Output is correct |
15 |
Correct |
2 ms |
716 KB |
Output is correct |
16 |
Correct |
1 ms |
588 KB |
Output is correct |
17 |
Correct |
4 ms |
3148 KB |
Output is correct |
18 |
Correct |
4 ms |
4044 KB |
Output is correct |
19 |
Correct |
3 ms |
2744 KB |
Output is correct |
20 |
Correct |
210 ms |
9072 KB |
Output is correct |
21 |
Correct |
2 ms |
1228 KB |
Output is correct |
22 |
Correct |
3 ms |
3148 KB |
Output is correct |
23 |
Correct |
4 ms |
3660 KB |
Output is correct |
24 |
Correct |
7 ms |
8012 KB |
Output is correct |
25 |
Correct |
7 ms |
8908 KB |
Output is correct |
26 |
Correct |
90 ms |
9020 KB |
Output is correct |
27 |
Correct |
87 ms |
8908 KB |
Output is correct |
28 |
Correct |
9 ms |
8960 KB |
Output is correct |
29 |
Correct |
7 ms |
3644 KB |
Output is correct |
30 |
Correct |
3 ms |
1228 KB |
Output is correct |
31 |
Correct |
6 ms |
2892 KB |
Output is correct |
32 |
Correct |
4 ms |
2508 KB |
Output is correct |
33 |
Correct |
16 ms |
8908 KB |
Output is correct |
34 |
Correct |
17 ms |
8888 KB |
Output is correct |
35 |
Correct |
74 ms |
77592 KB |
Output is correct |
36 |
Correct |
11 ms |
11212 KB |
Output is correct |
37 |
Correct |
79 ms |
78872 KB |
Output is correct |
38 |
Correct |
106 ms |
125544 KB |
Output is correct |
39 |
Correct |
115 ms |
125692 KB |
Output is correct |
40 |
Correct |
102 ms |
125636 KB |
Output is correct |
41 |
Correct |
97 ms |
125656 KB |
Output is correct |
42 |
Execution timed out |
1083 ms |
125676 KB |
Time limit exceeded |
43 |
Halted |
0 ms |
0 KB |
- |