Submission #1034020

#TimeUsernameProblemLanguageResultExecution timeMemory
1034020DucNguyen2007Jakarta Skyscrapers (APIO15_skyscraper)C++14
10 / 100
2 ms1368 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define fi first #define se second const int maxN=3e4+5; const ll inf=2e18; int n,m,b[maxN+1],p[maxN+1]; namespace sub2 { int d[101][2001]; struct node { int u,power; }; queue<node> q; vector<int> v[101]; void solve() { memset(d,-1,sizeof(d)); q.push({b[0],p[0]}); d[b[0]][p[0]]=0; ll dem=0; while(!q.empty()) { node tmp=q.front(); q.pop(); int u=tmp.u,power=tmp.power; //cout<<u<<" "<<power<<'\n'; if(u==b[1]) { cout<<d[u][power]; return; } if(u+power<m) { if(d[u+power][power]==-1) { d[u+power][power]=d[u][power]+1; q.push({u+power,power}); } } if(u-power>=0) { if(d[u-power][power]==-1) { d[u-power][power]=d[u][power]+1; q.push({u-power,power}); } } for(int i=0;i<n;i++) { if(u+power<m&&b[i]==u+power) { if(d[u+power][p[i]]==-1) { d[u+power][p[i]]=d[u][power]+1; q.push({u+power,p[i]}); } } if(u-power>=0&&b[i]==u-power) { if(d[u-power][p[i]]==-1) { d[u-power][p[i]]=d[u][power]+1; q.push({u-power,p[i]}); } } } } cout<<-1; } } int main() { //freopen("","r",stdin); //freopen("","w",stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>m>>n; for(int i=0;i<n;i++) { cin>>b[i]>>p[i]; } sub2::solve(); }

Compilation message (stderr)

skyscraper.cpp: In function 'void sub2::solve()':
skyscraper.cpp:24:12: warning: unused variable 'dem' [-Wunused-variable]
   24 |         ll dem=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...