1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        int l = 0, r = INT_MAX;
        set<int> s;
        for (int i = 0; i < n; ++i) {
            int o, x;
            cin >> o >> x;
            if (o == 1) l = max(l, x);
            else if (o == 2) r = min(r, x);
            else s.insert(x);
        }
        int cnt = r - l + 1;
        for (auto& v: s) if (v <= r && v >= l) --cnt;
        cout << max(0, cnt) << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n, k, x;
        cin >> n >> k >> x;
        vector<int> data(n);
        for (auto& i: data) cin >> i;
        sort(data.begin(), data.end(), greater<>());
        int total = 0, fx = 0;
        for (int i = 0; i < n; ++i) {
            total += data[i];
            fx += i < x ? data[i] : 0;
        }
        int cur = 0, ma = 0;
        for (int l = 0, r = x; l < k; ++l, ++r) {
            cur -= r < n ? 2 * data[r] : 0;
            cur += data[l];
            ma = max(ma, cur);
        }
        cout << total - fx - fx + ma << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

int gcd(const int a, const int b) {
    return b == 0 ? a : gcd(b, a % b);
}
void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        vector<int> data(n);
        for (auto& i: data) cin >> i;
        auto check = [&](const int x) {
            const int len = n / x;
            int tmp = 0;
            for (int i = 1; i < x; ++i)
                for (int j = 0; j < len; ++j)
                    tmp = gcd(abs(data[i * len + j] - data[(i - 1) * len + j]), tmp);
            return tmp != 1;
        };
        int ans = 0;
        for (int i = 1; i * i <= n; ++i) {
            if (n % i) continue;
            ans += check(i);
            if (i * i != n) ans += check(n / i);
        }
        cout << ans << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

#define int long long
void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n, q;
        cin >> n >> q;
        vector<pair<int, int>> data(n);
        for (auto& [fst, snd]: data) cin >> fst >> snd;
        map<int, list<int>> mp;
        int maxK = 0;
        for (int i = 0; i < q; ++i) {
            int tmp;
            cin >> tmp;
            mp[tmp].push_back(i);
            maxK = max(maxK, tmp);
        }
        int tot = 0, i = 0;
        for (; i < n; ++i) {
            if (data[i].first == 1) ++tot;
            else {
                if ((maxK + tot - 1) / tot <= 1 + data[i].second)
                    data[i].second = (maxK + tot - 1) / tot;
                tot *= 1 + data[i].second;
            }
            if (tot >= maxK) break;
        }
        vector<int> ans(q);
        for (; i >= 0; --i) {
            if (data[i].first == 1) {
                if (const auto iter = mp.find(tot); iter != mp.end())
                    for (const auto& v: iter->second) ans[v] = data[i].second;
                mp.erase(tot);
                --tot;
            } else {
                const int len = tot / (1 + data[i].second);
                for (auto iter = mp.upper_bound(len); iter != mp.end(); ) {
                    list<int>& l = mp[(iter->first - 1) % len + 1];
                    l.splice(l.end(), iter->second);
                    auto nxtIter = iter;
                    ++nxtIter;
                    mp.erase(iter);
                    iter = nxtIter;
                }
                tot = len;
            }
        }
        for (int i = 0; i < q; ++i) cout << ans[i] << " \n"[i == q - 1];
    }
}