提出 #57474197

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

void mark_numbers(Num n, std::vector<Set>& ps, const Vec& order, Num mark, Vec& marks) {
    std::vector<Vec> qs(3);
    for(Num i{0}; i<3; ++i) {
        Num left = n * i;
        Num right = left + n;
        for(const auto& p : ps.at(order.at(i))) {
            if ((left <= p) && (p < right)) {
                qs.at(i).push_back(p);
            }
        }
    }

    std::vector<size_t> ms(3);
    for(Num i{0}; i<3; ++i) {
        ms.at(i) = qs.at(i).size();
    }

    const auto sz = *std::ranges::min_element(ms);
    for(Num i{0}; i<3; ++i) {
        for(size_t j{0}; j<sz; ++j) {
            const auto& v = qs.at(i).at(j);
            marks.at(v) = mark;
            ps.at(order.at(i)).erase(v);
        }
    }

    return;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    std::string s;
    is >> n >> s;
    const auto n3 = n * 3;

    std::vector<Set> ps(3);
    for(Num i{0}; i<n3; ++i) {
        const Num d = s.at(i) - 'A';
        ps.at(d).insert(i);
    }

    std::vector<std::pair<Num,Num>> ss;
    Vec order {0,1,2};
    Num mark {1};
    Vec ans(n3, 1);
    do {
        mark_numbers(n, ps, order, mark, ans);
        ++mark;
    } while(std::next_permutation(order.begin(), order.end()));

    for(const auto& x : ans) {
        os << x;
    }
    os << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果