# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906036 | nguyentunglam | New Home (APIO18_new_home) | C++17 | 4671 ms | 378600 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 all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;
const int N = 3e5 + 10;
int n, k, q, sz;
int x[N * 3], t[N], a[N], b[N], cost[N], c[N], y[N], ans[N];
int pre[N * 3], nxt[N * 3];
vector<int> rrh, open[N * 3], close[N * 3], event[N * 3];
bool alive[N * 3];
bool bug;
priority_queue<pair<int, int> > bit0[N], bit1[N];
void add0 (int pos, int border, pair<int, int> tmp) {
while (pos >= border) {
bit0[pos].push(tmp);
pos -= pos & -pos;
}
}
int get0(int pos, int _pos) {
int ret = 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... |