链接
传送门
思路很简单,就是贪心,先扔鞭炮,再逃跑。扔鞭炮要在可以爆炸的前提下尽量扔时间大的。
code
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <vector>
using namespace std;
inline int read(){
int x = 0, op = 1; char ch = getchar();
while (!isdigit(ch)){
if (ch == '-') op = -1; ch = getchar();}
while (isdigit(ch)){
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * op;
}
inline void write(int x){
if (x < 0) putchar('-'), x = - x;
if (x > 9) write(x / 10);
putchar('0' + x % 10);
}
const int N = 2e5 + 10;
void solve(){
int n = read(), m = read();
int a = read(), b = read();
vector<int> v(m);
for (int & e: v) e = read();
int boom = abs(b - a) - 1, cnt = 0;
int blank = a - 1;
if (b < a) blank = n - a;
int time = boom + blank;
sort(v.rbegin(), v.rend());
for (int i = 0; i < m; ++i){
if (cnt == boom) break;
if (time >= v[i]){
++cnt;
--time;
}
}
printf("%d\n", cnt);
}
int main(){
int cases = read();
while (cases--){
solve();
}
return 0;
}