# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086579 | nathan4690 | Two Currencies (JOI23_currencies) | C++17 | 548 ms | 54568 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.
// The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
// Spring Training/Qualifying Trial
// March 18–22, 2023 (Komaba, Tokyo)
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define ld long double
#define el cout << '\n'
#define f1(i,n) for(int i=1;i<=n;i++)
#define __file_name ""
using namespace std;
const ll maxn = 4e5+5, inf=1e18;
struct FenwickTree{
int n;
vector<long long> bit;
FenwickTree(){}
FenwickTree(int n): n(n), bit(n+1, 0LL){}
void update(int idx, long long v){
if(idx <= 0) return;
for(;idx<=n;idx+=(idx&-idx)) bit[idx]+=v;
}
long long getSum(int idx){
if(idx <= 0) return 0;
long long res = 0;
for(;idx;idx-=idx&-idx) res += bit[idx];
return res;
}
};
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... |