oj.uz

Submission #580194

# Submission time Handle Problem Language Result Execution time Memory
580194 2022-06-20T17:19:49 Z Josia Boarding Passes (BOI22_passes) C++14
30 / 100
 67 ms 2956 KB 
#include <bits/stdc++.h>

using namespace std;

#define int int64_t

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    string s; cin >> s;

    int n = s.size();

    vector<vector<int>> groupsAlph(26);

    for (int i = 0; i<n; i++) {
        groupsAlph[s[i]-'A'].push_back(i);
    }

    vector<vector<int>> groups;
    for (auto i: groupsAlph) {
        if (i.size()) groups.push_back(i);
    }

    if (n > 100) {
        int n1 = (n/2);
        int n2 = ((n+1)/2);

        long double res = (n1-1)*n1 + (n2-1)*n2;

        res /= 4;

        cout << setprecision(30) << res << "\n";
        return 0;
    }

    sort(groups.begin(), groups.end());
    double res = 1e18;
    do {
        // for (auto i: groups) {for (int j: i) cerr << j << " "; cerr << "\n";}

        vector<bool> isset(n);
        double blubblubres = 0;                                                 // with this permutation of groups
        for (int i = 0; i<groups.size(); i++) {
            vector<int> pfs = {0};
            for (int j = 0; j<n; j++) pfs.push_back(isset[j] + pfs.back());


            double blubres = 1e18;                                              // find best offset for this group and current situation
            for (int j = 0; j<=groups[i].size(); j++) {
                int n1 = j;
                int n2 = groups[i].size()-j;

                double tmpres = ((n1-1)*n1 + (n2-1)*n2)/4.0;                    // current selected offset

                for (int k = 0; k<n1; k++) {
                    tmpres += pfs[groups[i][k]+1];
                }
                for (int k = n1; k<groups[i].size(); k++) {
                    tmpres += pfs.back() - pfs[groups[i][k]];
                }

                blubres = min(blubres, tmpres);
            }
            blubblubres += blubres;

            for (int j: groups[i]) isset[j] = 1;
        }
        // cerr << blubblubres << "-----------\n\n";
        res = min(res, blubblubres);
    } while (next_permutation(groups.begin(), groups.end()));

    
    cout << setprecision(100) << res << "\n";

    return 0;
}

Compilation message

passes.cpp: In function 'int main()':
passes.cpp:45:26: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::vector<long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int i = 0; i<groups.size(); i++) {
      |                         ~^~~~~~~~~~~~~~
passes.cpp:51:30: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |             for (int j = 0; j<=groups[i].size(); j++) {
      |                             ~^~~~~~~~~~~~~~~~~~
passes.cpp:60:35: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |                 for (int k = n1; k<groups[i].size(); k++) {
      |                                  ~^~~~~~~~~~~~~~~~~

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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 2444 KB Output is correct
7 Correct 3 ms 2828 KB Output is correct
8 Correct 3 ms 2924 KB Output is correct
9 Correct 2 ms 2956 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 1 ms 212 KB Output is correct
3 Correct 27 ms 212 KB Output is correct
4 Correct 24 ms 212 KB Output is correct
5 Correct 66 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 21 ms 316 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 11 ms 316 KB Output is correct
12 Correct 10 ms 320 KB Output is correct
13 Correct 11 ms 324 KB Output is correct
14 Correct 9 ms 212 KB Output is correct
15 Correct 10 ms 212 KB Output is correct
16 Correct 10 ms 324 KB Output is correct
17 Correct 9 ms 316 KB Output is correct

Subtask #3
0 / 30.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 27 ms 212 KB Output is correct
4 Correct 24 ms 212 KB Output is correct
5 Correct 66 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 21 ms 316 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 11 ms 316 KB Output is correct
12 Correct 10 ms 320 KB Output is correct
13 Correct 11 ms 324 KB Output is correct
14 Correct 9 ms 212 KB Output is correct
15 Correct 10 ms 212 KB Output is correct
16 Correct 10 ms 324 KB Output is correct
17 Correct 9 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 26 ms 212 KB Output is correct
21 Correct 26 ms 212 KB Output is correct
22 Correct 67 ms 212 KB Output is correct
23 Correct 6 ms 212 KB Output is correct
24 Correct 22 ms 316 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 9 ms 212 KB Output is correct
27 Correct 10 ms 212 KB Output is correct
28 Correct 10 ms 212 KB Output is correct
29 Correct 10 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 9 ms 320 KB Output is correct
32 Correct 9 ms 212 KB Output is correct
33 Correct 9 ms 212 KB Output is correct
34 Correct 10 ms 212 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Incorrect 1 ms 468 KB Output isn't correct
38 Halted 0 ms 0 KB -

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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 2444 KB Output is correct
7 Correct 3 ms 2828 KB Output is correct
8 Correct 3 ms 2924 KB Output is correct
9 Correct 2 ms 2956 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 27 ms 212 KB Output is correct
13 Correct 24 ms 212 KB Output is correct
14 Correct 66 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct
16 Correct 21 ms 316 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 9 ms 212 KB Output is correct
19 Correct 9 ms 212 KB Output is correct
20 Correct 11 ms 316 KB Output is correct
21 Correct 10 ms 320 KB Output is correct
22 Correct 11 ms 324 KB Output is correct
23 Correct 9 ms 212 KB Output is correct
24 Correct 10 ms 212 KB Output is correct
25 Correct 10 ms 324 KB Output is correct
26 Correct 9 ms 316 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 26 ms 212 KB Output is correct
30 Correct 26 ms 212 KB Output is correct
31 Correct 67 ms 212 KB Output is correct
32 Correct 6 ms 212 KB Output is correct
33 Correct 22 ms 316 KB Output is correct
34 Correct 2 ms 212 KB Output is correct
35 Correct 9 ms 212 KB Output is correct
36 Correct 10 ms 212 KB Output is correct
37 Correct 10 ms 212 KB Output is correct
38 Correct 10 ms 212 KB Output is correct
39 Correct 9 ms 212 KB Output is correct
40 Correct 9 ms 320 KB Output is correct
41 Correct 9 ms 212 KB Output is correct
42 Correct 9 ms 212 KB Output is correct
43 Correct 10 ms 212 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Incorrect 1 ms 468 KB Output isn't correct
47 Halted 0 ms 0 KB -