求解:线段覆盖 (point)

学术版

你梦熊账号是啥
by lottle1212 @ 2024-04-14 10:55:03


6
by lizhengdong @ 2024-04-14 11:02:45


@[5Z_tiansongyu](/user/969415) 这是我们的比赛 T1(你是不是 CW 的 ```cpp #include<bits/stdc++.h> #define ll long long using namespace std; mt19937 myrand(time(0)); inline ll read(){ ll x=0,w=1; char ch=0; while(ch<'0'||ch>'9'){ if(ch=='-')w=-1; ch=getchar(); } while(ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+(ch^48); ch=getchar(); } return x*w; } void write(ll x){ if(x<0){ putchar('-'); x=-x; } static int sta[35]; int top=0; do{ sta[top++]=x%10,x/=10; }while(x); while(top)putchar(sta[--top]+'0'); } int t,n,k,mp[100005]; struct edge{ int l,r; }a[100005]; int main(){ t=read(); while(t--){ int l1=0,r1=0,mid=0; memset(a,0,sizeof(a)); n=read();k=read(); for(int i=1;i<=n;i++){ a[i].l=read(); a[i].r=read(); if(k<a[i].r&&k>a[i].l)l1++,r1++,mid++; if(k==a[i].r&&k>a[i].l)l1++,mid++; if(k<a[i].r&&k==a[i].l)r1++,mid++; if(k==a[i].r&&k==a[i].l)mid++; } if(mid==l1||mid==r1)puts("NO"); else puts("YES"); } return 0; } ```
by A_R_O_N_A @ 2024-04-14 14:57:49


|