#394398 (C++14) No.281 門松と魔法(1)

提出ソース

結果

問題	No.281 門松と魔法(1)
ユーザー	fumiphys
提出日時	2019-10-28 00:00:14
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	4,086 bytes
コンパイル時間	1,662 ms
コンパイル使用メモリ	171,040 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-09-14 21:08:59
合計ジャッジ時間	4,814 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	2 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
testcase_23	AC	2 ms 5,376 KB
testcase_24	AC	2 ms 5,376 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	2 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	2 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	RE	-
testcase_32	RE	-
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	2 ms 5,376 KB
testcase_35	AC	2 ms 5,376 KB
testcase_36	AC	2 ms 5,376 KB
testcase_37	AC	2 ms 5,376 KB
testcase_38	AC	2 ms 5,376 KB
testcase_39	AC	2 ms 5,376 KB
testcase_40	AC	2 ms 5,376 KB
testcase_41	WA	-
testcase_42	AC	2 ms 5,376 KB
testcase_43	RE	-
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	RE	-
testcase_47	AC	2 ms 5,376 KB
testcase_48	RE	-
testcase_49	RE	-
testcase_50	RE	-
testcase_51	AC	2 ms 5,376 KB
testcase_52	RE	-
testcase_53	RE	-
testcase_54	RE	-
testcase_55	AC	2 ms 5,376 KB
testcase_56	AC	2 ms 5,376 KB

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

ソースコード

raw source code

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

bool ok(vector<ll> v){
  if(v[0] == v[1] || v[1] == v[2] || v[2] == v[0])return false;
  if(v[1] == max({v[0], v[1], v[2]}))return true;
  if(v[1] == min({v[0], v[1], v[2]}))return true;
  return false;
}

int main(int argc, char const* argv[])
{
  ll d; cin >> d;
  vector<ll> h(3); cin >> h;
  // h[0] < h[1] > h[2]
  ll res = linf;
  vector<ll> h1 = h;
  ll tmp1 = 0;
  if(h[0] >= h[1]){
    ll u = (h[0] - h[1] + d) / d;
    tmp1 += u;
    h1[0] -= u * d;
  }
  if(h[2] >= h[1]){
    ll u = (h[2] - h[1] + d) / d;
    tmp1 += u;
    h1[2] -= u * d;
  }
  if(h1[0] == h1[2]){
    if(h1[0] == 0)tmp1 = linf;
    else tmp1++;
  }
  rep(i, 3)h1[i] = max(h1[i], 0LL);
  if(ok(h1))res = min(res, tmp1);

  // h[0] > h[1] < h[2]
  vector<ll> h2 = h;
  ll tmp2 = 0;
  if(h2[0] == h2[2]){
    if(h2[0] == 0)tmp2 = linf;
    else tmp2++;
    h2[0] = max(0LL, h2[0] - d);
  }
  if(h2[0] <= h2[1]){
    ll u = (h2[1] - h2[0] + d) / d;
    h2[1] -= u * d;
    tmp2 += u;
  }
  if(h2[2] <= h2[1]){
    ll u = (h2[1] - h2[2] + d) / d;
    h2[1] -= u * d;
    tmp2 += u;
  }
  rep(i, 3)h2[i] = max(h2[i], 0LL);
  if(ok(h2))res = min(res, tmp2);

  if(res >= linf)cout << -1 << endl;
  else cout << res << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード