#include <bits/stdc++.h>
using namespace std;
const int MAX = (2e3)+1, INF = 1e9;
int n, m, b[MAX], p[MAX], d[MAX], g[MAX][MAX];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
fill(d+1, d+m, INF);
for(int i = 0; i < m; i++) for(int j = 0; j < m; j++) if(i != j) g[i][j] = INF;
for(int i = 0; i < m; i++) cin >> b[i] >> p[i];
for(int i = 0; i < m; i++) for(int j = 0; j < m; j++) if(i != j) {
if(abs(b[i] - b[j]) % p[i] == 0) g[i][j] = abs(b[i] - b[j]) / p[i];
}
unordered_set<int> st;
for(int i = 0; i < m; i++) st.insert(i);
while(!st.empty()) {
int u = *st.begin();
for(int v: st) if(d[v] < d[u]) u = v;
st.erase(u);
for(int v = 0; v < m; v++) if(d[u] + g[u][v] < d[v]) {
d[v] = d[u] + g[u][v];
}
}
cout << (d[1] == INF ? -1 : d[1]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
17848 KB |
Output is correct |
2 |
Correct |
0 ms |
17848 KB |
Output is correct |
3 |
Correct |
0 ms |
17848 KB |
Output is correct |
4 |
Correct |
0 ms |
17848 KB |
Output is correct |
5 |
Correct |
0 ms |
17848 KB |
Output is correct |
6 |
Correct |
0 ms |
17848 KB |
Output is correct |
7 |
Correct |
0 ms |
17848 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
17848 KB |
Output is correct |
2 |
Correct |
0 ms |
17848 KB |
Output is correct |
3 |
Correct |
0 ms |
17848 KB |
Output is correct |
4 |
Correct |
0 ms |
17848 KB |
Output is correct |
5 |
Correct |
0 ms |
17848 KB |
Output is correct |
6 |
Correct |
0 ms |
17848 KB |
Output is correct |
7 |
Correct |
0 ms |
17848 KB |
Output is correct |
8 |
Correct |
0 ms |
17848 KB |
Output is correct |
9 |
Correct |
0 ms |
17848 KB |
Output is correct |
10 |
Correct |
3 ms |
17848 KB |
Output is correct |
11 |
Correct |
33 ms |
17848 KB |
Output is correct |
12 |
Correct |
29 ms |
17848 KB |
Output is correct |
13 |
Correct |
26 ms |
17848 KB |
Output is correct |
14 |
Correct |
33 ms |
17848 KB |
Output is correct |
15 |
Correct |
36 ms |
17848 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
17848 KB |
Output is correct |
2 |
Correct |
0 ms |
17848 KB |
Output is correct |
3 |
Correct |
0 ms |
17848 KB |
Output is correct |
4 |
Correct |
0 ms |
17848 KB |
Output is correct |
5 |
Correct |
0 ms |
17848 KB |
Output is correct |
6 |
Correct |
0 ms |
17848 KB |
Output is correct |
7 |
Correct |
0 ms |
17848 KB |
Output is correct |
8 |
Correct |
0 ms |
17848 KB |
Output is correct |
9 |
Correct |
0 ms |
17848 KB |
Output is correct |
10 |
Correct |
3 ms |
17848 KB |
Output is correct |
11 |
Correct |
33 ms |
17848 KB |
Output is correct |
12 |
Correct |
36 ms |
17848 KB |
Output is correct |
13 |
Correct |
29 ms |
17848 KB |
Output is correct |
14 |
Correct |
33 ms |
17848 KB |
Output is correct |
15 |
Correct |
33 ms |
17848 KB |
Output is correct |
16 |
Correct |
9 ms |
17848 KB |
Output is correct |
17 |
Correct |
29 ms |
17848 KB |
Output is correct |
18 |
Correct |
9 ms |
17848 KB |
Output is correct |
19 |
Correct |
3 ms |
17848 KB |
Output is correct |
20 |
Correct |
33 ms |
17848 KB |
Output is correct |
21 |
Correct |
13 ms |
17848 KB |
Output is correct |
22 |
Correct |
3 ms |
17848 KB |
Output is correct |
23 |
Correct |
13 ms |
17848 KB |
Output is correct |
24 |
Correct |
33 ms |
17848 KB |
Output is correct |
25 |
Correct |
36 ms |
17848 KB |
Output is correct |
26 |
Correct |
29 ms |
17848 KB |
Output is correct |
27 |
Correct |
29 ms |
17848 KB |
Output is correct |
28 |
Correct |
36 ms |
17848 KB |
Output is correct |
29 |
Correct |
3 ms |
17848 KB |
Output is correct |
30 |
Correct |
0 ms |
17848 KB |
Output is correct |
31 |
Correct |
3 ms |
17848 KB |
Output is correct |
32 |
Correct |
3 ms |
17848 KB |
Output is correct |
33 |
Correct |
33 ms |
17848 KB |
Output is correct |
34 |
Correct |
36 ms |
17848 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
17848 KB |
Output is correct |
2 |
Correct |
0 ms |
17848 KB |
Output is correct |
3 |
Correct |
0 ms |
17848 KB |
Output is correct |
4 |
Correct |
0 ms |
17848 KB |
Output is correct |
5 |
Correct |
0 ms |
17848 KB |
Output is correct |
6 |
Correct |
0 ms |
17848 KB |
Output is correct |
7 |
Correct |
0 ms |
17848 KB |
Output is correct |
8 |
Correct |
0 ms |
17848 KB |
Output is correct |
9 |
Correct |
0 ms |
17848 KB |
Output is correct |
10 |
Correct |
3 ms |
17848 KB |
Output is correct |
11 |
Correct |
36 ms |
17848 KB |
Output is correct |
12 |
Correct |
29 ms |
17848 KB |
Output is correct |
13 |
Correct |
36 ms |
17848 KB |
Output is correct |
14 |
Correct |
36 ms |
17848 KB |
Output is correct |
15 |
Correct |
39 ms |
17848 KB |
Output is correct |
16 |
Correct |
6 ms |
17848 KB |
Output is correct |
17 |
Correct |
26 ms |
17848 KB |
Output is correct |
18 |
Correct |
6 ms |
17848 KB |
Output is correct |
19 |
Correct |
3 ms |
17848 KB |
Output is correct |
20 |
Correct |
33 ms |
17848 KB |
Output is correct |
21 |
Correct |
9 ms |
17848 KB |
Output is correct |
22 |
Correct |
6 ms |
17848 KB |
Output is correct |
23 |
Correct |
9 ms |
17848 KB |
Output is correct |
24 |
Correct |
36 ms |
17848 KB |
Output is correct |
25 |
Correct |
36 ms |
17848 KB |
Output is correct |
26 |
Correct |
36 ms |
17848 KB |
Output is correct |
27 |
Correct |
33 ms |
17848 KB |
Output is correct |
28 |
Correct |
39 ms |
17848 KB |
Output is correct |
29 |
Correct |
6 ms |
17848 KB |
Output is correct |
30 |
Correct |
0 ms |
17848 KB |
Output is correct |
31 |
Correct |
3 ms |
17848 KB |
Output is correct |
32 |
Correct |
0 ms |
17848 KB |
Output is correct |
33 |
Correct |
43 ms |
17848 KB |
Output is correct |
34 |
Correct |
43 ms |
17848 KB |
Output is correct |
35 |
Runtime error |
0 ms |
17848 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
36 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
17848 KB |
Output is correct |
2 |
Correct |
0 ms |
17848 KB |
Output is correct |
3 |
Correct |
0 ms |
17848 KB |
Output is correct |
4 |
Correct |
0 ms |
17848 KB |
Output is correct |
5 |
Correct |
0 ms |
17848 KB |
Output is correct |
6 |
Correct |
0 ms |
17848 KB |
Output is correct |
7 |
Correct |
0 ms |
17848 KB |
Output is correct |
8 |
Correct |
0 ms |
17848 KB |
Output is correct |
9 |
Correct |
0 ms |
17848 KB |
Output is correct |
10 |
Correct |
3 ms |
17848 KB |
Output is correct |
11 |
Correct |
46 ms |
17848 KB |
Output is correct |
12 |
Correct |
26 ms |
17848 KB |
Output is correct |
13 |
Correct |
29 ms |
17848 KB |
Output is correct |
14 |
Correct |
33 ms |
17848 KB |
Output is correct |
15 |
Correct |
33 ms |
17848 KB |
Output is correct |
16 |
Correct |
6 ms |
17848 KB |
Output is correct |
17 |
Correct |
29 ms |
17848 KB |
Output is correct |
18 |
Correct |
9 ms |
17848 KB |
Output is correct |
19 |
Correct |
0 ms |
17848 KB |
Output is correct |
20 |
Correct |
46 ms |
17848 KB |
Output is correct |
21 |
Correct |
16 ms |
17848 KB |
Output is correct |
22 |
Correct |
6 ms |
17848 KB |
Output is correct |
23 |
Correct |
9 ms |
17848 KB |
Output is correct |
24 |
Correct |
33 ms |
17848 KB |
Output is correct |
25 |
Correct |
39 ms |
17848 KB |
Output is correct |
26 |
Correct |
36 ms |
17848 KB |
Output is correct |
27 |
Correct |
43 ms |
17848 KB |
Output is correct |
28 |
Correct |
43 ms |
17848 KB |
Output is correct |
29 |
Correct |
6 ms |
17848 KB |
Output is correct |
30 |
Correct |
0 ms |
17848 KB |
Output is correct |
31 |
Correct |
3 ms |
17848 KB |
Output is correct |
32 |
Correct |
0 ms |
17848 KB |
Output is correct |
33 |
Correct |
36 ms |
17848 KB |
Output is correct |
34 |
Correct |
43 ms |
17848 KB |
Output is correct |
35 |
Runtime error |
0 ms |
17848 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
36 |
Halted |
0 ms |
0 KB |
- |