結果

問題 No.2746 Bicolor Pyramid
ユーザー siganaisiganai
提出日時 2024-04-21 00:20:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 6,116 bytes
コンパイル時間 2,766 ms
コンパイル使用メモリ 209,748 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-12 22:39:38
合計ジャッジ時間 4,773 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 AC 3 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 3 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 3 ms
5,248 KB
testcase_14 RE -
testcase_15 AC 3 ms
5,248 KB
testcase_16 WA -
testcase_17 AC 2 ms
5,248 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 2 ms
5,248 KB
testcase_27 AC 3 ms
5,248 KB
testcase_28 AC 3 ms
5,248 KB
testcase_29 AC 3 ms
5,248 KB
testcase_30 AC 3 ms
5,248 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 3 ms
5,248 KB
testcase_34 WA -
testcase_35 AC 3 ms
5,248 KB
testcase_36 AC 3 ms
5,248 KB
testcase_37 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
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 vul = vector<ull>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;

int main() {
    int M = 10000;
    int sq = sqrtl(M);
    vi dp(M + 1);
    vi mi(M + 1,1e9);
    dp[0] = 1;
    mi[0] = 0;
    rep(i,1,sq+1) {
        rrep(j,i*i,M + 1) {
            dp[j] |= dp[j-i*i];
            if(dp[j]) chmin(mi[j],(int)i);
        }
    }
    LL(r,b);
    if(b > r) swap(b,r);
    ll ng = intpow(10,6) * 2;
    ll ok = 0;
    set<ll> se;
    rep(i,1,10001) if(dp[i] == 0) se.insert(i);
    while(ng - ok > 1) {
        ll mid = (ng + ok) / 2;
        ll C = (__int128_t)mid * (mid + 1) * (2 * mid + 1) / 6;
        if(C > r + b) {
            ng = mid;
            continue;
        }
        if(r > 1000) {
            if(r >= C) ok = mid;
            else {
                ll C2 = (__int128_t)(mid + 1) * mid * (2 * mid + 3) / 6;
                if(C2 <= r + b) ok = mid;
                else {
                    ll R = r;
                    while(se.find(C2 - R) != se.end()) R--;
                    if(C - R <= b) ok = mid;
                    else ng = mid;
                }
            }
        }
        else {
            assert(false);
            vi dp(b+1);
            dp[0] = 1;
            rep(i,1,mid+1) {
                rrep(j,b+1-i*i) {
                    dp[j+i*i] |= dp[j];
                }
            }
            int x = 0;
            rrep(j,b+1) {
                if(dp[j] == 1) {
                    x = j;
                    break;
                }
            }
            if(r >= C - x) ok = mid;
            else ng = mid;
        }
    }   
    cout << ok << '\n';
    
/*
   int M = 1000000;
   int sq = sqrtl(M);
    vi dp(M + 1);
    vi mi(M + 1,1e9);
    dp[0] = 1;
    mi[0] = 0;
    rep(i,1,sq+1) {
        rrep(j,i*i,M + 1) {
            dp[j] |= dp[j-i*i];
            if(dp[j]) chmin(mi[j],(int)i);
        }
    }
    ll su = 0;
    int cnt = 0;
    rep(i,1,sq+1) {
        rep(j,su,min((ll)M,su+i*i)+1) {
            if(mi[j] > i) {
                debug(su + i * i - j);
            }
        }
        su += i * i;
    }
    debug(cnt);
    */

}
0