# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1177024 | Agageldi | Jakarta Skyscrapers (APIO15_skyscraper) | C++20 | 1095 ms | 584 KiB |
#include "bits/stdc++.h"
using namespace std;
#define N 30005
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define SZ(v) (int)v.size()
int n, m, ans = INT_MAX, j[N], dp[300001], pos[300001];
vector <pair<int,int>> v;
void solve(int dog) {
if(dog == 1) {
return;
}
for(int i = 0; i < SZ(v); i++) {
if(i == dog || abs(v[i].ff - pos[dog]) % j[dog] != 0 || dp[i] <= dp[dog] + abs(v[i].ff - pos[dog]) / j[dog]) continue;
dp[i] = dp[dog] + abs(v[i].ff - pos[dog]) / j[dog];
solve(i);
}
}
int main () {
ios::sync_with_stdio(0);cin.tie(0);
cin >> n >> m;
for(int i = 0; i < m; i++) {
dp[i] = INT_MAX;
# | 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... |