Submission #698609

#	Time	Username	Problem	Language	Result	Execution time	Memory
698609		Cyanmond	Diversity (CEOI21_diversity)	C++17	0 / 100	1 ms	300 KiB

diversity

#include <bits/stdc++.h>

using i64 = long long;

struct Query {
    int l;
    int r;
};

int main() {
    int N, Q;
    std::cin >> N >> Q;
    std::vector<int> A(N);
    for (auto &e : A) {
        std::cin >> e;
    }
    std::vector<Query> queries(Q);
    for (auto &[l, r] : queries) {
        std::cin >> l >> r;
        --l;
    }

    assert(Q == 1 and queries[0].l == 0 and queries[0].r == N);
    std::sort(A.begin(), A.end());
    i64 ans = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = 1; j <= N; ++j) {
            std::set<int> s;
            for (int k = i; k < j; ++k) {
                s.insert(A[k]);
            }
            ans += (int)s.size();
        }
    }
    std::cout << ans << std::endl;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36