# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947547 | vladilius | Two Currencies (JOI23_currencies) | C++17 | 644 ms | 58992 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;
using ll = long long;
#define int ll
using pii = pair<int, int>;
struct FT{
vector<ll> a;
int n;
FT(int ns){
n = ns;
a.resize(n + 1);
}
ll get(int v){
ll out = 0;
while (v > 0){
out += a[v];
v = (v & (v + 1)) - 1;
}
return out;
}
void upd(int p, int v){
while (p <= n){
a[p] += v;
p |= (p + 1);
}
}
};
signed main(){
# | 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... |