# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923273 | nguyentunglam | Shuffle (NOI19_shuffle) | C++17 | 1 ms | 604 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 NN = 1e3 + 10;
int n, b, k;
int g1[NN], g2[NN], match1[NN], match2[NN];
int lab[NN];
void reset (vector<vector<int> > &arr) {
for(int i = 0; i < arr.size(); i++) arr[i].clear();
}
int id (int x) {
return (x + k - 1) / k;
}
vector<int> solve_2 () {
int cnt = 0;
vector<vector<int> > ask(b);
vector<int> ret, unique1, unique2;
for(int i = 1; i <= n; i++) ask[id(i) - 1].push_back(i);
vector<vector<int> > tmp1 = shuffle(ask);
for(auto &arr: tmp1) {
++cnt;
for(auto &j : arr) g1[j] = cnt;
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... |