# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
973466 | beaboss | Synchronization (JOI13_synchronization) | C++14 | 365 ms | 25340 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.
// Source: https://oj.uz/problem/view/JOI13_synchronization
//
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
typedef vector<int> vi;
typedef pair<int, int> pii;
const int N = 1e5 + 10;
const int B = 20;
int bit[N];
void add(int ind, int val) {
for (; ind < N; ind += (ind & -ind)) {
bit[ind] += val;
}
}
int query(int ind) {
int res = 0;
for (; ind > 0; ind -= (ind & -ind)) {
res += bit[ind];
}
return res;
}
# | 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... |