# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
876274 | Halfjuice | Digital Circuit (IOI22_circuit) | C++17 | 0 ms | 0 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 <vector>
typedef struct {
Node* parent;
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;
}