제출 #573960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
573960		JovanB	Boarding Passes (BOI22_passes)	C++17	0 / 100	1 ms	1236 KiB

passes

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

const int N = 100000;
const int C = 15;

ll dp[N+5];

vector <int> vec[C+1];

ll levo[C+1][N+5];
ll desno[C+1][N+5];
ll plevo[C+1][N+5];
ll pdesno[C+1][N+5];

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    string s;
    cin >> s;
    int n = s.size();
    for(int i=0; i<n; i++){
        vec[s[i] - 'A'].push_back(i + 1);
    }
    for(int i=0; i<C; i++){
        for(int j=0; j<C; j++){
            if(i == j){
                ll p = 0;
                for(int k=0; k<vec[j].size(); k++){
                    levo[i][vec[j][k]] = p;
                    plevo[i][vec[j][k]] = p*(p+1)/2;
                    p++;
                }
                p = 0;
                for(int k=int(vec[j].size())-1; k>=0; k--){
                    desno[i][vec[j][k]] = p;
                    pdesno[i][vec[j][k]] = p*(p+1)/2;
                    p++;
                }
            }
            else{
                ll tr = 0;
                int d = 0;
                for(int k=0; k<vec[j].size(); k++){
                    while(d < vec[i].size() && vec[i][d] < vec[j][k]){
                        d++;
                    }
                    levo[i][vec[j][k]] = 2*d;
                    tr += 2*d;
                    plevo[i][vec[j][k]] = tr;
                }
                tr = 0, d = int(vec[i].size()) - 1;
                for(int k=int(vec[j].size())-1; k>=0; k--){
                    while(d >= 0 && vec[i][d] > vec[j][k]){
                        d--;
                    }
                    desno[i][vec[j][k]] = 2*(int(vec[i].size()) - d - 1);
                    tr += 2*(int(vec[i].size()) - d - 1);
                    pdesno[i][vec[j][k]] = tr;
                }
            }
        }
    }
    for(int mask=1; mask<(1<<C); mask++){
        dp[mask] = 1e18;
        bool em = 0;
        for(int i=0; i<C; i++){
            if((mask & (1 << i)) && vec[i].size() == 0){
                dp[mask] = dp[mask ^ (1 << i)];
                em = 1;
                break;
            }
        }
        if(em) continue;
        for(int i=0; i<C; i++){
            if(!((1 << i) & mask)) continue;
            int sub = mask ^ (1 << i);
            int l = 0, r = vec[i].size() - 1, d = -1;
            while(l <= r){
                int mid = (l+r)/2;
                ll ul = 0, ud = 0;
                for(int j=0; j<C; j++){
                    if(mask & (1 << j)){
                        ul += levo[j][vec[i][mid]];
                        ud += desno[j][vec[i][mid]];
                    }
                }
                if(ul <= ud){
                    d = mid;
                    l = mid + 1;
                }
                else r = mid - 1;
            }
            ll tot = 0;
            for(int j=0; j<C; j++){
                if(mask & (1 << j)){
                    if(d >= 0) tot += plevo[j][vec[i][d]];
                    if(d < int(vec[i].size()) - 1) tot += pdesno[j][vec[i][d+1]];
                }
            }
            dp[mask] = min(dp[mask], dp[sub] + tot);
        }
    }
    cout << 1.0*dp[(1<<C)-1]/2 << "\n";
    return 0;
}

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

passes.cpp: In function 'int main()':
passes.cpp:34:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |                 for(int k=0; k<vec[j].size(); k++){
      |                              ~^~~~~~~~~~~~~~
passes.cpp:49:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 for(int k=0; k<vec[j].size(); k++){
      |                              ~^~~~~~~~~~~~~~
passes.cpp:50:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |                     while(d < vec[i].size() && vec[i][d] < vec[j][k]){
      |                           ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 25
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40