# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996053 | gmroh06 | Employment (JOI16_employment) | C++14 | 241 ms | 29060 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;
inline void fastio() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
}
class Fenwick {
private:
vector<ll> tree;
ll n;
public:
Fenwick(ll x) {
n = x;
tree.resize(x + 1);
}
void add(ll idx, ll val) {
for (ll x = idx + 1; x <= n; x += x & -x) {
tree[x] += val;
}
}
ll sum(ll idx) {
ll ret = 0;
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... |