# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145197 | ecnerwala | Sky Walking (IOI19_walk) | C++14 | 1565 ms | 132924 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;
using ll = long long;
using height_t = pair<int, int>;
ll min_distance(vector<int> X_, vector<int> H_, vector<int> L, vector<int> R, vector<int> Y_, int S, int T) {
int N = int(X_.size());
int M = int(Y_.size());
vector<ll> X(X_.begin(), X_.end());
vector<height_t> H(N);
for (int i = 0; i < N; i++) {
H[i] = {H_[i], i};
}
vector<height_t> Y(M);
for (int e = 0; e < M; e++) {
Y[e] = {Y_[e], -1-e};
}
vector<vector<height_t>> needs(N);
vector<height_t> heights;
heights.insert(heights.end(), H.begin(), H.end());
heights.insert(heights.end(), Y.begin(), Y.end());
sort(heights.begin(), heights.end());
reverse(heights.begin(), heights.end());
# | 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... |