제출 #278287

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
278287		acm	Rack (eJOI19_rack)	C++14	100 / 100	38 ms	38392 KiB

rack

#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define oprecision    \
  cout.precision(30); \
  cerr.precision(7);
#define ll long long
#define ld long double
#define ss string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) \
  for (int i = l; (l > r ? i >= r : i <= r); (l > r ? i-- : i++))
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define mp(x, y) make_pair(x, y)
#define F first
#define S second
using namespace std;
const ll mod = 1000000007LL;
ll n, k, pw[1000005];
ll get(ll x, ll y) {
  if (!x) return 1LL;
  return (get(x - 1LL, (y + 1LL) / 2LL) + ((y & 1LL) ? 0LL : pw[x - 1])) % mod;
}
int main() {
  speed;
  oprecision;
  // code
  cin >> n >> k;
  pw[0] = 1LL;
  forn(n) pw[i] = (pw[i - 1] + pw[i - 1]) % mod;
  cout << get(n, k);
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 60 / 60