Submission #569240

#TimeUsernameProblemLanguageResultExecution timeMemory
569240BadPenaltyJakarta Skyscrapers (APIO15_skyscraper)C++14
0 / 100
2 ms1236 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define F first #define S second #define pb push_back #define endl '\n' #define all(x) x.begin(),x.end() #define yes cout<<"Yes"<<endl #define no cout<<"No"<<endl const int N = 4e4,mod = 1e9+7; vector<int>adj[N]; int dst[N],vstd[N]; pair<int,int>A[N]; int tile[N]; int main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); int n,m; cin>>n>>m; for(int i = 0;i<n;i++) dst[i] = mod,tile[i]=-1; int st = 0,en = 0; for(int i = 0;i<m;i++) { cin>>A[i].F>>A[i].S; tile[A[i].F] = i; } priority_queue<pair<int,int>>pq; pq.push({0,0}); while(!pq.empty()) { int nd = pq.top().S; int jumps = -pq.top().F; int x = A[nd].F; int p = A[nd].S; pq.pop(); if(vstd[nd])continue; vstd[nd] = 1; if(nd==1) { cout<<jumps<<endl; return 0; } int k = 1; for(int i = x+p;i<n;i+=p) { if(tile[i]!=-1) { pq.push({-(k+jumps),tile[i]}); } k++; } k = 1; for(int i = x-p;i>=0;i-=p) { if(tile[i]!=-1) { pq.push({-(k+jumps),tile[i]}); } k++; } } return 0; } /* */

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:26:9: warning: unused variable 'st' [-Wunused-variable]
   26 |     int st = 0,en = 0;
      |         ^~
skyscraper.cpp:26:16: warning: unused variable 'en' [-Wunused-variable]
   26 |     int st = 0,en = 0;
      |                ^~
#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...