#409381 (C++14) No.953 席

提出ソース

結果

問題	No.953 席
ユーザー	haruki_K
提出日時	2019-12-17 02:21:16
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	6,307 bytes
コンパイル時間	2,211 ms
コンパイル使用メモリ	191,536 KB
実行使用メモリ	16,328 KB
最終ジャッジ日時	2024-07-02 21:07:21
合計ジャッジ時間	10,338 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	RE	-
testcase_03	RE	-
testcase_04	RE	-
testcase_05	RE	-
testcase_06	RE	-
testcase_07	WA	-
testcase_08	AC	283 ms 16,328 KB
testcase_09	AC	241 ms 15,992 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	RE	-
testcase_13	RE	-
testcase_14	RE	-
testcase_15	RE	-
testcase_16	RE	-
testcase_17	RE	-
testcase_18	RE	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	RE	-
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	AC	264 ms 16,152 KB
testcase_26	AC	85 ms 11,800 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
// <<<
int k1,k2;
struct Comp {
    bool operator()(int j1, int j2) const {
        auto dst = [&](int j) {
            if (j <= k1) return 2*(k1-j)+0;
            else return 2*(j-k2)+1;
        };
        return dst(j1) < dst(j2);
    }
};

int32_t main() {
    int n; cin >> n >> k1 >> k2; k1--,k2--;
    int flag = 0;
    if (k1 > k2) { flag = 1; swap(k1,k2); }
    int q; cin >> q;
    vector<int> a(q),b(q);
    rep (i,q) cin >> a[i] >> b[i];

    set<int, Comp> s0,s1;
    rep (j,n) s0.emplace(j);
    dump(s0);
    s1 = s0;

    vector<int> ans(q,-1);
    deque<int> line;
    pque_min<tuple<int,int,int> > es;
    rep (i,q) {
        es.emplace(a[i],+1,i);
        es.emplace(a[i]+b[i],-1,i);
    }

    auto check = [&](int j) {
        if (s0.count(j) &&
            (j == 0 || s0.count(j-1)) &&
            (j == n-1 || s0.count(j+1))) {
            s1.insert(j);
        } else {
            s1.erase(j);
        }
    };

    while (!es.empty()) {
        int t,s,i; tie(t,s,i) = es.top(); es.pop();
        dump(t,s,i);
        if (s > 0) line.pb(i);
        else {
            assert(ans[i] >= 0 && !s0.count(ans[i]) && !s1.count(ans[i]));
            s0.insert(ans[i]);
            check(ans[i]);
            check(ans[i]-1);
            check(ans[i]+1);
        }
        dump(s0);
        dump(s1);
        dump(line);

        if (line.empty()) continue;
        if (!es.empty() && get<0>(es.top()) == t) continue;
        int ni = line.front();
        dump(ni);
        assert(ans[ni] == -1);

        if (!s1.empty()) {
            say("!s1.empty()");
            int j = *s1.begin();
            ans[ni] = j;
            dump(ni,ans[ni]);
        } else if (!s0.empty()) {
            say("!s0.empty()");
            int j = *s0.begin();
            ans[ni] = j;
            dump(ni,ans[ni]);
        }

        if (ans[ni] >= 0) {
            line.pop_front();
            s0.erase(ans[ni]);
            check(ans[ni]-1); check(ans[ni]); check(ans[ni]+1);
            dump(s0);
            dump(s1);
            dump(line);
        }
    }

    rep (i,q) cout << (flag ? n-ans[i] : ans[i]+1) << "\n";

}

yukicoder

結果

テストケース

ソースコード