#736193 (C++14) No.186 中華風 (Easy)

• 問題: No.186 中華風 (Easy)
• ユーザー: SymmetricHorizon
• 提出日時: 2022-02-02 18:52:01
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,671 bytes
• コンパイル時間: 1,551 ms
• コンパイル使用メモリ: 167,604 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-11 09:30:26
• 合計ジャッジ時間: 2,315 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (decltype(n) i = 0; i < (n); ++i)
#define rep3(i, s, n) for (decltype(n) i = (s); i < (n); ++i)
#define repR(i, n) for (decltype(n) i = (n)-1; i >= 0; --i)
#define rep3R(i, s, n) for (decltype(n) i = (n)-1; i >= (s); --i)
#define repit(it, c) for (auto it = (c).begin(); it != (c).end(); ++it)
#define all(x) ::std::begin(x), ::std::end(x)

using ll = long long;

template <typename T, typename U>
inline bool chmax(T &current, const U &test) {
  if (current < test) {
    current = test;
    return true;
  }
  return false;
}
template <typename T, typename U>
inline bool chmin(T &current, const U &test) {
  if (current > test) {
    current = test;
    return true;
  }
  return false;
}

const int64_t INFL = pow(10, 18);
const int INF = 2 * pow(10, 9);

ll ext_Euclid(ll a, ll b, ll &p, ll &q) {
  if (b == 0) {
    p = 1;
    q = 0;
    return a;
  }
  ll d = ext_Euclid(b, a % b, q, p);
  q -= a / b * p;
  return d;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  constexpr char endl = '\n';
  ///////////////////////////

  vector<ll> x(3), y(3);
  rep(i, 3) { cin >> x[i] >> y[i]; }

  ll ans = 0;
  ll mod = 1;
  rep(i, 3) {
    // mod p + y[i] q == gcd(mod, y[i])
    ll p, q;
    ll d = ext_Euclid(mod, y[i], p, q);
    if ((ans - x[i]) % d != 0) {
      cout << -1 << endl;
      return 0;
    }
    ll s = (ans - x[i]) / d;
    // s mod p + s y[i] q == ans - x[i]
    ans = ans - mod * (s * p % (y[i] / d));
    mod = mod / d * y[i];
    ans = (ans % mod + mod) % mod;
  }
  if (ans == 0) {
    ans = 1;
    rep(i, 3) { ans *= y[i]; }
  }
  cout << ans << endl;
}