聪明的质监员

题目名字

聪明的质监员
题目链接
https://www.luogu.com.cn/problem/P1314

题意

找最小值

时间复杂度

防AK 巨难

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int NR=210000;
const int MAXW=1100000;
long long S;
int n, m;
int w[NR],v[NR],ql[NR],qr[NR];
long long sumn[NR], sumv[NR];
long long c1[NR];
long long c2[NR];
long long calc(int x)
{  
           long long all=0;
           memset(c1,0,sizeof(c1));
           memset(c1,0,sizeof(c1));
           for(int i=1;i<=n;i++)
    {
                      c1[i]=c1[i-1];
                      c2[i]=c2[i-1];
                      if(x<=w[i])
                {
                              c1[i]++;
                              c2[i]+=v[i];
        }
           }
           for(int i=1;i<=m;i++)
           {
                    int ll=ql[i];
                    int rr=qr[i];
                    all+=(c1[rr]-c1[ll-1])*(c2[rr]-c2[ll-1]);
           }
  return all;
}
bool check(int x)
{
    return calc(x)>=S;
}
int main()
{
    cin>>n>>m>>S;
    for(int i=1;i<=n;i++)
    cin>>w[i]>>v[i];
    for(int i=1;i<=m;i++)
    cin>>ql[i]>>qr[i];
    int l=MAXW,r=0,ans=0;
    for(int i=1;i<=n;i++)
    {
        l=min(w[i],l);
        r=max(w[i],r);
    }
    while(l<=r)
    {
        int m=(l+r)>>1;
        if(check(m)) ans=m,l=m+1; 
        else r=m-1;
    }
    cout<<min(abs(calc(ans)-S),abs(calc(ans+1)-S))<<endl;
    return 0;
}