# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574137 | eecs | Boarding Passes (BOI22_passes) | C++17 | 27 ms | 468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int n = 15;
string str;
long long f[1 << n];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> str;
int mask = 0;
for (char c : str) mask |= 1 << (c - 'A');
fill(f + 1, f + (1 << n), 1e18);
for (int S = 0; S < 1 << n; S++) {
if ((S & mask) ^ S) continue;
for (int i = 0; i < n; i++) if (!(S >> i & 1)) {
auto calc = [&](int p) {
int c0 = 0, c1 = 0;
long long s = 0;
for (int j = p; ~j; j--) {
if (str[j] - 'A' == i) c0++;
else if (S >> (str[j] - 'A') & 1) s += c0;
}
for (int j = p + 1; j < str.size(); j++) {
if (str[j] - 'A' == i) c1++;
else if (S >> (str[j] - 'A') & 1) s += c1;
}
return 2 * s + 1LL * c0 * (c0 - 1) / 2 + 1LL * c1 * (c1 - 1) / 2;
};
for (int p = -1; p < (int)str.size(); p++) {
f[S | (1 << i)] = min(f[S | (1 << i)], f[S] + calc(p));
}
}
}
cout << f[mask] / 2 << "." << (f[mask] % 2 ? 5 : 0) << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |