# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
802999 | andreiomd | Fountain (eJOI20_fountain) | C++11 | 227 ms | 14912 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 <iostream>
#include <stack>
using namespace std;
using PII = pair<int, int>;
static constexpr int NMAX = (int)(1e5 + 1), LOGMAX = 17;
int Log2[NMAX];
int N, Q;
int D[NMAX], C[NMAX];
PII Next[LOGMAX][NMAX];
static inline void Read()
{
ios_base ::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> Q;
for (int i = 1; i <= N; ++i)
{
cin >> D[i] >> C[i], Next[0][i] = {0, 0};
if (i >= 2)
Log2[i] = 1 + Log2[(i >> 1)];
}
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |