# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798384 | vjudge1 | Passport (JOI23_passport) | C++17 | 1592 ms | 155088 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;
const int INF = 1e9;
const int M = (1 << 18);
vector<pair<int, int>> g[3 * M];
void build(int l = 0, int r = M - 1, int v = 1) {
if(l == r) {
g[l].push_back({v + M, 0});
return;
}
int mid = (l + r) / 2;
build(l, mid, 2 * v);
build(mid + 1, r, 2 * v + 1);
g[2 * v + M].push_back({v + M, 0});
g[2 * v + M + 1].push_back({v + M, 0});
}
void add(int ql, int qr, int u, int l = 0, int r = M - 1, int v = 1) {
if(qr < l || ql > r)
return;
if(ql <= l && r <= qr) {
g[v + M].push_back({u, 1});
return;
}
int mid = (l + r) / 2;
add(ql, qr, u, l, mid, 2 * v);
# | 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... |