結果

問題 No.945 YKC饅頭
ユーザー PachicobuePachicobue
提出日時 2019-12-08 00:05:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,426 bytes
コンパイル時間 1,982 ms
コンパイル使用メモリ 206,376 KB
実行使用メモリ 7,808 KB
最終ジャッジ日時 2024-06-08 02:42:32
合計ジャッジ時間 7,754 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 2 ms
5,376 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 2 ms
5,376 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 AC 8 ms
5,376 KB
testcase_57 AC 9 ms
5,376 KB
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2019/12/07] 23:55:10
#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> 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};

template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename... Args>
auto read(const usize size, Args... args)
{
    std::vector<decltype(read<T>(args...))> ans(size);
    for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }
    return ans;
}
template<typename... Types>
auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T>
std::vector<T> make_v(const usize size, const T v) { return std::vector<T>(size, v); }
template<typename... Args>
auto make_v(const usize size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }

template<typename OpMonoid>
class dualseg
{
public:
    using operator_monoid_type = OpMonoid;
    using operator_type        = typename operator_monoid_type::operator_type;
    dualseg(const usize sz, const operator_type& initial = operator_monoid_type::id()) : sz{sz}, depth{clog(sz)}, half{static_cast<usize>(1) << depth}, op(half << 1, operator_monoid_type::id())
    {
        if (initial != operator_monoid_type::id()) { std::fill(op.begin() + half, op.end(), initial); }
    }
    template<typename InIt>
    dualseg(const InIt first, const InIt last) : sz{static_cast<usize>(std::distance(first, last))}, depth{clog(sz)}, half{static_cast<usize>(1) << depth}, op(half << 1, operator_monoid_type::id()) { std::copy(first, last, op.begin() + half); }
    operator_type get(const usize a) const
    {
        assert(a < sz);
        operator_type ans = operator_monoid_type::id();
        for (usize i = 0; i <= depth; i++) { ans = operator_monoid_type::compose(ans, op[(a + half) >> (depth - i)]); }
        return ans;
    }
    void set(usize a, const operator_type& f)
    {
        assert(a < sz);
        clean(a += half), clean(a + 1), op[a] = f;
    }
    void act(usize L, usize R, const operator_type& f)
    {
        assert(L < R), assert(R <= sz);
        clean(L += half), clean(R += half);
        for (; L < R; L >>= 1, R >>= 1) {
            if (L & 1) { update(L++, f); }
            if (R & 1) { update(--R, f); }
        }
    }
    usize size() const { return sz; }
    friend std::ostream& operator<<(std::ostream& os, const dualseg& seg)
    {
        os << "[";
        for (usize i = 0; i < seg.sz; i++) { os << seg.get(i) << (i + 1 == seg.sz ? "" : ","); }
        return (os << "]\n");
    }

private:
    void down(const usize a) { update(a << 1, op[a]), update(a << 1 | 1, op[a]), op[a] = operator_monoid_type::id(); }
    void clean(const usize a)
    {
        const usize b = (a / (a & -a)) >> 1;
        for (usize i = 0; i < depth; i++) {
            const usize v = a >> (depth - i);
            if (v > b) { break; }
            down(v);
        }
    }
    void update(const usize a, const operator_type& f) { op[a] = operator_monoid_type::compose(f, op[a]); }
    const usize sz, depth, half;
    std::vector<operator_type> op;
};
template<typename Element>
struct assign
{
    using element_type  = Element;
    using operator_type = element_type;
    static operator_type compose(const operator_type& f1, const operator_type& f2) { return f1 != id() ? f1 : f2; }
    assign() = delete;
    static constexpr operator_type id() { return inf_v<operator_type>; }
};
int main()
{
    const auto [N, M] = reads<int, int>();
    dualseg<assign<int>> seg(N);
    seg.act(0, N, 0);
    std::vector<int> L(M), R(M), T(M);
    for (int i = 0; i < M; i++) {
        L[i] = read<int>() - 1, R[i] = read<int>();
        const char c = read<char>();
        T[i]         = (c == 'Y' ? 1 : c == 'M' ? 2 : 3);
    }
    for (int i = M - 1; i >= 0; i--) { seg.act(L[i], R[i], T[i]); }
    std::vector<int> num{0, 0, 0, 0};
    for (int i = 0; i < N; i++) { num[seg.get(i)]++; }
    for (int i = 1; i < 4; i++) { std::cout << num[i] << " "; }
    std::cout << std::endl;
    return 0;
}
0