結果

問題 No.953 席
ユーザー PachicobuePachicobue
提出日時 2019-12-16 03:34:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 101 ms / 2,000 ms
コード長 7,717 bytes
コンパイル時間 2,389 ms
コンパイル使用メモリ 218,264 KB
実行使用メモリ 13,056 KB
最終ジャッジ日時 2024-07-02 19:08:18
合計ジャッジ時間 5,535 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 51 ms
5,632 KB
testcase_03 AC 50 ms
5,376 KB
testcase_04 AC 49 ms
5,504 KB
testcase_05 AC 43 ms
5,376 KB
testcase_06 AC 52 ms
5,760 KB
testcase_07 AC 95 ms
12,288 KB
testcase_08 AC 88 ms
9,972 KB
testcase_09 AC 101 ms
13,056 KB
testcase_10 AC 26 ms
6,400 KB
testcase_11 AC 68 ms
8,576 KB
testcase_12 AC 68 ms
8,576 KB
testcase_13 AC 85 ms
9,680 KB
testcase_14 AC 60 ms
7,552 KB
testcase_15 AC 59 ms
7,168 KB
testcase_16 AC 64 ms
7,680 KB
testcase_17 AC 75 ms
8,192 KB
testcase_18 AC 69 ms
7,652 KB
testcase_19 AC 95 ms
9,868 KB
testcase_20 AC 64 ms
7,552 KB
testcase_21 AC 50 ms
5,888 KB
testcase_22 AC 69 ms
8,640 KB
testcase_23 AC 57 ms
6,528 KB
testcase_24 AC 56 ms
6,528 KB
testcase_25 AC 90 ms
9,872 KB
testcase_26 AC 36 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2019/12/15] 17:30:14
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto fix_point = [](auto f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
} hogechan;

template<typename T>
void out(const T& v) { std::cout << v; }
template<typename T>
void out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    std::cout << "\n";
}
template<typename T1, typename T2>
void out(const std::pair<T1, T2>& v) { out(v.first), std::cout << ' ', out(v.second); }
template<typename T, typename... Args>
void out(const T& v, const Args... args) { out(v), std::cout << ' ', out(args...); }
template<typename... Args>
void outln(const Args... args) { out(args...), std::cout << '\n'; }
template<typename... Args>
void outel(const Args... args) { out(args...), std::cout << std::endl; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto N = in<ll>();
    assert(2 <= N and N <= TEN(5));
    const auto K1 = in<ll>();
    const auto K2 = in<ll>();
    assert(1 <= K1 and K1 <= N);
    assert(1 <= K2 and K2 <= N);
    assert(std::abs(K1 - K2) == 1);
    const auto D = K1 * 2 + K2;
    auto comp    = [D](const ll k1, const ll k2) { return std::abs(3 * k1 - D) < std::abs(3 * k2 - D); };
    std::vector<bool> empty(N + 2, true);
    std::set<ll, decltype(comp)> seats(comp);
    std::set<ll, decltype(comp)> good_seats(comp);
    for (ll i = 1; i <= N; i++) {
        seats.insert(i);
        good_seats.insert(i);
    }
    auto good = [&](const ll k) {
        if (k < 1 or k > N) { return false; }
        return empty[k - 1] and empty[k] and empty[k + 1];
    };
    auto sit_at = [&](const ll k) {
        assert(empty[k]);
        empty[k] = false;
        seats.erase(k);
        if (not good(k)) { good_seats.erase(k); }
        if (not good(k - 1)) { good_seats.erase(k - 1); }
        if (not good(k + 1)) { good_seats.erase(k + 1); }
    };
    auto sit = [&]() -> ll {
        if (not good_seats.empty()) {
            const ll k = *good_seats.begin();
            sit_at(k);
            return k;
        } else if (not seats.empty()) {
            const ll k = *seats.begin();
            sit_at(k);
            return k;
        } else {
            return 0;
        }
    };
    auto leave = [&](const ll k) {
        assert(not empty[k]);
        empty[k] = true;
        seats.insert(k);
        if (good(k)) { good_seats.insert(k); }
        if (good(k - 1)) { good_seats.insert(k - 1); }
        if (good(k + 1)) { good_seats.insert(k + 1); }
    };
    using pli    = std::pair<ll, ll>;
    const auto Q = in<ll>();
    assert(1 <= Q and Q <= TEN(5));
    std::vector<ll> a(Q), b(Q);
    for (ll i = 0; i < Q; i++) {
        a[i] = in<ll>(), b[i] = in<ll>();
        assert(1 <= a[i] and a[i] <= TEN(9));
        assert(1 <= b[i] and b[i] <= TEN(9));
    }
    for (ll i = 0; i < Q - 1; i++) { assert(a[i] < a[i + 1]); }
    std::priority_queue<pli, std::vector<pli>, std::greater<pli>> ls;
    ll tim = 0;
    for (ll i = 0; i < Q; i++) {
        chmax(tim, a[i]);
        while (not ls.empty() and ls.top().first <= tim) {
            leave(ls.top().second);
            ls.pop();
        }
        ll k = 0;
        while (true) {
            k = sit();
            if (k != 0) { break; }
            const auto info = ls.top();
            tim             = info.first;
            while (not ls.empty() and ls.top().first == tim) {
                leave(ls.top().second);
                ls.pop();
            }
        }
        ls.push({tim + b[i], k});
        outln(k);
    }
    return 0;
}
0