D. A Game with Traps(贪心+二分+差分模拟)

https://codeforces.com/contest/1260/problem/D

---

思路：

二分后对于答案要拆的区间是要+3（过去回来再带走）剩下的就是走1次

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1;
struct P{
   LL st,ed,d;
}trap[maxn];
LL a[maxn];
LL m,n,k,t;
bool cmp(LL A,LL B){
   return A>B;
}
bool check(LL x,LL limit){///二分人数
     LL tot=0;///总时间
     map1.clear();
     for(LL i=1;i<=k;i++){
         if(trap[i].d>limit){
            map1[trap[i].st]++;
            map1[trap[i].ed+1]--;
         }
     }
     LL sum=0;
     for(LL i=1;i<=n+1;i++){
        sum+=map1[i];
        if(sum>=1){
            tot+=3;
        }
        else tot++;
     }
     if(tot<=t) return true;
     else return false;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   cin>>m>>n>>k>>t;
   for(LL i=1;i<=m;i++) cin>>a[i];
   sort(a+1,a+1+m,cmp);
   for(LL i=1;i<=k;i++){
      cin>>trap[i].st>>trap[i].ed>>trap[i].d;
   }
   LL l=0;LL r=m;///上界是m人不是无穷大
   while(l<r){
      LL mid=(l+r+1)>>1;
      if(check(mid,a[mid])) l=mid;
      else r=mid-1;
   }
   cout<<l<<"\n";
   return 0;
}