제출 #739257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739257		edogawa_something	Boarding Passes (BOI22_passes)	C++17	60 / 100	1757 ms	17156 KiB

passes

#include<bits/stdc++.h>
#include<chrono>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define test1 ll qqqqq=1;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(int i=0;i<n;i++)
#define forx(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define ub upper_bound
#define pow powww
#define prtll(x) printf("%lld",x)
#define prtld(x) printf("%Lf",x)
#define prtst(x) printf("%s",x)
#define prtch(x) printf("%c",x)
#define measure chrono::high_resolution_clock::now()
#define duration chrono::duration_cast<chrono::milliseconds>(end-start)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
const ll dx[]{1,0,-1,0,1,-1,1,-1};
const ll dy[]{0,-1,0,1,1,-1,-1,1};
const ll inf=1e18;
const ll mod=1e9+7;
const ll LM=1e8+1;
const ll M=2e7+10;
const ll MM=2002;
const ll MMM=501;
const ld pi=acos(-1);
//const ll mod=998244353;
ll pow(ll r,ll to,ll m=mod){
  ll res=1;
  r%=m;
  while(to){
    if((to&1)){
      res*=r,res%=m;
    }
    r*=r,r%=m;
    to=(to>>1);
  }
  return res;
}
ld n,dp[M];
ll cnt[20];
string s;
bl mp[M];
int main(){
  fast
  //freopen("gen.txt","r",stdin);
  auto start=measure;
  test1{
    cin>>s;
    for(auto it:s){
      cnt[it-'A']++;
    }
    n=s.size();
    forn(i,(1<<20))
    dp[i]=n*n*n;
    dp[0]=0; 
    forn(i,(1<<10)){
      ll cc=0;
      forn(j,n){
        if(((1<<(s[j]-'A'))&i))
        mp[j]=1;
        else
        mp[j]=0;
        cc+=mp[j];
      }
      forn(bit,10){
        ld res=0;
        if(((1<<bit)&i)==0){
          ll c=0;
          ll ccc=0;
          forn(j,n){
            if(ll(s[j])==bit+'A')
            res+=min(ld(c)/ld(2)+ld(ccc),(ld(cnt[bit]-c-1)/ld(2))+ld(cc)-ld(ccc));
            ccc+=mp[j];
            c+=bl(ll(s[j])==(bit+'A'));
          }
          dp[(i|(1<<bit))]=min(dp[(i|(1<<bit))],dp[i]+res);
        }
      }
    }
    cout<<fixed<<dp[(1<<10)-1]<<'\n';
  }
  auto end=measure;
  auto dur=duration;
  //cout<<fixed<<dur.count()<<'\n';
  return 0;
}
/*
*/

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