# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
876285 | 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>
using namespace std;
struct _Node {
_Node* parent;
vector<_Node*> children;
} Node;
vector<Node> nodes;
void init(int N, int M, vector<int> P, vector<int> A) {
nodes.empty();
for (int i=0; i<N+M; i++) {
nodes.push_back(move(Node()))
nodes[i].parent = nodes[P[i]];
nodes[P[i]].children.push_back(nodes[i]);
}
}
int count_ways(int L, int R) {
return 0;
}