# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200862 | EntityIT | Cake 3 (JOI19_cake3) | C++14 | 709 ms | 10476 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 all(x) (x).begin(), (x).end()
#define sz(x) ( (int)(x).size() )
using LL = long long;
template<class T>
inline bool asMn(T &a, const T &b) { return a > b ? a = b, true : false; }
template<class T>
inline bool asMx(T &a, const T &b) { return a < b ? a = b, true : false; }
const LL infLL = 1e18;
mt19937 rng( (uint32_t)chrono::steady_clock::now().time_since_epoch().count() );
template<class T>
struct Bit {
vector<T> a;
Bit(int nNode = 0) { a.assign(nNode, T() ); }
void reset(int nNode = 0) { a.assign(nNode, T() ); }
void upd(int pos, int val) {
for (int i = pos; i < sz(a); i |= i + 1) a[i] += val;
}
T get(int pos) {
T ret = 0;
for (int i = pos; i >= 0; i = (i & (i + 1) ) - 1) ret += a[i];
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |