# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574138 | 2022-06-08T02:54:35 Z | eecs | Boarding Passes (BOI22_passes) | C++17 | 2000 ms | 724 KB |
#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" : "") << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 468 KB | Output is correct |
3 | Correct | 1 ms | 468 KB | Output is correct |
4 | Correct | 1 ms | 468 KB | Output is correct |
5 | Correct | 40 ms | 536 KB | Output is correct |
6 | Execution timed out | 2091 ms | 724 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 468 KB | Output is correct |
3 | Correct | 20 ms | 468 KB | Output is correct |
4 | Correct | 21 ms | 556 KB | Output is correct |
5 | Correct | 21 ms | 468 KB | Output is correct |
6 | Correct | 1 ms | 468 KB | Output is correct |
7 | Correct | 15 ms | 580 KB | Output is correct |
8 | Correct | 2 ms | 468 KB | Output is correct |
9 | Correct | 2 ms | 468 KB | Output is correct |
10 | Correct | 2 ms | 468 KB | Output is correct |
11 | Correct | 2 ms | 468 KB | Output is correct |
12 | Correct | 2 ms | 468 KB | Output is correct |
13 | Correct | 2 ms | 468 KB | Output is correct |
14 | Correct | 2 ms | 468 KB | Output is correct |
15 | Correct | 3 ms | 468 KB | Output is correct |
16 | Correct | 3 ms | 468 KB | Output is correct |
17 | Correct | 3 ms | 468 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 468 KB | Output is correct |
3 | Correct | 20 ms | 468 KB | Output is correct |
4 | Correct | 21 ms | 556 KB | Output is correct |
5 | Correct | 21 ms | 468 KB | Output is correct |
6 | Correct | 1 ms | 468 KB | Output is correct |
7 | Correct | 15 ms | 580 KB | Output is correct |
8 | Correct | 2 ms | 468 KB | Output is correct |
9 | Correct | 2 ms | 468 KB | Output is correct |
10 | Correct | 2 ms | 468 KB | Output is correct |
11 | Correct | 2 ms | 468 KB | Output is correct |
12 | Correct | 2 ms | 468 KB | Output is correct |
13 | Correct | 2 ms | 468 KB | Output is correct |
14 | Correct | 2 ms | 468 KB | Output is correct |
15 | Correct | 3 ms | 468 KB | Output is correct |
16 | Correct | 3 ms | 468 KB | Output is correct |
17 | Correct | 3 ms | 468 KB | Output is correct |
18 | Correct | 1 ms | 468 KB | Output is correct |
19 | Correct | 1 ms | 468 KB | Output is correct |
20 | Correct | 21 ms | 468 KB | Output is correct |
21 | Correct | 20 ms | 468 KB | Output is correct |
22 | Correct | 24 ms | 468 KB | Output is correct |
23 | Correct | 1 ms | 468 KB | Output is correct |
24 | Correct | 18 ms | 468 KB | Output is correct |
25 | Correct | 1 ms | 468 KB | Output is correct |
26 | Correct | 2 ms | 572 KB | Output is correct |
27 | Correct | 2 ms | 468 KB | Output is correct |
28 | Correct | 3 ms | 468 KB | Output is correct |
29 | Correct | 2 ms | 468 KB | Output is correct |
30 | Correct | 2 ms | 468 KB | Output is correct |
31 | Correct | 3 ms | 468 KB | Output is correct |
32 | Correct | 2 ms | 468 KB | Output is correct |
33 | Correct | 2 ms | 468 KB | Output is correct |
34 | Correct | 2 ms | 468 KB | Output is correct |
35 | Execution timed out | 2079 ms | 468 KB | Time limit exceeded |
36 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 468 KB | Output is correct |
3 | Correct | 1 ms | 468 KB | Output is correct |
4 | Correct | 1 ms | 468 KB | Output is correct |
5 | Correct | 40 ms | 536 KB | Output is correct |
6 | Execution timed out | 2091 ms | 724 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |