2018 Multi-University Training Contest 2

Posted 2020-12-25 amadeus

Rank	Solved	A	B	C	D	E	F	G	H	I	J
88/821	3/10	.	.	.	O	.	.	O	.	.	O

O: 当场通过

?: 赛后通过

.: 尚未通过

A Absolute

unsolved

---

B Counting Permutations

unsolved

---

C Cover

unsolved

---

D Game

solved by chelly

---

chelly‘s solution

签到，全是YES

E Hack It

unsolved

---

F Matrix

unsolved

---

G Naive Operations

solved by chelly

---

chelly‘s solution

因为给的b是排列，所以均摊对答案贡献是(nlogn)级别的，于是就可以用线段树暴力模拟

H Odd Shops

unsolved

---

I Segment

unsolved

---

J Swaps and Inversions

solved by syf

---

(ans=min(x,y) imes 逆序对个数)

Replay

本场由chelly和syf打的，ch去参加bupt camp了。
开局chelly切了D，syf切了J。后来chelly去想G，首先思考分块，但感觉复杂度很高，后来发现答案肯定不会超过nlogn，于是就用线段树暴力A了。之后syf一直在想E题的构造，但直到终场都没想出，chelly一直在搞F，但复杂度一直是(O(n^3))，无法降下来。于是挂机了三个半小时……