結果
問題 | No.945 YKC饅頭 |
ユーザー | CleyL |
提出日時 | 2023-08-03 01:03:17 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 549 ms / 2,000 ms |
コード長 | 4,672 bytes |
コンパイル時間 | 1,510 ms |
コンパイル使用メモリ | 132,332 KB |
実行使用メモリ | 18,064 KB |
最終ジャッジ日時 | 2024-04-21 00:48:24 |
合計ジャッジ時間 | 12,830 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,944 KB |
testcase_10 | AC | 3 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 3 ms
6,940 KB |
testcase_14 | AC | 3 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 3 ms
6,940 KB |
testcase_23 | AC | 3 ms
6,940 KB |
testcase_24 | AC | 3 ms
6,940 KB |
testcase_25 | AC | 3 ms
6,944 KB |
testcase_26 | AC | 3 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,944 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | AC | 2 ms
6,940 KB |
testcase_31 | AC | 21 ms
6,940 KB |
testcase_32 | AC | 9 ms
9,408 KB |
testcase_33 | AC | 100 ms
15,992 KB |
testcase_34 | AC | 255 ms
10,768 KB |
testcase_35 | AC | 439 ms
17,460 KB |
testcase_36 | AC | 267 ms
6,940 KB |
testcase_37 | AC | 256 ms
6,940 KB |
testcase_38 | AC | 246 ms
7,808 KB |
testcase_39 | AC | 58 ms
9,720 KB |
testcase_40 | AC | 51 ms
15,852 KB |
testcase_41 | AC | 18 ms
9,484 KB |
testcase_42 | AC | 371 ms
11,456 KB |
testcase_43 | AC | 223 ms
6,940 KB |
testcase_44 | AC | 338 ms
17,180 KB |
testcase_45 | AC | 407 ms
11,588 KB |
testcase_46 | AC | 9 ms
9,492 KB |
testcase_47 | AC | 249 ms
10,708 KB |
testcase_48 | AC | 47 ms
6,940 KB |
testcase_49 | AC | 103 ms
10,012 KB |
testcase_50 | AC | 438 ms
11,664 KB |
testcase_51 | AC | 547 ms
17,908 KB |
testcase_52 | AC | 547 ms
17,976 KB |
testcase_53 | AC | 549 ms
18,064 KB |
testcase_54 | AC | 543 ms
18,004 KB |
testcase_55 | AC | 545 ms
17,864 KB |
testcase_56 | AC | 8 ms
15,708 KB |
testcase_57 | AC | 8 ms
15,652 KB |
testcase_58 | AC | 205 ms
17,076 KB |
testcase_59 | AC | 245 ms
17,468 KB |
testcase_60 | AC | 90 ms
16,248 KB |
testcase_61 | AC | 215 ms
17,208 KB |
testcase_62 | AC | 209 ms
17,144 KB |
testcase_63 | AC | 10 ms
15,628 KB |
testcase_64 | AC | 100 ms
16,340 KB |
testcase_65 | AC | 79 ms
16,276 KB |
testcase_66 | AC | 74 ms
16,216 KB |
testcase_67 | AC | 150 ms
16,772 KB |
testcase_68 | AC | 94 ms
16,304 KB |
testcase_69 | AC | 33 ms
15,732 KB |
testcase_70 | AC | 41 ms
15,868 KB |
testcase_71 | AC | 42 ms
15,796 KB |
testcase_72 | AC | 120 ms
16,504 KB |
testcase_73 | AC | 231 ms
17,508 KB |
ソースコード
//yukicoder@cpp17 #include <iostream> #include <cmath> #include <algorithm> #include <iomanip> #include <string> #include <vector> #include <set> #include <stack> #include <queue> #include <map> #include <bitset> #include <complex> #include <cctype> #include <utility> #include <climits> #include <numeric> #include <functional> using namespace std; using ll = long long; using P = pair<ll,ll>; const ll MOD = 998244353; const ll MODx = 1000000007; const int INF = (1<<30)-1; const ll LINF = (1LL<<62LL)-1; const double EPS = (1e-10); P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}}; P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); } template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); } /* 確認ポイント cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる 計算量は変わらないが楽できるシリーズ min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる */ /* function corner below */ /* Function corner above */ /* comment outed because can cause bugs __attribute__((constructor)) void initial() { cin.tie(0); ios::sync_with_stdio(false); } */ template< typename T, typename F> struct LazySegmentTree{ private: int n; vector<T> node,lazy; vector<bool> lazyTrigger; F f; T initer; public: LazySegmentTree(int n_, F f, T initer) : f(f),initer(initer) { n = 1; while(n < n_)n*=2; node.resize(2*n-1, initer); lazy.resize(2*n-1, {0,0,0}); lazyTrigger.resize(2*n-1, false); } void eval(int k, int l, int r){ if(lazyTrigger[k]){ node[k] = lazy[k]; if(r-l >= 1){ lazy[k*2+1] = lazy[k]/2; lazyTrigger[k*2+1] = true; lazy[k*2+2] = lazy[k]/2; lazyTrigger[k*2+2] = true; } lazy[k] = {0,0,0}; lazyTrigger[k] = false; } } //TODO: update -> apply(such as update and add) void update(int a,int b, T x, int k = 0, int l = 0, int r = -1){ if(r < 0) r = n-1; eval(k, l, r); if(b < l || r < a){ return; } if(a <= l && r <= b){ lazy[k] = x*(r-l+1); lazyTrigger[k] = true; eval(k, l, r); }else{ update(a,b,x,2*k+1, l, (l+r)/2); update(a,b,x,2*k+2,(l+r)/2+1,r); node[k] = f(node[k*2+1],node[k*2+2]); } } T getf(int a,int b, int k=0, int l=0, int r=-1){ if(r < 0){ r = n-1; } if(r < a || b < l)return initer; eval(k,l,r); if(a <= l && r <= b){ return node[k]; } T vl = getf(a,b,2*k+1,l,(l+r)/2); T vr = getf(a,b,2*k+2,(l+r)/2+1,r); return f(vl,vr); } void debug(){ int nw = 1; int curr = 1; cout << "---begin---" << endl; for(int i = 0; 2*n-1 > i; i++){ cout << "(" << node[i] << ", " << lazy[i] << " (" << lazyTrigger[i] << ")) "; if(nw == curr)cout << endl,nw *= 2, curr=1; else curr++; } cout << "---end---" << endl; } }; template <typename T, typename F> LazySegmentTree<T, F> get_lazy_segment_tree(int N, const F &f, T initer){ return LazySegmentTree{N,f,initer}; } struct d{ int a,b,c; d operator+(d x){ d ret; ret.a = (*this).a + x.a; ret.b = (*this).b + x.b; ret.c = (*this).c + x.c; return ret; } d operator*(int x){ d ret; ret.a = (*this).a * x; ret.b = (*this).b * x; ret.c = (*this).c * x; return ret; } d operator/(int x){ d ret; ret.a = (*this).a / x; ret.b = (*this).b / x; ret.c = (*this).c / x; return ret; } d operator+=(d a){return (*this) = (*this) + a;} d operator*=(int a){return (*this) = (*this) * a;} d operator/=(int a){return (*this) = (*this) / a;} friend ostream &operator<<(ostream &os, const d &p){ return os << "(" << p.a << ", " << p.b << ". " << p.c << ")"; } }; struct x{ int l,r; char c; }; int main(){ int n,m;cin>>n>>m; d xx = {0,0,0}; auto seg = get_lazy_segment_tree(n, [](d a,d b){return a+b;}, xx); vector<x> A(m); for(int i = 0; m > i; i++){ cin>>A[i].l>>A[i].r>>A[i].c; A[i].l--;A[i].r--; } reverse(A.begin(), A.end()); for(int i = 0; m > i; i++){ seg.update(A[i].l, A[i].r, {A[i].c == 'Y', A[i].c == 'K', A[i].c == 'C'}); } auto z = seg.getf(0,n); cout << z.a << " " << z.b << " " << z.c << endl; return 0; }