제출 #605594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
605594		duality	Boarding Passes (BOI22_passes)	C++17	100 / 100	353 ms	377004 KiB

passes

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

char s[100001];
LLI pre[100001][15],pre2[100001][15][15];
LLI suff[100001][15],suff2[100001][15][15];
LLI dp[1 << 15];
vi occ[15];
int main() {
    scanf("%s",s);

    int i,j,k;
    int N = strlen(s),G = *max_element(s,s+N)-'A'+1;
    for (i = 0; i < N; i++) {
        for (j = 0; j < G; j++) pre[i+1][j] = pre[i][j];
        pre[i+1][s[i]-'A']++;
        for (j = 0; j < G; j++) {
            for (k = 0; k < G; k++) pre2[i+1][j][k] = pre2[i][j][k];
        }
        for (j = 0; j < G; j++) pre2[i+1][j][s[i]-'A'] += pre[i][j];
    }
    for (i = N-1; i >= 0; i--) {
        for (j = 0; j < G; j++) suff[i][j] = suff[i+1][j];
        suff[i][s[i]-'A']++;
        for (j = 0; j < G; j++) {
            for (k = 0; k < G; k++) suff2[i][j][k] = suff2[i+1][j][k];
        }
        for (j = 0; j < G; j++) suff2[i][j][s[i]-'A'] += suff[i+1][j];
    }
    for (i = 0; i < N; i++) occ[s[i]-'A'].pb(i);
    for (i = 0; i < G; i++) occ[i].pb(N);
    fill(dp,dp+(1 << G),1e18);
    dp[0] = 0;
    for (i = 0; i < (1 << G); i++) {
        for (j = 0; j < G; j++) {
            if (!(i & (1 << j))) {
                int l = 0,r = occ[j].size()-1;
                while (l < r) {
                    int m = (l+r) / 2;

                    LLI c1 = pre2[occ[j][m]][j][j]+suff2[occ[j][m]][j][j];
                    LLI c2 = pre2[occ[j][m+1]][j][j]+suff2[occ[j][m+1]][j][j];
                    for (k = 0; k < G; k++) {
                        if (i & (1 << k)) {
                            c1 += 2*pre2[occ[j][m]][k][j]+2*suff2[occ[j][m]][k][j];
                            c2 += 2*pre2[occ[j][m+1]][k][j]+2*suff2[occ[j][m+1]][k][j];
                        }
                    }
                    if (c1 < c2) r = m;
                    else l = m+1;
                }
                LLI c = pre2[occ[j][l]][j][j]+suff2[occ[j][l]][j][j];
                for (k = 0; k < G; k++) {
                    if (i & (1 << k)) c += 2*pre2[occ[j][l]][k][j]+2*suff2[occ[j][l]][k][j];
                }
                dp[i | (1 << j)] = min(dp[i | (1 << j)],dp[i]+c);
            }
        }
    }
    printf("%lld.%c\n",dp[(1 << G)-1]/2,(dp[(1 << G)-1] & 1) ? '5':'0');

    return 0;
}

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

passes.cpp: In function 'int main()':
passes.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     scanf("%s",s);
      |     ~~~~~^~~~~~~~

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