D. In Love

合集 - 数据结构(28)

1.P3957 [NOIP2017 普及组] 跳房子2024-03-062.P2034 选择数字2024-03-093.P1714 切蛋糕2024-03-094.E - Insert or Erase2024-03-105.P4147 玉蟾宫2024-03-106.P2866 [USACO06NOV] Bad Hair Day S2024-03-107.P2032 扫描2024-03-108.P1884 [USACO12FEB] Overplanting S2024-03-109.P5905 【模板】全源最短路（Johnson）2024-03-1110.P1801 黑匣子2024-03-2911.P2168 [NOI2015] 荷马史诗2024-03-3012.P8306 【模板】字典树2024-03-3013.P1481 魔族密码2024-03-3014.P4341 [BJWC2010] 外星联络2024-04-0115.P1470 [USACO2.3] 最长前缀 Longest Prefix2024-04-0116.P3384 【模板】重链剖分/树链剖分2024-04-0317.P10288 [GESP样题 八级] 区间2024-04-1618.P2161 [SHOI2009] 会场预约2024-04-1719.P1878 舞蹈课2024-05-1720.P9691 [GDCPC2023] Base Station Construction2024-05-1821.P3611 [USACO17JAN] Cow Dance Show S2024-05-2022.F. Cutting Game2024-05-2123.G. Money Buys Less Happiness Now2024-05-22

24.D. In Love2024-06-29

25.F. Selling a Menagerie2024-06-2926.D. Learning to Paint2024-07-1927.P4588 [TJOI2018] 数学计算2024-07-2028.P3522 [POI2011] TEM-Temperature2024-07-21

收起

原题链接

题解

只要存在一对线段不相交就输出yes，显然空集合以及最小的r大于等于最大的l时一定不存在

code

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int q;
    cin>>q;
    multiset<int> l,r;
    while(q--)
    {
        char op;
        cin>>op;
        int x,y;
        cin>>x>>y;

        if(op=='+')
        {
            l.insert(x);
            r.insert(y);
        }
        else
        {
            l.erase(l.find(x));
            r.erase(r.find(y));
        }
        if(r.empty()||*r.begin()>=*l.rbegin()) puts("no");
        else puts("yes");
    }
    return 0;
}