oj.uz

Submission #600846

# Submission time Handle Problem Language Result Execution time Memory
600846 2022-07-21T08:16:33 Z alextodoran Boarding Passes (BOI22_passes) C++17
60 / 100
 2000 ms 2528 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;
    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 pref[N_MAX], suff[N_MAX];

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();
//    cout << N << " " << G << "\n";
//    for (int i = 0; i < N; i++) {
//        cout << group[i] << " ";
//    }
//    cout << "\n";

    fill(minEV, minEV + (1 << G), LLONG_MAX);
    minEV[0] = 0;
    for (int mask = 0; mask < (1 << G) - 1; mask++) {
        for (int i = 0; i < N; i++) {
            pref[i] = (i > 0 ? pref[i - 1] : 0) + ((mask >> group[i]) & 1);
        }
        for (int i = N - 1; i >= 0; i--) {
            suff[i] = (i < N - 1 ? suff[i + 1] : 0) + ((mask >> group[i]) & 1);
        }
        for (int g = 0; g < G; g++) {
            if (((mask >> g) & 1) == 0) {
                ll add = 0;
                for (int i = 0; i < (int) inGroup[g].size(); i++) {
                    add += 2 * suff[inGroup[g][i]];
                }
                for (int cntL = 0; cntL <= (int) inGroup[g].size(); cntL++) {
                    int cntR = (int) inGroup[g].size() - cntL;
                    update(minEV[mask | (1 << g)], minEV[mask]
                        + (add + (ll) cntL * (cntL - 1) / 2 + (ll) cntR * (cntR - 1) / 2));
                    if (cntL < inGroup[g].size()) {
                        add -= 2 * suff[inGroup[g][cntL]];
                        add += 2 * pref[inGroup[g][cntL]];
                    }
                }
            }
        }
    }
    ll answer = minEV[(1 << G) - 1];
    if (answer % 2 == 0) {
        cout << answer / 2 << "\n";
    } else {
        cout << answer / 2 << ".5\n";
    }

    return 0;
}

Compilation message

passes.cpp: In function 'int main()':
passes.cpp:87:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |                     if (cntL < inGroup[g].size()) {
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 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 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 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 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 0 ms 340 KB Output is correct
17 Correct 0 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 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 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 55 ms 468 KB Output is correct
38 Correct 56 ms 524 KB Output is correct
39 Correct 55 ms 596 KB Output is correct
40 Correct 56 ms 468 KB Output is correct
41 Correct 56 ms 556 KB Output is correct
42 Correct 56 ms 556 KB Output is correct
43 Correct 58 ms 552 KB Output is correct
44 Correct 59 ms 536 KB Output is correct
45 Correct 56 ms 552 KB Output is correct
46 Correct 55 ms 468 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 4 ms 1808 KB Output is correct
7 Correct 4 ms 2064 KB Output is correct
8 Correct 3 ms 2192 KB Output is correct
9 Correct 4 ms 2192 KB Output is correct
10 Correct 1 ms 356 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 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 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 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 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 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 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 1 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 1 ms 292 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 55 ms 468 KB Output is correct
47 Correct 56 ms 524 KB Output is correct
48 Correct 55 ms 596 KB Output is correct
49 Correct 56 ms 468 KB Output is correct
50 Correct 56 ms 556 KB Output is correct
51 Correct 56 ms 556 KB Output is correct
52 Correct 58 ms 552 KB Output is correct
53 Correct 59 ms 536 KB Output is correct
54 Correct 56 ms 552 KB Output is correct
55 Correct 55 ms 468 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 8 ms 596 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 3 ms 1944 KB Output is correct
64 Correct 4 ms 2192 KB Output is correct
65 Correct 4 ms 2320 KB Output is correct
66 Correct 3 ms 2328 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 1 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 336 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 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 0 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 336 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 592 KB Output is correct
85 Correct 2 ms 468 KB Output is correct
86 Correct 69 ms 548 KB Output is correct
87 Correct 65 ms 468 KB Output is correct
88 Correct 54 ms 592 KB Output is correct
89 Correct 54 ms 468 KB Output is correct
90 Correct 62 ms 556 KB Output is correct
91 Correct 63 ms 548 KB Output is correct
92 Correct 55 ms 552 KB Output is correct
93 Correct 57 ms 540 KB Output is correct
94 Correct 55 ms 468 KB Output is correct
95 Correct 56 ms 468 KB Output is correct
96 Execution timed out 2058 ms 2528 KB Time limit exceeded
97 Halted 0 ms 0 KB -