結果

問題 No.195 フィボナッチ数列の理解(2)
ユーザー heno239heno239
提出日時 2020-08-09 17:26:37
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4 ms / 5,000 ms
コード長 4,451 bytes
コンパイル時間 1,307 ms
コンパイル使用メモリ 127,384 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-05 02:59:54
合計ジャッジ時間 2,119 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
6,820 KB
testcase_01 AC 3 ms
6,816 KB
testcase_02 AC 3 ms
6,816 KB
testcase_03 AC 3 ms
6,816 KB
testcase_04 AC 3 ms
6,820 KB
testcase_05 AC 3 ms
6,816 KB
testcase_06 AC 3 ms
6,816 KB
testcase_07 AC 3 ms
6,820 KB
testcase_08 AC 3 ms
6,816 KB
testcase_09 AC 3 ms
6,816 KB
testcase_10 AC 3 ms
6,820 KB
testcase_11 AC 3 ms
6,820 KB
testcase_12 AC 3 ms
6,816 KB
testcase_13 AC 3 ms
6,820 KB
testcase_14 AC 3 ms
6,816 KB
testcase_15 AC 3 ms
6,816 KB
testcase_16 AC 3 ms
6,820 KB
testcase_17 AC 3 ms
6,816 KB
testcase_18 AC 4 ms
6,816 KB
testcase_19 AC 3 ms
6,820 KB
testcase_20 AC 3 ms
6,816 KB
testcase_21 AC 3 ms
6,820 KB
testcase_22 AC 3 ms
6,820 KB
testcase_23 AC 3 ms
6,816 KB
testcase_24 AC 3 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 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, ll 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 = 1 << 17;
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];
}

typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
mat mtmul(mat& A, mat& B) {
	mat C(A.size(), vec(B[0].size()));
	rep(i, (int)A.size()) {
		rep(k, (int)B.size()) {
			rep(j, (int)B[0].size()) {
				C[i][j] = (C[i][j] + (A[i][k] * B[k][j]));
			}
		}
	}
	return C;
}
P normalize(P p) {
	while (p.first < p.second&&p.second-p.first<=p.first) {
		p = { p.second - p.first,p.first };
	}
	return p;
}
vector<P> calc(int le, int ri) {
	vector<P> res;
	mat A = { {1,1},{1,0} };
	mat X = { {1,0},{0,1} };
	while (true) {
		if (X[0][1] * le >= ri)break;
		ll dif = ri - X[0][1] * le;
		if (dif % X[0][0] == 0) {
			P p = { le,dif / X[0][0] };
			p=normalize(p); res.push_back(p);
		}
		X = mtmul(A,X);
	}
	return res;
}
void solve() {
	vector<ll> v(3);
	rep(i, 3)cin >> v[i];
	sort(all(v));
	v.erase(unique(all(v)), v.end());

	if (v.size() == 1) {
		vector<P> c = calc(1, v[0]);
		P mi = c[0];
		rep(i, c.size()) {
			//cout << c[i].first << " " << c[i].second << "\n";
			mi = min(mi, c[i]);
		}
		cout << mi.first << " " << mi.second << "\n";
	}
	else if (v.size() == 2) {
		vector<P> c = calc(v[0], v[1]);
		P mi = c[0];
		rep(i, c.size()) {
			mi = min(mi, c[i]);
		}
		cout << mi.first << " " << mi.second << "\n";
	}
	else {
		vector<P> c1 = calc(v[0], v[1]);
		vector<P> c2 = calc(v[1], v[0]);
		vector<P> c;
		for (P p : c1)c.push_back(p);
		for (P p : c2)c.push_back(p);
		P ans = { mod,mod };
		for (P p : c) {
			bool valid = false;
			int x = p.first, y = p.second;
			while (y < v[2]) {
				int s = x + y;
				if (s == v[2])valid = true;
				x = y; y = s;
			}
			if (valid) {
				ans = min(ans, p);
			}
		}
		if (ans.first == mod) {
			cout << -1 << "\n";
		}
		else {
			cout << ans.first << " " << ans.second << "\n";
		}
	}
}




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