# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1035655 | vjudge1 | Shuffle (NOI19_shuffle) | C++17 | 1 ms | 348 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 <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
const int N = 6;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> s, ans;
vector<int> solve(int N, int B, int K, int Q, int ST) {
ans.resize(N);
s.resize(N);
for (int i = 0; i < N; i++) {
s[i] = i;
}
vector<vector<int>> a(B, vector<int>(K));
for (int i = 0; i < B; i++) {
for (int j = 0; j < K; j++) {
a[i][j] = i*K + j;
}
}
vector<vector<int>> b = shuffle(a);
while (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... |