Algorithm Designa66_q4a_clique
Clique
58896719-b916-48cd-b1c8-a2d981501b5b.cppC++
1// Loading code...Selected Submission
100 / 100
0.517s
1548 KB
BacktrackDFS
Time Comp.
O(2^n)
Space Comp.
O(n)
Readability
5/10
"The code uses a depth-first search (DFS) to explore different combinations of people to form a team, aiming to maximize the total value while ensuring team members know each other. The bitset representation of friendships and the pruning based on current value and minimum friendships suggest a backtracking approach."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #41 | 100 | 4/22/2025 |
| Try #40 | 100 | 4/22/2025 |
| Try #39 | 95 | 4/22/2025 |
| Try #38 | 100 | 4/22/2025 |
| Try #37 | 100 | 4/22/2025 |
| Try #36 | 100 | 4/22/2025 |
| Try #35 | 95 | 4/22/2025 |
| Try #34 | 95 | 4/22/2025 |
| Try #33 | 95 | 4/22/2025 |
| Try #32 | 90 | 4/22/2025 |
| Try #31 | 95 | 4/22/2025 |
| Try #30 | 80 | 4/22/2025 |
| Try #29 | 95 | 4/22/2025 |
| Try #28 | 95 | 4/22/2025 |
| Try #27 | 85 | 4/22/2025 |
| Try #26 | 95 | 4/22/2025 |
| Try #25 | 95 | 4/22/2025 |
| Try #24 | 0 | 4/22/2025 |
| Try #23 | 85 | 4/22/2025 |
| Try #22 | 95 | 4/22/2025 |
| Try #21 | 85 | 4/22/2025 |
| Try #20 | 85 | 4/22/2025 |
| Try #19 | 0 | 4/22/2025 |
| Try #18 | 85 | 4/22/2025 |
| Try #17 | 90 | 4/22/2025 |
| Try #16 | 0 | 4/22/2025 |
| Try #15 | 0 | 4/22/2025 |
| Try #14 | 95 | 4/22/2025 |
| Try #13 | 0 | 4/22/2025 |
| Try #12 | 0 | 4/22/2025 |
| Try #11 | 0 | 4/22/2025 |
| Try #10 | 0 | 4/22/2025 |
| Try #9 | 95 | 4/22/2025 |
| Try #8 | 0 | 4/22/2025 |
| Try #7 | 0 | 4/22/2025 |
| Try #6 | 95 | 4/22/2025 |
| Try #5 | 95 | 4/22/2025 |
| Try #4 | 0 | 4/22/2025 |
| Try #3 | 0 | 4/22/2025 |
| Try #2 | 95 | 4/22/2025 |
| Try #1 | 0 | 4/22/2025 |