Submission #617103

#	Time	Username	Problem	Language	Result	Execution time	Memory
617103		Mr_Husanboy	Diversity (CEOI21_diversity)	C++14	0 / 100	2 ms	304 KiB

diversity

#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>


 
 
using namespace std;
using ll = long long;


 
mt19937 rng(123);
#define ld long double
#define ull unsigned long long 
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define setp(x) setprecision(x)


ll mod=1e9+7;
int inf=1e9;
const int LOGN = 20;
const int MXX=3e5;

const long double PI = 3.1415926535897932384626433832795;







void solve(){
	int n, q; cin >> n >> q;
	vector<int> v(n);
	for(int i = 0; i < n; i ++){
		cin >> v[i];
	}
	sort(all(v));
	while(q--){
		int l,r; cin >> l >> r;
		int ans = 0;
		for(int i = 0; i < n; i ++){
			for(int j = i+1; j < n; j ++){
				set<int> st;
				for(int k = i; k <=j; k ++){
					st.insert(v[k]);
				} ans += st.size();
			}
		}
		cout << ans + n << '\n';
	}
}

 
int main(){
	int testcases = 1;
//	cin >> testcases;
	while(testcases --){
		solve(); if(testcases) cout << '\n';
		//cout << 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