原文:Liars(2018-2019 ACM-ICPC Pacific Northwest Regional Contest (Div. 1))差分法

Problem L limit second Liars There are n people in a circle, numbered from to n, each of whom always tells the truth or always lies. Each person i makes a claim of the form: the number of truth teller ...

2020-04-29 10:49 0 802 推薦指數:

查看詳情

2018-2019 ACM-ICPC, Asia Seoul Regional Contest

ProblemA Circuits Solved. 題意: 有$n$個矩形,可以放兩條平行與$x$軸的線,求怎么放置兩條無線長的平行於$x$軸的線,使得他們與矩形相交個數最多 如果一個矩形同時 ...

Sun Mar 03 02:16:00 CST 2019 0 1685
 
粵ICP備18138465號   © 2018-2025 CODEPRJ.COM