# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113781 | ckodser | New Home (APIO18_new_home) | C++14 | 4993 ms | 109864 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 pb push_back
using namespace std;
typedef long long ll;
const int N = 120005, INF = 2e8 + 10;
int n, k, A[N], TP[N], L[N], R[N];
int q, B[N], T[N], P[N], rev[N], res[N];
vector < int > U, S[N], E[N], Q[N];
multiset < int > ST[N];
struct SEGT
{
multiset < int > MS[N * 2];
inline void Add(int le, int ri, int val)
{
le += q; ri += q;
for (; le < ri; le >>= 1, ri >>= 1)
{
if (le & 1) MS[le ++].insert(val);
if (ri & 1) MS[-- ri].insert(val);
}
}
inline void Del(multiset < int > &SS, int val)
{
auto it = SS.lower_bound(val);
if ((*it) == val)
SS.erase(it);
}
inline void Del(int le, int ri, int val)
{
le += q; ri += q;
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... |