結果

問題 No.832 麻雀修行中
ユーザー hitonanode
提出日時 2019-05-24 21:44:15
言語 C++14
(gcc 8.2.0)
結果
WA   .
実行時間 -
コード長 3,938 Byte
コンパイル時間 1,478 ms
使用メモリ 8,916 KB
最終ジャッジ日時 2019-05-24 21:44:18

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
random_01.txt AC 2 ms
6,868 KB
random_02.txt AC 2 ms
6,868 KB
random_03.txt AC 3 ms
6,872 KB
random_04.txt AC 2 ms
8,916 KB
random_05.txt AC 2 ms
6,872 KB
random_06.txt AC 2 ms
6,868 KB
random_07.txt AC 2 ms
6,872 KB
random_08.txt WA -
random_09.txt WA -
random_10.txt AC 2 ms
6,872 KB
random_11.txt AC 3 ms
6,872 KB
random_12.txt AC 2 ms
6,868 KB
random_13.txt WA -
random_14.txt AC 3 ms
6,868 KB
random_15.txt WA -
random_16.txt AC 2 ms
6,868 KB
random_17.txt WA -
random_18.txt WA -
random_19.txt WA -
random_20.txt AC 2 ms
6,868 KB
random_21.txt AC 2 ms
6,872 KB
random_22.txt WA -
random_23.txt AC 2 ms
6,868 KB
random_24.txt AC 3 ms
6,868 KB
random_25.txt AC 3 ms
6,868 KB
sample_01.txt AC 3 ms
6,872 KB
sample_02.txt AC 2 ms
8,912 KB
sample_03.txt AC 3 ms
6,868 KB
sample_04.txt AC 2 ms
6,868 KB
sample_05.txt AC 3 ms
6,872 KB
sample_06.txt AC 2 ms
6,872 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
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){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

set<int> ans;
vector<int> cou;

void chi()
{
    int ni = 0;
    for (auto v : cou) ni += (v == 2);
    if (ni == 6)
    {
        REP(i, 10) if (cou[i] == 1) ans.insert(i);
    }
    return;
}

bool check()
{
    FOR(head, 1, 10) if (cou[head] >= 2)
    {
        vector<int> m = cou;
        m[head] -= 2;

        bool flg = true;
        REP(i, 8)
        {
            while (m[i] % 3)
            {
                m[i]--;
                m[i + 1]--;
                m[i + 2]--;
            }
        }
        REP(i, 10) if (m[i] < 0) flg = false;

        if (flg) return true;
    }
    return false;
}

int main()
{
    string S;
    cin >> S;
    cou.resize(12);
    for (auto c : S) cou[c - '0']++;
    chi();

    FOR(i, 1, 10) if (cou[i] < 4)
    {
        cou[i]++;
        if (check()) ans.insert(i);
        cou[i]--;
    }
    for (auto v : ans)
    {
        cout << v << endl;
    }
}
0