# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925044 | Camillus | New Home (APIO18_new_home) | C++17 | 5067 ms | 807520 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"
#pragma GCC optimize("O3")
using namespace std;
constexpr int INF = 1e9;
struct Event {
static constexpr int OPEN = 0;
static constexpr int CLOSE = 1;
static constexpr int QUERY = 2;
int type = OPEN;
int ind = 0;
Event() = default;
Event(int type, int ind) : type(type), ind(ind) {
}
bool operator<(const Event&other) const {
return type < other.type;
}
};
namespace st {
static constexpr int size = 1 << 21;
multiset<int> tree[size * 2 - 1];
void add(int i, int v) {
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... |