# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1083787 | alexdumitru | ICC (CEOI16_icc) | C++17 | 3 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 <bits/stdc++.h>
#include "icc.h"
using namespace std;
const int NMAX = 100;
mt19937 mt(time(0));
int A[NMAX], B[NMAX];
int cnt1, cnt2;
int cmp[NMAX + 1];
vector<vector<int>> comp;
void run(int n) {
comp.resize(n);
for (int i = 0; i < n; i++)
comp[i].push_back(i + 1);
int nrc = n;
for (int step = 1; step < n; step++) {
vector<int> perm(nrc);
iota(perm.begin(), perm.end(), 0);
bool diffHalfs = false;
while (!diffHalfs) {
shuffle(perm.begin(), perm.end(), mt);
cnt1 = cnt2 = 0;
for (int i = 0; i < nrc / 2; i++) {
for (int node : comp[perm[i]]) {
cmp[node] = perm[i];
A[cnt1++] = node;
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... |