제출 #625535

#제출 시각아이디문제언어결과실행 시간메모리
625535Ooops_sorryBoarding Passes (BOI22_passes)C++14
60 / 100
2054 ms354140 KiB
#include<bits/stdc++.h>

using namespace std;

mt19937 rnd(51);

#define ll long long
#define pb push_back
#define ld long double

const int G = 15, N = 1e5 + 10;
const ld INF = 1e18;
ll L[G][G][N], R[G][G][N];
vector<int> pos[G];
int g;

//a * (a - 1) / 4

ld func(int a) {
    return (ld)a * (a - 1) / 4;
}

ll take_val(int mask, int j, int ind, bool f) {
    if (ind < 0 || ind >= pos[j].size()) return 0;
    ll res = 0;
    for (int i = 0; i < g; i++) {
        if (mask & (1 << i)) {
            if (!f) {
                res += L[j][i][pos[j][ind]];
            } else {
                res += R[j][i][pos[j][ind]];
            }
        }
    }
    return res;
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    string s;
    cin >> s;
    int n = s.size();
    vector<int> a(n);
    map<char, int> mp;
    for (int i = 0; i < s.size(); i++) {
        if (mp.count(s[i]) == 0) {
            mp[s[i]] = mp.size();
        }
        a[i] = mp[s[i]];
    }
    g = mp.size();
    vector<ld> dp((1 << g), INF);
    for (int i = 0; i < n; i++) {
        pos[a[i]].pb(i);
    }
    for (int i = 0; i < g; i++) {
        for (int l = 0; l < g; l++) {
            ll cnt = 0, res = 0;
            for (int j = 0; j < n; j++) {
                if (i == a[j]) {
                    res += cnt;
                    L[i][l][j] = res;
                } else if (l == a[j]){
                    cnt++;
                }
            }
            cnt = 0, res = 0;
            for (int j = n - 1; j >= 0; j--) {
                if (i == a[j]) {
                    res += cnt;
                    R[i][l][j] = res;
                } else if (l == a[j]){
                    cnt++;
                }
            }
        }
    }
    dp[0] = 0;
    for (int mask = 0; mask < (1 << g); mask++) {
        for (int j = 0; j < g; j++) {
            if (!(mask & (1 << j))) {
                ld bst = func(pos[j].size()) + take_val(mask, j, 0, 1);
                for (int k = 0; k < pos[j].size(); k++) {
                    ld val = func(k + 1) + func((int)(pos[j].size()) - k - 1) + take_val(mask, j, k, 0) + take_val(mask, j, k + 1, 1);
                    bst = min(bst, val);
                }
                dp[mask | (1 << j)] = min(dp[mask | (1 << j)], dp[mask] + bst);
            }
        }
    }
    cout << setprecision(30) << fixed << dp[(1 << g) - 1] << endl;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

passes.cpp: In function 'long long int take_val(int, int, int, bool)':
passes.cpp:24:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     if (ind < 0 || ind >= pos[j].size()) return 0;
      |                    ~~~~^~~~~~~~~~~~~~~~
passes.cpp: In function 'int main()':
passes.cpp:49:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
passes.cpp:87:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |                 for (int k = 0; k < pos[j].size(); k++) {
      |                                 ~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...