# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646866 | chenwz | Abracadabra (CEOI22_abracadabra) | C++11 | 574 ms | 34232 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.
// CEOI 2022 Day1 - Abracadabra
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
struct BIT {
VI C;
int n;
BIT(int _n) : C(_n + 1), n(_n + 1) {}
void add(int x, int v) {
while (x < n) C[x] += v, x += x & -x;
}
int sum(int x) {
int ret = 0;
while (x) ret += C[x], x -= x & -x;
return ret;
}
int kth(int x) {
int pos = 0;
for (int b = 1 << 17; b >= 1; b >>= 1)
if (pos + b < n && C[pos + b] < x) pos += b, x -= C[pos];
return pos + 1;
}
};
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int N, q;
cin >> N >> q;
BIT S(N);
VI A(N), P(N + 1), Ans(q);
vector<vector<pair<int, int>>> v(N + 1);
# | 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... |