oj.uz

Submission #601149

# Submission time Handle Problem Language Result Execution time Memory
601149 2022-07-21T12:00:06 Z alextodoran Boarding Passes (BOI22_passes) C++17
60 / 100
 1950 ms 37660 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 100000;
const int G_MAX = 15;

int G, N;
int group[N_MAX];
vector <int> inGroup[G_MAX];

mt19937 rnd(0);
void input () {
    string S;
    cin >> S;
//    for (int i = 0; i < 100000; i++) {
//        S += (char) (rnd() % 15 + 'A');
//    }
    N = (int) S.size();
    bool occ[26];
    fill(occ, occ + 26, false);
    for (int i = 0; i < N; i++) {
        group[i] = (int) (S[i] - 'A');
        occ[group[i]] = true;
    }
    int id[26];
    for (int g = 0; g < 26; g++) {
        if (occ[g] == true) {
            id[g] = G++;
        }
    }
    for (int i = 0; i < N; i++) {
        group[i] = id[group[i]];
        inGroup[group[i]].push_back(i);
    }
}

int L[N_MAX], R[N_MAX];
int pref[N_MAX][G_MAX], suff[N_MAX][G_MAX];
ll prefSum[N_MAX][G_MAX], suffSum[N_MAX][G_MAX];

void precalc () {
    for (int i = 0; i < N; i++) {
        if (i > 0) {
            for (int g = 0; g < G; g++) {
                pref[i][g] = pref[i - 1][g];
            }
        }
        pref[i][group[i]]++;
    }
    for (int i = N - 1; i >= 0; i--) {
        if (i < N - 1) {
            for (int g = 0; g < G; g++) {
                suff[i][g] = suff[i + 1][g];
            }
        }
        suff[i][group[i]]++;
    }
    int last[G_MAX];
    fill(last, last + G, -1);
    for (int i = 0; i < N; i++) {
        L[i] = last[group[i]];
        last[group[i]] = i;
        if (L[i] != -1) {
            for (int g = 0; g < G; g++) {
                prefSum[i][g] = prefSum[L[i]][g];
            }
        }
        for (int g = 0; g < G; g++) {
            prefSum[i][g] += pref[i][g];
        }
    }
    fill(last, last + G, -1);
    for (int i = N - 1; i >= 0; i--) {
        R[i] = last[group[i]];
        last[group[i]] = i;
        if (R[i] != -1) {
            for (int g = 0; g < G; g++) {
                suffSum[i][g] += suffSum[R[i]][g];
            }
        }
        for (int g = 0; g < G; g++) {
            suffSum[i][g] += suff[i][g];
        }
    }
}

ll f (int mask, int g, int k) {
    ll ret;
    if (k == 0) {
        int i = inGroup[g][0];
        int gr = suff[i][g];
        ret = (ll) gr * (gr - 1) / 2;
        while (mask > 0) {
            int h = __builtin_ctz(mask & -mask);
            mask ^= (1 << h);
            ret += 2 * suffSum[i][h];
        }
    } else {
        int i = inGroup[g][k - 1];
        int gl = pref[i][g], gr = suff[R[i]][g];
        ret = (ll) gl * (gl - 1) / 2 + (ll) gr * (gr - 1) / 2;
        while (mask > 0) {
            int h = __builtin_ctz(mask & -mask);
            mask ^= (1 << h);
            ret += 2 * prefSum[i][h] + 2 * suffSum[R[i]][h];
        }
    }
    return ret;
}

ll minEV[1 << G_MAX];

void update (ll &x, const ll &y) {
    if (y < x) {
        x = y;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(4);

    input();
    precalc();
    fill(minEV, minEV + (1 << G), LLONG_MAX);
    minEV[0] = 0;
    for (int mask = 0; mask < (1 << G) - 1; mask++) {
        for (int g = 0; g < G; g++) {
            if (((mask >> g) & 1) == 0) {
                int l = 0, r = (int) inGroup[g].size();
                while (l < r) {
                    int a = (l * 2 + r + 2) / 3, b = (l + r * 2) / 3;
                    if (f(mask, g, a) < f(mask, g, b)) {
                        r = b;
                    } else {
                        l = a;
                    }
                }
                for (int k = max(0, l - 100); k <= min((int) inGroup[g].size(), l + 100); k++) {
                    update(minEV[mask ^ (1 << g)], minEV[mask] + f(mask, g, k));
                }
            }
        }
    }
    ll answer = minEV[(1 << G) - 1];
    if (answer % 2 == 0) {
        cout << answer / 2 << "\n";
    } else {
        cout << answer / 2 << ".5\n";
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 15 ms 29520 KB Output is correct
7 Correct 19 ms 35124 KB Output is correct
8 Correct 19 ms 37444 KB Output is correct
9 Correct 19 ms 37392 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 2 ms 4052 KB Output is correct
36 Correct 2 ms 4052 KB Output is correct
37 Correct 40 ms 4052 KB Output is correct
38 Correct 14 ms 4052 KB Output is correct
39 Correct 7 ms 4152 KB Output is correct
40 Correct 29 ms 4052 KB Output is correct
41 Correct 37 ms 3924 KB Output is correct
42 Correct 26 ms 3924 KB Output is correct
43 Correct 39 ms 3924 KB Output is correct
44 Correct 34 ms 3924 KB Output is correct
45 Correct 25 ms 3924 KB Output is correct
46 Correct 24 ms 3924 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 15 ms 29520 KB Output is correct
7 Correct 19 ms 35124 KB Output is correct
8 Correct 19 ms 37444 KB Output is correct
9 Correct 19 ms 37392 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 4052 KB Output is correct
45 Correct 2 ms 4052 KB Output is correct
46 Correct 40 ms 4052 KB Output is correct
47 Correct 14 ms 4052 KB Output is correct
48 Correct 7 ms 4152 KB Output is correct
49 Correct 29 ms 4052 KB Output is correct
50 Correct 37 ms 3924 KB Output is correct
51 Correct 26 ms 3924 KB Output is correct
52 Correct 39 ms 3924 KB Output is correct
53 Correct 34 ms 3924 KB Output is correct
54 Correct 25 ms 3924 KB Output is correct
55 Correct 24 ms 3924 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 40 ms 624 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 0 ms 340 KB Output is correct
62 Correct 1 ms 724 KB Output is correct
63 Correct 15 ms 29584 KB Output is correct
64 Correct 17 ms 35140 KB Output is correct
65 Correct 19 ms 37396 KB Output is correct
66 Correct 18 ms 37392 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 0 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 0 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 1 ms 340 KB Output is correct
81 Correct 0 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 2 ms 4052 KB Output is correct
85 Correct 2 ms 4052 KB Output is correct
86 Correct 31 ms 4052 KB Output is correct
87 Correct 13 ms 4088 KB Output is correct
88 Correct 5 ms 4052 KB Output is correct
89 Correct 28 ms 4076 KB Output is correct
90 Correct 33 ms 3924 KB Output is correct
91 Correct 24 ms 3924 KB Output is correct
92 Correct 30 ms 4024 KB Output is correct
93 Correct 37 ms 3924 KB Output is correct
94 Correct 26 ms 4016 KB Output is correct
95 Correct 31 ms 3924 KB Output is correct
96 Correct 1950 ms 37660 KB Output is correct
97 Correct 24 ms 468 KB Output is correct
98 Incorrect 996 ms 37600 KB Output isn't correct
99 Halted 0 ms 0 KB -