Difference between revisions of "2018 ACM-ICPC China Shanghai Metropolitan Invitational Contest"
Jump to navigation
Jump to search
| Line 39: | Line 39: | ||
Solved by kblack. 00:24 (+) | Solved by kblack. 00:24 (+) | ||
| − | + | 裸矩阵乘法，温暖的签到。 | |
Revision as of 16:01, 21 July 2018
Problem A
Solved by zerol. 01:21 (+)
Problem B
Solved by ultmaster. 00:10 (+)
Problem D
Solved by kblack. 00:36 (+1)
裸几何规律，温暖的签到。
Problem F
Solved by ultmaster. 01:06 (+1)
Problem H
Solved by kblack. 03:01 (+1)
题意：区间平方膜 2018，区间求和。
题解：一个数不断平方膜 2018，最多 4 次后就会进入长度是 6 的约数的循环节，于是将序列分为两类数分别考虑。 对于循环内的数，直接记录当前即平方5次内的所有和，平方操作即是对数列的位移操作，可以懒标记维护。 对于循环外的数，暴力递归到叶子节点，手动平方，一旦进入循环就删掉特殊标记，转化为上一种维护方式。
Problem I
Solved by zerol. 03:34 (+1)
Problem J
Solved by ultmaster. 02:05 (+)
Problem K
Solved by kblack. 00:24 (+)
裸矩阵乘法，温暖的签到。