# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21970 | 2017-04-27T21:40:12 Z | Hiasat | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 0 ms | 1848 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<ll, int> plli; typedef pair<double, double> pdd; typedef pair<string, int> psi; const int MOD = 1e9 + 7; const ll oo = 1e15; typedef long long ll; int n , m; pii d[2010]; bool vis[2010][30010]; int cost[2010][30010]; vector<int> dogs[2010]; int main() { //freopen("input.txt","r",stdin); scanf("%d%d",&n,&m); for (int i = 0; i < m; ++i){ scanf("%d%d",&d[i].first,&d[i].second); dogs[d[i].first].push_back(i); } deque<pii> q; cost[d[0].first][0] = 0; vis[d[0].first][0] = 1; q.push_front(make_pair(d[0].first,0)); while(!q.empty()){ pii src = q.front(); if(src.first == d[1].first){ printf("%d\n", cost[src.first][src.second]); return 0; } q.pop_front(); for (int i = 0; i < dogs[src.first].size(); ++i){ int nw = dogs[src.first][i]; if(vis[src.first][nw]) continue; vis[src.first][nw] = 1; cost[src.first][nw] = cost[src.first][src.second]; q.push_front(make_pair(src.first,nw)); } for(int i = -1 ; i <= 1 ; i+= 2){ int nw = src.first + d[src.second].second * i; if(nw < 0 || nw >= n) continue; if(vis[nw][src.second]) continue; vis[nw][src.second]=1; cost[nw][src.second] = 1 + cost[src.first][src.second]; q.push_back(make_pair(nw,src.second)); } } puts("-1"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 1848 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 1848 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 1848 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 1848 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 1848 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |