这道题虽然是 Div2A,但是听说很多选手在比赛时思考了很久,甚至出现了比赛开始后 5min 左右排名榜第一面的许多人都是 AC 了 B 而没有通过 A...遂写了这篇题解. 首先可以确定的是,显然 \(O(tn)\) 的暴力做法无法通过此题,因为 \(t\) 和 \(n\) 已经分别达到了 \(10^3\) 和 \(10^9\)
Problem Description A.R.C. Markland-N is a tall building with n floors numbered from 1 to n. Between each two adjacent floors in the building, there is a staircase connecting them. It's lunchtime for our sensei Colin "ConneR" Neumann Jr, a
ConneR and the A.R.C. Markland-N JOE is on TV! NEKO's Maze Game Aroma's Search ConneR and the A.R.C. Markland-N \[ Time Limit: 1 s\quad Memory Limit: 256 MB \] 直接把所有的时间记录下来，然后暴力跑一遍答案判断是否合法即可。 view /*************************
ConneR and the A.R.C. Markland-N A.R.C. Markland-N is a tall building with n floors numbered from 1 to n. Between each two adjacent floors in the building, there is a staircase connecting them. It’s lunchtime for our sensei Colin “ConneR” Neumann Jr,
