# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071320 | LittleOrange | Sky Walking (IOI19_walk) | C++17 | 4066 ms | 645012 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;
const ll big = 1e18;
struct pos{
ll x,y;
bool operator<(const pos &o) const{
return x!=o.x?x<o.x:y<o.y;
}
bool operator==(const pos &o) const{
return x==o.x&&y==o.y;
}
bool operator!=(const pos &o) const{
return x!=o.x||y!=o.y;
}
};
struct line{
ll i,v;
bool operator<(const line &o) const{
return v>o.v;
}
};
long long min_distance(std::vector<int> x, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int g) {
ll n = x.size();
ll m = y.size();
vector<pos> ps;
for(ll i = 0;i<n;i++) ps.push_back({x[i],0});
for(ll i = 0;i<m;i++){
for(ll j = l[i];j<=r[i];j++){
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... |