結果

問題 No.873 バイナリ、ヤバいなり！ｗ
ユーザー kitakitalilykitakitalily
提出日時 2019-08-31 12:12:55
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 6,175 bytes
コンパイル時間 1,231 ms
コンパイル使用メモリ 112,348 KB
実行使用メモリ 8,108 KB
最終ジャッジ日時 2024-06-11 14:03:30
合計ジャッジ時間 10,267 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

#define random_shuffle "USE std::shuffle!";

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

constexpr int MAX_N = 300000;
int dp[MAX_N + 5];
int pre[MAX_N + 5];

std::string make01(int n, bool f) {
	std::string res;
	if (f) { REP(i, n) res += '0' + (i & 1); }
	else { REP(i, n) res += '1' - (i & 1); }
	return res;
}

std::string make(int n) {
	std::string res = "";
	int now = 0;
	while (now < n) {
		bool added = false;
		if (res.empty() || res.back() == '0') { // 0
			for (int i = 1; i < 10000; i += 2) {
				if (now + i * i > n) break;
				if (dp[n - (now + i * i)] + res.size() + i == dp[n]) {
					now += i * i;
					res += make01(i, true);
					added = true;
					break;
				}
			}
			if (added) continue;
			int t = std::sqrt(n - now) + 5;
			if (t & 1) --t;
			for (int i = t; i >= 2; i -= 2) {
				if (now + i * i > n) continue;
				if (dp[n - (now + i * i)] + res.size() + i == dp[n]) {
					now += i * i;
					res += make01(i, true);
					break;
				}
			}
		}
		else { // 1
			for (int i = 2; i < 10000; i += 2) {
				if (now + i * i > n) break;
				if (dp[n - (now + i * i)] + res.size() + i == dp[n]) {
					now += i * i;
					res += make01(i, false);
					added = true;
					break;
				}
			}
			if (added) continue;
			int t = std::sqrt(n - now) + 5;
			if (!(t & 1)) --t;
			for (int i = t; i >= 1; i -= 2) {
				if (now + i * i > n) break;
				if (dp[n - (now + i * i)] + res.size() + i == dp[n]) {
					now += i * i;
					res += make01(i, false);
					break;
				}
			}
		}
	}
	return res;
}

signed main() {
	INIT;

	FILL(dp, INFLL);
	dp[0] = 0;
	REP(i, MAX_N) {
		FOR(k, 1, MAX_N + 3) {
			if (i + k * k > MAX_N) break;
			if (dp[i + k * k] > dp[i] + k) {
				dp[i + k * k] = dp[i] + k;
				pre[i + k * k] = i;
			}
		}
	}

	VAR(int, n);
	OUT(make(n))BR;

	return 0;
}
0