#217367 (C++14) No.362 門松ナンバー

• 問題: No.362 門松ナンバー
• ユーザー: Yang33
• 提出日時: 2017-11-19 01:40:40
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 3,000 ms
• コード長: 2,530 bytes
• コンパイル時間: 1,616 ms
• コンパイル使用メモリ: 168,996 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-25 18:30:53
• 合計ジャッジ時間: 2,506 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include "bits/stdc++.h"
using namespace std;
using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;
#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* -----  2017/11/18  Problem: yukicoder362 / Link: __CONTEST_URL__  ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
LL N;
LL ans = 0LL;
LL dp[20][10][10][3][2];
// 0:? 1:up 2:down
LL f(string &s, int i, int befbef = 0, int bef = 0, int up = 0, int less = 0) {
    if (i == -1) {
        return 1;
    }
    if (less == 1 && dp[i][befbef][bef][up][less] != -1)return dp[i][befbef][bef][up][less];
    LL res = 0;
    int num = s[i] - '0';
    int Max = less ? 9 : num;
    FOR(nx, 0, Max + 1) {
        if (up == 0) {// 0,5,?
            if (bef == 0)res += f(s, i - 1, bef, nx, (0), less || (nx < Max));
            else if (nx > bef)res += f(s, i - 1, bef, nx, (1), less || (nx < Max));
            else if (nx < bef)res += f(s, i - 1, bef, nx, (2), less || (nx < Max));
        }
        else if (up == 1) {// 1,4,?
            if (nx < bef&&befbef != nx)res += f(s, i - 1, bef, nx, (2), less || (nx < Max));
        }
        else if (up == 2) {
            if (nx > bef&&befbef != nx)res += f(s, i - 1, bef, nx, (1), less || (nx < Max));
        }
    }
    if (less == 1)return dp[i][befbef][bef][up][less] = res;
    else return res;
}
LL two(LL x) {
    string s = to_string(x);
    reverse(ALL(s));
    
    return f(s, SZ(s) - 1);
}
void solve(LL kado) {
    LL L = 0; LL R = 37294859064823 + 1;
    LL mid;
    FOR(i, 0, 60) {
        mid = (L + R) / 2;
        if (two(mid)-91 >= kado) {
            R = mid;
        }
        else L = mid;
    }
    cout << R << endl;
}
int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    fill(****dp, ****dp + 20 * 10 * 10 * 3 * 2, -1);
    cin >> N;
    FOR(i, 0, N) {
        LL a; cin >> a;
        solve(a);
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX