結果

問題 No.814 ジジ抜き
ユーザー PachicobuePachicobue
提出日時 2019-04-14 21:03:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,027 bytes
コンパイル時間 1,961 ms
コンパイル使用メモリ 204,676 KB
実行使用メモリ 7,936 KB
最終ジャッジ日時 2024-09-19 13:08:42
合計ジャッジ時間 9,879 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 8 ms
5,376 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 453 ms
7,808 KB
testcase_07 AC 178 ms
5,760 KB
testcase_08 AC 312 ms
7,680 KB
testcase_09 AC 327 ms
6,528 KB
testcase_10 AC 418 ms
7,680 KB
testcase_11 AC 470 ms
7,680 KB
testcase_12 AC 213 ms
5,504 KB
testcase_13 AC 209 ms
5,504 KB
testcase_14 AC 322 ms
6,784 KB
testcase_15 AC 167 ms
5,376 KB
testcase_16 AC 140 ms
5,376 KB
testcase_17 AC 374 ms
6,912 KB
testcase_18 AC 301 ms
6,400 KB
testcase_19 AC 352 ms
7,808 KB
testcase_20 AC 224 ms
5,632 KB
testcase_21 AC 203 ms
5,888 KB
testcase_22 AC 266 ms
7,168 KB
testcase_23 AC 157 ms
5,376 KB
testcase_24 AC 246 ms
6,656 KB
testcase_25 AC 193 ms
5,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return a = std::min(a, b), a == b; }
template <typename T>
bool chmax(T& a, const T& b) { return a = std::max(a, b), a == b; }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!============================================!//
//!    8888ba.88ba             oo              !//
//!    88  '8b  '8b                            !//
//!    88   88   88  .d8888b.  dP  88d888b.    !//
//!    88   88   88  88'  '88  88  88'  '88    !//
//!    88   88   88  88.  .88  88  88    88    !//
//!    dP   dP   dP  '88888P8  dP  dP    dP    !//
//!============================================!//
int main()
{
    int N;
    std::cin >> N;
    std::vector<int> K(N), D(N);
    std::vector<ll> L(N);
    for (int i = 0; i < N; i++) { std::cin >> K[i] >> L[i] >> D[i]; }
    auto ok = [&](const ll A) {
        ll sub = 0;
        for (int i = 0; i < N; i++) {
            ll num = std::min((ll)K[i], A >= L[i] ? (A - L[i]) / (1LL << D[i]) + 1LL : 0LL);
            sub += num;
        }
        return sub % 2LL == 0LL;
    };
    ll inf = -1LL, sup = 1000000000000000000LL + 1LL;
    while (sup - inf > 1LL) {
        const ll mid = (inf / 2LL + sup / 2LL) + (inf % 2 == 1 and sup % 2 == 1 ? 1LL : 0LL);
        (ok(mid) ? inf : sup) = mid;
    }
    std::cout << sup << std::endl;
    return 0;
}
0