#228756 (C++11) No.680 作れる数

• 問題: No.680 作れる数
• ユーザー: はむこ
• 提出日時: 2018-01-10 01:11:20
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 6,502 bytes
• コンパイル時間: 1,413 ms
• コンパイル使用メモリ: 163,808 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-25 23:05:35
• 合計ジャッジ時間: 2,435 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,384 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	2 ms; 4,384 KB
testcase_03	AC	1 ms; 4,380 KB
testcase_04	AC	1 ms; 4,384 KB
testcase_05	AC	1 ms; 4,380 KB
testcase_06	AC	2 ms; 4,380 KB
testcase_07	AC	2 ms; 4,384 KB
testcase_08	AC	2 ms; 4,384 KB
testcase_09	AC	1 ms; 4,380 KB
testcase_10	AC	1 ms; 4,384 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	2 ms; 4,384 KB
testcase_13	AC	2 ms; 4,380 KB
testcase_14	AC	2 ms; 4,384 KB
testcase_15	AC	1 ms; 4,384 KB
testcase_16	AC	1 ms; 4,384 KB
testcase_17	AC	1 ms; 4,380 KB
testcase_18	AC	2 ms; 4,380 KB
testcase_19	AC	0 ms; 4,380 KB

ソースコード

#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }

inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; } // これを使うならば、tieとかを消して！！
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size())  rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << "    " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl;  } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40) 

#define EPS (double)1e-14
#define INF (ll)1e18
#define mo  (ll)(1e9+7)

bool solve(ll n) {
    vector<P> q;
    set<P> visited;
    q.pb(P(0, 0));
    while (q.size()) {
        vector<P> q_next;
        for (auto x : q) {
            if (visited.count(x)) continue;
            visited.insert(x);
            if (x.fi == n) {
                return 1;
            }
            if (x.fi+2ll*x.se+0<=n)
                q_next.pb(P(x.fi+2ll*x.se+0, 2ll*x.se+0));
            if (x.fi+2ll*x.se+1<=n)
                q_next.pb(P(x.fi+2ll*x.se+1, 2ll*x.se+1));
            q_next.pb(x);
        }
        swap(q, q_next);
    }
//    for (auto x : visited) cout << x << endl;
    return 0;
}

ll t_to_s(ll t) {
    ll tmp = t, cnt = 0;
    while (tmp) cnt += tmp, tmp /= 2;
    return cnt;
}
ll solveFast(ll n) {
    ll ng = -1, ok = 1e9;
    // t_to_s(ok) >= n
    while (ok - ng > 1) {
        ll mid = (ok + ng) / 2;
        ll cnt = t_to_s(mid);
        (cnt >= n ? ok : ng) = mid;
    }
    return t_to_s(ok) == n;
}
int main(void) {
    ll n; cin >> n;
    assert(0<=n&&n<=1e9);
    if (n < 1000) assert(solve(n) == solveFast(n));
    cout << (solveFast(n) ? "YES" : "NO") << endl;
    return 0;
}