結果

問題 No.145 yukiover
ユーザー fumiphysfumiphys
提出日時 2019-09-16 00:08:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3 ms / 5,000 ms
コード長 4,410 bytes
コンパイル時間 1,558 ms
コンパイル使用メモリ 170,160 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-06 22:53:10
合計ジャッジ時間 2,453 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 3 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 3 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  int n;
  cin >> n;
  string s;
  cin >> s;
  vector<int> cnt(26, 0);
  rep(i, n){
    cnt[int(s[i] - 'a')]++;
  }
  int Y = int('y' - 'a');
  int U = int('u' - 'a');
  int K = int('k' - 'a');
  int I = int('i' - 'a');
  int res = 0;
  // z
  res += cnt[25];
  cnt[25] = 0;

  // y*
  int sum = 0;
  for(int i = U + 1; i < 24; i++){
    sum += cnt[i];
  }
  if(cnt[24] <= sum){
    sum = cnt[24];
  }
  cnt[24] -= sum;
  res += sum;

  // yu*
  sum = 0;
  for(int i = K + 1; i < U; i++){
    sum += cnt[i];
  }
  if(min(cnt[U], cnt[Y]) <= sum){
    sum = min(cnt[U], cnt[Y]);
  }
  res += sum;
  cnt[U] -= sum;
  cnt[Y] -= sum;

  // yuk*
  sum = 0;
  for(int i = I + 1; i < K; i++){
    sum += cnt[i];
  }
  if(min(cnt[U], min(cnt[Y], cnt[K])) <= sum){
    sum = min(cnt[U], min(cnt[Y], cnt[K]));
  }
  res += sum;
  cnt[U] -= sum;
  cnt[Y] -= sum;
  cnt[K] -= sum;

  // yuki*
  sum = 0;
  for(int i = 0; i < I; i++){
    sum += cnt[i];
  }
  if(min({cnt[Y], cnt[U], cnt[K], cnt[I]}) <= sum){
    sum = min({cnt[Y], cnt[U], cnt[K], cnt[I]});
  }
  res += sum;
  cnt[Y] -= sum;
  cnt[U] -= sum;
  cnt[K] -= sum;
  cnt[I] -= sum;

  int tmp = min({cnt[Y], cnt[U], cnt[K], cnt[I], cnt[I] / 2});
  res += tmp;
  cnt[Y] -= tmp;
  cnt[U] -= tmp;
  cnt[K] -= tmp;

  tmp = min({cnt[Y], cnt[U], cnt[K], cnt[K] / 2});
  res += tmp;
  cnt[Y] -= tmp;
  cnt[U] -= tmp;

  tmp = min({cnt[Y], cnt[U], cnt[U] / 2});
  res += tmp;
  cnt[Y] -= tmp;

  res += cnt[Y] / 2;

  cout << res << endl;
  return 0;
}
0