結果

問題 No.910 素数部分列
ユーザー ningenMeningenMe
提出日時 2020-01-04 17:14:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 10 ms / 1,000 ms
コード長 3,296 bytes
コンパイル時間 1,699 ms
コンパイル使用メモリ 173,512 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-22 20:52:49
合計ジャッジ時間 3,871 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 2 ms
6,816 KB
testcase_09 AC 3 ms
6,816 KB
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 2 ms
6,816 KB
testcase_14 AC 2 ms
6,820 KB
testcase_15 AC 2 ms
6,816 KB
testcase_16 AC 2 ms
6,816 KB
testcase_17 AC 2 ms
6,816 KB
testcase_18 AC 2 ms
6,820 KB
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 2 ms
6,816 KB
testcase_21 AC 2 ms
6,816 KB
testcase_22 AC 2 ms
6,816 KB
testcase_23 AC 9 ms
6,816 KB
testcase_24 AC 9 ms
6,816 KB
testcase_25 AC 8 ms
6,820 KB
testcase_26 AC 8 ms
6,816 KB
testcase_27 AC 8 ms
6,816 KB
testcase_28 AC 9 ms
6,816 KB
testcase_29 AC 9 ms
6,820 KB
testcase_30 AC 9 ms
6,816 KB
testcase_31 AC 8 ms
6,820 KB
testcase_32 AC 8 ms
6,820 KB
testcase_33 AC 8 ms
6,816 KB
testcase_34 AC 9 ms
6,820 KB
testcase_35 AC 9 ms
6,816 KB
testcase_36 AC 8 ms
6,816 KB
testcase_37 AC 9 ms
6,816 KB
testcase_38 AC 9 ms
6,816 KB
testcase_39 AC 9 ms
6,816 KB
testcase_40 AC 8 ms
6,820 KB
testcase_41 AC 9 ms
6,816 KB
testcase_42 AC 8 ms
6,820 KB
testcase_43 AC 10 ms
6,816 KB
testcase_44 AC 9 ms
6,816 KB
testcase_45 AC 9 ms
6,816 KB
testcase_46 AC 9 ms
6,820 KB
testcase_47 AC 9 ms
6,816 KB
testcase_48 AC 7 ms
6,820 KB
testcase_49 AC 8 ms
6,820 KB
testcase_50 AC 8 ms
6,816 KB
testcase_51 AC 7 ms
6,816 KB
testcase_52 AC 8 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> inline void chmax(T& a, const T b){a=max(a,b);}
template <class T> inline void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	string S; cin >> S;
	int ans = 0;
	string T;
	for(int i = 0; i < N; ++i){
		if(S[i]=='3' || S[i]=='5' || S[i]=='7') ans++;
		else T.push_back(S[i]);
	}
	int M = T.size();
	queue<int> q;
	for(int i = 0; i < M; ++i){
		if(T[i]=='1') q.push(i);
		if(T[i]=='9' && q.size()){
			int j = q.front();
			q.pop();
			T[i] = T[j] = '0';
			ans++;
		}
	}
	int c9=0,c1=0;
	for(int i = 0; i < M; ++i){
		if(T[i]=='9') c9++;
		if(T[i]=='1') c1++;
	}
	int m = min(c9/2,c1);
	ans += m;
	c1 -= m;
	ans += (c1/2);
	cout << ans << endl;
}
0