結果
問題 | No.1286 Stone Skipping |
ユーザー |
![]() |
提出日時 | 2020-11-13 21:50:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,698 bytes |
コンパイル時間 | 2,058 ms |
コンパイル使用メモリ | 195,264 KB |
最終ジャッジ日時 | 2025-01-15 22:51:32 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define LOCAL#pragma region Macrostypedef long long ll;#define ALL(x) (x).begin(),(x).end()const long long MOD=1000000007;// const long long MOD=998244353;const int INF=1e9;const long long IINF=1e18;const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};const char dir[4]={'D','R','U','L'};template<typename T>istream &operator>>(istream &is,vector<T> &v){for (T &x:v) is >> x;return is;}template<typename T>ostream &operator<<(ostream &os,const vector<T> &v){for (int i=0;i<v.size();++i){os << v[i] << (i+1==v.size()?"": " ");}return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const pair<T,U> &p){os << '(' << p.first << ',' << p.second << ')';return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const map<T,U> &m){os << '{';for (auto itr=m.begin();itr!=m.end();++itr){os << '(' << itr->first << ',' << itr->second << ')';if (++itr!=m.end()) os << ',';--itr;}os << '}';return os;}template<typename T>ostream &operator<<(ostream &os,const set<T> &s){os << '{';for (auto itr=s.begin();itr!=s.end();++itr){os << *itr;if (++itr!=s.end()) os << ',';--itr;}os << '}';return os;}void debug_out(){cerr << '\n';}template<class Head,class... Tail>void debug_out(Head&& head,Tail&&... tail){cerr << head;if (sizeof...(Tail)>0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) cerr << " ";\cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\cerr << " ";\debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}template<class T1,class T2> inline bool chmin(T1 &a,T2 b){if (a>b){a=b; return true;} return false;}template<class T1,class T2> inline bool chmax(T1 &a,T2 b){if (a<b){a=b; return true;} return false;}#pragma endregionconst int MAX_B=60;int main(){cin.tie(0);ios::sync_with_stdio(false);ll D; cin >> D;vector<ll> sum(MAX_B+1,0);for (int i=1;i<=MAX_B;++i) sum[i]=(1LL<<i)-1;for (int i=MAX_B;i>0;--i){ll mul=D/sum[i],last=1LL<<(i-1);ll cur=sum[i]*mul; last*=mul;for (int j=i-1;j>0;--j){if (cur+sum[j]<=D){cur+=sum[j];last+=1LL<<(j-1);// debug(i,j,cur,last);}}// debug(i,cur,last);if (cur==D){cout << last << '\n';return 0;}}}