結果

問題 No.910 素数部分列
ユーザー Haar
提出日時 2019-10-18 22:14:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 9 ms / 1,000 ms
コード長 3,028 bytes
コンパイル時間 3,108 ms
コンパイル使用メモリ 202,284 KB
最終ジャッジ日時 2025-01-07 22:57:08
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))
#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif
#define gcd __gcd
using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}
template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}
struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;
int main(){
  int n;
  string s;
  while(cin >> n >> s){
    int ans = 0;
    {
      dump(s);
      string t;
      REP(i,n){
        if(s[i] == '3' or s[i] == '5' or s[i] == '7'){
          ans += 1;
        }else{
          t += s[i];
        }
      }
      s = t;
      n = s.size();
    }
    {
      dump(s);
      vector<int> check(n);
      stack<int> one;
    
      REP(i,n){
        if(s[i] == '1'){
          one.push(i);
        }else{
          if(one.size()){
            int j = one.top(); one.pop();
            check[j] = true;
            check[i] = true;
          
            ans += 1;
          }
        }
      }
      string t;
      REP(i,n){
        if(not check[i]) t += s[i];
      }
      s = t;
      n = s.size();
    }
    {
      dump(s);
      int one = count(ALL(s), '1');
      int nine = count(ALL(s), '9');
      int k = min(one, nine/2);
      
      ans += k;
      s = string(nine - k*2, '9') + string(one-k, '1');
      n = s.size();
    }
    {
      dump(s);
      vector<int> check(n);
      stack<int> one;
      REP(i,n){
        if(s[i] == '1'){
          if(one.size()){
            int j = one.top(); one.pop();
            check[j] = true;
            check[i] = true;
            
            ans += 1;
          }else{
            one.push(i);
          }
        }
      }
      string t;
      REP(i,n){
        if(not check[i]) t += s[i];
      }
      s = t;
      n = s.size();
    }
    cout << ans << endl;
  }
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0