Difference between revisions of "2019 Multi-University,HDU Day 9"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Kilo_5723. 02:16:39 (+) == Problem B == Solved by Xiejiadong && Kilo_5723. 03:38:23 (+) == Problem C == Unsolved. (-5) == Problem D == Solved...") |
Xiejiadong (talk | contribs) |
||
| Line 6: | Line 6: | ||
Solved by Xiejiadong && Kilo_5723. 03:38:23 (+) | Solved by Xiejiadong && Kilo_5723. 03:38:23 (+) | ||
| + | |||
| + | 题意：给出一些从边界出发的直线，求平面被分割成了几块。 | ||
| + | |||
| + | 题解：可以对交点分类讨论，因为保证了出发点不会同行也不会同列，所以只有两种交点是有贡献的： | ||
| + | |||
| + | * + 交点，且贡献为 $1$ ； | ||
| + | |||
| + | * 」 交点，贡献为 $0.5$ ，且只出现在边界上，共 $4$ 个，贡献为 $1$ 。 | ||
| + | |||
| + | 所以统计 + 交点个数，+1 就好了，需要区间加，单点询问，直接上树状数组。 | ||
== Problem C == | == Problem C == | ||
Revision as of 10:45, 19 August 2019
Problem A
Solved by Kilo_5723. 02:16:39 (+)
Problem B
Solved by Xiejiadong && Kilo_5723. 03:38:23 (+)
题意：给出一些从边界出发的直线，求平面被分割成了几块。
题解：可以对交点分类讨论，因为保证了出发点不会同行也不会同列，所以只有两种交点是有贡献的：
- + 交点，且贡献为 $1$ ；
- 」 交点，贡献为 $0.5$ ，且只出现在边界上，共 $4$ 个，贡献为 $1$ 。
所以统计 + 交点个数，+1 就好了，需要区间加，单点询问，直接上树状数组。
Problem C
Unsolved. (-5)
Problem D
Solved by Weaver_zhu. 00:15:48 (+)
Problem E
Solved by Kilo_5723. 04:07:47 (+9)
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Unsolved.