結果

問題 No.598 オーバーフローファンタジー
ユーザー naimonon77
提出日時 2018-12-07 10:19:20
言語 C++17(1z)
(gcc 8.3.0)
結果
AC  
実行時間 4 ms
コード長 3,389 Byte
コンパイル時間 2,016 ms
使用メモリ 1,516 KB
最終ジャッジ日時 2019-10-26 11:04:03

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_0_sample_1.txt AC 3 ms
1,512 KB
0_1_sample_2.txt AC 4 ms
1,508 KB
0_2_sample_3.txt AC 2 ms
1,512 KB
1_0.txt AC 3 ms
1,512 KB
1_1.txt AC 3 ms
1,512 KB
1_2.txt AC 3 ms
1,512 KB
1_3.txt AC 3 ms
1,516 KB
1_4.txt AC 3 ms
1,516 KB
1_5.txt AC 3 ms
1,516 KB
1_8.txt AC 4 ms
1,516 KB
1_9.txt AC 4 ms
1,512 KB
1_10.txt AC 4 ms
1,516 KB
2_0.txt AC 4 ms
1,512 KB
2_1.txt AC 3 ms
1,512 KB
2_2.txt AC 3 ms
1,512 KB
2_3.txt AC 3 ms
1,512 KB
2_4.txt AC 3 ms
1,508 KB
3_0.txt AC 3 ms
1,516 KB
3_1.txt AC 4 ms
1,512 KB
3_2.txt AC 3 ms
1,512 KB
3_3.txt AC 3 ms
1,516 KB
3_4.txt AC 3 ms
1,512 KB
4_1.txt AC 3 ms
1,516 KB
4_2.txt AC 3 ms
1,516 KB
4_3.txt AC 3 ms
1,516 KB
5_0.txt AC 3 ms
1,516 KB
5_1.txt AC 3 ms
1,512 KB
99_system_test1.txt AC 3 ms
1,516 KB
99_system_test2.txt AC 3 ms
1,512 KB
99_system_test3.txt AC 3 ms
1,516 KB
99_system_test4.txt AC 3 ms
1,516 KB
テストケース一括ダウンロード

ソースコード

diff #
#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;             \
                                   c > 0 ? i < b : i > b; \
                                   i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long

#ifdef LOCAL_ENV

#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
const int INF = (int)1 << 60;
const int undefined = INF;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }

//.....................
const int MAX = (int)2e5 + 5;

vector<string> split(const string &str, char sep)
{
	vector<string> v;
	stringstream ss(str);
	string buffer;
	while (getline(ss, buffer, sep))
	{
		v.push_back(buffer);
	}
	return v;
}

string join(const vector<string>& v, const string delim = 0) {
	string s;
	if (!v.empty()) {
		s += v[0];
		for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
			if (delim != "") s += delim;
			s += v[i];
		}
	}
	return s;
}

template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
	return accumulate(begin, end, 0ll);
}

template<typename T>
T gcd(T a, T b)
{
	T c;
	while (a != 0) {
		c = a; a = b%a;  b = c;
	}
	return b;
}

template<typename T>
T bit_count(T N) {
	T cnt = 0;
	while (N) {
		if (N & 1) cnt++;
		N >>= 1;
	}
	return cnt;
}

template<typename T>
void print_vec(ostream& ostream, vector<T> a) {
	rep(i, a.size() - 1) ostream << a[i] << " ";
	ostream << a.back() << endl;
}

ll pow_n(ll x,ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x;
		x = x * x;
		n >>= 1;
	}
	return res;
}

class Solver {
public:
	int H, W;

	bool grid_ng(int y, int x) {
		return y < 0 || y >= H || x < 0 || x >= W;
	}

	struct Point {
		int x, y;
		bool operator < (const Point& r) const {
			if (y != r.y) return y < r.y;
			return x < r.x;
		}
	};

	int N, X, A, B;

	void solve() {
		cin >> N >> X >> A >> B;
		dumpl((int)1 << (N - 1));
		int C = ((int)1 << (N - 1)) - X;

		int D = C / B;
		if (C % B != 0) D += 1;

		//int E = X + B * D;

		//int F = E / A;
		//if (E % A != 0) F += 1;

		int G = X / A;
		if (X % A != 0) G += 1;

		dump(D); dumpl(G);
		cout << min(D, G) << endl;
	}
};

signed main()
{
	srand((unsigned int)time(NULL));
	cout << fixed << setprecision(20);
	auto ptr = new Solver();
	ptr->solve();
	delete ptr;
	//while (true) {
	//	if (cin.eof() == true) break;
	//	auto ptr = new Solver();
	//	ptr->solve();
	//	delete ptr;
	//}
	return 0;
}
0