# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873342 | rainboy | Shuffle (NOI19_shuffle) | C++17 | 2 ms | 2652 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 "shuffle.h"
#include <cstring>
#include <vector>
using namespace std;
const int N = 1000, L = 11; /* L = ceil(log2(N)) + 1 */
typedef vector<int> vi;
typedef vector<vi> vvi;
int n, m, k, l;
int pp[L], xx[N], idx[N * N], uu[N], vv[N], cc[N], yy[N], kk[N][N], zz[N];
vvi iii, aaa, aaa_; vi aa;
void shuffle_(vvi iii, vvi &aaa) {
aaa = shuffle(iii);
for (int d = 0; d < m; d++)
for (int g = 0; g < k; g++)
aaa[d][g]--;
}
void init(int n, int m) {
l = 1, pp[0] = 1;
while (pp[l - 1] < n)
pp[l] = pp[l - 1] * m, l++;
for (int i = 0; i < n; i++) {
int x = i + 1 < n ? i : pp[l - 1];
# | 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... |