#462839 (C++14) No.1017 Reiwa Sequence

提出ソース

結果

問題	No.1017 Reiwa Sequence
ユーザー	kyon2326
提出日時	2020-04-11 20:54:30
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	85 ms / 2,000 ms
コード長	7,438 bytes
コンパイル時間	2,721 ms
コンパイル使用メモリ	168,048 KB
実行使用メモリ	31,336 KB
最終ジャッジ日時	2023-09-16 07:10:46
合計ジャッジ時間	13,881 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	9 ms 30,060 KB
testcase_01	AC	10 ms 30,152 KB
testcase_02	AC	10 ms 30,052 KB
testcase_03	AC	10 ms 29,884 KB
testcase_04	AC	10 ms 29,892 KB
testcase_05	AC	10 ms 30,008 KB
testcase_06	AC	10 ms 30,048 KB
testcase_07	AC	10 ms 29,940 KB
testcase_08	AC	10 ms 29,880 KB
testcase_09	AC	10 ms 29,912 KB
testcase_10	AC	9 ms 29,996 KB
testcase_11	AC	9 ms 29,868 KB
testcase_12	AC	10 ms 29,880 KB
testcase_13	AC	10 ms 30,080 KB
testcase_14	AC	10 ms 29,880 KB
testcase_15	AC	9 ms 30,084 KB
testcase_16	AC	10 ms 29,948 KB
testcase_17	AC	11 ms 29,844 KB
testcase_18	AC	10 ms 29,832 KB
testcase_19	AC	51 ms 29,960 KB
testcase_20	AC	51 ms 29,976 KB
testcase_21	AC	52 ms 29,896 KB
testcase_22	AC	52 ms 29,888 KB
testcase_23	AC	51 ms 30,076 KB
testcase_24	AC	52 ms 29,960 KB
testcase_25	AC	51 ms 29,960 KB
testcase_26	AC	50 ms 30,056 KB
testcase_27	AC	38 ms 30,148 KB
testcase_28	AC	41 ms 29,888 KB
testcase_29	AC	11 ms 29,884 KB
testcase_30	AC	12 ms 30,188 KB
testcase_31	AC	15 ms 29,912 KB
testcase_32	AC	30 ms 29,944 KB
testcase_33	AC	11 ms 30,024 KB
testcase_34	AC	30 ms 30,012 KB
testcase_35	AC	10 ms 29,956 KB
testcase_36	AC	10 ms 30,080 KB
testcase_37	AC	30 ms 30,076 KB
testcase_38	AC	10 ms 29,980 KB
testcase_39	AC	30 ms 29,944 KB
testcase_40	AC	84 ms 30,748 KB
testcase_41	AC	85 ms 30,736 KB
testcase_42	AC	84 ms 30,680 KB
testcase_43	AC	84 ms 30,752 KB
testcase_44	AC	40 ms 30,740 KB
testcase_45	AC	84 ms 30,864 KB
testcase_46	AC	82 ms 30,680 KB
testcase_47	AC	82 ms 30,772 KB
testcase_48	AC	60 ms 31,336 KB
testcase_49	AC	59 ms 31,164 KB
testcase_50	AC	62 ms 31,200 KB
testcase_51	AC	9 ms 30,008 KB
testcase_52	AC	49 ms 29,976 KB
testcase_53	AC	19 ms 29,892 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
/*
#ifndef ONLINE_JUDGE
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
	using namespace boost::multiprecision;
#endif
*/
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		dbool(const dbool& b) : boolvalue(b.boolvalue) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<std::dvector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE(int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV(int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/
inline ll up(ll bit, ll i) { return bit | (1LL<<i); }
inline ll down(ll bit, ll i) { return bit & ~(1LL<<i); }
inline ll inverse(ll bit, ll i) { return bit ^ (1LL<<i); }
inline bool isup(ll bit, ll i) { return bit & (1LL<<i); }
inline bool isdown(ll bit, ll i) { return !(bit & (1LL<<i)); }
inline ll msb(ll bit){ assert(bit); return numeric_limits<ll>::digits-__builtin_clzll(bit); } //最上位ビットの位置
inline ll lsb(ll bit){ assert(bit); return __builtin_ctzll(bit); } //最下位ビットの位置

/*-----8<-----library-----8<-----*/

void solve() {
	ll N;
	cin>>N;
	vector<ll> a(N);
	rep(i,N)cin>>a[i];

	vector<ll> x(23*150000,-INF);
	ll maxval=min(22LL,N);
	for (ll bit = 0; bit < (1LL<<maxval); bit++) {
		ll t=0;
		rep(i, maxval) {
			if (bit & (1LL<<i)) {
				t+=a[i];
			}
		}

		if(x[t]!=-INF){
			p("Yes");
			ll other=x[t];
			rep(i,maxval){
				if(isup(bit,i)&&isup(other,i))cout<<0<<' ';
				else if(isup(bit,i))cout<<a[i]<<' ';
				else if(isup(other,i))cout<<'-'<<a[i]<<' ';
				else cout<<0<<' ';
			}
			for(ll i=maxval;i<N;i++)cout<<0<<' ';
			cout<<endl;
			return;
		}
		x[t]=bit;
	}
	p("No");
}

signed main() {
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード