結果

問題 No.319 happy b1rthday 2 me
ユーザー Yang33
提出日時 2017-11-18 01:07:04
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,658 bytes
コンパイル時間 1,585 ms
コンパイル使用メモリ 170,028 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-25 08:56:26
合計ジャッジ時間 2,657 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

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

#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/03 Problem: yukicoder319 / Link: https://yukicoder.me/problems/no/319 ----- */
/* ------------
---------- */
/* ----------
-------- */
LL N;
LL ans = 0LL;
LL dp[14][7][2][2];
LL f(string & target, int i, int has = 0, int one = 0, int less = 0) {
if (i == -1) {
return has;
}
if (dp[i][has][one][less] != -1 && less == 1)return dp[i][has][one][less];
LL res = 0;
int num = target[i] - '0';
int Max = less ? 9 : num;
FOR(nx, 0, Max + 1) {
if (nx == 1) {
res += f(target, i - 1, has,1, less || (nx < Max));
}
else if (nx == 2) {
res += f(target, i - 1, one==1 ? has + 1 : has, 0, less || (nx < Max));
}
else res += f(target, i - 1, has, 0, less || (nx < Max));
}
if (less == 1)return dp[i][has][one][less] = res;
return res;
}
LL calc[14];
LL oneandtwo(string &s) {
reverse(ALL(s));
LL ret = 0;
FOR(i, 0, SZ(s)) {
if (SZ(s) - 1 != i) {
ret += calc[i];
}
else {//
if (s[0] > '2') {
ret += calc[i];
}
else if (s[0] == '2') {
LL t = 0;
FOR(j, 1, SZ(s) - 1) {
t *= 10;
t += s[j] - '0';
}
if (s.back() >= '2')t++;
ret += t;
}
else {
;
}
}
}
return ret;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
LL a, b; cin >> a >> b;
a--;
string A, B;
A = to_string(a);
B = to_string(b);
fill(***dp, ***dp + 14 * 7 * 2 * 2, -1);
reverse(ALL(A));
reverse(ALL(B));
ans = f(B, SZ(B) - 1);
ans -= f(A, SZ(A) - 1);
FOR(i, 0, 14) {
calc[i] = pow(10, (i ? i - 1 : 0));
//debug(calc[i]);
}
ans += oneandtwo(B);
a++;
A = to_string(a);
reverse(ALL(A));
ans -= oneandtwo(A);
cout << ans << "\n";
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0