結果

問題 No.145 yukiover
ユーザー raven7959
提出日時 2022-12-15 10:33:19
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 25 ms / 5,000 ms
コード長 3,758 bytes
コンパイル時間 1,937 ms
コンパイル使用メモリ 198,688 KB
最終ジャッジ日時 2025-02-09 13:51:05
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvc = vector<vector<char>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
const int INF = 1e9;
const ll LINF = 2e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
bool ispow2(int i) { return i && (i & -i) == i; }
bool ispow2(ll i) { return i && (i & -i) == i; }
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < int(v.size()) - 1) os << ' ';
    }
    return os;
}
static uint32_t RandXor(){
    static uint32_t x=123456789;
    static uint32_t y=362436069;
    static uint32_t z=521288629;
    static uint32_t w=88675123;
    uint32_t t;
 
    t=x^(x<<11);
    x=y; y=z; z=w;
    return w=(w^(w>>19))^(t^(t>>8));
}
static double Rand01(){
    return (RandXor()+0.5)*(1.0/UINT_MAX);
}
void solve(){
    int N;
    cin>>N;
    string S;
    cin>>S;
    int a=0,b=0,c=0,d=0,e=0,A=0,B=0,C=0,D=0;
    rep(i,N){
        if(S[i]>'y') a++;
        else if(S[i]=='y') A++;
        else if(S[i]>'u') b++;
        else if(S[i]=='u') B++;
        else if(S[i]>'k') c++;
        else if(S[i]=='k') C++;
        else if(S[i]>'i') d++;
        else if(S[i]=='i') D++;
        else e++;
    }
    int ans=a;
    a=0;
    ans+=min(A,b);
    int tmp=min(A,b);
    A-=tmp;
    b-=tmp;
    ans+=min({A,B,c});
    tmp=min({A,B,c});
    A-=tmp;
    B-=tmp;
    c-=tmp;
    ans+=min({A,B,C,d});
    tmp=min({A,B,C,d});
    A-=tmp;
    B-=tmp;
    C-=tmp;
    d-=tmp;
    ans+=min({A,B,C,D,e});
    tmp=min({A,B,C,D,e});
    A-=tmp;
    B-=tmp;
    C-=tmp;
    D-=tmp;
    e-=tmp;
    e+=(D+1)/2;
    D-=(D+1)/2;
    ans+=min({A,B,C,D,e});
    tmp=min({A,B,C,D,e});
    A-=tmp;
    B-=tmp;
    C-=tmp;
    D-=tmp;
    e-=tmp;
    d+=(C+1)/2;
    C-=(C+1)/2;
    ans+=min({A,B,C,d});
    tmp=min({A,B,C,d});
    A-=tmp;
    B-=tmp;
    C-=tmp;
    d-=tmp;
    c+=(B+1)/2;
    B-=(B+1)/2;
    ans+=min({A,B,c});
    tmp=min({A,B,c});
    A-=tmp;
    B-=tmp;
    c-=tmp;
    b+=(A+1)/2;
    A-=(A+1)/2;
    ans+=min(A,b);
    tmp=min(A,b);
    A-=tmp;
    b-=tmp;
    cout<<ans<<"\n";
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0