結果

問題 No.953 席
コンテスト
ユーザー hitonanode
提出日時 2019-12-16 00:46:31
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 5,517 bytes
コンパイル時間 2,141 ms
コンパイル使用メモリ 194,392 KB
実行使用メモリ 36,608 KB
最終ジャッジ日時 2024-07-02 18:33:41
合計ジャッジ時間 10,647 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 4 WA * 9 RE * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/


int main()
{
    int N, K, K2;
    cin >> N >> K >> K2;
    vector<int> yusen(N + 1);

    int i = K, j = K + 1, pr = 0;
    while (true) {
        if (i >= 0) yusen[i--] = pr++;
        if (j <= N) yusen[j++] = pr++;
        if (i < 0 and j > N) break;
    }
    auto f = [&](const int &l, const int &r){ return yusen[l] < yusen[r]; };
    set<int, function<bool (const int &l, const int &r)>> aki(f), aki_pri(f);
    FOR(i, 1, N + 1) aki.insert(i), aki_pri.insert(i);
    map<int, set<pint>> kyaku;
    int Q;
    cin >> Q;
    REP(q, Q) {
        int a, b;
        cin >> a >> b;
        kyaku[a].emplace(q, b);  // hito, duration
    }
    int t = -1;
    vector<int> ret(Q);
    queue<pint> waiting;
    vector<int> state(N + 2);
    while (true)
    {
        auto p = kyaku.upper_bound(t);
        if (p == kyaku.end()) break;
        t = p->first;
        for (auto pa : p->second) {
            int q = pa.first, T = pa.second;
            if (q >= 0) waiting.emplace(pa);
            if (q < 0)
            {
                aki.insert(T);
                state[T] = 0;
                FOR(d, -1, 2) if ((T + d - 1 < 0 or !state[T + d - 1]) and !state[T + d] and !state[T + d + 1] and T + d <= N) aki_pri.insert(T + d);

            }
        }
        while (aki.size() and waiting.size()) {
            int q = waiting.front().first, T = waiting.front().second;
            if (aki_pri.size())
            {
                int v = *aki_pri.begin();
                ret[q] = v;
                kyaku[t + T].emplace(-1, v);
                aki.erase(v);
                aki_pri.erase(v);
                aki_pri.erase(v - 1);
                aki_pri.erase(v + 1);
                state[v] = 1;
            }
            else
            {
                int v = *aki.begin();
                ret[q] = v;
                kyaku[t + T].emplace(-1, v);
                aki.erase(v);
                state[v] = 1;
            }
            waiting.pop();
        }
    }
    REP(q, Q) printf("%d\n", ret[q]);
}
0