# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41230 | ssnsarang2023 | Port Facility (JOI17_port_facility) | C++14 | 4211 ms | 647636 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 <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
#define SZ(x) ((int)x.size())
const int N = (int)1e6+5;
const int base = (int)1e9+7;
int n, vis[N], lo[2][N], hi[2][N], b[2][N];
ii tree[2][1 << 21], a[2][N];
void merge_tree_min(ii tr[], int root, int lf, int rt) {
if (tr[lf].first > tr[rt].first)
tr[root] = tr[rt];
else tr[root] = tr[lf];
}
void merge_tree_max(ii tr[], int root, int lf, int rt) {
if (tr[lf].first < tr[rt].first)
tr[root] = tr[rt];
else tr[root] = tr[lf];
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... |