codeforces #371(Div2)题解

A. Meeting of Old Friends

求两个区间的重叠部分的大小，先把两个点排一下序好处理一点，然后判断两个区间的位置就好了

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)

struct node {
    LL l, r;
} a[10];

bool cmp(node a, node b) {
    if (a.l != b.l) return a.l < b.l;
    return a.r < b.r;
}

int main() {
    LL l1, r1, l2, r2, k, res;
    scanf("%lld%lld%lld%lld%lld", &a[0].l, &a[0].r, &a[1].l, &a[1].r, &k);
    sort(a, a + 2, cmp);
    if (a[1].l > a[0].r) puts("0");
    else {
        LL t = min(a[0].r, a[1].r);
        res = t - a[1].l + 1;
        if (k >= a[1].l && k <= t) res--;
        printf("%lld\n", res);
    }
    return 0;
}

B. Filya and Homework

对于每个数，能选择的只有+x, -x, 不变。因此最多只能有3种类型的数，统计一下出现的数字总数：出现1/2种一定成立，出现3种的话最大的数-中间的数 == 中间的数 - 最小的数即可

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)

set<int> s;

int main() {
    int n, x, cnt = 0;
    scan(n);
    while (n--) {
        scan(x);
        if (!s.count(x)) {
            cnt++;
            s.insert(x);
        }
        if (cnt > 3) break;
    }
    if (cnt > 3) puts("NO");
    else {
        int a[3], k = 0;
        for (set<int>::iterator it = s.begin(); it != s.end(); it++) a[k++] = *it;
        if (cnt == 1 || cnt == 2) puts("YES");
        else {
            if (a[2] - a[1] == a[1] - a[0]) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}

C. Sonya and Queries

感觉cf div2的C都是大腿题啊= =
刚开始想的是用一个multiset来模拟一下，但是好像会T。仔细考虑一下，其实每次添加的数只需要关注每位的奇偶性即可，并且如果少了的话在前面补前导0并不影响数的大小，于是将数字按照相同的规则转化成2进制，然后每次查询用一个数组查询就可以了

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)

const int maxn = (1 << 18) + 5;
int a[maxn];

int main() {
    int n, x;
    char ch, s[20];
    scan(n);
    while (n--) {
        getchar();
        scanf("%c %s", &ch, &s);
        int len = strlen(s);
        int t = 0;
        for (int i = 0; i < len; i++) {
            if ((s[i] - '0') & 1) t = (t << 1) | 1;
            else t <<= 1;
        }
        if (ch == '+') a[t]++;
        if (ch == '-') a[t]--;
        if (ch == '?') printf("%d\n", a[t]);
    }
    return 0;
}