提出 #48589854

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    std::vector<Num> ts;
    std::vector<Num> t1s;
    std::vector<std::vector<std::pair<Num, Num>>> events(200009);
    for(Num i{0}; i<n; ++i) {
        Num t, x;
        is >> t >> x;
        events[x].push_back(std::make_pair(t, i));
        ts.push_back(t);
        if (t == 1) {
            t1s.push_back(i);
        }
    }

    Num total {0};
    Vec actions(200009, 0);
    Num idx {0};
    for(const auto& seq : events) {
        Num max_s {0};
        Num s {0};
        for(auto it = seq.rbegin(); it != seq.rend(); ++it) {
            const auto e = it->first;
            const auto i = it->second;
            if (e == 2) {
                s += 1;
                max_s = std::max(max_s, s);
            } else {
                if (s > 0) {
                    actions.at(i) = 1;
                }
                s = std::max(0LL, s-1);
            }
        }

        if (s > 0) {
            os << "-1\n";
            return;
        }

        total += max_s;
        ++idx;
    }

    Num ans {0};
    Num ct {0};
    for(Num i{0}; i<n; ++i) {
        const auto t = ts.at(i);
        if (t == 1) {
            ct += actions.at(i);
            ans = std::max(ans, ct);
        } else {
            --ct;
        }
    }
    os << ans << "\n";

    auto size = t1s.size();
    for(size_t i{0}; i<size; ++i) {
        const auto t = t1s.at(i);
        os << actions.at(t);
        if ((i+1) == size) {
            os << "\n";
        } else {
            os << " ";
        }
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果