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

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        string a, b, c;
        a.resize(n);
        b.resize(n);
        c.resize(n);
        cin >> a >> b >> c;
        bool flag = false;
        for (int i = 0; i < n; ++i) if (a[i] != c[i] && b[i] != c[i]) flag = true;
        cout << (flag ? "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

#define int long long
void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        map<int, int> cnt;
        for (int i = 0; i < n; ++i) {
            int tmp;
            cin >> tmp;
            ++cnt[tmp];
        }
        int tot = 0, ans = 0;
        for (const auto [fst, snd]: cnt) {
            if (snd == 2) ans += tot;
            else if (snd > 2) ans += tot * snd * (snd - 1) / 2 + snd * (snd - 1) * (snd - 2) / 6;
            tot += snd;
        }
        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

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        vector<int> data(n), cl(n), cr(n);
        for (auto& i: data) cin >> i;
        cl[0] = cr[n - 1] = 0;
        for (int i = 1; i < n; ++i) {
            if (i == 1 || data[i - 1] - data[i - 2] >= data[i] - data[i - 1]) cl[i] = cl[i - 1] + 1;
            else cl[i] = cl[i - 1] + data[i] - data[i - 1];
        }
        for (int i = n - 2; i >= 0; --i) {
            if (i == n - 2 || data[i + 2] - data[i + 1] >= data[i + 1] - data[i]) cr[i] = cr[i + 1] + 1;
            else cr[i] = cr[i + 1] + data[i + 1] - data[i];
        }
        int m;
        cin >> m;
        for (int i = 0; i < m; ++i) {
            int u, v;
            cin >> u >> v;
            if (u <= v) cout << cl[v - 1] - cl[u - 1] << endl;
            else cout << cr[v - 1] - cr[u - 1] << 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

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        vector<int> a(n), d(n);
        for (auto& i: a) cin >> i;
        for (auto& i: d) cin >> i;
        map<int, pair<int, int>> mp;
        for (int i = 0; i < n; ++i) mp[i] = {a[i], d[i]};
        auto check = [&](map<int, pair<int, int>>::iterator& cur) {
            int cost = 0;
            if (cur != mp.begin()) {
                --cur;
                cost += cur->second.first;
                ++cur;
            }
            ++cur;
            if (cur != mp.end()) cost += cur->second.first;
            --cur;
            return cost > cur->second.second;
        };
        set<int> s[2];
        for (auto iter = mp.begin(); iter != mp.end(); ++iter) if (check(iter)) s[0].insert(iter->first);
        int cur = 0, nxt = 1, tot = 0;
        vector ans(n, 0);
        while (!s[cur].empty()) {
            for (const int& c: s[cur]) {
                ++ans[tot];
                mp.erase(c);
            }
            for (const int& c: s[cur]) {
                auto iter = mp.upper_bound(c);
                if (iter != mp.end()) if (check(iter)) s[nxt].insert(iter->first);
                if (iter != mp.begin()) {
                    --iter;
                    if (check(iter)) s[nxt].insert(iter->first);
                }
            }
            s[cur].clear();
            swap(cur, nxt);
            ++tot;
        }
        for (int i = 0; i < n; ++i) cout << ans[i] << " \n"[i == n - 1];
    }
}

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

#define int long long
void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        --n;
        vector<int> ans;
        int cur = 62;
        while (n < (1LL << cur) - 1) --cur;
        for (int i = 1; i <= cur; ++i) ans.push_back(i);
        n -= (1LL << cur) - 1;
        while (n) {
            while (n >= 1LL << cur - 1) {
                n -= 1LL << cur - 1;
                ans.push_back(cur);
            }
            --cur;
        }
        cout << ans.size() << endl;
        for (int i = 0; i < ans.size(); ++i) cout << ans[i] << " \n"[i == ans.size() - 1];
    }
}