結果

問題 No.281 門松と魔法(1)
ユーザー purupuru
提出日時 2016-10-26 21:42:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 4,988 bytes
コンパイル時間 1,213 ms
コンパイル使用メモリ 125,756 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-24 03:54:55
合計ジャッジ時間 2,508 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define debug(fmt, ...) \
fprintf( stderr, \
fmt "\n", \
##__VA_ARGS__ \
)
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1 << 30;
const double EPS = 1e-10;
double zero(double d) {
return d < EPS ? 0.0 : d;
}
template<class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
os << '[';
rep(i, a.size()) os << (i ? " " : "") << a[i];
return os << ']';
}
string toString(int i) {
stringstream ss;
ss << i;
return ss.str();
}
const int MOD = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
ll res = 1ll;
ll x = a;
while (k != 0) {
if ((k & 1) == 1)
res = (res * x) % M;
x = (x * x) % M;
k >>= 1;
}
return res;
}
struct prepare {
prepare() {
cout.setf(ios::fixed, ios::floatfield);
cout.precision(8);
ios_base::sync_with_stdio(false);
}
} _prepare;
bool check(vll &take) {
rep(i, 3)if (take[i] < 0)
return false;
if (count(all(take), 0) > 1)
return false;
if (take[0] == take[1] || take[1] == take[2] || take[2] == take[0])
return false;
if (take[0] < take[1] && take[1] > take[2])
return true;
if (take[0] > take[1] && take[1] < take[2])
return true;
return false;
}
int main() {
ll d;
cin >> d;
vll H(3);
rep(i, 3)cin >> H[i];
if(check(H)) {
cout << 0 << endl;
return 0;
}
if (d == 0) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
if (!check(H)) {
if (H[0] == H[2]) {
H[0] -= d;
ans++;
}
ll tans = 1ll<<60;
if(!check(H)) {
ll mxAns = ans, miAns = ans;
// max
vll mxH(H);
int u = (max(0ll, mxH[0] - mxH[1]) / d) + 1;
if(mxH[0] < mxH[1]) u = 0;
mxAns += u;
mxH[0] -= d * u;
chmax(mxH[0], 0ll);
u = (max(0ll, mxH[2] - mxH[1]) / d) + 1;
if(mxH[2] < mxH[1]) u = 0;
mxAns += u;
mxH[2] -= d * u;
chmax(mxH[2], 0ll);
if (mxH[0] == mxH[2]) {
mxH[0] -= d;
mxAns++;
}
if(check(mxH))
chmin(tans, mxAns);
// min
vll miH(H);
u = max(0ll, ((miH[1] - min(miH[0], miH[2])) / d)) + 1;
if(min(miH[0], miH[2]) > miH[1] ) u = 0;
miAns += u;
miH[1] -= d * u;
chmax(miH[1], 0ll);
if(check(miH))
chmin(tans, miAns);
if(!check(mxH) && !check(miH)) {
cout << -1 << endl;
return 0;
}
else {
ans = tans;
}
}
chmin(ans, tans);
}
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0