This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
int dist[n][m];
for(int i = 0; i < n; i ++)
for(int j = 0; j < m ; j++)
dist[i][j] = inf;
vector<int> L[n];
int p[m], b[m];
for(int i = 0; i < m; i ++)
{
cin >> b[i] >> p[i];
L[b[i]].push_back(i);
}
int cnt[n] = {};
deque<pair<int,int> > Q;
Q.push_back({b[0], 0});
dist[b[0]][0] = 0;
while(Q.size())
{
int f = Q.front().first, s = Q.front().second;
Q.pop_front();
if(f == b[1])
{
cout << dist[f][s] << endl;
exit(0);
}
// cerr << f << ' ' << s << ' ' << dist[f][s] << endl;
// if(cnt[f] <= 2000) {
for(int res : L[f])
if(dist[f][s] < dist[f][res])
{
dist[f][res] = dist[f][s];
Q.push_front({f, res});
}
// cnt[f]++;
// }
L[f].clear();
if(f + p[s] < n && dist[f][s] + 1 < dist[f + p[s]][s])
{
dist[f + p[s]][s] = dist[f][s] + 1;
Q.push_back({f + p[s], s});
}
if(f - p[s] >= 0 && dist[f][s] + 1 < dist[f - p[s]][s])
{
dist[f - p[s]][s] = dist[f][s] + 1;
Q.push_back({f - p[s], s});
}
}
cout << -1 << endl;
return 0;
}
Compilation message (stderr)
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:28:7: warning: unused variable 'cnt' [-Wunused-variable]
28 | int cnt[n] = {};
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |