結果

問題 No.945 YKC饅頭
ユーザー haruki_Kharuki_K
提出日時 2019-12-08 01:17:24
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 137 ms / 2,000 ms
コード長 7,834 bytes
コンパイル時間 1,701 ms
コンパイル使用メモリ 178,400 KB
実行使用メモリ 12,624 KB
最終ジャッジ日時 2023-08-27 14:56:13
合計ジャッジ時間 6,819 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 2 ms
4,376 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 3 ms
4,376 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 2 ms
4,376 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 1 ms
4,380 KB
testcase_29 AC 2 ms
4,380 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 8 ms
4,380 KB
testcase_32 AC 8 ms
5,952 KB
testcase_33 AC 32 ms
7,404 KB
testcase_34 AC 67 ms
7,872 KB
testcase_35 AC 109 ms
11,176 KB
testcase_36 AC 76 ms
7,228 KB
testcase_37 AC 72 ms
7,012 KB
testcase_38 AC 67 ms
7,016 KB
testcase_39 AC 20 ms
5,692 KB
testcase_40 AC 21 ms
6,968 KB
testcase_41 AC 11 ms
5,376 KB
testcase_42 AC 96 ms
9,080 KB
testcase_43 AC 66 ms
6,816 KB
testcase_44 AC 84 ms
9,336 KB
testcase_45 AC 104 ms
9,080 KB
testcase_46 AC 5 ms
4,708 KB
testcase_47 AC 65 ms
8,216 KB
testcase_48 AC 15 ms
4,376 KB
testcase_49 AC 31 ms
6,428 KB
testcase_50 AC 112 ms
9,724 KB
testcase_51 AC 131 ms
12,440 KB
testcase_52 AC 137 ms
12,560 KB
testcase_53 AC 133 ms
12,580 KB
testcase_54 AC 130 ms
12,436 KB
testcase_55 AC 130 ms
12,624 KB
testcase_56 AC 7 ms
7,676 KB
testcase_57 AC 7 ms
7,800 KB
testcase_58 AC 59 ms
10,900 KB
testcase_59 AC 70 ms
11,640 KB
testcase_60 AC 30 ms
9,124 KB
testcase_61 AC 63 ms
11,232 KB
testcase_62 AC 61 ms
11,040 KB
testcase_63 AC 9 ms
7,876 KB
testcase_64 AC 32 ms
9,192 KB
testcase_65 AC 27 ms
8,808 KB
testcase_66 AC 26 ms
8,988 KB
testcase_67 AC 46 ms
10,176 KB
testcase_68 AC 30 ms
9,128 KB
testcase_69 AC 14 ms
8,020 KB
testcase_70 AC 17 ms
8,404 KB
testcase_71 AC 17 ms
8,528 KB
testcase_72 AC 38 ms
9,604 KB
testcase_73 AC 67 ms
11,444 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#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
#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
using ll = long long;
using ld = long double;
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> istream& operator>>(istream& is, vector<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{}); }
#define int ll
#define double ld
template <class T> int sz(T const& x) { return x.size(); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<
// >>> lazy segment tree
template <class Handler>
struct LazySegtree : Handler {
    // static int32_t btmbit(int64_t x) { return x ? __builtin_ctzll(x) : -1; }
    // static int32_t btmbit(int32_t x) { return x ? __builtin_ctz(x) : -1; }

    using Value = typename Handler::Value;
    using Lazy = typename Handler::Lazy;
    using Handler::unit_value; // () -> Value
    using Handler::unit_action; // () -> Lazy
    using Handler::merge; // (Value,Value) -> Value
    using Handler::act; // (Lazy,Lazy&,Value&) -> void

    vector<Value> v;
    vector<Lazy> lz;
    int n;
    mutable Lazy tmp;

    LazySegtree() {}
    template <class... T> LazySegtree(T&&... x) { init(forward<T>(x)...); }

    template <class F, class = decltype(declval<F>()(0))>
    void init(int n, F gen)  {
        assert(n >= 0); this->n = n;
        v.resize(2*n); lz.assign(n, unit_action());
        for (int i = 0; i < n; i++) v[n+i] = gen(i);
        for (int i = n-1; i >= 1; i--) v[i] = merge(v[2*i],v[2*i+1]);
    }
    void init(int n) { init(n, [&](int) { return unit_value(); }); }
    void init(int n, Value const& x) { init(n, [&](int) { return x; }); }
    void init(vector<Value> const& v) { init(v.size(), [&](int i) { return v[i]; }); }
    int size() const { return n; }


    void act(Lazy const& x, int i) { act(x, (i < n ? lz[i] : tmp), v[i]); }
    void flush(int k) {
        if (n <= k || lz[k] == unit_action()) return;
        act(lz[k], 2*k);
        act(lz[k], 2*k+1);
        lz[k] = unit_action();
    }
    void flush(int l, int r) {
        for (int p = __lg(l += n), q = __lg(r += n-1); q; --p,--q) {
            flush(l >> p); flush(r >> q);
        }
    }
    void build(int i) {
        i += n; i >>= __builtin_ctz((int32_t)i);
        while (i >>= 1) v[i] = merge(v[2*i],v[2*i+1]);
    }
    Value get(int l, int r) {
        assert(0 <= l && l <= r && r <= n);
        flush(l,r);
        Value x = unit_value(), y = unit_value();
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l&1) x = merge(x,v[l++]);
            if (r&1) y = merge(v[--r],y);
        }
        return merge(x,y);
    }
    void apply(int l, int r, Lazy const& x) {
        assert(0 <= l && l <= r && r <= n);
        flush(l,r);
        for (int a = l+n, b = r+n; a < b; a >>= 1, b >>= 1) {
            if (a&1) act(x, a++);
            if (b&1) act(x, --b);
        }
        build(l); build(r);
    }
    Value operator[](int i) const { return get(i); }
    Value get(int i) const {
        assert(0 <= i && i < n);
        Value x = v[i += n];
        while (i >>= 1) act(lz[i], tmp, x);
        return x;
    }
    void set(int i, Value const& x) {
        assert(0 <= i && i < n);
        for (int p = __lg(i += n); p; --p) flush(i >> p);
        for (v[i] = x; i >>= 1; ) v[i] = merge(v[2*i],v[2*i+1]);
    }
    vector<Value> dat() const {
        vector<Value> ret(size());
        for (int i = 0; i < size(); i++) ret[i] = get(i);
        return ret;
    }
};
// <<<

// handler
struct Set {
    using Value = int;
    using Lazy = int;
    constexpr static Value unit_value() { return -1; }
    constexpr static Lazy unit_action() { return -1; }
    constexpr static Value merge(Value, Value) { return -1; }
    static void act(Lazy x, Lazy &y, Value &z) {
        if (x >= 0) y = x, z = x;
    }
};

map<char,int> code = { {'Y',1}, {'K',2}, {'C',3} };

int32_t main() {
    int n,m; cin >> n >> m;
    vector<int> l(m),r(m),t(m);
    rep (i,m) {
        cin >> l[i] >> r[i], l[i]--;
        char c; cin >> c; t[i] = code[c];
    }
    LazySegtree<Set> seg(n,0);
    repR (i,m) seg.apply(l[i],r[i],t[i]);
    vector<int> cnt(4);
    rep (i,n) cnt[seg.get(i)]++;
    rep1 (i,3) cout << cnt[i] << " ";
    cout << endl;

}
0