#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2003;
const int M = 30004;
int n, m;
int b[M];
int p[M];
int cost[N][N];
set<int> v[N];
inline void bfs() {
queue<pair<int, int>> q;
memset(cost, -1, sizeof cost);
q.emplace(b[0], 0);
cost[b[0]][p[0]] = 0;
while (!q.empty()) {
auto src = q.front();
q.pop();
if (src.first == b[1]) {
cout << src.second;
exit(0);
}
for (auto c : v[src.first]) {
int l = src.first - c;
int r = src.first + c;
if (l >= 0 && cost[l][c] == -1) {
cost[l][c] = src.second + 1;
q.emplace(l, cost[l][c]);
v[l].insert(c);
}
if (r < n && cost[r][c] == -1) {
cost[r][c] = src.second + 1;
q.emplace(r, cost[r][c]);
v[r].insert(c);
}
}
}
}
signed main() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> b[i] >> p[i];
v[b[i]].insert(p[i]);
}
bfs();
cout << -1 << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
31700 KB |
Output is correct |
2 |
Correct |
12 ms |
31700 KB |
Output is correct |
3 |
Correct |
12 ms |
31780 KB |
Output is correct |
4 |
Correct |
12 ms |
31700 KB |
Output is correct |
5 |
Correct |
12 ms |
31752 KB |
Output is correct |
6 |
Correct |
13 ms |
31700 KB |
Output is correct |
7 |
Correct |
12 ms |
31700 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
31692 KB |
Output is correct |
2 |
Correct |
12 ms |
31700 KB |
Output is correct |
3 |
Correct |
12 ms |
31720 KB |
Output is correct |
4 |
Correct |
13 ms |
31700 KB |
Output is correct |
5 |
Correct |
11 ms |
31712 KB |
Output is correct |
6 |
Correct |
14 ms |
31688 KB |
Output is correct |
7 |
Correct |
12 ms |
31700 KB |
Output is correct |
8 |
Correct |
13 ms |
31700 KB |
Output is correct |
9 |
Correct |
13 ms |
31792 KB |
Output is correct |
10 |
Correct |
13 ms |
31760 KB |
Output is correct |
11 |
Correct |
14 ms |
31828 KB |
Output is correct |
12 |
Correct |
13 ms |
31732 KB |
Output is correct |
13 |
Correct |
15 ms |
31764 KB |
Output is correct |
14 |
Incorrect |
16 ms |
32084 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
31700 KB |
Output is correct |
2 |
Correct |
14 ms |
31796 KB |
Output is correct |
3 |
Correct |
13 ms |
31820 KB |
Output is correct |
4 |
Correct |
12 ms |
31788 KB |
Output is correct |
5 |
Correct |
13 ms |
31700 KB |
Output is correct |
6 |
Correct |
12 ms |
31700 KB |
Output is correct |
7 |
Correct |
12 ms |
31712 KB |
Output is correct |
8 |
Correct |
14 ms |
31752 KB |
Output is correct |
9 |
Correct |
12 ms |
31700 KB |
Output is correct |
10 |
Correct |
13 ms |
31828 KB |
Output is correct |
11 |
Correct |
14 ms |
31828 KB |
Output is correct |
12 |
Correct |
14 ms |
31732 KB |
Output is correct |
13 |
Correct |
14 ms |
31844 KB |
Output is correct |
14 |
Incorrect |
17 ms |
32104 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
31700 KB |
Output is correct |
2 |
Correct |
13 ms |
31700 KB |
Output is correct |
3 |
Correct |
12 ms |
31720 KB |
Output is correct |
4 |
Correct |
12 ms |
31700 KB |
Output is correct |
5 |
Correct |
13 ms |
31700 KB |
Output is correct |
6 |
Correct |
12 ms |
31792 KB |
Output is correct |
7 |
Correct |
12 ms |
31728 KB |
Output is correct |
8 |
Correct |
13 ms |
31700 KB |
Output is correct |
9 |
Correct |
13 ms |
31692 KB |
Output is correct |
10 |
Correct |
13 ms |
31844 KB |
Output is correct |
11 |
Correct |
14 ms |
31828 KB |
Output is correct |
12 |
Correct |
14 ms |
31852 KB |
Output is correct |
13 |
Correct |
16 ms |
31804 KB |
Output is correct |
14 |
Incorrect |
16 ms |
32084 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
31684 KB |
Output is correct |
2 |
Correct |
13 ms |
31772 KB |
Output is correct |
3 |
Correct |
12 ms |
31700 KB |
Output is correct |
4 |
Correct |
12 ms |
31700 KB |
Output is correct |
5 |
Correct |
12 ms |
31700 KB |
Output is correct |
6 |
Correct |
13 ms |
31700 KB |
Output is correct |
7 |
Correct |
12 ms |
31804 KB |
Output is correct |
8 |
Correct |
13 ms |
31700 KB |
Output is correct |
9 |
Correct |
12 ms |
31780 KB |
Output is correct |
10 |
Correct |
13 ms |
31836 KB |
Output is correct |
11 |
Correct |
14 ms |
31844 KB |
Output is correct |
12 |
Correct |
13 ms |
31828 KB |
Output is correct |
13 |
Correct |
15 ms |
31828 KB |
Output is correct |
14 |
Incorrect |
16 ms |
32104 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |