# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218184 | Alexa2001 | Sky Walking (IOI19_walk) | C++17 | 819 ms | 162840 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;
typedef long long ll;
typedef pair<int,int> Pair;
const int Nmax = 2e6 + 5;
///13:05
vector<int> x, h, l, r, y;
vector<int> newl, newr, newy;
vector<Pair> v[Nmax];
int nr;
void add_new(int l, int r, int y)
{
if(l == r) return;
newl.push_back(l); newr.push_back(r); newy.push_back(y);
}
auto cmp_buildings = [](int i, int j)
{
return h[i] > h[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... |