제출 #1191103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1191103		shadow_sami	Boarding Passes (BOI22_passes)	C++20	60 / 100	2097 ms	16900 KiB

passes

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifdef SAMI
	#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
	#define debg() cerr<<nli;
#else
	#define debug(x)
	#define debg() 
#endif


void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
string s;
bool mark[mx];
ld pref[mx];
ld suf[mx];
vi lis[mx];
ld dp[1<<16];
ll to[mx];

ld get(ld aa,ld bb){
	ld rss = aa * (aa-1);
	rss += bb * (bb-1);
	return (rss/4.0);
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());	
    #ifdef SAMI
        freopen("input1.txt", "r", stdin);
        freopen("output1.txt", "w", stdout);
        freopen("error1.txt", "w", stderr);
    #endif // ONLINE_JUDGE

        cin>>s;
        n = s.size();
        set<char> st;
        fx(s)
        	st.insert(x);
        tp = st.size();
        fip(0,(1<<tp))
            dp[i] = 1e18;
        dp[0] = 0;       
        cnt = 0;
        fx(st){
            to[cnt] = x-'A';
            cnt++;
        }
        fip(0,n)
        	lis[s[i]-'A'].push_back(i);        
        cnt = 0;
        fip(1,1<<tp){
        	// v = {1,4,3,6,5};    
            fjp(0,tp){
                if(i & (1<<j))
                    mark[to[j]] = 1;
                else
                    mark[to[j]] = 0;
            }    	
            fjp(0,tp){
                ld rs = 0;                
                if(i & (1<<j)){                    
                    tp2 = i-(1<<j);             
                    ll x = to[j];                    
                    mark[x] = 0;
                    cnt = 0;
                    fip(0,n){                   
                        pref[i] = (s[i]-'A'==x?cnt:0ll) + (i?pref[i-1]:0);
                        if(mark[s[i]-'A'])
                            cnt++;
                    }      
                    cnt = 0;                
                    suf[n] = 0;
                    rs = 1e18;
                    fin(n-1,0){                 
                        suf[i] = (s[i]-'A'==x?cnt:0ll) + suf[i+1];
                        if(mark[s[i]-'A'])
                            cnt++;
                    }
                    cnt = 0;                    
                    fip(0,n)
                        if(s[i]-'A' == x)
                            cnt++;                    
                    rs = suf[lis[x][0]] + get(0,cnt);
                    rs = min(rs,pref[lis[x][lis[x].size()-1]] + get(0,cnt));
                    fip(0,(ll)lis[x].size()-1)
                        rs = min(rs,pref[lis[x][i]]+suf[lis[x][i+1]]+get(i+1,cnt-i-1));                
                    mark[x] = 1;
                    dp[i] = min(dp[i],dp[tp2]+rs);
                }
            }        	
        }
        tp = (1ll<<tp) - 1;
        cout<<setprecision(20)<<dp[tp]<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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