10.10T2 贪心去重

万事先排序，然后找规律

思路我还是要学习，先普通的一个点，然后我们再扩张到两个的形式，然后就出来了

code：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#define N 100005
using namespace std;
const long long mod=998244353;
struct node {
    long long l,r;
    bool operator<(const node&a)const{
        return r>a.r;
    }
} e[N];
bool cmp(const node&a,const node &b){
    return a.l<b.l;
}
long long read(){
    long long x=0,f=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        x=(x<<3)+(x<<1)+c-'0';
        c=getchar();
    }
    return x*f;
}
long long ksm(long long a,long long b){
    long long ans=1;
    for(;b;b>>=1){
        if(b&1){
            ans*=a;
            ans%=mod;
        }
        a*=a;
        a%=mod;
    }
    return ans;
}
long long a[N];
priority_queue<long long,vector<long long>,greater<long long> >q;
int main() {
    long long n,m;
    n=read(),m=read();
    for(long long i=1; i<=n; i++){
        e[i].l=read();
        e[i].r=read();
    }
    sort(e+1,e+n+1,cmp);
//    for(long long i=1;i<=n;i++)cout<<e[i].l<<" "<<e[i].r<<'
';
    for(long long i=1; i<=m; i++) {
        a[i]=read();
    }
    sort(a+1,a+m+1);
    long long ans=0;
    long long head=1;
    for(long long i=1;i<=m;i++){
        while(!q.empty()&&q.top()<a[i])q.pop();
        long long chong=q.size();chong=ksm(2,chong);
        while(head<=n&&e[head].l<=a[i]){
            if(e[head].r<a[i]){
                head++;
                continue;
            }
            q.push(e[head].r);
            head++;
        }
        long long now=q.size();now=ksm(2,now);
        ans+=now-chong;
        ans+=mod;
        ans%=mod;
    }
    cout<<ans;
    return 0;
}

over