제출 #1170565

#제출 시각아이디문제언어결과실행 시간메모리
1170565lopkusDiversity (CEOI21_diversity)C++20
0 / 100
1 ms324 KiB
#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int n, q;
  std::cin >> n >> q;
  std::vector<int> a(n + 1);
  for(int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  while(q--) {
    int l, r;
    std::cin >> l >> r;
    int ans = 0;
    std::vector<int> b = a;
    std::sort(b.begin() + l, b.begin() + r + 1);
    for(int L = l; L <= r; L++) {
      std::set<int> st;
      for(int R = L; R <= r; R++) {
        st.insert(b[R]);
        ans += (int)st.size();
      }
    }
    std::cout << ans << "\n";
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...