| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 522233 | blue | Hiperkocka (COCI21_hiperkocka) | C++17 | 73 ms | 11664 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 <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <string>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
const int max_n = 16;
vi edge[1+max_n];
vi parent(1+max_n);
vi fake(1+max_n);
vi actual(1+max_n);
int node_ct = -1;
void dfs(int u, int p)
{
node_ct++;
parent[u] = p;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||