# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877096 | SorahISA | Chorus (JOI23_chorus) | C++17 | 2073 ms | 1048576 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.
#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA
struct BIT {
int maxn;
vector<int> bit;
BIT() {}
BIT(int N) {init(N);}
void init(int N) {
maxn = 1 << (__lg(N) + 1);
bit.assign(maxn, 0);
}
int query(int L, int R) {return _query(R) - _query(L-1);}
int _query(int idx, int ans = 0) {
while (idx) ans += bit[idx], idx -= idx & -idx;
return ans;
}
void add(int idx, int val) {
while (idx < maxn) bit[idx] += val, idx += idx & -idx;
}
};
void solve() {
int N, K; cin >> N >> K;
string S; cin >> S;
# | 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... |