用户工具

站点工具


2020-2021:teams:farmer_john:2020-2021_buaa_icpc_team_supplementary_training_02

这是本文档旧的修订版!


比赛名称

A.

upsolved by

题意

题解

B.

solved by

题意

题解

C.

upsolved by

题意

题解

D.

solved by

题意

题解

E.

upsolved by

题意

题解

F.

solved by

题意

题解

G.

upsolved by

题意

题解

H.

solved by 2sozx

题意

给定一个第一象限简单多边形,问一条从原点出发的直线最多将多边形分成多少块。$n\le10^5$

题解

首先忽略掉三点共线的点,这样的点是没有意义的,之后对剩余的点进行极角排序,让直线逆时针扫这些点,将这些点分成四种情况。

I.

upsolved by

题意

题解

J.

upsolved by

题意

题解

记录

0min:开局分题
10min:MJX发现C是签到冲C
33min:MJX WA,CSK冲G
46min:CSK AC,ZYF冲A
55min:ZYF AC A,MJX继续冲C
83min:MJX WA2,换CSK写C,MJX ZYF看J
167min:J WA3,CSK冲I
186min:CSK AC I,ZYF继续看J,MJX看H,CSK 看F
230min:CSK WA
232min:MJX AC H,继续看J
285min:CSK AC F,一起看J
295min:CSK想到了正解冲J
till end :CSK没写完,由于inque多开了几分钟

总结

  • MJX要尽量避免精度问题
2020-2021/teams/farmer_john/2020-2021_buaa_icpc_team_supplementary_training_02.1596786644.txt.gz · 最后更改: 2020/08/07 15:50 由 2sozx