#518197 (C++14) No.1106 🦉 何事もバランスが大事

提出ソース

結果

問題	No.1106 🦉 何事もバランスが大事
ユーザー	heno239
提出日時	2020-07-25 13:52:57
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	8 ms / 2,000 ms
コード長	3,654 bytes
コンパイル時間	1,204 ms
コンパイル使用メモリ	115,636 KB
実行使用メモリ	19,440 KB
最終ジャッジ日時	2024-06-27 04:41:23
合計ジャッジ時間	3,762 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	7 ms 19,176 KB
testcase_01	AC	6 ms 19,180 KB
testcase_02	AC	6 ms 19,432 KB
testcase_03	AC	6 ms 19,180 KB
testcase_04	AC	6 ms 19,180 KB
testcase_05	AC	6 ms 19,176 KB
testcase_06	AC	7 ms 19,184 KB
testcase_07	AC	6 ms 19,184 KB
testcase_08	AC	6 ms 19,184 KB
testcase_09	AC	7 ms 19,184 KB
testcase_10	AC	7 ms 19,180 KB
testcase_11	AC	7 ms 19,180 KB
testcase_12	AC	6 ms 19,184 KB
testcase_13	AC	7 ms 19,180 KB
testcase_14	AC	7 ms 19,312 KB
testcase_15	AC	7 ms 19,308 KB
testcase_16	AC	7 ms 19,440 KB
testcase_17	AC	7 ms 19,180 KB
testcase_18	AC	7 ms 19,184 KB
testcase_19	AC	6 ms 19,176 KB
testcase_20	AC	7 ms 19,176 KB
testcase_21	AC	6 ms 19,184 KB
testcase_22	AC	7 ms 19,180 KB
testcase_23	AC	7 ms 19,180 KB
testcase_24	AC	7 ms 19,180 KB
testcase_25	AC	6 ms 19,180 KB
testcase_26	AC	7 ms 19,180 KB
testcase_27	AC	7 ms 19,180 KB
testcase_28	AC	7 ms 19,180 KB
testcase_29	AC	8 ms 19,180 KB
testcase_30	AC	7 ms 19,180 KB
testcase_31	AC	7 ms 19,176 KB
testcase_32	AC	7 ms 19,176 KB
testcase_33	AC	7 ms 19,180 KB
testcase_34	AC	8 ms 19,180 KB
testcase_35	AC	7 ms 19,180 KB
testcase_36	AC	7 ms 19,184 KB
testcase_37	AC	7 ms 19,308 KB
testcase_38	AC	7 ms 19,308 KB
testcase_39	AC	7 ms 19,180 KB
testcase_40	AC	7 ms 19,180 KB
testcase_41	AC	7 ms 19,180 KB
testcase_42	AC	7 ms 19,304 KB
testcase_43	AC	6 ms 19,180 KB
testcase_44	AC	7 ms 19,180 KB
testcase_45	AC	6 ms 19,176 KB
testcase_46	AC	6 ms 19,304 KB
testcase_47	AC	7 ms 19,180 KB
testcase_48	AC	6 ms 19,180 KB
testcase_49	AC	7 ms 19,436 KB
testcase_50	AC	7 ms 19,184 KB
testcase_51	AC	6 ms 19,176 KB
testcase_52	AC	7 ms 19,440 KB
testcase_53	AC	7 ms 19,188 KB
testcase_54	AC	7 ms 19,180 KB
testcase_55	AC	6 ms 19,180 KB
testcase_56	AC	7 ms 19,176 KB
testcase_57	AC	7 ms 19,176 KB
testcase_58	AC	7 ms 19,180 KB
testcase_59	AC	7 ms 19,180 KB
testcase_60	AC	6 ms 19,180 KB
testcase_61	AC	6 ms 19,180 KB
testcase_62	AC	6 ms 19,308 KB
testcase_63	AC	7 ms 19,304 KB
testcase_64	AC	6 ms 19,184 KB
testcase_65	AC	6 ms 19,180 KB
testcase_66	AC	7 ms 19,180 KB
testcase_67	AC	6 ms 19,180 KB
testcase_68	AC	7 ms 19,184 KB
testcase_69	AC	7 ms 19,184 KB
testcase_70	AC	7 ms 19,180 KB
testcase_71	AC	6 ms 19,308 KB
testcase_72	AC	7 ms 19,180 KB
testcase_73	AC	7 ms 19,304 KB
testcase_74	AC	7 ms 19,180 KB
testcase_75	AC	6 ms 19,176 KB
testcase_76	AC	7 ms 19,180 KB
testcase_77	AC	7 ms 19,180 KB
testcase_78	AC	7 ms 19,184 KB
testcase_79	AC	7 ms 19,180 KB
testcase_80	AC	7 ms 19,180 KB
testcase_81	AC	7 ms 19,184 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n,ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1010000;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

const int ad = 60;
ll dp[30][121];
void solve(){
	dp[0][ad] = 1;
	rep(i, 29) {
		rep(j, 121) {
			if (dp[i][j] > 0) {
				for (int k = -2; k <= 2; k++) {
					dp[i + 1][j + k] += dp[i][j];
				}
			}
		}
	}
	ll n; cin >> n;
	ll s = 1;
	vector<ll> v;
	while (true) {
		v.push_back(s);
		if (s > n)break;
		s *= 5;
	}
	vector<ll> sups; ll ss = 0;
	rep(i, v.size()) {
		ss += 2 * v[i];
		sups.push_back(ss);
	}
	function<ll(int, ll, int)> dfs = [&](int id, ll x, int c)->ll {
		if (x < 0)return 0;
		if (id < 0) {
			if (x > 0 && x <= n && c == 0)return 1;
			else return 0;
		}
		if (x > n) {
			ll d = x - n;
			if (d > sups[id])return 0;
		}
		else {
			ll d = n - x;
			if (d > sups[id]&&x>sups[id])return dp[id + 1][ad + c];
		}
		ll res = 0;
		for (int i = -2; i <= 2; i++) {
			res += dfs(id - 1, x + i * v[id], c + i);
		}
		return res;
	};
	ll ans = dfs(v.size() - 1, 0, 0);
	cout << ans << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//cout << grandy(2, 3, false, false) << "\n";
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード