結果
問題 | No.1924 3 color painting on a line |
ユーザー | 👑 emthrm |
提出日時 | 2022-05-11 01:06:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,194 bytes |
コンパイル時間 | 2,166 ms |
コンパイル使用メモリ | 204,808 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-18 07:55:58 |
合計ジャッジ時間 | 3,881 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
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 | - |
ソースコード
#define _USE_MATH_DEFINES #include <bits/stdc++.h> 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() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template <typename T> struct SegmentTree { using Monoid = typename T::Monoid; explicit SegmentTree(int n) : SegmentTree(std::vector<Monoid>(n, T::id())) {} explicit SegmentTree(const std::vector<Monoid>& a) : n(a.size()), p2(1) { while (p2 < n) p2 <<= 1; dat.assign(p2 << 1, T::id()); std::copy(a.begin(), a.end(), dat.begin() + p2); for (int i = p2 - 1; i > 0; --i) { dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]); } } void set(int idx, const Monoid val) { idx += p2; dat[idx] = val; while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]); } Monoid get(int left, int right) const { Monoid res_l = T::id(), res_r = T::id(); for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) { if (left & 1) res_l = T::merge(res_l, dat[left++]); if (right & 1) res_r = T::merge(dat[--right], res_r); } return T::merge(res_l, res_r); } Monoid operator[](const int idx) const { return dat[idx + p2]; } template <typename G> int find_right(int left, const G g) { if (left >= n) return n; Monoid val = T::id(); left += p2; do { while (!(left & 1)) left >>= 1; Monoid nxt = T::merge(val, dat[left]); if (!g(nxt)) { while (left < p2) { left <<= 1; nxt = T::merge(val, dat[left]); if (g(nxt)) { val = nxt; ++left; } } return left - p2; } val = nxt; ++left; } while (__builtin_popcount(left) > 1); return n; } template <typename G> int find_left(int right, const G g) { if (right <= 0) return -1; Monoid val = T::id(); right += p2; do { --right; while (right > 1 && (right & 1)) right >>= 1; Monoid nxt = T::merge(dat[right], val); if (!g(nxt)) { while (right < p2) { right = (right << 1) + 1; nxt = T::merge(dat[right], val); if (g(nxt)) { val = nxt; --right; } } return right - p2; } val = nxt; } while (__builtin_popcount(right) > 1); return -1; } private: const int n; int p2; std::vector<Monoid> dat; }; namespace monoid { template <typename T> struct RangeMinimumQuery { using Monoid = T; static constexpr Monoid id() { return std::numeric_limits<Monoid>::max(); } static Monoid merge(const Monoid& a, const Monoid& b) { return std::min(a, b); } }; template <typename T> struct RangeMaximumQuery { using Monoid = T; static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); } static Monoid merge(const Monoid& a, const Monoid& b) { return std::max(a, b); } }; template <typename T> struct RangeSumQuery { using Monoid = T; static constexpr Monoid id() { return 0; } static Monoid merge(const Monoid& a, const Monoid& b) { return a + b; } }; } // namespace monoid int main() { constexpr int C = 3; int n; string s; cin >> n >> s; int last[C]{-1, -1, -1}; SegmentTree<monoid::RangeMaximumQuery<int>> dp(n + 1); dp.set(0, 0); REP(i, n) { if (last[s[i] % C] != -1) dp.set(i + 1, dp.get(0, last[s[i] % C] + 2) + 1); last[s[i] % C] = i; } cout << n - dp.get(0, n + 1) << '\n'; return 0; }