Submission #409270

#TimeUsernameProblemLanguageResultExecution timeMemory
409270victoriadJakarta Skyscrapers (APIO15_skyscraper)C++14
0 / 100
1 ms204 KiB
#include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> #include <utility> #include <queue> #include <map> #include <iomanip> #include <stack> #include <fstream> using namespace std; int menor(vector<vector<int> >&mov){ int n=mov.size(); vector<int>d(n,1e9); priority_queue<pair<int,int > >pq; pq.push(make_pair(0,0)); d[0]=0; while(!pq.empty()){ int t=pq.top().first; t*=-1; int nt=pq.top().second; pq.pop(); for(int c:mov[nt]){ int x=nt+c; if(x<=n-1){ int y=1+d[nt]; if(d[x]>y){ d[x]=y; mov[x].push_back(c); pq.push(make_pair(-d[x],x)); } } int a=nt-c; if(a>=0){ int y=1+d[nt]; if(d[a]>y){ d[a]=y; mov[a].push_back(c); pq.push(make_pair(-d[a],a)); } else if(a!=1){ mov[a].push_back(c); pq.push(make_pair(-y,a)); } } } } if(d[1]==1e9){ return -1; } else{ return d[1]; } } int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int n,m,b,p,x,a; cin>>n>>m; vector<vector<int> >mov(n); for(int i=0;i<m;i++){ cin>>x>>a; mov[x].push_back(a); } cout<<menor(mov); return 0; }

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:63:13: warning: unused variable 'b' [-Wunused-variable]
   63 |     int n,m,b,p,x,a;
      |             ^
skyscraper.cpp:63:15: warning: unused variable 'p' [-Wunused-variable]
   63 |     int n,m,b,p,x,a;
      |               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...