Difference between revisions of "2018-2019 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)"

From EOJ Wiki
Jump to navigation Jump to search
Line 57: Line 57:
 
== Problem M ==
 
== Problem M ==
  
Solved by . 01:10 (+)
+
Solved by kblack. 01:10 (+)
 +
 
 +
题意:给一堆向量,求加权后横纵坐标积的最大值。
 +
 
 +
题解:能产生的向量一定在凸壳内,目标函数的极值一定在右上凸壳上,扫过去维护个凸壳,边中间的做个初中数学题。

Revision as of 12:27, 28 November 2018

在北美都出不了线啊?

Problem A

Solved by . 00:11 (+)

Problem B

Solved by . 01:06 (+)

Problem C

Solved by . 00:50 (+)

Problem D

Solved by . 00:16 (+)

Problem E

Solved by . 01:52 (+1)

Problem F

Solved by kblack. 02:30 (+3)

题意:给一堆矩形,求面积异或并。

题解:扫描线扫一扫,线段树区间翻转维护。这每次写这种扫描线都能把 i j 写倒也是把自己牛逼坏了。

Problem G

Solved by . 00:34 (+)

Problem H

Solved by . 01:20 (+)

Problem I

Solved by . 04:22 (+2)

Problem J

Solved by . 00:39 (+)

Problem K

Solved by . 02:31 (+1)

Problem L

Solved by kblack. 00:19 (+1)

温暖的签、咳咳、签到。

Problem M

Solved by kblack. 01:10 (+)

题意:给一堆向量,求加权后横纵坐标积的最大值。

题解:能产生的向量一定在凸壳内,目标函数的极值一定在右上凸壳上,扫过去维护个凸壳,边中间的做个初中数学题。