# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871390 | rainboy | Secret Permutation (RMI19_permutation) | C++17 | 25 ms | 596 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 "permutation.h"
#include <cstring>
#include <vector>
using namespace std;
typedef vector<int> vi;
const int N = 256;
int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
int rr[N], dd[N], ss[N];
char usedl[N * 2 + 1], usedr[N * 2 + 1];
void solve(int n) {
for (int i = 0; i < n; i++)
rr[i] = i;
for (int i = 0; i < n; i++) {
int j = rand_() % (i + 1), tmp;
tmp = rr[i], rr[i] = rr[j], rr[j] = tmp;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |