#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)x.size()
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a.begin() + 1, a.end());
int _, __;
cin >> _ >> __;
ll ans = -1;
do {
ll cur = 0;
for (int l = 1; l <= n; l++) {
set<int> s;
for (int r = l; r <= n; r++) {
s.insert(a[r]);
cur += sz(s);
}
}
if (ans == -1)
ans = cur;
ans = min(ans, cur);
} while (next_permutation(a.begin() + 1, a.end()));
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
280 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
76 ms |
288 KB |
Output is correct |
5 |
Correct |
477 ms |
296 KB |
Output is correct |
6 |
Correct |
3455 ms |
284 KB |
Output is correct |
7 |
Execution timed out |
7056 ms |
204 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
7064 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
7064 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
7064 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
280 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
76 ms |
288 KB |
Output is correct |
5 |
Correct |
477 ms |
296 KB |
Output is correct |
6 |
Correct |
3455 ms |
284 KB |
Output is correct |
7 |
Execution timed out |
7056 ms |
204 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
280 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
76 ms |
288 KB |
Output is correct |
5 |
Correct |
477 ms |
296 KB |
Output is correct |
6 |
Correct |
3455 ms |
284 KB |
Output is correct |
7 |
Execution timed out |
7056 ms |
204 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |