結果
| 問題 | No.54 Happy Hallowe'en |
| コンテスト | |
| ユーザー |
 zeta
|
| 提出日時 | 2026-02-16 08:18:04 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 9 ms / 5,000 ms |
| コード長 | 16,108 bytes |
| 記録 | |
| コンパイル時間 | 3,083 ms |
| コンパイル使用メモリ | 278,060 KB |
| 実行使用メモリ | 7,844 KB |
| 最終ジャッジ日時 | 2026-02-16 08:18:08 |
| 合計ジャッジ時間 | 4,230 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 19 |
ソースコード
#line 1 "No_54_Happy_Hallowe_en.cpp"
#define YRSD
#line 2 "YRS/all.hpp"
#line 2 "YRS/aa/head.hpp"
#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>
#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define OV4(a, b, c, d, e, ...) e
#define FOR1(a) for (int _ = 0; _ < (a); ++_)
#define FOR2(i, a) for (int i = 0; i < (a); ++i)
#define FOR3(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) OV4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR1_R(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FOR2_R(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FOR3_R(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FOR4_R(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) OV4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))
#define sort ranges::sort
using namespace std;
TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long; using ull = unsigned long long;
using ld = long double; using i128 = __int128; using u128 = __uint128_t; using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>; using PLL = pair<ll, ll>;
#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
#line 2 "YRS/IO/IO.hpp"
istream &operator>>(istream &I, i128 &x) {
static string s;
I >> s;
int f = s[0] == '-';
x = 0;
const int N = (int)s.size();
FOR(i, f, N) x = x * 10 + s[i] - '0';
if (f) x = -x;
return I;
}
ostream &operator<<(ostream &O, i128 x) {
static string s;
s.clear();
bool f = x < 0;
if (f) x = -x;
while (x) s += '0' + x % 10, x /= 10;
if (s.empty()) s += '0';
if (f) s += '-';
reverse(all(s));
return O << s;
}
istream &operator>>(istream &I, f128 &x) {
static string s;
I >> s, x = stold(s);
return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
for (Z &e : c) I >> e;
return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, const char*>) and
(not is_same_v<decay_t<T>, string>) and
(not is_array_v<remove_reference_t<T>> or
not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
if (a.empty()) return O;
Z i = a.begin();
O << *i++;
for (; i != a.end(); ++i) O << ' ' << *i;
return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
cout << x;
if constexpr (sizeof...(S)) cout << ' ';
print(forward<S>(y)...);
}
void put() { cout << ' '; }
TES void put(T &&x, S &&...y) {
cout << x;
if constexpr (sizeof...(S)) cout << ' ';
put(forward<S>(y)...);
}
#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128 __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)
void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#line 5 "YRS/all.hpp"
#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};
TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }
void reverse(Z &a) { reverse(all(a)); }
void unique(Z &a) {
sort(a);
a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
int N = len(a);
vc<int> b(N, -1);
FOR(i, N) if (a[i] != -1) b[a[i]] = i;
return b;
}
Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }
vc<int> argsort(const Z &a) {
vc<int> I(len(a));
iota(all(I), 0);
sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
int N = len(I);
vc<T> b(N);
FOR(i, N) b[i] = a[I[i]];
return b;
}
template <int of = 1, typename T>
vc<T> pre_sum(const vc<T> &a) {
int N = len(a);
vc<T> c(N + 1);
FOR(i, N) c[i + 1] = c[i] + a[i];
if (of == 0) c.erase(c.begin());
return c;
}
TE constexpr static int topbit(T x) {
if (x == 0) return - 1;
if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
if (x == 0) return -1;
if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
else return __builtin_ctzll(x);
}
TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * x; }
TE constexpr pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
if constexpr (ck) assert(f(l));
while (abs(l - r) > 1) {
ll x = (r + l) >> 1;
(f(x) ? l : r) = x;
}
return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
while (c--) {
T x = (l + r) / 2;
(f(x) ? l : r) = x;
}
return (l + r) / 2;
}
Z pop(Z &s) {
if constexpr (requires { s.pop_back(); }) {
Z x = s.back();
return s.pop_back(), x;
} else if constexpr (requires { s.top(); }) {
Z x = s.top();
return s.pop(), x;
} else {
Z x = s.front();
return s.pop(), x;
}
}
void setp(int x) { cout << fixed << setprecision(x); }
TE inline void sh(vc<T> &a, int N) {
a.resize(N, T(0));
}
#line 1 "YRS/debug.hpp"
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
cerr << x;
if constexpr (sizeof...(S)) cerr << ", ";
DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
cerr << x;
if constexpr (sizeof...(S)) cerr << ", ";
ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#define asser assert
#else
#define debug(...) void(0721)
#define err(...) void(0721)
#define asser(...) void(0721)
#endif
#line 4 "No_54_Happy_Hallowe_en.cpp"
// #include "YRS/IO/fast_io.hpp"
// #include "YRS/random/rng.hpp"
#line 1 "YRS/ds/basic/bs.hpp"
struct bs {
int N;
vc<ull> a;
bs(int N = 0) : N(N), a((N + 63) >> 6) {};
void set(int x, bool f) {
if (f) set(x);
else reset(x);
}
void set(int x) { a[x / 64] |= 1ull << (x & 63); }
void set() { fill(all(a), -1ull); }
void reset(int x) { a[x / 64] &= ~(1ull << (x & 63)); }
void reset() { fill(all(a), 0); }
void flip(int x) { a[x / 64] ^= 1ull << (x & 63); }
void flip() {
int sz = len(a) - 1;
FOR(i, sz) a[i] = ~a[i];
FOR(i, sz << 6, N) flip(i);
}
inline bool get(int x) const { return a[x / 64] >> (x & 63) & 1; }
inline bool operator[](int x) const { return get(x); }
int prev(int i) const {
int k = i >> 6;
if ((i & 63) < 63) {
ull x = a[k];
x &= (1ull << ((i & 63) + 1)) - 1;
if (x) return k << 6 | topbit(x);
--k;
}
FOR_R(i, k + 1) if (a[i]) return i << 6 | topbit(a[i]);
return -1;
}
int next(int i) const {
int k = i >> 6, s = i & 63;
ull x = (a[k] >> s) << s;
if (x) return k << 6 | lowbit(x);
FOR(i, k + 1, (N + 63) >> 6) if (a[i]) return i << 6 | lowbit(a[i]);
return N;
}
int _Find_first() const { return next(0); }
int _Find_next(int i) const { return next(i + 1); }
void resize(int sz) {
a.resize((sz + 63) >> 6);
int r = sz & 63;
if (r) a.back() &= (1ull << r) - 1;
N = sz;
}
void range_set(int l, int r) {
while (l < r and (l & 63)) set(l++);
while (l < r and (r & 63)) set(--r);
FOR(i, l >> 6, r >> 6) a[i] = -1ull;
}
void range_reset(int l, int r) {
while (l < r and (l & 63)) reset(l++);
while (l < r and (r & 63)) reset(--r);
FOR(i, l >> 6, r >> 6) a[i] = 0;
}
void range_flip(int l, int r) {
while (l < r and (l & 63)) flip(l++);
while (l < r and (r & 63)) flip(--r);
FOR(i, l >> 6, r >> 6) a[i] = ~a[i];
}
int range_count(int l, int r) const {
int s = 0;
while (l < r and (l & 63)) s += get(l++);
while (l < r and (r & 63)) s += get(--r);
FOR(i, l >> 6, r >> 6) s += pc(a[i]);
return s;
}
void range_assign(int l, int r, bs p) {
assert(p.N == r - l);
int f = 0, t = r - l;
while (l < r and (l & 63)) set(l++, p.get(f++));
while (l < r and (r & 63)) set(--r, p.get(--t));
l >>= 6, r >>= 6;
int s = f >> 6, N = r - l, hi = f & 63, lo = 64 - hi;
if (not(f & 63)) FOR(i, N) a[l + i] = p.a[s + i];
else FOR(i, N) a[l + i] = (p.a[s + i] >> hi) | (p.a[s + i + 1] << lo);
}
void range_xor(int l, int r, bs p) {
assert(p.N == r - l);
int f = 0, t = r - l;
while (l < r and (l & 63)) a[l >> 6] ^= ull(p.get(f)) << (l & 63), ++f, ++l;
while (l < r and (r & 63)) --t, --r, a[r >> 6] ^= ull(p.get(t)) << (r & 63);
l >>= 6, r >>= 6;
int s = f >> 6, N = r - l, hi = f & 63, lo = 64 - hi;
if (not(f & 63)) FOR(i, N) a[l + i] ^= p.a[s + i];
else FOR(i, N) a[l + i] ^= (p.a[s + i] >> hi) | (p.a[s + i + 1] << lo);
}
void range_and(int l, int r, bs p) {
assert(p.N == r - l);
int f = 0, t = r - l;
while (l < r and (l & 63)) {
if (!p.get(f)) a[l >> 6] &= ~(1ull << (l & 63));
++f, ++l;
}
while (l < r and (r & 63)) {
--t, --r;
if (!p.get(t)) a[r >> 6] &= ~(1ull << (r & 63));
}
l >>= 6, r >>= 6;
int s = f >> 6, N = r - l, hi = f & 63, lo = 64 - hi;
if (not(f & 63)) FOR(i, N) a[l + i] &= p.a[s + i];
else FOR(i, N) a[l + i] &= (p.a[s + i] >> hi) | (p.a[s + i + 1] << lo);
}
void range_or(int l, int r, bs p) {
assert(p.N == r - l);
int f = 0, t = r - l;
while (l < r and (l & 63)) a[l >> 6] |= ull(p.get(f)) << (l & 63), ++f, ++l;
while (l < r and (r & 63)) --t, --r, a[r >> 6] |= ull(p.get(t)) << (r & 63);
l >>= 6, r >>= 6;
int s = f >> 6, N = r - l, hi = f & 63, lo = 64 - hi;
if (not(f & 63)) FOR(i, N) a[l + i] |= p.a[s + i];
else FOR(i, N) a[l + i] |= (p.a[s + i] >> hi) | (p.a[s + i + 1] << lo);
}
int count() const {
int N = len(a), s = 0;
FOR(i, N) s += pc(a[i]);
return s;
}
bs range(int l, int r) const {
bs s(r - l);
int rm = (r - l) & 63;
while (rm--) s.set(r - l - 1, get(r - 1)), --r;
int N = (r - l) >> 6, hi = l & 63, lo = 64 - hi, t = l >> 6;
if (hi == 0) FOR(i, N) s.a[i] ^= a[t + i];
else FOR(i, N) s.a[i] ^= (a[t + i] >> hi) ^ (a[t + i + 1] << lo);
return s;
}
void moveL(int x) {
if (not x) return;
int sz = (N + 63) >> 6;
FOR(i, sz - x) a[i] = a[i + x];
FOR(i, max(0, sz - x), sz) a[i] = 0;
}
void moveR(int x) {
if (not x) return;
int sz = (N + 63) >> 6;
FOR_R(i, x, sz) a[i] = a[i - x];
FOR(i, min(x, sz)) a[i] = 0;
}
bs &operator<<=(int x) {
if (x < 0) return *this >>= -x;
moveR(x >> 6);
x &= 63;
ull s = 0, ls = 0, ps = 64 - x;
FOR(i, 1, x + 1) s |= 1ull << (64 - i);
int sz = (N + 63) >> 6;
FOR(i, sz) {
ull c = (a[i] & s) >> ps;
a[i] <<= x, a[i] |= ls, ls = c;
}
return resize(N), *this;
}
bs &operator>>=(int x) {
if (x < 0) return *this <<= -x;
moveL(x >> 6);
x &= 63;
ull s = (1ull << x) - 1, ls = 0, ps = 64 - x;
int sz = (N + 63) >> 6;
FOR_R(i, sz) {
ull ss = (a[i] & s) << ps;
a[i] >>= x, a[i] |= ls, ls = ss;
}
return *this;
}
bs operator<<(int x) const { return bs(*this) <<= x; };
bs operator>>(int x) const { return bs(*this) >>= x; };
void AND(const bs &p) {
int sz = (N + 63) >> 6;
FOR(i, sz) a[i] &= p.a[i];
}
void OR(const bs &p) {
int sz = (N + 63) >> 6;
FOR(i, sz) a[i] |= p.a[i];
}
void XOR(const bs &p) {
int sz = (N + 63) >> 6;
FOR(i, sz) a[i] ^= p.a[i];
}
bs operator&=(const bs &p) { return AND(p), *this; }
bs operator&(const bs &p) { return bs(*this) &= p; }
bs operator|=(const bs &p) { return OR(p), *this; }
bs operator|(const bs &p) { return bs(*this) |= p; }
bs operator^=(const bs &p) { return XOR(p), *this; }
bs operator^(const bs &p) { return bs(*this) ^= p; }
bs operator~() const {
bs r = *this;
return r.flip(), r;
}
string to_s() const {
string s;
FOR(i, N) s += '0' + get(i);
return s;
}
};
#line 7 "No_54_Happy_Hallowe_en.cpp"
#define tests 0
#define fl 0
#define DB 10
void Yorisou() {
INT(N);
VEC(PII, a, N);
sort(a, [&](PII a, PII b) { return a.fi + a.se < b.fi + b.se; });
bs f(2'000'1);
f.set(0);
for (Z [c, lm] : a) {
f.range_or(c, c + lm, f.range(0, lm));
}
print(f.prev(2'000'0));
}
#line 1 "YRS/aa/main.hpp"
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int T = 1;
if (fl) cerr.tie(0);
if (tests and not fl) IN(T);
for (int i = 0; i < T or fl; ++i) {
Yorisou();
if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
}
return 0;
}
#line 23 "No_54_Happy_Hallowe_en.cpp"