2017-2018 ACM-ICPC, Asia Tsukuba Regional Contest
阿新 • • 發佈：2018-12-13
end com 如果 nal ron pizza black cloc ole
地址
| Rank | Solved | A | B | C | D | E | F | G | H | I | J | K |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 16/160 | 27/130 | O | O | O | . | O | O | ? | . | O | . | ? |
O: 當場通過
?: 賽後通過
.: 尚未通過
A Secret of Chocolate Poles
solved by chelly
chelly‘s solution
B Parallel Lines
solved by ch
ch‘s solution
C Medical Checkup
solved by chelly
chelly‘s solution
D Digital Clock
unsolved
E Black or White
solved by chelly&ch
chelly‘s solution
F Pizza Delivery
solved by chelly&ch
chelly‘s solution
G Rendezvous on a Tetrahedron
upsolved by feynman
feynman‘s solution
H Homework
unsolved
I Starting a Scenic Railroad Service
solved by chelly
chelly‘s solution
J String Puzzle
unsolved
K Counting Cycles
upsolved by chelly
chelly‘s solution
先求出一棵生成樹，那麽非樹邊頂多16條，二進制枚舉所有的組合，算經過某幾條非樹邊是否存在一個環（如果存在則一定是唯一的）
對於如何判斷，只需要將一個非樹邊對應的樹上的鏈全部異或一下，那麽對於這組選擇，選出邊權為1的邊組成一個圖，判斷這個圖是不是一個簡單環即可
註意原樹會很大，\(2^16\)次遍歷原樹是會TLE，我們只需要在虛樹上做即可
Dirt Replay
F -1 雙連通分量的板子抄錯了
E -3 一發是dp式子寫錯了，還有兩發是因為單調隊列優化時候的單調隊列方向寫反了
2017-2018 ACM-ICPC, Asia Tsukuba Regional Contest