# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496635 | JovanB | Hiperkocka (COCI21_hiperkocka) | C++17 | 56 ms | 5964 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>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 17;
int gde[(1<<N)][N+1];
vector <int> ord, parent;
vector <int> graf[N+1];
void dfs(int v, int p){
ord.push_back(v);
parent.push_back(p);
for(auto c : graf[v]){
if(c != p) dfs(c, v);
}
}
bool taken[(1<<N)];
vector <int> vc;
void dupliraj(int n, int v, int p){
vc.push_back(v);
for(int i=0; i<n; i++){
gde[i][v] = gde[i][p] + 2*n;
taken[gde[i][v]] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |