# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52397 | MatheusLealV | Money (IZhO17_money) | C++17 | 3 ms | 488 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>
#define N 1000050
using namespace std;
int bit[N], v[N], n, ans;
void upd(int x, int v)
{
x += 2;
for(int i = x; i < N; i += (i&-i)) bit[i] += v;
}
int query(int x)
{
x += 2;
int sum = 0;
for(int i = x; i > 0; i -= (i&-i)) sum += bit[i];
return sum;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n;
# | 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... |