摘要: 考虑如果顺序模拟会T,注意到最后一个元素一定在它确定的位置,考虑从后往前放,找第k个空位,完美解决这题; 1 #include<iostream> 2 #include<cstdio> 3 #define ls (x<<1) 4 #define rs (x<<1|1) 5 using namespa 阅读全文
posted @ 2022-01-11 22:19 matt-11 阅读(32) 评论(0) 推荐(0)
摘要: 1 class Solution { 2 public: 3 typedef long long ll; 4 const int lim=1e6; 5 int dx[8]={-1,0,1,0},dy[8]={0,1,0,-1}; 6 bool isEscapePossible(vector<vect 阅读全文
posted @ 2022-01-11 15:13 matt-11 阅读(47) 评论(0) 推荐(0)