結果

問題 No.262 面白くないビットすごろく
ユーザー fumiphysfumiphys
提出日時 2019-10-19 22:39:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 196 ms / 2,000 ms
コード長 3,789 bytes
コンパイル時間 1,470 ms
コンパイル使用メモリ 168,684 KB
実行使用メモリ 261,576 KB
最終ジャッジ日時 2024-06-28 00:32:09
合計ジャッジ時間 2,933 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 190 ms
261,576 KB
testcase_01 AC 195 ms
261,468 KB
testcase_02 AC 196 ms
261,440 KB
testcase_03 AC 196 ms
261,468 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[21][1<<20];
int nel[21][1<<20];

int main(int argc, char const* argv[])
{
  ll n; cin >> n;
  rep(i, 21){
    for(int j = bit(20) - 1; j >= 0; j--){
      int nex = j + (j == 0 && i == 0 ? 1: __builtin_popcount(j)) + i;
      if(nex >= bit(20)){
        dp[i][j] = 1;
        nel[i][j] = nex % bit(20);
      }else{
        dp[i][j] = 1 + dp[i][nex];
        nel[i][j] = nel[i][nex];
      }
    }
  }
  int c = (n / bit(20));
  ll curr = 0;
  ll res = 0;
  rep(i, c){
    res += dp[__builtin_popcount(i)][curr];
    curr = nel[__builtin_popcount(i)][curr];
  }
  int d = n % bit(20);
  if(curr > d){
    cout << -1 << endl;
    return 0;
  }
  while(true){
    res++;
    curr += (curr == 0 && c == 0 ? 1: __builtin_popcount(curr)) + __builtin_popcount(c);
    if(curr == d){
      cout << res << endl;
      return 0;
    }else if(curr > d){
      cout << -1 << endl;
      return 0;
    }
  }
  return 0;
}
0