# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286595 | tmwilliamlin168 | Sky Walking (IOI19_walk) | C++14 | 1971 ms | 141372 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 "walk.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1e5, mxT=1e6;
int n, m, pg[mxN], t, ua, ub;
vector<int> ta[mxN], tr[mxN];
ll d[mxT];
vector<ar<ll, 2>> adj[mxT];
ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int a, int b) {
n=x.size();
m=l.size();
vector<vector<int>> v(n);
v[a].push_back(0);
v[b].push_back(0);
for(int _ : {1, 0}) {
for(int i=0; i<m; ++i) {
ta[l[i]].push_back(i);
tr[r[i]].push_back(i);
}
set<ar<int, 2>> s;
for(int i=0; i<n; ++i) {
vector<ar<int, 2>> w;
for(pg[i]=i-1; ~pg[i]&&h[pg[i]]<=h[i]; pg[i]=pg[pg[i]]) {
auto it=s.lower_bound({h[pg[i]]});
if(it!=s.end()&&(*it)[0]<=h[i])
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... |