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

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int k, q, s;
        cin >> k >> q;
        cin >> s;
        for (int i = 1; i < k; ++i) {
            int tmp;
            cin >> tmp;
        }
        for (int i = 0; i < q; ++i) {
            int n;
            cin >> n;
            cout << min(n, s - 1) << " \n"[i == q - 1];
        }
    }
}

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

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        set<int> st;
        for (int i = 0; i < n; ++i) {
            int tmp;
            cin >> tmp;
            st.insert(tmp);
        }
        cout << n - st.size() << endl;
    }
}

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

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n;
        cin >> n;
        int ans = 0;
        for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) ans += max(i, j) + 1;
        cout << ans << ' ' << 2 * n << endl;
        for (int i = n - 1; i >= 0; --i) {
            cout << 1 << ' ' << i + 1;
            for (int j = 0; j < n; ++j) cout << ' ' << j + 1;
            cout << endl;
            cout << 2 << ' ' << i + 1;
            for (int j = 0; j < n; ++j) cout << ' ' << j + 1;
            cout << 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
51
52
53
54
55
56
57
58
59
60
61

void solve() {
    int n;
    cin >> n;
    vector<int> data(n), dp(n), dr(n);
    for (auto &i: data) cin >> i;
    dp[0] = data[0] >= 1 ? data[0] : 1;
    dr[0] = data[0] >= 1 ? -1 : 0;
    for (int i = 1; i < n; ++i) {
        dp[i] = dp[i - 1] + data[i];
        dr[i] = -1;
        for (int j = i; j >= 1; --j)
            if (dp[j - 1] + (i - j + 1) * (i - j + 1) > dp[i]) {
                dp[i] = dp[j - 1] + (i - j + 1) * (i - j + 1);
                dr[i] = j;
            }
        if ((i + 1) * (i + 1) > dp[i]) {
            dr[i] = 0;
            dp[i] = (i + 1) * (i + 1);
        }
    }
    vector<pair<int, int>> ans;
    ans.reserve(2e5);
    auto zero = [&](int l, int r) {
        bool flag = true;
        for (int i = l; i <= r; ++i) if (data[i] == 0) flag = false;
        if (flag) ans.emplace_back(l, r);
        else {
            ans.emplace_back(l, r);
            ans.emplace_back(l, r);
        }
        for (int i = l; i <= r; ++i) data[i] = 0;
    };
    function<void(int, int)> dfs = [&](int l, int r) {
        if (l == r) {
            if (data[l] == 0) return;
            ans.emplace_back(l, l);
            return;
        }
        dfs(l, r - 1);
        ans.emplace_back(l, r);
        ans.emplace_back(l, r - 1);
        data[r] = r - l;
        dfs(l, r - 1);
    };
    auto f = [&](int l, int r) {
        zero(l, r);
        dfs(l, r);
        ans.emplace_back(l, r);
    };
    vector<pair<int, int>> lr;
    for (int i = n - 1; i >= 0; --i) {
        if (dr[i] == -1) continue;
        f(dr[i], i);
        i = dr[i];
    }
    cout << dp[n - 1] << ' ' << ans.size() << endl;
    for (auto &[a, b]: ans) cout << a + 1 << ' ' << b + 1 << endl;
}