# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531834 | sidon | Road Closures (APIO21_roads) | C++17 | 248 ms | 49376 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;
template<class T>
using ii = array<T, 2>;
using ll = long long;
using vi = vector<int>;
const int Z = 1e5;
const ll INF = 5e13;
struct BIT {
vi a;
vector<ii<int>> vals;
vector<ll> b;
int n, sz {};
void addVal(ii<int> v) {
vals.push_back(v);
}
void init() {
sort(begin(vals), end(vals));
n = size(vals) + 1;
b.resize(n);
a.resize(n);
}
void insert(ii<int> v) {
int i = 1 + lower_bound(begin(vals), end(vals), v) - begin(vals);
for(++sz; i<n; i+=i&-i) {
a[i] += 1;
b[i] += v[0];
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |