結果

問題 No.873 バイナリ、ヤバいなり!w
ユーザー haruki_Kharuki_K
提出日時 2020-01-25 23:42:28
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 212 ms / 2,000 ms
コード長 4,631 bytes
コンパイル時間 1,805 ms
コンパイル使用メモリ 176,124 KB
実行使用メモリ 8,064 KB
最終ジャッジ日時 2024-06-11 14:04:51
合計ジャッジ時間 10,931 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 193 ms
8,064 KB
testcase_01 AC 198 ms
7,936 KB
testcase_02 AC 199 ms
7,936 KB
testcase_03 AC 200 ms
7,820 KB
testcase_04 AC 198 ms
7,936 KB
testcase_05 AC 192 ms
7,936 KB
testcase_06 AC 194 ms
7,940 KB
testcase_07 AC 194 ms
7,936 KB
testcase_08 AC 197 ms
7,936 KB
testcase_09 AC 203 ms
7,936 KB
testcase_10 AC 197 ms
8,064 KB
testcase_11 AC 201 ms
7,880 KB
testcase_12 AC 212 ms
7,808 KB
testcase_13 AC 200 ms
7,756 KB
testcase_14 AC 194 ms
7,908 KB
testcase_15 AC 197 ms
7,808 KB
testcase_16 AC 200 ms
7,936 KB
testcase_17 AC 205 ms
7,936 KB
testcase_18 AC 207 ms
7,936 KB
testcase_19 AC 199 ms
7,808 KB
testcase_20 AC 195 ms
8,064 KB
testcase_21 AC 199 ms
8,064 KB
testcase_22 AC 199 ms
7,808 KB
testcase_23 AC 205 ms
7,936 KB
testcase_24 AC 200 ms
7,860 KB
testcase_25 AC 197 ms
7,808 KB
testcase_26 AC 197 ms
7,808 KB
testcase_27 AC 200 ms
7,936 KB
testcase_28 AC 200 ms
7,920 KB
testcase_29 AC 198 ms
7,936 KB
testcase_30 AC 199 ms
7,936 KB
testcase_31 AC 202 ms
7,936 KB
testcase_32 AC 204 ms
7,936 KB
testcase_33 AC 200 ms
7,808 KB
testcase_34 AC 198 ms
7,996 KB
testcase_35 AC 204 ms
7,936 KB
testcase_36 AC 203 ms
7,936 KB
testcase_37 AC 199 ms
7,936 KB
testcase_38 AC 200 ms
7,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<

int32_t main() {
    int n; cin >> n;

    const int NN = 3e5 + 10;
    vector<int> dp(NN,INF), last(NN,-1);
    dp[0] = 0;
    rep (i,NN) {
        for (int j = 1; i+j*j < NN; j++) {
            if (chmin(dp[i+j*j], dp[i]+j)) {
                last[i+j*j] = j;
            }
        }
    }
    dump(dp[n]);

    auto f = [](int x, int n) {
        string s(n,'0'+(1-x));
        for (int i = 0; i < sz(s); i += 2) s[i] = '0'+x;
        return s;
    };

    vector<int> v[2], w[2];
    for (int j = 2; j*j <= n; j += 2) v[0].eb(j);
    for (int j = 1; j*j <= n; j += 2) v[1].eb(j);

    w[0] = v[1];
    reverse(all(v[0]));
    w[0].insert(w[0].end(), all(v[0]));
    w[1] = w[0];
    reverse(all(w[1]));

    int x = 0;
    while (n) {
        bool found = false;
        for (int j : w[x]) {
            if (n < j*j) continue;
            if (dp[n] != dp[n-j*j] + j) continue;
            found = true;
            cout << f(x,j);
            dump(x,j);
            n -= j*j;
            if (j%2 == 0) x = 1-x;
            break;
        }
        assert(found);
    }


}
0