# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105989 | Hideo | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1071 ms | 37240 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define vl vector < ll >
#define pi pair < int, int >
#define pii pair < int, pi >
#define vii vector < pi >
const int N = 2e5 + 7;
const int INF = 1e9 + 7;
int l[N], p[N], us[N];
int n, m, ans;
vii g[N];
void dfs (int v = 1, int c = 0){
if (c >= us[v])
return;
us[v] = c;
if (v == 2){
ans = min(ans, c);
return;
}
for (pi to : g[v])
dfs(to.fr, c + to.sc);
}
main(){
ans = INF;
cin >> n >> m;
for (int i = 1; i <= m; i++){
us[i] = INF;
scanf("%d%d", &l[i], &p[i]);
}
for (int i = 1; i <= m; i++)
for (int j = 1; j <= m; j++)
if (i != j && l[i] % p[i] == l[j] % p[i])
g[i].pb(mk(j, abs(l[j] - l[i]) / p[i]));
dfs();
if (ans == INF)
cout << -1;
else
cout << ans;
}
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... |