# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209713 | Alexa2001 | Shuffle (NOI19_shuffle) | C++17 | 18 ms | 8564 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;
const int Nmax = 1005;
int b, k, n, one, Nr;
vector<vector<int>> query[15], ans1, ans2, ans3, to0, W[15];
vector<int> cycle;
int marked[Nmax][Nmax], on_cycle[Nmax];
int marked1[Nmax], marked2[Nmax], val[Nmax];
void step1()
{
vector<int> aux;
vector<vector<int>> to1, to2;
int i, j;
for(i=1; i<=b; ++i)
{
aux.clear();
for(j=i*k-k+1; j<=i*k; ++j)
aux.push_back(j);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |