# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1237870 | djsksbrbf | Jakarta Skyscrapers (APIO15_skyscraper) | C++20 | 1096 ms | 39580 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define pb push_back
#define fi first
#define se second
const int MAX = 3e5 + 5;
const int MOD = 1e9 + 7;
#define int ll
vector <pii> adj[MAX];
int n,m;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
vector <pii> v(m);
for(auto &it : v)cin >> it.fi >> it.se;
for(int i = 0 ; i < m ; i++){
for(int j = 0 ; j < m ; j++){
if(i== j)continue;
ll dis = abs(v[i].fi - v[j].fi);
if(dis % v[i].se)continue;
adj[i].pb({j, dis / v[i].se});
}
}
ll dist[m + 4];
bool vis[m];memset(vis, 0, sizeof(vis));
for(int i = 0 ; i <= m ; i++)dist[i] = (ll)1e18;
dist[0] = 0;
for(int i = 0 ; i < m ; i++){
int t = -1;
for(int j = 0 ; j < m ; j++){
if(!vis[j] && (t == -1 || dist[j] < dist[t])){
t = j;
}
}
if(dist[t] == (ll)1e18){
cout << -1 << endl;
return 0;
}
if(t == 1){
cout << dist[t] << endl;
return 0;
}
vis[t] = 1;
for(auto [nxt, we] : adj[t]){
if(dist[nxt] > dist[t] + we){
dist[nxt] = dist[t] + we;
}
}
}
cout << -1 << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |