結果

問題 No.281 門松と魔法(1)
ユーザー is_eri23is_eri23
提出日時 2015-09-26 11:17:05
言語 C++11
(gcc 13.3.0)
結果
WA  
実行時間 -
コード長 3,430 bytes
コンパイル時間 1,401 ms
コンパイル使用メモリ 161,080 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-06 19:42:47
合計ジャッジ時間 2,655 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 55 WA * 2
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
ll d;
void cut(int &x){
  x -= d;
  if (x < 0) {
    x = 0;
  }
}
int cut(int x, int &y){
  int z = (y-x) / d + 1;
  y -= z * d;
  if (y < 0) {
    y = 0;
  }
  return z;
}


int go(vector <int> nums, int cnt){
  if (nums[0] > nums[2]) {
    swap(nums[0],nums[2]);
  }
  if (nums[0] == nums[2]) {
    if (nums[0] == 0) {
      return INT_MAX;
    }
    cut(nums[0]);
    cnt += 1;
  }
  if (nums[1] < nums[0]) {
    return cnt;
  }
  if (nums[1] > nums[2]) {
    return cnt;
  }
  if (d == 0) {
    return INT_MAX;
  }
  //num[0] > nums[1]
  int a = INT_MAX;
  if (nums[0] == nums[1]) {
    if (nums[0] == 0) {
      return INT_MAX;
    }else{
      return 1;
    }
  }else if (nums[0] < nums[1]){
    int tmp = nums[1];
    int z = cut(nums[0], nums[1]);
    a = go(nums, cnt + z);
    nums[1] = tmp;
  }

  if (nums[1] == nums[2]) {
    if (nums[1] == 0) {
      return INT_MAX;
    }else{
      int tmp = nums[2];
      int z = cut(nums[1], nums[2]);
      a = min(a, go(nums, cnt + z));
      nums[2] = tmp;
    }
  }else if (nums[1] < nums[2]) {
    int tmp = nums[2];
    int z = cut(nums[1], nums[2]);
    a = min(a, go(nums, cnt + z));
    nums[2] = tmp;
  }
  return a;
}



int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  vector <int> nums(3);
  cin >> d;
  rep(i,3){
    cin >> nums[i];
  }
  int ans = go(nums, 0);
  if (ans == INT_MAX) {
    cout << -1 << endl;
  }else{
    cout << ans << endl;
  }
  
  return 0;
}
0