Algorithm Designa67_f_make_dag
Make DAG
05ea2dd3-4d42-4f03-9a58-7e9a8dc4590d.cC
1// Loading code...Selected Submission
100 / 100
0.007s
2836 KB
ImplementationGraph
Time Comp.
O(node + edge)
Space Comp.
O(node + edge)
Readability
5/10
"The code processes a graph represented by nodes and edges, assigning a status (0 or 1) to each edge based on whether the first node of the edge matches the current node being processed. This is a straightforward implementation of graph traversal and edge status assignment."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #2 | 100 | 5/4/2025 |
| Try #1 | 100 | 5/2/2025 |