# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
876282 | 2023-11-21T13:40:21 Z | Halfjuice | Digital Circuit (IOI22_circuit) | C++17 | 0 ms | 0 KB |
#include <vector> typedef struct _Node { _Node* parent; std::vector<_Node*> children; } Node; void init(int N, int M, int* P, int* A) { Node* nodes = new Node[N+M]; for (int i=0; i<N+M; i++) { nodes[i].parent = nodes+P[i]; nodes[P[i]].children.push_back(nodes+i); } } int count_ways(int L, int R) { return 0; }