結果
問題 | No.910 素数部分列 |
ユーザー | tomarint |
提出日時 | 2019-10-18 22:55:49 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,643 bytes |
コンパイル時間 | 1,000 ms |
コンパイル使用メモリ | 102,464 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-25 18:27:00 |
合計ジャッジ時間 | 2,641 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | WA | - |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | WA | - |
testcase_21 | AC | 2 ms
6,944 KB |
testcase_22 | AC | 2 ms
6,944 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | AC | 6 ms
6,940 KB |
testcase_42 | WA | - |
testcase_43 | AC | 5 ms
6,944 KB |
testcase_44 | AC | 6 ms
6,940 KB |
testcase_45 | AC | 5 ms
6,940 KB |
testcase_46 | AC | 5 ms
6,940 KB |
testcase_47 | WA | - |
testcase_48 | AC | 4 ms
6,944 KB |
testcase_49 | AC | 4 ms
6,940 KB |
testcase_50 | AC | 3 ms
6,944 KB |
testcase_51 | AC | 4 ms
6,940 KB |
testcase_52 | AC | 4 ms
6,940 KB |
ソースコード
#define DEBUG 1 #include <algorithm> #include <cmath> #include <cstring> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <tuple> #include <utility> #include <vector> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using pll = pair<ll, ll>; using tll = tuple<ll, ll, ll>; #define all(v) (v).begin(), (v).end() #define for1(i, n) for (ll i = 0; i < (n); i++) #define for2(i, m, n) for (ll i = (m); i < (n); i++) #define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d)) #define rfor2(i, m, n) for (ll i = (m); i > (n); i--) #define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d)) #define INF 1111111111111111111LL #define MOD 1000000007LL // 10**9 + 7 #define print(...) print_1(__VA_ARGS__) #define in(...) in_1(__VA_ARGS__) #if DEBUG #define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__) #else #define dump(...) #endif template <typename Head> void dump_1(const char* str, Head&& h) { cerr << str << ": " << h << '\n'; } template <typename Head, typename... Tail> void dump_1(const char* str, Head&& h, Tail&&... t) { while (*str != ',') { cerr << *str++; } cerr << ": " << h << ' '; dump_1(str + 1, t...); } template <typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& v) { os << '(' << v.first << ", " << v.second << ')'; return os; } template <typename T1, typename T2, typename T3> ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v) { os << '(' << get<0>(v) << ", " << get<1>(v) << ", " << get<2>(v) << ')'; return os; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) { os << ' '; } os << *it; } return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) { os << ' '; } os << *it; } return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) { os << ' '; } os << *it; } return os; } template <typename T1, typename T2> ostream& operator<<(ostream& os, const map<T1, T2>& v) { os << '{'; for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) { os << ", "; } os << it->first << ':' << it->second; } os << '}'; return os; } void Yes(void) { cout << "Yes" << '\n'; } void No(void) { cout << "No" << '\n'; } void YES(void) { cout << "YES" << '\n'; } void NO(void) { cout << "NO" << '\n'; } template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; } template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; } template <typename T> void vin(vector<T>& v, ll len) { for1 (i, len) { cin >> v[i]; } } template <typename Head> void in_1(Head& h) { cin >> h; } template <typename Head, typename... Tail> void in_1(Head& h, Tail&... t) { cin >> h; in_1(t...); } template <typename Head> void print_1(Head&& h) { cout << h << '\n'; } template <typename Head, typename... Tail> void print_1(Head&& h, Tail&&... t) { cout << h << ' '; print_1(t...); } //--------------------------------------------------------- void solve() { ll N; in(N); string S; in(S); map<char, ll> cnt; for (char c : S) { cnt[c]++; } ll ans = cnt['3'] + cnt['5'] + cnt['7']; ll c1 = 0; ll c9 = 0; ll ans19 = 0; ll ans991 = 0; for1 (i, N) { char c = S[i]; if (c == '9') { c9++; // 19 if (c1 >= 1) { c1--; c9--; ans19++; } } else if (c == '1') { c1++; // 991 if (c9 >= 2) { c1--; c9 -= 2; ans991++; } } } cnt['1'] -= ans19 + ans991; cnt['9'] -= ans19 + ans991 * 2; ans += ans19 + ans991; // 11 ans += cnt['1'] / 2; print(ans); } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(16); cerr << fixed << setprecision(16); solve(); }