結果
問題 |
No.3 ビットすごろく
|
ユーザー |
|
提出日時 | 2018-05-12 13:33:41 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,732 bytes |
コンパイル時間 | 715 ms |
コンパイル使用メモリ | 78,896 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-01 09:00:12 |
合計ジャッジ時間 | 1,696 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
#include <iostream> #include <algorithm> #include <vector> #include <queue> using namespace std; template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; } template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; } template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; } int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; } long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }} struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; } long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} #define mod long(1e9 + 7) #define all(x) (x).begin(), (x).end() #define bitcount(n) __builtin_popcountl(long(n)) struct path{ int now, cost; }; int main(){ int N; cin >> N; vector<int> distances(N + 1, -1); distances[1] = 1; queue<path> pathes; pathes.push({1, 1}); while(!pathes.empty()){ if(pathes.front().now - bitcount(pathes.front().now) >= 1 && distances[pathes.front().now - bitcount(pathes.front().now)] == -1){ distances[pathes.front().now - bitcount(pathes.front().now)] = pathes.front().cost + 1; pathes.push({pathes.front().now - bitcount(pathes.front().now), pathes.front().cost + 1}); } if(pathes.front().now + bitcount(pathes.front().now) <= N && distances[pathes.front().now + bitcount(pathes.front().now)] == -1){ distances[pathes.front().now + bitcount(pathes.front().now)] = pathes.front().cost + 1; pathes.push({pathes.front().now + bitcount(pathes.front().now), pathes.front().cost + 1}); } pathes.pop(); } cout << distances[N] << endl; }