# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376135 | ijxjdjd | Segments (IZhO18_segments) | C++14 | 5058 ms | 952 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 FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using namespace std;
using ll = long long;
const int MAXN = (int)(2e5) + 5;
const int K = 2;
int curAdd = 0;
int sz = 0;
int e[MAXN][2];
int mnSz[MAXN];
int mxL[MAXN];
bool del[MAXN];
vector<int> L;
vector<int> Sz;
vector<int> curdel;
void rebuild() {
auto byL = [&] (const int& lhs, const int& rhs) {
return e[lhs][0] < e[rhs][0];
};
auto byR = [&] (const int& lhs, const int& rhs) {
return e[lhs][1] < e[rhs][1];
};
auto bySz = [&] (const int& lhs, const int& rhs) {
return (e[lhs][1] - e[lhs][0]) < (e[rhs][1] - e[rhs][0]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |