oj.uz

Submission #576705

# Submission time Handle Problem Language Result Execution time Memory
576705 2022-06-13T09:40:03 Z InternetPerson10 Boarding Passes (BOI22_passes) C++17
60 / 100
 2000 ms 15956 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

ll BIG = 1e13;

vector<int> nums;
vector<vector<int>> ct;
vector<ll> dp;
vector<vector<ll>> pref;
vector<vector<int>> v;

int n, g;

ll solve(int bit);

ll solvebit(int bit, int las) {
    int bi = bit - (1 << las);
    ll ans = solve(bi);
    ll tot = BIG, tot2 = 0;
    ll m = ct[las].size();
    if(m == 0) return ans;
    ll x = 0;
    for(int g : ct[las]) {
        for(int k : v[bi]) {
            tot2 += pref[k][g];
        }
    }
    for(int k : v[bi]) {
        x += pref[k][n];
    }
    tot = min(tot, 2 * tot2 + (m * m - m) / 2);
    for(ll i = m-1; i >= 0; i--) {
        tot2 += x;
        for(int k : v[bi]) {
            tot2 -= 2 * pref[k][ct[las][i]];
        }
        assert(tot2 >= 0);
        tot = min(tot, 2 * tot2 + (i * i - i) / 2 + ((m-i) * (m-i) - (m-i)) / 2);
    }
    return ans + tot;
}

ll solve(int bit) {
    if(bit == 0) return 0;
    if(dp[bit] != BIG) return dp[bit];
    ll ans = BIG;
    for(int i : v[bit]) {
        ans = min(ans, solvebit(bit, i));
    }
    return dp[bit] = ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s;
    cin >> s;
    n = s.size();
    nums.resize(n);
    ct.resize(15);
    g = 0;
    for(int i = 0; i < n; i++) {
        nums[i] = s.at(i) - 'A';
        g = max(g, nums[i]+1);
        ct[nums[i]].push_back(i);
    }
    v.resize(1 << g);
    for(int i = 0; i < (1 << g); i++) {
        for(int j = 0; j < g; j++) {
            if((1 << j) & i) v[i].push_back(j);
        }
    }
    pref.resize(g);
    dp.resize(1 << g, BIG);
    dp[0] = 0;
    for(int i = 0; i < g; i++) {
        pref[i].resize(n+1);
        for(int j = 0; j < n; j++) {
            pref[i][j+1] = pref[i][j];
            if(nums[j] == i) pref[i][j+1]++;
        }
    }
    ll a = solve((1 << g) - 1);
    cout << a/2;
    if(a%2) cout << ".5\n";
    else cout << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 1808 KB Output is correct
7 Correct 3 ms 2064 KB Output is correct
8 Correct 3 ms 2164 KB Output is correct
9 Correct 3 ms 2192 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 252 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 280 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 252 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 280 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 11 ms 980 KB Output is correct
36 Correct 11 ms 1108 KB Output is correct
37 Correct 59 ms 1276 KB Output is correct
38 Correct 50 ms 1236 KB Output is correct
39 Correct 54 ms 1236 KB Output is correct
40 Correct 49 ms 1236 KB Output is correct
41 Correct 52 ms 1236 KB Output is correct
42 Correct 53 ms 1236 KB Output is correct
43 Correct 59 ms 1236 KB Output is correct
44 Correct 53 ms 1236 KB Output is correct
45 Correct 52 ms 1264 KB Output is correct
46 Correct 53 ms 1276 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 1808 KB Output is correct
7 Correct 3 ms 2064 KB Output is correct
8 Correct 3 ms 2164 KB Output is correct
9 Correct 3 ms 2192 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 252 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 280 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 11 ms 980 KB Output is correct
45 Correct 11 ms 1108 KB Output is correct
46 Correct 59 ms 1276 KB Output is correct
47 Correct 50 ms 1236 KB Output is correct
48 Correct 54 ms 1236 KB Output is correct
49 Correct 49 ms 1236 KB Output is correct
50 Correct 52 ms 1236 KB Output is correct
51 Correct 53 ms 1236 KB Output is correct
52 Correct 59 ms 1236 KB Output is correct
53 Correct 53 ms 1236 KB Output is correct
54 Correct 52 ms 1264 KB Output is correct
55 Correct 53 ms 1276 KB Output is correct
56 Correct 18 ms 3132 KB Output is correct
57 Correct 22 ms 3156 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 3 ms 1808 KB Output is correct
64 Correct 2 ms 2064 KB Output is correct
65 Correct 3 ms 2192 KB Output is correct
66 Correct 3 ms 2192 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 1 ms 212 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 11 ms 980 KB Output is correct
85 Correct 11 ms 980 KB Output is correct
86 Correct 59 ms 1284 KB Output is correct
87 Correct 50 ms 1236 KB Output is correct
88 Correct 52 ms 1236 KB Output is correct
89 Correct 63 ms 1236 KB Output is correct
90 Correct 53 ms 1268 KB Output is correct
91 Correct 59 ms 1272 KB Output is correct
92 Correct 54 ms 1236 KB Output is correct
93 Correct 53 ms 1260 KB Output is correct
94 Correct 57 ms 1260 KB Output is correct
95 Correct 55 ms 1236 KB Output is correct
96 Execution timed out 2044 ms 15956 KB Time limit exceeded
97 Halted 0 ms 0 KB -