# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650185 | Elias_Obeid | Klasika (COCI20_klasika) | C++17 | 3557 ms | 475316 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;
const int32_t MAXN = 200'000;
int32_t timer = 0;
array<vector<pair<int32_t, int32_t>>, MAXN + 1> graph;
array<int32_t, MAXN + 1> xor_depths, time_in, time_out;
void depthFirstSearch(int32_t node, int32_t current_depth)
{
time_in.at(node) = ++timer;
xor_depths.at(node) = current_depth;
for (const auto &[neighbour, weight] : graph.at(node))
{
depthFirstSearch(neighbour, current_depth ^ weight);
}
time_out.at(node) = timer;
}
const int32_t BITS = 2;
const int32_t MAXB = 30;
struct TrieNode
{
array<int32_t, BITS> next_nodes;
set<int32_t> available_positions;
TrieNode()
{
# | 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... |