結果

問題 No.286 Modulo Discount Store
ユーザー yuruhiyayuruhiya
提出日時 2020-04-01 15:36:04
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 14,760 bytes
コンパイル時間 1,940 ms
コンパイル使用メモリ 196,992 KB
最終ジャッジ日時 2024-04-27 03:07:20
合計ジャッジ時間 2,358 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In function 'int gc()':
main.cpp:30:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'?
   30 | #define getchar_unlocked _getchar_nolock
      |                          ^~~~~~~~~~~~~~~
main.cpp:33:34: note: in expansion of macro 'getchar_unlocked'
   33 | inline int gc()noexcept { return getchar_unlocked(); }
      |                                  ^~~~~~~~~~~~~~~~

ソースコード

diff # 

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#define _SILENCE_CXX17_RESULT_OF_DEPRECATION_WARNING
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)

using namespace std;
using ll = long long;		using ld = long double;
using VB = vector<bool>;	using VVB = vector<VB>;
using VI = vector<int>;		using VVI = vector<VI>;
using VL = vector<ll>;		using VVL = vector<VL>;
using VS = vector<string>;	using VD = vector<ld>;
using PII = pair<int, int>;	using VP = vector<PII>;
using PLL = pair<ll, ll>;	using VPL = vector<PLL>;
template<class T>using PQ = priority_queue<T>;
template<class T>using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr ll inf_ll = (ll)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;

// --- input --- //
#if defined(_WIN32) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc()noexcept { return getchar_unlocked(); }
template<class T>inline void InputF(T& v)noexcept { cin >> v; }
inline void InputF(char& v)noexcept { while (isspace(v = gc())); }
inline void InputF(bool& v)noexcept { char c; InputF(c); v = c == '1'; }
inline void InputF(string& v)noexcept {
	char c; for (InputF(c); !isspace(c); c = gc())v += c;
}
inline void InputF(int& v)noexcept {
	bool neg = false; v = 0; char c; InputF(c);
	if (c == '-') { neg = true; c = gc(); }
	for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
	if (neg)v = -v;
}
inline void InputF(long long& v)noexcept {
	bool neg = false; v = 0; char c; InputF(c);
	if (c == '-') { neg = true; c = gc(); }
	for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
	if (neg)v = -v;
}
inline void InputF(double& v)noexcept {
	double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c);
	if (c == '-') { neg = true; c = gc(); }
	for (; isdigit(c) || c == '.'; c = gc()) {
		if (c == '.')adp = true;
		else if (adp)v += (c - '0') * (dp *= 0.1);
		else v = v * 10 + (c - '0');
	}
	if (neg)v = -v;
}
template<class T, class U>inline void InputF(pair<T, U>& v)noexcept {
	InputF(v.first); InputF(v.second);
}
template<class T>inline void InputF(vector<T>& v)noexcept {
	for (auto& e : v)InputF(e);
}
template<class T>inline T InputF() { T v; InputF(v); return v; }
struct InputV {
	int n, m;
	InputV(int N) :n(N), m(0) {}
	InputV(pair<int, int> N) :n(N.first), m(N.second) {}
	template<class T>operator vector<T>()noexcept {
		vector<T> v(n); InputF(v); return v;
	}
	template<class T>operator vector<vector<T>>()noexcept {
		vector<vector<T>> v(n, vector<T>(m)); InputF(v); return v;
	}
};
struct Input {
	template<class T>operator T()noexcept { return InputF<T>(); }
	int operator--(int) { int v; InputF(v); v--; return v; }
	InputV operator[](int n)noexcept { return InputV(n); }
	InputV operator[](pair<int, int> n)noexcept { return InputV(n); }
	void operator()() {}
	template<class H, class...T>void operator()(H&& h, T&& ...t) {
		InputF(h); operator()(forward<T>(t)...);
	}
	template<class T>Input& operator,(T&& v) {
		InputF(v); return *this;
	}
	template<class T, size_t W>array<vector<T>, W> get(int H) {
		array<vector<T>, W> ret;
		for (int i = 0; i < H; ++i)for (int j = 0; j < W; ++j)ret[j].push_back(InputF<T>());
		return ret;
	}
}in;
#define input(T) InputF<T>()
#define ini input(int)
#define inl input(ll)
#define ins input(string)
#define ind input(ld)
#define input2(T, ...) T __VA_ARGS__; in(__VA_ARGS__)
#define INT(...) input2(int, __VA_ARGS__)
#define LL(...) input2(ll, __VA_ARGS__)
#define STR(...) input2(string, __VA_ARGS__)
#define DOUBLE(...) input2(ld, __VA_ARGS__)

// --- output --- //
struct BoolStr {
	const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}
}Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
	const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}
}spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
	BoolStr B{ Yes }; DivStr D{ spc }; bool isPrint = true;
	void p(double v) { printf("%.20f", v); } void p(long double v) { printf("%.20Lf", v); }
	void p(int v) { printf("%d", v); }	void p(ll v) { printf("%lld", v); }
	void p(char v) { putchar(v); }		void p(bool v) { printf("%s", v ? B.t : B.f); }
	template<class T>void p(const T& v) { cout << v; }
	template<class T, class U>void p(const pair<T, U>& v) { p(v.first); printf("%s", D.d); p(v.second); }
	template<class T>void p(const vector<T>& v) { rep(i, sz(v)) { if (i)printf("%s", D.d); p(v[i]); } }
	template<class T>void p(const vector<vector<T>>& v) { rep(i, sz(v)) { if (i)printf("%s", D.l); p(v[i]); } }
	void p(const BoolStr& v) { B = v; isPrint = false; } void p(const DivStr& v) { D = v; isPrint = false; }
public:
	Output& operator()() { printf("%s", D.l); return *this; }
	template<class H>Output& operator()(H&& h) {
		p(h); if (isPrint)printf("%s", D.l); isPrint = true; return *this;
	}
	template<class H, class...T>Output& operator()(H&& h, T&& ...t) {
		p(h); if (isPrint)printf("%s", D.d); isPrint = true; return operator()(forward<T>(t)...);
	}
	template<class...T>void exit(T&& ...t) {
		operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);
	}
	Output& flush() { cout.flush(); return *this; }
	Output& set(const char* t, const char* f) { B = BoolStr(t, f); return *this; }
}out;

// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif

// --- step --- //
template<class T>struct Step {
	class It {
		T a, b, c;
	public:
		constexpr It()noexcept : a(T()), b(T()), c(T()) {}
		constexpr It(T _b, T _c, T _s)noexcept : a(_b), b(_c), c(_s) {}
		constexpr It& operator++()noexcept { --b; a += c; return *this; }
		constexpr It operator++(int)noexcept { It tmp = *this; --b; a += c; return tmp; }
		constexpr const T& operator*()const noexcept { return a; }
		constexpr const T* operator->()const noexcept { return &a; }
		constexpr bool operator==(const It& i)const noexcept { return b == i.b; }
		constexpr bool operator!=(const It& i)const noexcept { return !(b == i.b); }
		constexpr T start()const noexcept { return a; }
		constexpr T count()const noexcept { return b; }
		constexpr T step()const noexcept { return c; }
	};
	constexpr Step(T b, T c, T s)noexcept : be(b, c, s) {}
	constexpr It begin()const noexcept { return be; }
	constexpr It end()const noexcept { return en; }
	constexpr T start()const noexcept { return be.start(); }
	constexpr T count()const noexcept { return be.count(); }
	constexpr T step()const noexcept { return be.step(); }
	constexpr T sum()const noexcept { return start() * count() + step() * (count() * (count() - 1) / 2); }
	operator vector<T>()const noexcept { return as_vector(); }
	vector<T> as_vector()const noexcept {
		vector<T> res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res;
	}
	template<class F>void each(const F& f)const noexcept { for (T i : *this)f(i); }
	template<class F>auto map(const F& f)const noexcept {
		vector<decay_t<result_of_t<F(T)>>> res; res.reserve(count());
		each([&](T i) {res.push_back(f(i)); }); return res;
	}
	template<class F>int count_if(const F& f)const noexcept {
		int res = 0; each([&](T i) {i += f(i); }); return res;
	}
	template<class F>vector<T> select(const F& f)const noexcept {
		vector<T> res; each([&](T i) {if (f(i))res.push_back(i); }); return res;
	}
	template<class F>auto sum(const F& f)const noexcept {
		decay_t<result_of_t<F(T)>> res = 0; each([&](T i) {res += f(i); }); return res;
	}
	using value_type = T;
	using iterator = It;
private:
	It be, en;
};
template<class T>inline constexpr auto step(T a)noexcept { return Step<T>(0, a, 1); }
template<class T>inline constexpr auto step(T a, T b)noexcept { return Step<T>(a, b - a, 1); }
template<class T>inline constexpr auto step(T a, T b, T c)noexcept { return Step<T>(a, (b - a - 1) / c + 1, c); }

inline namespace {
	template<class T>inline void Sort(T& a)noexcept { sort(all(a)); }
	template<class T>inline void RSort(T& a)noexcept { sort(rall(a)); }
	template<class T>inline T Sorted(T a)noexcept { Sort(a); return a; }
	template<class T>inline T RSorted(T a)noexcept { RSort(a); return a; }
	template<class T, class F>inline void Sort(T& a, const F& f)noexcept {
		sort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class F>inline void RSort(T& a, const F& f)noexcept {
		sort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T>inline void Reverse(T& a)noexcept { reverse(all(a)); }
	template<class T>inline void Unique(T& a)noexcept { a.erase(unique(all(a)), a.end()); }
	template<class T>inline T Reversed(T a)noexcept { Reverse(a); return a; }
	template<class T>inline T Uniqued(T a)noexcept { Unique(a); return a; }
	template<class T>inline auto Max(const T& a)noexcept { return *max_element(all(a)); }
	template<class T>inline auto Min(const T& a)noexcept { return *min_element(all(a)); }
	template<class T>inline int MaxPos(const T& a)noexcept { return max_element(all(a)) - a.begin(); }
	template<class T>inline int MinPos(const T& a)noexcept { return min_element(all(a)) - a.begin(); }
	template<class T, class F>inline auto Max(const T& a, const F& f)noexcept {
		return max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class F>inline auto Min(const T& a, const F& f)noexcept {
		return min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class U>inline int Count(const T& a, const U& v)noexcept { return count(all(a), v); }
	template<class T, class F>inline int CountIf(const T& a, const F& f)noexcept { return count_if(all(a), f); }
	template<class T, class U>inline int Find(const T& a, const U& v)noexcept { return find(all(a), v) - a.begin(); }
	template<class T, class F>inline int FindIf(const T& a, const F& f)noexcept { return find_if(all(a), f) - a.begin(); }
	template<class T, class U = typename T::value_type>inline U Sum(const T& a)noexcept { return accumulate(all(a), U()); }
	template<class T, class F>inline auto Sum(const T& v, const F& f) {
		return accumulate(next(v.begin()), v.end(), f(v.front()), [&](auto a, auto b) {return a + f(b); });
	}
	template<class T, class U>inline int Lower(const T& a, const U& v)noexcept { return lower_bound(all(a), v) - a.begin(); }
	template<class T, class U>inline int Upper(const T& a, const U& v)noexcept { return upper_bound(all(a), v) - a.begin(); }
	template<class T, class F>inline void RemoveIf(T& a, const F& f)noexcept { a.erase(remove_if(all(a), f), a.end()); }
	template<class F>inline auto Vector(size_t size, const F& f)noexcept {
		vector<decay_t<result_of_t<F(size_t)>>> res(size); for (size_t i = 0; i < size; ++i)res[i] = f(i); return res;
	}
	template<class T>inline auto Grid(size_t h, size_t w, const T& v = T())noexcept { return vector<vector<T>>(h, vector<T>(w, v)); }
	template<class T>inline auto Slice(const T& v, size_t i, size_t len)noexcept {
		return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();
	}
	template<class T, class F>inline auto Each(const T& v, const F& f)noexcept { for (auto& i : v)f(i); }
	template<class T, class F>inline auto Select(const T& v, const F& f)noexcept {
		T res; for (const auto& e : v)if (f(e))res.push_back(e); return res;
	}
	template<class T, class F>inline auto Map(const T& v, const F& f)noexcept {
		vector<decay_t<result_of_t<F(typename T::value_type)>>> res(v.size());
		size_t i = 0; for (const auto& e : v)res[i++] = f(e); return res;
	}
	template<class T, class F>inline auto MapIndex(const T& v, const F& f)noexcept {
		vector<decay_t<result_of_t<F(size_t, typename T::value_type)>>> res(v.size());
		size_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it); return res;
	}
	template<class T, class F>inline auto TrueIndex(const T& v, const F& f)noexcept {
		vector<size_t> res; for (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i); return res;
	}
	inline string operator*(string s, size_t n)noexcept { string ret; for (size_t i = 0; i < n; ++i)ret += s; return ret; }
	template<class T>inline T Ceil(T n, T m)noexcept { return (n + m - 1) / m; }
	template<class T>inline T Ceil2(T n, T m)noexcept { return Ceil(n, m) * m; }
	template<class T>inline T Tri(T n)noexcept { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); }
	template<class T>inline T nC2(T n)noexcept { return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1); }
	template<class T>inline T Mid(const T& l, const T& r)noexcept { return l + (r - l) / 2; }
	template<class T>inline int pop_count(T n)noexcept { return bitset<64>(n).count(); }
	template<class T>inline bool chmax(T& a, const T& b)noexcept { if (a < b) { a = b; return true; } return false; }
	template<class T>inline bool chmin(T& a, const T& b)noexcept { if (a > b) { a = b; return true; } return false; }
	template<class T>inline bool inRange(const T& v, const T& min, const T& max)noexcept { return min <= v && v < max; }
	template<class T = ll>inline T BIT(int b)noexcept { return T{ 1 } << b; }
	template<class T>inline T Gcd(T n, T m)noexcept { return m ? Gcd(m, n % m) : n; }
	template<class T>inline T Lcm(T n, T m)noexcept { return n / Gcd(n, m) * m; }
	template<class T, class U = typename T::value_type>inline U Gcdv(const T& v)noexcept {
		return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd<U>);
	}
	template<class T, class U = typename T::value_type>inline U Lcmv(const T& v)noexcept {
		return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm<U>);
	}
	template<class T>inline T Pow(T a, T n)noexcept { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; } return r; }
	template<class T>inline T Powmod(T a, T n, T m = MOD)noexcept {
		T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r;
	}
}

// ---------------------------------------------------------------- //

int main() {
	INT(n);
	VI a = in[n];

	int size = BIT(n);
	VI dp(size, -1);
	function<int(int)> rec = [&](int bit) {
		if (dp[bit] != -1) {
			return dp[bit];
		} else if (bit == 0) {
			return dp[bit] = 0;
		}

		int res = inf;
		int sum = step(n).sum([&](int i) {return a[i] * !!(bit & BIT(i)); });
		rep(i, n)if (bit & BIT(i)) {
			chmin(res, rec(bit & ~BIT(i)) + max(0, a[i] - (sum - a[i]) % 1000));
		}
		return dp[bit] = res;
	};

	out(rec(size - 1));
}
0