結果

問題 No.1924 3 color painting on a line
ユーザー hitonanodehitonanode
提出日時 2022-05-02 19:52:09
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,405 bytes
コンパイル時間 2,250 ms
コンパイル使用メモリ 188,388 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-01 23:57:11
合計ジャッジ時間 3,647 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
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 -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) 0
#define dbgif(cond, x) 0
#endif

// https://github.com/imeimi2000/sshsmwt_codes/blob/master/bitset%20lcs.cpp
using ull = unsigned long long;

#define get(A, x) ((A[(x) >> 6] >> ((x)&63)) & 1)
#define set(A, x) (A[(x) >> 6] |= 1llu << ((x)&63))
int lcs(string A, string B) {
    int n = A.size(), m = B.size();
    int sz = (m >> 6) + 1; // 64bit
    vector<ull> S[256];
    for (int i = 0; i < 256; ++i) S[i].assign(sz, 0);
    for (int i = 0; i < m; ++i) set(S[B[i]], i);
    vector<ull> R(sz, 0);
    for (int i = 0; i < m; ++i)
        if (A[0] == B[i]) {
            set(R, i);
            break;
        }
    for (int i = 1; i < n; ++i) {
        ull shl_carry = 1, sub_carry = 0;
        for (int j = 0; j < sz; ++j) {
            ull x = S[A[i]][j] | R[j];
            ull u = (R[j] << 1) | shl_carry;
            shl_carry = R[j] >> 63;
            auto get_carry = [](ull &x, ull y) {
                ull z = x;
                x -= y;
                return z < x;
            };
            ull v = x;
            sub_carry = get_carry(v, sub_carry);
            sub_carry += get_carry(v, u);
            R[j] = x & (x ^ v);
        }
        R[m >> 6] &= (1llu << (m & 63)) - 1llu;
    }
    int ret = 0;
    for (int i = 0; i < m; ++i)
        if (get(R, i)) ++ret;
    return ret;
}
#undef get
#undef set


int bruteforce(const string &S) {
    const int N = S.size();
    vector dp(N + 1, vector<int>(N + 1, N + 10));
    REP(i, N) dp[i][i] = 0;
    FOR(w, 1, N + 1) {
        REP(l, N - w + 1) {
            int r = l + w;
            // [l, r)
            if (S[l] == S[r - 1]) {
                chmin(dp[l][r], dp[l + 1][r - 1] + 1);
            }
            chmin(dp[l][r], dp[l][r - 1] + 1);
            chmin(dp[l][r], dp[l + 1][r] + 1);
        }
    }
    return dp[0][N];
}

struct rand_int_ {
    using lint = long long;
    std::mt19937 mt;
    rand_int_() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
    lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
    lint operator()(lint l, lint r) {
        std::uniform_int_distribution<lint> d(l, r - 1);
        return d(mt);
    }
} rnd;

int solve(string T) {
    auto T2 = T;
    reverse(ALL(T2));
    int n = lcs(T, T2);
    assert(n <= T.size());
    return T.size() - n / 2;
}

string trim(string S) {
    string T;
    for (auto c : S) {
        if (T.empty() or c != T.back()) T += c;
    }
    return T;
}


int subsolve(string S, vector<char> U) {
    int i = 0, j = S.size() - 1;
    int d = 0;
    int ret = 0;
    char last_painted = 'Z';
    while (i <= j) {
        if (S[i] != U[d]) {
            if (S[i] != last_painted) ++ret;
            ++i;
            continue;
        }
        if (S[j] != U[d]) {
            if (S[j] != last_painted) ++ret;
            --j;
            continue;
        }
        last_painted = S[i];
        ++i;
        --j;
        d = (d + 1) % 3;
        ++ret;
    }
    return ret;
}

int main() {
    int N;
    string S;
    cin >> N >> S;
    S = trim(S);
    N = S.size();
    int ret = N;
    vector<char> U = {'B', 'G', 'R'};
    U = sort_unique(U);
    do {
        chmin(ret, subsolve(S, U));
    } while (next_permutation(ALL(U)));
    cout << ret << '\n';
}
0