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

void solve() {
    int _;
    cin >> _;
    for (int ts = 0; ts < _; ++ts) {
        int x;
        cin >> x;
        int d[5], ans = 0;
        for (int &i: d) {
            i = x % 10;
            if (i == 0) i = 10;
            x /= 10;
        }
        d[4] = 1;
        for (int i = 3; i >= 0; --i) ans += abs(d[i] - d[i + 1]) + 1;
        cout << ans << endl;
    }
}

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

void solve() {
    int _;
    cin >> _;
    string str;
    str.reserve(1e5 + 10);
    for (int ts = 0; ts < _; ++ts) {
        int n, k;
        cin >> n >> k >> str;
        map<char, int> cnt;
        for (auto &item: str) cnt[item]++;
        int edd = 0;
        for (auto &item: cnt) edd += item.second % 2;
        cout << ((k >= edd - 1) ? "YES" : "NO") << 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

void solve() {
    int _;
    cin >> _;
    for (int ts = 0; ts < _; ++ts) {
        int n, k;
        cin >> n >> k;
        vector<int> data(n);
        for (auto &i: data) cin >> i;
        if (k != 4) {
            int mi = k, ma = 0;
            for (auto &i: data) {
                mi = min(mi, i % k);
                ma = max(ma, i % k);
            }
            if (mi == 0) cout << 0 << endl;
            else cout << (k - ma) << endl;
        } else {
            int even = 0, ma = 0;
            for (auto &i: data) {
                even += i % 4 == 0 ? 2 : i % 2 == 0;
                ma = max(ma, i % 4);
            }
            cout << min(max(0, 2 - even), 4 - 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
29
30
31
32
33
34
35
36
37
38
39
40

void solve() {
    int n;
    cin >> n;
    priority_queue<pair<int, int>, vector<pair<int, int>>, less<>> prq1;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> prq2;
    map<int, int> mvd1, mvd2;
    for (int i = 0; i < n; ++i) {
        char op;
        int l, r;
        cin >> op >> l >> r;
        if (op == '+') {
            prq1.emplace(l, i);
            prq2.emplace(r, i);
        } else {
            mvd1[l]++;
            mvd2[r]++;
        }
        while (!prq1.empty()) {
            auto item = prq1.top();
            auto iter = mvd1.find(item.first);
            if (iter != mvd1.end()) {
                while (iter->second--) prq1.pop();
                mvd1.erase(iter);
            } else break;
        }
        while (!prq2.empty()) {
            auto item = prq2.top();
            auto iter = mvd2.find(item.first);
            if (iter != mvd2.end()) {
                while (iter->second--) prq2.pop();
                mvd2.erase(iter);
            } else break;
        }
        if (prq1.empty() || prq2.empty() || prq1.size() == 1 || prq2.size() == 1) cout << "NO" << endl;
        else cout << (prq1.top().first > prq2.top().first ? "YES" : "NO") << 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

#define int long long
void solve() {
    int _;
    cin >> _;
    for (int ts = 0; ts < _; ++ts) {
        int n;
        cin >> n;
        vector<int> data(n), p(n, 0), ans(n, 0);
        for (auto &i: data) cin >> i;
        for (int i = 0; i < n; ++i) {
            while (data[i] <= INT_MAX) {
                p[i]++;
                data[i] <<= 1;
            }
        }
        for (int i = 1; i < n; ++i) ans[i] = ans[i - 1] + (data[i] >= data[i - 1] ? 0 : 1);
        int last = p[0] + ans[0], tot = 0;
        for (int i = 0; i < n; ++i) {
            ans[i] += p[i];
            last = min(ans[i], last);
            ans[i] -= last;
            tot += ans[i];
        }
        cout << tot << 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

#define int long long
void solve() {
    int _;
    cin >> _;
    for (int ts = 0; ts < _; ++ts) {
        int n;
        cin >> n;
        vector<int> data(n);
        for (auto &i: data) cin >> i;
        map<int, int> cnt[2];
        for (auto &i: data) cnt[1][i]++;
        int ans = 0;
        for (auto &i: data) {
            auto iter = cnt[1].find(i);
            iter->second--;
            if (iter->second == 0) cnt[1].erase(iter);
            // left has
            if (cnt[0].count(i)) continue;
            ans += (int) cnt[1].size();
            // single
            if (iter->second == 0) ans++;
            cnt[0][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

void solve() {
    int _;
    cin >> _;
    for (int ts = 0; ts < _; ++ts) {
        int n, m;
        cin >> n >> m;
        vector<int> a(n - 1), b(n);
        for (auto &i: a) cin >> i;
        for (auto &i: b) cin >> i;
        sort(a.begin(), a.end());
        sort(b.begin(), b.end());
        int lastB = -1, base = 0, cur = 0;
        for (int &i: a) {
            while (cur < n && i >= b[cur]) lastB = b[cur++];
            if (cur >= n) base++;
            cur++;
        }
        if (lastB == -1) lastB = b.back();
        cout << 1LL * base * m + max(0, m - lastB + 1) << endl;
    }
}