Submission #881881

#	Time	Username	Problem	Language	Result	Execution time	Memory
881881		TAhmed33	Diversity (CEOI21_diversity)	C++98	0 / 100	1 ms	504 KiB

diversity

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 3e5 + 25;
int n, a[MAXN], q;
int main () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> a[i];
	while (q--) {
		int l, r;
		cin >> l >> r;
		sort(a + 1, a + n + 1);
		ll sum = 0;
		for (int i = 1; i <= n; i++) {
			set <int> dd;
			for (int j = i; j <= n; j++) {
				dd.insert(a[j]);
				sum += dd.size();
			}
		}
		cout << sum << '\n';
	}
}

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