| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 920238 | vjudge1 | Diversity (CEOI21_diversity) | C++17 | 1 ms | 600 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <set>
#warning That's the baby, that's not my baby
typedef long long ll;
const int NMAX = 3e5;
int a[NMAX + 1];
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  int n, q;
  std::cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  while (q--) {
    int l, r;
    std::cin >> l >> r;
    std::vector<int> b;
    for (int i = l; i <= r; i++) {
      b.push_back(a[i]);
    }
    std::sort(b.begin(), b.end());
    int m = (int) b.size();
    ll answer = 0;
    for (int i = 0; i < m; i++) {
      std::set<int> st;
      for (int j = i; j < m; j++) {
        st.insert(b[j]);
        answer += (int) st.size();
      }
    }
    std::cout << answer << '\n';
  }
  return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
