제출 #920265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
920265		vjudge1	Diversity (CEOI21_diversity)	C++17	0 / 100	7021 ms	344 KiB

diversity

#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int MAXN = 300228;

int cnt[MAXN];

ll get(vector<int> a) {
	ll res = 0;
	for (int i = 0; i < sz(a); i++) {
		int diff = 0;
		for (int j = i; j < sz(a); j++) {
			if (cnt[a[j]] == 0) {
				diff++;
			}
			cnt[a[j]]++;
			res += diff;
		}
		for (int j = i; j < sz(a); j++) {
			cnt[a[j]] = 0;
		}
	}
	return res;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);	
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	vector<int> inds(n);
	iota(all(inds), 0);
	ll cost = 1e18;
	do {
		vector<int> newa(n);
		for (int i = 0; i < n; i++) {
			newa[inds[i]] = a[i];
		}
		chkmin(cost, get(newa));
	} while (next_permutation(all(inds)));
	cout << cost << '\n';
	sort(all(a));
	assert(get(a) == cost);
	return 0;
	for (int i = 1; i <= q; i++) {
		int l, r;
		cin >> l >> r;
		vector<int> v;
		for (int j = l; j <= r; j++) {
			v.pb(a[j - 1]);
		}
		sort(all(v));
		cout << get(v) << '\n';
	}
	return 0;				
}

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