結果
問題 |
No.3298 K-th Slime
|
ユーザー |
|
提出日時 | 2025-10-05 13:55:48 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 3,799 bytes |
コンパイル時間 | 2,841 ms |
コンパイル使用メモリ | 284,948 KB |
実行使用メモリ | 7,716 KB |
最終ジャッジ日時 | 2025-10-05 13:55:56 |
合計ジャッジ時間 | 4,473 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h> using namespace std; template <class F> class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward<F>(f)) {} template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); } }; using ll = long long; using ld = long double; using u64 = uint64_t; using vi = vector<int>; using vl = vector<ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>; inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcountll(x); } inline ll floor_div(ll a, ll b) noexcept { return a / b - (a % b && (a ^ b) < 0); } inline ll ceil_div(ll a, ll b) noexcept { return floor_div(a + b - 1, b); } template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } template <class T> void dedup(std::vector<T>& v) { std::sort(std::begin(v), std::end(v)), v.erase(std::unique(std::begin(v), std::end(v)), std::end(v)); } template <class F> ll bisect(ll ok, ll ng, const F& f) { while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; } template <class F> ld bisect_real(ld ok, ld ng, const F& f, int iter = 80) { while (iter--) { ld mid = (ok + ng) / 2.; (f(mid) ? ok : ng) = mid; } return ok; } inline void SCAN() {} template <class H, class... T> inline void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); } #define INT(...) int __VA_ARGS__; SCAN(__VA_ARGS__) #define LL(...) long long __VA_ARGS__; SCAN(__VA_ARGS__) #define LD(...) long double __VA_ARGS__; SCAN(__VA_ARGS__) #define STR(...) std::string __VA_ARGS__; SCAN(__VA_ARGS__) #define CHAR(...) char __VA_ARGS__; SCAN(__VA_ARGS__) #define VEC(type, name, size) std::vector<type> name(size); for (int i = 0; i < (int)size; i++) SCAN(name[i]); #define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); for (int i = 0; i < (int)h; i++) for (int j = 0; j < (int)w; j++) SCAN(name[i][j]); #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define len(x) (long long)(size(x)) #define pb push_back #ifndef LOCAL #define debug(...) #endif void run_case() { INT(N, K, Q); VEC(ll, A, N); prique<ll> MIN; prique<ll, greater<>> MAX; rep(i, N) { if (i < K) { MIN.push(A[i]); } else { MIN.push(A[i]); ll mx = MIN.top(); MIN.pop(); MAX.push(mx); } } rep(Q) { INT(op); if (op == 1) { int x; cin >> x; MIN.push(x); ll mx = MIN.top(); MIN.pop(); MAX.push(mx); } else if (op == 2) { int y; cin >> y; ll kmax = MIN.top(); MIN.pop(); kmax += y; MAX.push(kmax); ll mn = MAX.top(); MAX.pop(); MIN.push(mn); } else { cout << MIN.top() << "\n"; } assert(MIN.size()==K); } } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; while (T--) run_case(); return 0; }