# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596843 | lcj | Sky Walking (IOI19_walk) | C++17 | 46 ms | 23528 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>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
int n = x.size();
int m = l.size();
vector<vector<pii>> conto(n);
vector<vector<pll>> neighbours(2*m+2);
for (int i = 0; i < m; i++)
{
conto[l[i]].push_back({y[i], i});
conto[r[i]].push_back({y[i], i+m});
neighbours[i].push_back({i+m, x[r[i]]-x[l[i]]});
}
for (int i = 0; i < n; i++)
{
sort(all(conto[i]));
auto &mconto = conto[i];
if (i == s && !mconto.empty()) {
neighbours[2*m].push_back({mconto[0].se, mconto[0].fi});
}
if (i == g && !mconto.empty()) {
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... |