結果
問題 | No.945 YKC饅頭 |
ユーザー | 👑 emthrm |
提出日時 | 2019-12-08 00:04:55 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 403 ms / 2,000 ms |
コード長 | 4,239 bytes |
コンパイル時間 | 1,641 ms |
コンパイル使用メモリ | 139,104 KB |
実行使用メモリ | 9,848 KB |
最終ジャッジ日時 | 2023-08-27 06:54:24 |
合計ジャッジ時間 | 12,044 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 3 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,376 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 3 ms
4,380 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 3 ms
4,376 KB |
testcase_25 | AC | 3 ms
4,380 KB |
testcase_26 | AC | 3 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 2 ms
4,380 KB |
testcase_31 | AC | 27 ms
4,380 KB |
testcase_32 | AC | 59 ms
5,204 KB |
testcase_33 | AC | 121 ms
7,840 KB |
testcase_34 | AC | 183 ms
6,440 KB |
testcase_35 | AC | 330 ms
9,316 KB |
testcase_36 | AC | 168 ms
5,260 KB |
testcase_37 | AC | 162 ms
5,264 KB |
testcase_38 | AC | 162 ms
5,644 KB |
testcase_39 | AC | 72 ms
5,364 KB |
testcase_40 | AC | 97 ms
7,584 KB |
testcase_41 | AC | 55 ms
5,116 KB |
testcase_42 | AC | 255 ms
7,020 KB |
testcase_43 | AC | 136 ms
5,064 KB |
testcase_44 | AC | 254 ms
8,840 KB |
testcase_45 | AC | 264 ms
7,236 KB |
testcase_46 | AC | 34 ms
5,156 KB |
testcase_47 | AC | 188 ms
6,476 KB |
testcase_48 | AC | 34 ms
4,376 KB |
testcase_49 | AC | 102 ms
5,636 KB |
testcase_50 | AC | 289 ms
7,488 KB |
testcase_51 | AC | 400 ms
9,608 KB |
testcase_52 | AC | 403 ms
9,596 KB |
testcase_53 | AC | 395 ms
9,660 KB |
testcase_54 | AC | 398 ms
9,796 KB |
testcase_55 | AC | 396 ms
9,848 KB |
testcase_56 | AC | 91 ms
7,216 KB |
testcase_57 | AC | 60 ms
7,320 KB |
testcase_58 | AC | 193 ms
8,884 KB |
testcase_59 | AC | 216 ms
9,172 KB |
testcase_60 | AC | 130 ms
7,808 KB |
testcase_61 | AC | 200 ms
8,740 KB |
testcase_62 | AC | 194 ms
8,904 KB |
testcase_63 | AC | 54 ms
7,224 KB |
testcase_64 | AC | 136 ms
8,020 KB |
testcase_65 | AC | 123 ms
7,664 KB |
testcase_66 | AC | 119 ms
7,792 KB |
testcase_67 | AC | 168 ms
8,336 KB |
testcase_68 | AC | 132 ms
7,764 KB |
testcase_69 | AC | 84 ms
7,656 KB |
testcase_70 | AC | 91 ms
7,488 KB |
testcase_71 | AC | 92 ms
7,480 KB |
testcase_72 | AC | 148 ms
8,064 KB |
testcase_73 | AC | 205 ms
9,064 KB |
ソースコード
#include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <chrono> #define _USE_MATH_DEFINES #include <cmath> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <utility> #include <vector> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; // const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, // dx[] = {0, -1, -1, -1, 0, 1, 1, 1}; struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(10); } } iosetup; /*-------------------------------------------------*/ template <typename Monoid> struct RMQandRUQ { RMQandRUQ(int sz, const Monoid &UNITY) : UNITY(UNITY) { init(sz); dat.assign((n << 1) - 1, UNITY); } RMQandRUQ(const vector<Monoid> &a, const Monoid &UNITY) : UNITY(UNITY) { int a_sz = a.size(); init(a_sz); dat.resize((n << 1) - 1); REP(i, a_sz) dat[n - 1 + i] = a[i]; for (int i = n - 2; i >= 0; --i) dat[i] = min(dat[(i << 1) + 1], dat[(i << 1) + 2]); } void update(int a, int b, const Monoid &value) { update(a, b, value, 0, 0, n); } Monoid query(int a, int b) { return query(a, b, 0, 0, n); } Monoid operator[](const int idx) { return query(idx, idx + 1); } int find(int a, int b, const Monoid &value) { return find(a, b, value, 0, 0, n); } private: int n = 1; const Monoid UNITY; vector<Monoid> dat, lazy; vector<bool> need_to_be_eval; void init(int sz) { while (n < sz) n <<= 1; lazy.assign((n << 1) - 1, UNITY); need_to_be_eval.assign((n << 1) - 1, false); } inline void evaluate(int node, int left, int right) { if (need_to_be_eval[node]) { dat[node] = lazy[node]; if (node < n - 1) { lazy[(node << 1) + 1] = lazy[(node << 1) + 2] = lazy[node]; need_to_be_eval[(node << 1) + 1] = need_to_be_eval[(node << 1) + 2] = true; } lazy[node] = UNITY; need_to_be_eval[node] = false; } } void update(int a, int b, const Monoid &value, int node, int left, int right) { evaluate(node, left, right); if (right <= a || b <= left) return; if (a <= left && right <= b) { lazy[node] = value; need_to_be_eval[node] = true; evaluate(node, left, right); } else { update(a, b, value, (node << 1) + 1, left, (left + right) >> 1); update(a, b, value, (node << 1) + 2, (left + right) >> 1, right); dat[node] = min(dat[(node << 1) + 1], dat[(node << 1) + 2]); } } Monoid query(int a, int b, int node, int left, int right) { evaluate(node, left, right); if (right <= a || b <= left) return UNITY; if (a <= left && right <= b) return dat[node]; return min(query(a, b, (node << 1) + 1, left, (left + right) >> 1), query(a, b, (node << 1) + 2, (left + right) >> 1, right)); } int find(int a, int b, const Monoid &value, int node, int left, int right) { evaluate(node, left, right); if (dat[node] > value || right <= a || b <= left) return -1; if (right - left == 1) return node - (n - 1); int res_l = find(a, b, value, (node << 1) + 1, left, (left + right) >> 1); if (res_l != -1) return res_l; return find(a, b, value, (node << 1) + 2, (left + right) >> 1, right); } }; int main() { int n, m; cin >> n >> m; vector<int> l(m), r(m), t(m); map<char, int> mp; mp['Y'] = 0; mp['K'] = 1; mp['C'] = 2; REP(i, m) { char c; cin >> l[i] >> r[i] >> c; --l[i]; --r[i]; t[i] = mp[c]; } RMQandRUQ<int> ruq(n, INF); for (int i = m - 1; i >= 0; --i) ruq.update(l[i], r[i] + 1, t[i]); vector<int> ans(3, 0); REP(i, n) { if (ruq[i] <= 2) ++ans[ruq[i]]; } REP(i, 3) cout << ans[i] << (i + 1 == 3 ? '\n' : ' '); return 0; }