# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
411575 | nichke | Monochrome Points (JOI20_monochrome) | C++14 | 1229 ms | 14884 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;
#define int long long
#define endl '\n'
int ans;
int n;
string s;
vector<int> a, b;
int bit[400005];
void clr() {
for (int i = 1; i <= 2 * n; i++) {
bit[i] = 0;
}
}
void upd(int v, int k) {
while (v <= 2 * n) {
bit[v] += k;
v += (v & (-v));
}
}
int qry(int v) {
int res = 0;
while (v) {
res += bit[v];
v -= (v & (-v));
Compilation message (stderr)
# | 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... |