oj.uz

Submission #580190

# Submission time Handle Problem Language Result Execution time Memory
580190 2022-06-20T17:18:45 Z Josia Boarding Passes (BOI22_passes) C++14
25 / 100
 2000 ms 3236 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);
    }

    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:33: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]
   33 |         for (int i = 0; i<groups.size(); i++) {
      |                         ~^~~~~~~~~~~~~~
passes.cpp:39: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]
   39 |             for (int j = 0; j<=groups[i].size(); j++) {
      |                             ~^~~~~~~~~~~~~~~~~~
passes.cpp:48: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]
   48 |                 for (int k = n1; k<groups[i].size(); k++) {
      |                                  ~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 2 ms 340 KB Output is correct
6 Execution timed out 2096 ms 3236 KB Time limit exceeded
7 Halted 0 ms 0 KB -

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 29 ms 212 KB Output is correct
4 Correct 27 ms 212 KB Output is correct
5 Correct 71 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 23 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 9 ms 316 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 10 ms 212 KB Output is correct
12 Correct 9 ms 312 KB Output is correct
13 Correct 9 ms 212 KB Output is correct
14 Correct 9 ms 320 KB Output is correct
15 Correct 11 ms 212 KB Output is correct
16 Correct 10 ms 212 KB Output is correct
17 Correct 11 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 0 ms 212 KB Output is correct
3 Correct 29 ms 212 KB Output is correct
4 Correct 27 ms 212 KB Output is correct
5 Correct 71 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 23 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 9 ms 316 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 10 ms 212 KB Output is correct
12 Correct 9 ms 312 KB Output is correct
13 Correct 9 ms 212 KB Output is correct
14 Correct 9 ms 320 KB Output is correct
15 Correct 11 ms 212 KB Output is correct
16 Correct 10 ms 212 KB Output is correct
17 Correct 11 ms 316 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 34 ms 212 KB Output is correct
21 Correct 26 ms 212 KB Output is correct
22 Correct 68 ms 304 KB Output is correct
23 Correct 7 ms 212 KB Output is correct
24 Correct 24 ms 212 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 14 ms 324 KB Output is correct
27 Correct 11 ms 316 KB Output is correct
28 Correct 10 ms 212 KB Output is correct
29 Correct 9 ms 212 KB Output is correct
30 Correct 10 ms 212 KB Output is correct
31 Correct 9 ms 212 KB Output is correct
32 Correct 10 ms 316 KB Output is correct
33 Correct 10 ms 212 KB Output is correct
34 Correct 11 ms 212 KB Output is correct
35 Correct 109 ms 688 KB Output is correct
36 Correct 116 ms 596 KB Output is correct
37 Execution timed out 2081 ms 888 KB Time limit exceeded
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 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 2 ms 340 KB Output is correct
6 Execution timed out 2096 ms 3236 KB Time limit exceeded
7 Halted 0 ms 0 KB -