# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087971 | Seungni | Treatment Project (JOI20_treatment) | C++17 | 1328 ms | 220516 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>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const ll inf = 0x3f3f3f3f3f3f3f3fLL;
ll N, M, sz;
pair<pii, pii> arr[1600005];
pair<pii, int> v[1600005];
vector<ll> xpos;
ll dist[1600005];
set<pii> seg[1600005];
void add(int n, int s, int e, int idx, pii val) {
if (idx > e || idx < s) return;
if (s == e) {
seg[n].insert(val);
return;
}
int m = (s + e) >> 1;
add(n * 2, s, m, idx, val);
add(n * 2 + 1, m + 1, e, idx, val);
seg[n].insert(val);
return;
}
void del(int n, int s, int e, int idx, pii val) {
if (idx > e || idx < s) return;
if (s == e) {
# | 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... |