oj.uz

답안 #709000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709000 2023-03-13T03:45:46 Z Sanzhar23 Diversity (CEOI21_diversity) C++14
0 / 100
 7000 ms 308 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long	
#define pb push_back
#define bug cout << "bug" << endl
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pll pair <ll, ll> 
#define pii pair <int, int> 
#define triple pair <pair <ll, ll> , ll>   
#define ull unsigned long long
#define ld long double
#define pinode pair <node*, node*>

const ll INF = 9e18 + 5;
const ll inf = 1e9 + 5;
const ll N = 3e5 + 5;
const ll shift = 2e6;
const ll mod = 998244353;
const ll mod2 = 1e9 + 9;
const ll M = 1e3 + 5;
const ll LOG = 21;
const ll sp = 263;
const ll sp2 = 9973;
const int block = 100;
const double eps = 1e-10;

int n, q;
int a[N];

int main(){
	speed;
	cin >> n >> q;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	int l, r;
	cin >> l >> r;
	int ans = inf;
	do{
		int cur = 0;
		for(int i = 1; i <= n; i++){
			unordered_set <int> st;
			for(int j = i; j <= n; j++){
				st.insert(a[j]);
				cur += (int)st.size();
			}
		}
		ans = min(ans, cur);
	}
	while(next_permutation(a + 1, a + 1 + n));	
	cout << ans << endl;
}
/*	
%I64d6


		
		



%I64d
*/

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 212 KB Output is correct
4 Correct 19 ms 212 KB Output is correct
5 Correct 344 ms 300 KB Output is correct
6 Correct 2350 ms 308 KB Output is correct
7 Correct 174 ms 308 KB Output is correct
8 Execution timed out 7057 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 7055 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 7055 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 7055 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 212 KB Output is correct
4 Correct 19 ms 212 KB Output is correct
5 Correct 344 ms 300 KB Output is correct
6 Correct 2350 ms 308 KB Output is correct
7 Correct 174 ms 308 KB Output is correct
8 Execution timed out 7057 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 212 KB Output is correct
4 Correct 19 ms 212 KB Output is correct
5 Correct 344 ms 300 KB Output is correct
6 Correct 2350 ms 308 KB Output is correct
7 Correct 174 ms 308 KB Output is correct
8 Execution timed out 7057 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -