# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519541 | Jomnoi | Just Long Neckties (JOI20_ho_t1) | C++17 | 151 ms | 16328 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 <bits/stdc++.h>
#define DEBUG 0
using namespace std;
const int N = 2e5 + 10;
pair <int, int> a[N];
int b[N], p[N];
int ans[N];
class A {
public :
int a, b;
A() : a(), b() {}
A(int l, int r) : a(l), b(r) {}
A operator+(const A &o) const {
return A(max(a, o.a), max(b, o.b));
}
};
class SegmentTree {
private :
int N;
vector <A> tree;
public :
SegmentTree(int n) : N(n) {
tree.resize(4 * N, A());
build(1, 1, N);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |