H - Hard Refactoring（巨坑模拟）

题目链接： https://cn.vjudge.net/problem/Gym-101190H

题意：简单的区间合并，输出合并后的区间，如果合并后区间为空集输出false，若为(-inf, +inf)则输出true，否则输出合并后的区间范围。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#define lt k<<1
#define rt k<<1|1
#define lowbit(x) x&(-x)
#define lson l,mid,lt
#define rson mid+1,r,rt
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
#define ios ios::sync_with_stdio(false);cin.tie(nullptr);
#define mem(a, b) memset(a, b, sizeof(a))
const double pi = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int maxn = 1e5 + 50;;
const int max_ = 32767;
const int min_ = -32768;
struct node
{
    int l, r;
    node(int ll = min_, int rr = max_):l(ll),r(rr) {}
}qu[maxn];
struct nodd
{
    int l, r;
    nodd(int ll = min_, int rr = max_):l(ll),r(rr) {}
}cun[maxn];
bool cmp(node a, node b)
{
    if(a.l == b.l) return a.r < b.r;
    else return a.l < b.l;
}
string s;
int main()
{
    freopen("hard.in", "r", stdin);
    freopen("hard.out", "w", stdout);
    int pos1, pos2;
    int sum1, sum2;
    int poo;
    int cnt = 0;
    int tot = 0;
    while(getline(cin, s))
    {
        int laji = 0;
        int len = s.size();
        sum1 = sum2 = 0;
        pos1 = pos2 = 0;
        poo = 1;
        for(int i=0; i<len; i++)
        {
            if(s[i] == '>' && s[i+1] == '=') pos1 = 1;
            else if(s[i] == '<' && s[i+1] == '=') pos2 = 1;
            if(s[i] == '|' && s[i+1] == '|') laji = 1;
        }
        if(pos1 == 1 && pos2 == 1)
        {
            int fuhao1 = 1;
            int fuhao2 = 1;
            for(int i=0; i<len; i++)
            {
                if(s[i] >='0' && s[i] <='9' && poo ==1 )
                {
                    sum1 = sum1 * 10 + s[i] - '0';
                }
                else if(s[i] >= '0' && s[i] <= '9' && poo == 2)
                {
                    sum2 = sum2 * 10 + s[i] - '0';
                }
                else if(s[i] == '&') poo = 2;
                else if(s[i] == '-' && poo == 1) fuhao1 = -1;
                else if(s[i] == '-' && poo == 2) fuhao2 = -1;
            }
            sum1 *= fuhao1;
            sum2 *= fuhao2;
            if(sum1 <= sum2)
            {
                qu[cnt].l = sum1;
                qu[cnt].r = sum2;
                cnt++;
            }
        }
        else if(pos1 == 1)
        {
            int flag = 1;
            for(int i=0; i<len; i++)
            {
                if(s[i] >= '0' && s[i] <= '9')
                {
                    sum1 = sum1 * 10 + s[i] - '0';
                }
                if(s[i] == '-') flag = -1;
            }
            int ans = sum1 * flag;
//            if(ans > max_) continue;
            if(ans <= max_)
            {
                qu[cnt].l = ans;
                cnt++;
            }
        }
        else if(pos2 == 1)
        {
            int flag = 1;
            for(int i=0; i<len; i++)
            {
                if(s[i] >= '0' && s[i] <= '9')
                {
                    sum2 = sum2 * 10 + s[i] - '0';
                }
                if(s[i] == '-') flag = -1;
            }
            int ans = sum2 * flag;
//            if(ans < min_) continue;
            if(ans >= min_)
            {
                qu[cnt].r = ans;
                cnt++;
            }
        }
//        cout << len << endl;
        if(!laji) break;
    }
    sort(qu, qu+cnt, cmp);
//    for(int i=0;i<cnt;i++)
//    {
//        cout << qu[i].l << ' ' << qu[i].r << endl;
//    }
    int ll, rr;
    ll = qu[0].l;
    rr = qu[0].r;
    for(int i=1; i<cnt; i++)
    {
        if(qu[i].l <= rr) rr = max(qu[i].r, rr);
        else if(qu[i].l == rr + 1) rr = qu[i].r;
        else if(qu[i].l > rr + 1)
        {
            cun[tot].l = ll;
            cun[tot].r = rr;
            tot++;
            ll = qu[i].l;
            rr = qu[i].r;
        }
    }
    cun[tot].l = ll;
    cun[tot].r = rr;
    tot++;
//    for(int i=0;i<tot;i++)
//    {
//        cout << cun[i].l << ' ' << cun[i].r <<  endl;
//    }
//    cout << cnt << ' ' << tot << endl;
    if(cnt == 0 || (cnt !=0 && tot == 0)) cout << "false" << endl;
    else if(cun[0].l == min_ && cun[0].r == max_) cout << "true" << endl;
    else
    {
        for(int i=0; i<tot; i++)
        {
            if(i!=tot - 1)
            {
                if(cun[i].l == min_) cout << "x <= " << cun[i].r << " ||" << endl;
                else if(cun[i].r == max_ && i==tot-1) cout << "x >= " << cun[i].l << " ||" << endl;
                else cout << "x >= " << cun[i].l << " && " << "x <= " << cun[i].r << " ||" << endl;
            }
            else
            {
                if(cun[i].l == min_) cout << "x <= " << cun[i].r << endl;
                else if(cun[i].r == max_ && i == tot - 1) cout << "x >= " << cun[i].l << endl;
                else cout << "x >= " << cun[i].l << " && " << "x <= " << cun[i].r << endl;
            }
        }
    }
    return 0;
}