#606541 (C++17) No.1352 Three Coins

• 問題: No.1352 Three Coins
• ユーザー: ningenMe
• 提出日時: 2021-01-17 13:52:52
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 4,805 bytes
• コンパイル時間: 2,637 ms
• コンパイル使用メモリ: 214,040 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-24 23:04:42
• 合計ジャッジ時間: 4,017 ms
• ジャッジサーバーID （参考情報）: judge12 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	1 ms; 4,384 KB
testcase_05	AC	1 ms; 4,384 KB
testcase_06	AC	2 ms; 4,380 KB
testcase_07	AC	2 ms; 4,380 KB
testcase_08	AC	2 ms; 4,384 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	1 ms; 4,384 KB
testcase_11	AC	2 ms; 4,380 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	1 ms; 4,380 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	1 ms; 4,384 KB
testcase_16	AC	1 ms; 4,384 KB
testcase_17	AC	1 ms; 4,380 KB
testcase_18	AC	2 ms; 4,380 KB
testcase_19	AC	1 ms; 4,380 KB
testcase_20	AC	1 ms; 4,380 KB
testcase_21	AC	2 ms; 4,380 KB
testcase_22	AC	1 ms; 4,380 KB
testcase_23	AC	2 ms; 4,380 KB
testcase_24	AC	1 ms; 4,384 KB
testcase_25	AC	2 ms; 4,380 KB
testcase_26	AC	1 ms; 4,380 KB
testcase_27	AC	2 ms; 4,380 KB
testcase_28	AC	2 ms; 4,384 KB
testcase_29	AC	1 ms; 4,384 KB
testcase_30	AC	2 ms; 4,380 KB
testcase_31	AC	2 ms; 4,380 KB
testcase_32	AC	2 ms; 4,380 KB
testcase_33	AC	2 ms; 4,380 KB
testcase_34	AC	1 ms; 4,380 KB
testcase_35	AC	1 ms; 4,384 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


/*
 * @title Gcd - 高速GCD
 * @docs md/math/Gcd.md
 */
class Gcd{
public:
	inline static long long impl(long long n, long long m) {
		static constexpr long long K = 5;
		long long t,s;
		for(int i = 0; t = n - m, s = n - m * K, i < 80; ++i) {
			if(t<m){
				if(!t) return m;
				n = m, m = t;
			}
			else{
				if(!m) return t;
				n=t;
				if(t >= m * K) n = s;
			}
		}
		return impl(m, n % m);
	}
	inline static long long pre(long long n, long long m) {
		long long t;
		for(int i = 0; t = n - m, i < 4; ++i) {
			(t < m ? n=m,m=t : n=t);
			if(!m) return n;
		}
		return impl(n, m);
	}
	inline static long long gcd(long long n, long long m) {
		return (n>m ? pre(n,m) : pre(m,n));
	}
	inline static constexpr long long pureGcd(long long a, long long b) {
		return (b ? pureGcd(b, a % b):a);
	}
	inline static constexpr long long lcm(long long a, long long b) {
		return (a*b ? (a / gcd(a, b)*b): 0);
	}
	inline static constexpr long long extGcd(long long a, long long b, long long &x, long long &y) {
		if (b == 0) return x = 1, y = 0, a;
		long long d = extGcd(b, a%b, y, x);
		return y -= a / b * x, d;
	}
};

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
	vector<int64> A(3);
	for(int i=0;i<3;++i) cin >> A[i];
	int64 G = 0;
	for(int i=0;i<3;++i) G = Gcd::gcd(G,A[i]);
	corner(G!=1,"INF");
	sort(ALL(A));
	int base = A[0];
	vector<int64> cost(base,HIGHINF);
	priority_queue_reverse<pair<int64,int>> pq;
	pq.push({0,0});
	cost[0] = 0;
	while(pq.size()) {
		auto p = pq.top(); pq.pop();
		int64 num = p.first;
		int mod = p.second;
		if(cost[mod] < num) continue;
		for(int i=1;i<3;++i) {
			int next_mod = (mod+A[i])%base;
			if(cost[next_mod] > cost[mod] + A[i]) {
				cost[next_mod] = cost[mod] + A[i];
				pq.push({cost[next_mod],next_mod});
			}
		}
	}
	int64 ans = 0;
	for(int i=0;i<base; ++i) {
		ans += cost[i] / base;
	}
	cout << ans << endl;
    return 0;
}