# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977495 | tnknguyen_ | Janjetina (COCI21_janjetina) | C++14 | 1558 ms | 58704 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 endl '\n'
#define ll long long
#define len(s) (int)s.size()
#define pii pair<int, int>
//#define int long long
struct BIT{
int n;
vector<ll> f;
BIT(int N = 1e5): n(N+5), f(N+5, 0) {};
void update(int i, int val){
while(i < n){
f[i] += val;
i += (i & -i);
}
}
ll get(int i){
ll ans = 0;
while(i > 0){
ans += f[i];
i -= (i & -i);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |