結果
問題 | No.945 YKC饅頭 |
ユーザー | Shuz* |
提出日時 | 2019-12-08 10:00:02 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 452 ms / 2,000 ms |
コード長 | 5,848 bytes |
コンパイル時間 | 1,681 ms |
コンパイル使用メモリ | 178,020 KB |
実行使用メモリ | 55,656 KB |
最終ジャッジ日時 | 2023-08-28 15:15:04 |
合計ジャッジ時間 | 13,718 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
52,264 KB |
testcase_01 | AC | 16 ms
52,200 KB |
testcase_02 | AC | 16 ms
52,284 KB |
testcase_03 | AC | 17 ms
52,388 KB |
testcase_04 | AC | 16 ms
52,264 KB |
testcase_05 | AC | 17 ms
52,284 KB |
testcase_06 | AC | 17 ms
52,176 KB |
testcase_07 | AC | 17 ms
52,268 KB |
testcase_08 | AC | 16 ms
52,172 KB |
testcase_09 | AC | 16 ms
52,280 KB |
testcase_10 | AC | 17 ms
52,176 KB |
testcase_11 | AC | 18 ms
52,172 KB |
testcase_12 | AC | 18 ms
52,204 KB |
testcase_13 | AC | 19 ms
52,268 KB |
testcase_14 | AC | 17 ms
52,196 KB |
testcase_15 | AC | 17 ms
52,164 KB |
testcase_16 | AC | 17 ms
52,280 KB |
testcase_17 | AC | 18 ms
52,388 KB |
testcase_18 | AC | 17 ms
52,160 KB |
testcase_19 | AC | 17 ms
52,112 KB |
testcase_20 | AC | 16 ms
52,148 KB |
testcase_21 | AC | 17 ms
52,132 KB |
testcase_22 | AC | 18 ms
52,020 KB |
testcase_23 | AC | 18 ms
52,148 KB |
testcase_24 | AC | 18 ms
52,344 KB |
testcase_25 | AC | 17 ms
52,084 KB |
testcase_26 | AC | 18 ms
52,024 KB |
testcase_27 | AC | 17 ms
52,024 KB |
testcase_28 | AC | 17 ms
52,016 KB |
testcase_29 | AC | 16 ms
52,136 KB |
testcase_30 | AC | 16 ms
52,288 KB |
testcase_31 | AC | 42 ms
52,272 KB |
testcase_32 | AC | 68 ms
52,440 KB |
testcase_33 | AC | 138 ms
52,808 KB |
testcase_34 | AC | 227 ms
54,116 KB |
testcase_35 | AC | 374 ms
54,784 KB |
testcase_36 | AC | 233 ms
54,792 KB |
testcase_37 | AC | 220 ms
54,608 KB |
testcase_38 | AC | 216 ms
54,504 KB |
testcase_39 | AC | 91 ms
52,600 KB |
testcase_40 | AC | 108 ms
52,660 KB |
testcase_41 | AC | 67 ms
52,488 KB |
testcase_42 | AC | 314 ms
54,916 KB |
testcase_43 | AC | 197 ms
54,760 KB |
testcase_44 | AC | 293 ms
54,388 KB |
testcase_45 | AC | 335 ms
55,560 KB |
testcase_46 | AC | 47 ms
52,344 KB |
testcase_47 | AC | 233 ms
53,924 KB |
testcase_48 | AC | 58 ms
52,548 KB |
testcase_49 | AC | 125 ms
52,996 KB |
testcase_50 | AC | 359 ms
55,488 KB |
testcase_51 | AC | 447 ms
55,652 KB |
testcase_52 | AC | 450 ms
55,416 KB |
testcase_53 | AC | 452 ms
55,656 KB |
testcase_54 | AC | 448 ms
55,492 KB |
testcase_55 | AC | 451 ms
55,372 KB |
testcase_56 | AC | 92 ms
52,228 KB |
testcase_57 | AC | 64 ms
52,336 KB |
testcase_58 | AC | 208 ms
54,428 KB |
testcase_59 | AC | 231 ms
54,868 KB |
testcase_60 | AC | 136 ms
53,124 KB |
testcase_61 | AC | 211 ms
54,572 KB |
testcase_62 | AC | 207 ms
54,268 KB |
testcase_63 | AC | 59 ms
52,268 KB |
testcase_64 | AC | 145 ms
53,324 KB |
testcase_65 | AC | 130 ms
53,048 KB |
testcase_66 | AC | 126 ms
53,068 KB |
testcase_67 | AC | 176 ms
53,924 KB |
testcase_68 | AC | 139 ms
53,180 KB |
testcase_69 | AC | 89 ms
52,540 KB |
testcase_70 | AC | 98 ms
52,604 KB |
testcase_71 | AC | 98 ms
52,592 KB |
testcase_72 | AC | 160 ms
53,804 KB |
testcase_73 | AC | 228 ms
54,592 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; // Define using ll = long long; using ull = unsigned long long; using ld = long double; template <class T> using pvector = vector<pair<T, T>>; template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>; constexpr const ll dx[4] = {1, 0, -1, 0}; constexpr const ll dy[4] = {0, 1, 0, -1}; constexpr const ll MOD = 1e9 + 7; constexpr const ll mod = 998244353; constexpr const ll INF = 1LL << 60; constexpr const ll inf = 1 << 30; constexpr const char rt = '\n'; constexpr const char sp = ' '; #define mp make_pair #define mt make_tuple #define pb push_back #define eb emplace_back #define elif else if #define all(a, v, ...) \ ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v) #define fi first #define se second template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } // Debug #define debug(...) \ { \ cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \ for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \ cerr << rt; \ } #define dump(a, h, w) \ { \ cerr << __LINE__ << ": " << #a << " = [" << rt; \ rep(i, h) { \ rep(j, w) cerr << a[i][j] << sp; \ cerr << rt; \ } \ cerr << "]" << rt; \ } #define vdump(a, n) \ { \ cerr << __LINE__ << ": " << #a << " = ["; \ rep(i, n) if (i) cerr << sp << a[i]; \ else cerr << a[i]; \ cerr << "]" << rt; \ } // Loop #define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i) #define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i) #define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i) #define each(i, a) for (auto &&i : a) // Stream #define fout(n) cout << fixed << setprecision(n) struct io { io() { cin.tie(nullptr), ios::sync_with_stdio(false); } } io; // Speed #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // Math inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; } inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; } inline constexpr ll modulo(const ll n, const ll m = MOD) { ll k = n % m; return k + m * (k < 0); } inline constexpr ll chmod(ll &n, const ll m = MOD) { n %= m; return n += m * (n < 0); } inline constexpr ll mpow(ll a, ll n, const ll m = MOD) { ll r = 1; rep(i, 64) { if (n & (1LL << i)) r *= a; chmod(r, m); a *= a; chmod(a, m); } return r; } inline ll inv(const ll n, const ll m = MOD) { ll a = n, b = m, x = 1, y = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); x -= t * y; swap(x, y); } return modulo(x, m); } struct RUMQ { static const ll n = 1LL << 20; vector<ll> node, lazy, flag; RUMQ() : node(n * 2 - 1, INF), lazy(n * 2 - 1), flag(n * 2 - 1) {} inline void eval(ll i, ll l, ll r) { if (flag[i]) { node[i] = lazy[i]; if (r - l > 1) { lazy[i * 2 + 1] = lazy[i * 2 + 2] = lazy[i]; flag[i * 2 + 1] = flag[i * 2 + 2] = true; } lazy[i] = 0; flag[i] = false; } } inline void update(ll a, ll b, ll x, ll i = 0, ll l = 0, ll r = 1LL << 20) { eval(i, l, r); if (b <= l || r <= a) return; if (a <= l && r <= b) { lazy[i] = x; flag[i] = true; eval(i, l, r); } else { update(a, b, x, i * 2 + 1, l, (l + r) / 2); update(a, b, x, i * 2 + 2, (l + r) / 2, r); node[i] = std::min(node[i * 2 + 1], node[i * 2 + 2]); } } inline ll min(ll a, ll b, ll i = 0, ll l = 0, ll r = 1LL << 20) { if (b <= l || r <= a) return INF; eval(i, l, r); if (a <= l && r <= b) return node[i]; return std::min(min(a, b, i * 2 + 1, l, (l + r) / 2), min(a, b, i * 2 + 2, (l + r) / 2, r)); } }; signed main() { ll N, M, res[3] = {}; cin >> N >> M; ll L[M], R[M]; char T[M]; RUMQ seg; rep(i, M) cin >> L[i] >> R[i] >> T[i]; reverse(L, L + M), reverse(R, R + M), reverse(T, T + M); rep(i, M) { if (T[i] == 'Y') seg.update(L[i] - 1, R[i], 0); if (T[i] == 'K') seg.update(L[i] - 1, R[i], 1); if (T[i] == 'C') seg.update(L[i] - 1, R[i], 2); } rep(i, N) if (seg.min(i, i + 1) != INF) res[seg.min(i, i + 1)]++; cout << res[0] << sp; cout << res[1] << sp; cout << res[2] << rt; } // -g -D_GLIBCXX_DEBUG -fsanitize=undefined