結果
問題 | No.1869 Doubling? |
ユーザー | yuto1115 |
提出日時 | 2022-03-11 22:07:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 7,217 bytes |
コンパイル時間 | 2,869 ms |
コンパイル使用メモリ | 228,004 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-16 02:24:45 |
合計ジャッジ時間 | 3,907 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 1 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 1 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 1 ms
5,376 KB |
testcase_34 | AC | 1 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
testcase_36 | AC | 1 ms
5,376 KB |
testcase_37 | AC | 2 ms
5,376 KB |
testcase_38 | AC | 2 ms
5,376 KB |
testcase_39 | AC | 2 ms
5,376 KB |
testcase_40 | AC | 1 ms
5,376 KB |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | AC | 1 ms
5,376 KB |
testcase_43 | AC | 1 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 1 ms
5,376 KB |
ソースコード
#include<bits/stdc++.h>#include<ext/pb_ds/assoc_container.hpp>#include<ext/pb_ds/tree_policy.hpp>#include<ext/pb_ds/tag_and_trait.hpp>#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define SUM(a) accumulate(all(a),0LL)#define MIN(a) *min_element(all(a))#define MAX(a) *max_element(all(a))#define SORT(a) sort(all(a));#define REV(a) reverse(all(a));#define SZ(a) int(a.size())#define popcount(x) __builtin_popcountll(x)#define pf push_front#define pb push_back#define ef emplace_front#define eb emplace_back#define ppf pop_front#define ppb pop_back#ifdef __LOCAL#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }#else#define debug(...) void(0);#endif#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)using namespace std;using namespace __gnu_pbds;using ll = long long;using ld = long double;using P = pair<int, int>;using LP = pair<ll, ll>;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;using vd = vector<double>;using vvd = vector<vd>;using vs = vector<string>;using vc = vector<char>;using vvc = vector<vc>;using vb = vector<bool>;using vvb = vector<vb>;using vp = vector<P>;using vvp = vector<vp>;template<class T>using PQ = priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>>;template<class S, class T>istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }template<class S, class T>ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }template<class S, class T, class U>istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }template<class S, class T, class U>ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';}template<class T>istream &operator>>(istream &is, vector<T> &v) {for (T &t: v) { is >> t; }return is;}template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {os << '[';rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", ");return os << ']';}template<class T>ostream &operator<<(ostream &os, const deque<T> &v) {os << '[';rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", ");return os << ']';}template<class T>ostream &operator<<(ostream &os, const set<T> &st) {os << '{';auto it = st.begin();while (it != st.end()) {os << (it == st.begin() ? "" : ", ") << *it;it++;}return os << '}';}template<class T>ostream &operator<<(ostream &os, const multiset<T> &st) {os << '{';auto it = st.begin();while (it != st.end()) {os << (it == st.begin() ? "" : ", ") << *it;it++;}return os << '}';}template<class T>void vecout(const vector<T> &v, char div = '\n') {rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);}template<class T>bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template<class T>bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}void scan() {}template<class Head, class... Tail>void scan(Head &head, Tail &... tail) {cin >> head;scan(tail...);}template<class T>void print(const T &t) { cout << t << '\n'; }template<class Head, class... Tail>void print(const Head &head, const Tail &... tail) {cout << head << ' ';print(tail...);}template<class... T>void fin(const T &... a) {print(a...);exit(0);}template<class T>vector<T> &operator+=(vector<T> &v, T x) {for (T &t: v) t += x;return v;}template<class T>vector<T> &operator-=(vector<T> &v, T x) {for (T &t: v) t -= x;return v;}template<class T>vector<T> &operator*=(vector<T> &v, T x) {for (T &t: v) t *= x;return v;}template<class T>vector<T> &operator/=(vector<T> &v, T x) {for (T &t: v) t /= x;return v;}struct Init_io {Init_io() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cout << boolalpha << fixed << setprecision(15);cerr << boolalpha << fixed << setprecision(15);}} init_io;const string yes[] = {"no", "yes"};const string Yes[] = {"No", "Yes"};const string YES[] = {"NO", "YES"};const int inf = 1001001001;const ll linf = 1001001001001001001;void rearrange(const vi &) {}template<class T, class... Tail>void rearrange(const vi &ord, vector<T> &head, Tail &...tail) {assert(ord.size() == head.size());vector<T> ori = head;rep(i, ord.size()) head[i] = ori[ord[i]];rearrange(ord, tail...);}template<class T, class... Tail>void sort_by(vector<T> &head, Tail &... tail) {vi ord(head.size());iota(all(ord), 0);sort(all(ord), [&](int i, int j) { return head[i] < head[j]; });rearrange(ord, head, tail...);}template<class T, class S>vector<T> cumsum(const vector<S> &v, bool shift_one = true) {int n = v.size();vector<T> res;if (shift_one) {res.resize(n + 1);rep(i, n) res[i + 1] = res[i] + v[i];} else {res.resize(n);if (n) {res[0] = v[0];rep(i, 1, n) res[i] = res[i - 1] + v[i];}}return res;}vvi graph(int n, int m, bool directed = false, int origin = 1) {vvi G(n);rep(_, m) {INT(u, v);u -= origin, v -= origin;G[u].pb(v);if (!directed) G[v].pb(u);}return G;}template<class T>vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {vector<vector<pair<int, T>>> G(n);rep(_, m) {int u, v;T w;scan(u, v, w);u -= origin, v -= origin;G[u].eb(v, w);if (!directed) G[v].eb(u, w);}return G;}int main() {INT(n, m);vi v;int now = m;while (now > 1) {v.pb(now);now = (now + 1) / 2;}if (SZ(v) < n) {ll ans = SUM(v);ans += n - SZ(v);fin(ans);} else {v.clear();rep(i, n) v.pb(1 << i);assert(v.back() <= m);fin(SUM(v));}}