cf
/
mirror
Problemset
Contests
Favorites
Profile
Tools
Settings
Problemset
Contests
Favorites
Profile
Complexity
Stress
Graph
Templates
Crawler
0-1-Tree
☆
save
CF
1156D
⊞ graph
2200
· master
2s
256 MB
⌨ stdin/stdout
#dfs and similar
#divide and conquer
#dp
#dsu
#trees
hide
Examples
Sample 1
of 1
Input
copy
7
2 1 1
3 2 0
4 2 1
5 2 0
6 7 1
7 2 1
Output
copy
34
58%
1156D.cpp
GNU C++20 (64)
GNU C11
Python 3
PyPy 3
Java 21
Rust
Go
C#
JavaScript
Ruby
Pascal
Haskell
Kotlin · no run
loading editor…
Ln
11
·
137 B
GNU C++20 (64)
⟲ Reset
Run samples
Submit
▸
Custom test
run your code against any stdin
▸
Stress test
run a brute + generator against your solution to find a failing case
▾
Graph visualizer
paste edges (or use sample) — auto-detects trees / DAGs / weighted graphs ·
g g
to open
loading graph engine…
▸
Editorial & videos
official tutorial + youtube — hidden while contest is live