Difference between revisions of "2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest"

From EOJ Wiki
Jump to: navigation, search
(Created page with "== Problem A == Solved by Xiejiadong. 00:36 (+) == Problem B == Solved by Kilo_5723. 00:45 (+) == Problem C == Solved by Weaver_zhu. 01:43 (+1) == Problem D == Unsolved...")
 
(Problem A)
 
(One intermediate revision by the same user not shown)
Line 2: Line 2:
  
 
Solved by Xiejiadong. 00:36 (+)
 
Solved by Xiejiadong. 00:36 (+)
 +
 +
温暖的模拟题。
  
 
== Problem B ==
 
== Problem B ==
Line 22: Line 24:
  
 
Solved by Xiejiadong. 00:06 (+)
 
Solved by Xiejiadong. 00:06 (+)
 +
 +
温暖的签到。
  
 
== Problem G ==
 
== Problem G ==

Latest revision as of 19:53, 6 November 2019

Problem A

Solved by Xiejiadong. 00:36 (+)

温暖的模拟题。

Problem B

Solved by Kilo_5723. 00:45 (+)

Problem C

Solved by Weaver_zhu. 01:43 (+1)

Problem D

Unsolved.

Problem E

Unsolved.

Problem F

Solved by Xiejiadong. 00:06 (+)

温暖的签到。

Problem G

Solved by Kilo_5723. 02:16 (+1)

Problem H

Solved by Kilo_5723. 00:28 (+)

Problem I

Unsolved.

Problem J

Solved by Kilo_5723. 01:12 (+1)

Problem K

Unsolved.

Problem L

Solved by Xiejiadong. 00:49 (+)

题意:有三类人 $a,b,c$ ,要求尽量平均的分成三组,但是 $a$ 的人和 $c$ 的人不能在同一组。

题解:显然 $a$ 和 $c$ 是等价的,我们不妨假设 $a>c$ (不过不满足,我们交换一下)。

显然为了更加平均的分配,我们三组中分别放入 $\frac{a}{2},a-\frac{a}{2},c$ (第二部分用减法防止不是 $2$ 的倍数的情况)。

然后,时间复杂度是允许的,我们直接枚举 $b$ 分在前两组的数量,然后计算三组中的数量 max 更新答案即可。

Problem M

Solved by Kilo_5723. 03:33 (+)

Problem N

Solved by Weaver_zhu. 00:37 (+1)