# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545937 | rainboy | The Potion of Great Power (CEOI20_potion) | C++11 | 897 ms | 43872 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.
/* https://codeforces.com/blog/entry/82022 */
#include <stdlib.h>
#include <string.h>
#define N 100000
#define M 200000
#define D 500
#define B 50 /* B = floor(sqrt(M)) */
#define K (M / B)
#define INF 1000000000
int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }
int aa[N], n, d;
void init(int n_, int d_, int *aa_) {
memcpy(aa, aa_, (n = n_) * sizeof *aa_), d = d_;
}
int *jj[N], kk[N], *eh[N], *ep[N], *eq[N], **ejj[N], eo[N];
void append(int i, int h, int p, int q) {
int o = eo[i]++;
eh[i][o] = h, ep[i][o] = p, eq[i][o] = q;
if ((o + 1) % B == 0)
memcpy(ejj[i][o / B], jj[i], kk[i] * sizeof *jj[i]);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |