# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946695 | vladilius | Passport (JOI23_passport) | C++17 | 666 ms | 83820 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<int, int>;
const int inf = 1e9;
struct ST{
vector<vector<pii>> t;
vector<int> idx;
int n;
void build(int v, int tl, int tr){
if (tl == tr){
idx[tl] = v;
return;
}
int tm = (tl + tr) / 2, vv = 2 * v;
build(vv, tl, tm);
build(vv + 1, tm + 1, tr);
t[vv].push_back({v, 0});
t[vv + 1].push_back({v, 0});
}
ST(int ns){
n = ns;
t.resize(4 * n);
idx.resize(n + 1);
build(1, 1, n);
}
void add(int v, int tl, int tr, int& l, int& r, int& i){
if (l > tr || r < tl) return;
if (l <= tl && tr <= r){
# | 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... |