2019 Sun Yat-sen University Programming Contest

From SHUOJ Wiki
Revision as of 17:48, 20 April 2019 by Compute (talk | contribs) (→‎Problem K)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Failed System Test

Problem B

solved by CSL. 0:31(+1)

Problem D

solved by CSL. 1:06(+2)

Problem E

solved by SuperSodaSea. 0:37(+3)

Problem H

solved by SuperSodaSea. 1:03(+)

Problem I

solved by CSL. 0:21(+)

Problem J

solved by SuperSodaSea. 3:06(+4)

Problem K

solved by CSL. 2:39(+)

Magic Vegetable

Problem B

solved by dyume.1:28(+9)

卡读入。。。从小到大排序,如果存在某个数大于后面某两个数的最小查分值,那么成立,否则就不成立。从后往前扫$O(n)$判断。

Problem D

solved by compute.1:48(+)

给定一些矩形,每次询问是否一个矩形内的点都被原有的矩形包含。

转换为 $01$ 矩阵,用二维前缀和维护 $1$ 的个数,看面积是否等于其中 $1$ 的个数即可

Problem E

solved by compute.0:42(+2)

签到题,把字符串转化为二进制数再每6位划分一下就可以了。

Problem H

solved by LIN88.1:22(+)

用三维数组记录个三维空间 $cnt[N][N][N]$ ,对每个面的图案,在空间中垂直移动经过的空间方格都 $+1$ ,三个面这样做,遍历整个空间,$cnt$ 为 $3$ 的个数就是答案

Problem I

solved by LIN88.0:34(+1)

小模拟签到,把每个字符都换成 $n\times k$ 个字符,按原本的布局拼起来就好了

Problem K

solved by compute.3:58(+9)

一群人,每次选定一个区间开party,每次区间内的人都会认识,问每次新产生的认识了几对。

因为是区间更新,所以每个点必定可以拓展到包含自己的一个区间,用线段树维护左右端点的最小/大值和和即可。