Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

OneupNetwork/1upCup2018

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

4 Commits

Repository files navigation

1up Cup 2018

Problems

牆如果可以被炸到,其 x 或 y 座標必定有一個與炸彈相同,所以只需在牆的 x 與 y 座標組合中判斷是否與所有的牆皆有至少其中一個相同,此組合即為解。 同時當第一堵與最後一堵牆之座標所圍成的區域內有其他牆時,必定是 NO,可以不進去迴圈判斷。(測資 66 會給予整張都是牆的地圖,沒有預先判斷直接進入迴圈會 TLE)

About

No description or website provided.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

AltStyle によって変換されたページ (->オリジナル) /