#include <bits/stdc++.h>
//#include "game.h"
using namespace std;
vector<long long> ind[2001];
long long len[30001];
long long n,m;
long long nah;
long long d(int b){
long long cost[n+1][n+1];
for(int i = 0;i<=n;i++)for(int j = 0;j<=n;j++)cost[i][j] = 1e18;
priority_queue<pair<long long,pair<long long,long long>>> q1;
q1.push({0,{len[0],b}});
cost[len[0]][b] = 0;
while(!q1.empty()){
long long co = q1.top().first*-1;
long long lin = q1.top().second.first;
long long indx = q1.top().second.second;
//cout<<lin<<" "<<indx<<"\n";
q1.pop();
if(co>cost[lin][indx]) continue ;
for(auto i:ind[indx]){
if(cost[len[i]][indx]>(cost[lin][indx])){
cost[len[i]][indx] = (cost[lin][indx]);
q1.push({cost[len[i]][indx]*-1,{len[i],indx}});
}
}
if(indx+lin>=0&&indx+lin<n){
if(cost[lin][indx+lin]>(cost[lin][indx]+1)){
cost[lin][indx+lin] = (cost[lin][indx]+1);
q1.push({cost[lin][indx+lin]*-1,{lin,indx+lin}});
}
}
if(indx-lin>=0&&indx-lin<n){
if(cost[lin][indx-lin]>(cost[lin][indx]+1)){
cost[lin][indx-lin] = (cost[lin][indx]+1);
q1.push({cost[lin][indx-lin]*-1,{lin,indx-lin}});
}
}
}
long long ans = 1e18;
for(int i = 1;i<=n;i++){
ans = min(ans,cost[i][nah]);
}
return ans;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>m;
long long z;
for(int i = 0;i<m;i++){
long long x,b;
cin>>x>>b;
if(i==1)nah = x;
if(i==0)z = x;
len[i] = b;
ind[x].push_back(i);
}
//cout<<z<<" "<<nah<<"\n";
long long val = d(z);
if(val==1e18)cout<<-1<<"\n";
else cout<<val<<"\n";
}
Compilation message
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:59:22: warning: 'z' may be used uninitialized in this function [-Wmaybe-uninitialized]
59 | long long val = d(z);
| ~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
9 |
Halted |
0 ms |
0 KB |
- |