# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294116 | PeppaPig | Sky Walking (IOI19_walk) | C++14 | 390 ms | 67948 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>
#define long long long
#define pii pair<long, long>
#define x first
#define y second
using namespace std;
const int N = 1.2e6 + 5;
int n, m;
int pos[N];
long dp[N];
vector<pii> g[N];
long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int su, int eu) {
n = (int)x.size(), m = (int)l.size();
iota(pos, pos + N, 0);
sort(pos, pos + m, [&](int a, int b) {
return l[a] < l[b];
});
priority_queue<pii, vector<pii>, greater<pii> > rem, Q;
set<pii> active;
for(int _ = 0; _ < m; _++) {
int i = pos[_];
while(!rem.empty() && rem.top().x < l[i]) {
# | 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... |