結果
| 問題 | No.2986 Permutation Puzzle |
| ユーザー |
👑  Nachia
|
| 提出日時 | 2024-12-11 19:28:46 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 39 ms / 2,000 ms |
| コード長 | 8,618 bytes |
| コンパイル時間 | 1,441 ms |
| コンパイル使用メモリ | 109,832 KB |
| 最終ジャッジ日時 | 2025-02-26 12:01:41 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 40 |
ソースコード
#ifdef NACHIA#define _GLIBCXX_DEBUG#else#define NDEBUG#endif#include <iostream>#include <string>#include <vector>#include <algorithm>using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(int i=0; i<int(n); i++)const i64 INF = 1001001001001001001;template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }using namespace std;#include <atcoder/modint>using Modint = atcoder::static_modint<998244353>;#include <iterator>#include <functional>#include <utility>#include <type_traits>template<class Elem> struct vec;template<class Iter>struct seq_view{using Ref = typename std::iterator_traits<Iter>::reference;using Elem = typename std::iterator_traits<Iter>::value_type;Iter a, b;Iter begin() const { return a; }Iter end() const { return b; }int size() const { return (int)(b-a); }seq_view(Iter first, Iter last) : a(first), b(last) {}seq_view sort() const { std::sort(a, b); return *this; }Ref& operator[](int x) const { return *(a+x); }template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {ret x(size()); for(int i=0; i<size(); i++) x[i] = i;x().sort([&](int l, int r){ return f(a[l],a[r]); });return x;}template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }template<class ret = vec<Elem>> ret cumsum() const {auto res = ret(size() + 1, Elem(0));for(int i=0; i<size(); i++) res[i+1] = res[i] + operator[](i);return res;}template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>ret rle(F eq = F()) const {auto x = ret();for(auto& a : (*this)){if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;} return x;}template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }Iter uni() const { return std::unique(a, b); }Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }int lbi(const Elem& x) const { return lb(x) - a; }int ubi(const Elem& x) const { return ub(x) - a; }seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }template<class F> Iter when_true_to_false(F f) const {if(a == b) return a;return std::lower_bound(a, b, *a,[&](const Elem& x, const Elem&){ return f(x); });}seq_view same(Elem x) const { return { lb(x), ub(x) }; }template<class F> auto map(F f) const {vec<decltype(f(std::declval<const typename Iter::value_type&>()))> r;for(auto& x : *this) r.emp(f(x));return r;}Iter max() const { return std::max_element(a, b); }Iter min() const { return std::min_element(a, b); }template<class F = std::less<Elem>>Iter min(F f) const { return std::min_element(a, b, f); }seq_view rev() const { std::reverse(a, b); return *this; }};template<class Elem>struct vec {public:using Base = typename std::vector<Elem>;using Iter = typename Base::iterator;using CIter = typename Base::const_iterator;using View = seq_view<Iter>;using CView = seq_view<CIter>;vec(){}explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}template <class I2> vec(I2 first, I2 last) : a(first, last) {}vec(std::initializer_list<Elem> il) : a(std::move(il)) {}vec(Base b) : a(std::move(b)) {}operator Base() const { return a; }Iter begin(){ return a.begin(); }CIter begin() const { return a.begin(); }Iter end(){ return a.end(); }CIter end() const { return a.end(); }int size() const { return a.size(); }bool empty() const { return a.empty(); }Elem& back(){ return a.back(); }const Elem& back() const { return a.back(); }vec& sortuni(){ (*this)().sort(); a.erase((*this)().uni(), end()); return *this; }vec sortunied(){ vec x = *this; x.sortuni(); return x; }Iter operator()(int x){ return a.begin() + x; }CIter operator()(int x) const { return a.begin() + x; }View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }View operator()(){ return (*this)(0,size()); }CView operator()() const { return (*this)(0,size()); }Elem& operator[](int x){ return a[x]; }const Elem& operator[](int x) const { return a[x]; }Base& operator*(){ return a; }const Base& operator*() const { return a; }vec& push(Elem args){a.push_back(std::move(args));return *this;}template<class... Args>vec& emp(Args &&... args){a.emplace_back(std::forward<Args>(args) ...);return *this;}template<class Range>vec& app(Range& x){ for(auto& v : x){ emp(v); } return *this; }Elem pop(){ Elem x = std::move(a.back()); a.pop_back(); return x; }void resize(int sz){ a.resize(sz); }void reserve(int sz){ a.reserve(sz); }bool operator==(const vec& r) const { return a == r.a; }bool operator!=(const vec& r) const { return a != r.a; }bool operator<(const vec& r) const { return a < r.a; }bool operator<=(const vec& r) const { return a <= r.a; }bool operator>(const vec& r) const { return a > r.a; }bool operator>=(const vec& r) const { return a >= r.a; }vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }template<class F> vec& filter(F f){int p = 0;for(auto& x : a) if(f(x)) std::swap(a[p++],x);resize(p); return *this;}vec& operator+=(const vec& r){ return app(r); }vec operator+(const vec& r) const { vec x = *this; x += r; return x; }vec operator*(int t) const { vec res; while(t--){ res += *this; } return res; }private: Base a;};template<class IStr, class U, class T>IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }template<class IStr, class T>IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }template<class OStr, class T>OStr& operator<<(OStr& os, const vec<T>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << v[i];} return os;}template<class OStr, class U, class T>OStr& operator<<(OStr& os, const vec<std::pair<U,T>>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << '(' << v[i].first << ',' << v[i].second << ')';} return os;}void testcase(){i64 N, K; cin >> N >> K;auto A = vec<int>(N).pile(N); cin >> A;auto B = vec<int>(N).pile(N); cin >> B;rep(i,N) rep(j,N) A[i][j]--;rep(i,N) rep(j,N) B[i][j]--;struct Move {char c;int a;int b;vec<int> P;};vec<Move> moves;auto P = A;auto dfs = [&](auto& dfs) -> bool {if(P == B || moves.size() == K){if(P == B){return true;} else {moves.pop();return false;}}auto Q = P;rep(a,N){vec<int> F(N); rep(i,N) F[i] = Q[a][i];rep(i,N) rep(j,N) P[F[i]][j] = Q[i][j];moves.push({ 'R', a, F[a], F });if(dfs(dfs)) return true;}rep(a,N){vec<int> F(N); rep(i,N) F[i] = Q[i][a];rep(i,N) rep(j,N) P[i][F[j]] = Q[i][j];moves.push({ 'C', a, F[a], F });if(dfs(dfs)) return true;}if(!moves.empty()) moves.pop();return false;};dfs(dfs);moves().rev();vec<pair<char,int>> ans;for(auto m : moves){vec<int> F = m.P;int b = m.b;vec<int> FF = F;vec<int> Id(N); rep(i,N) Id[i] = i;auto procFF = [&](){vec<int> nxFF(N);rep(i,N) nxFF[i] = F[FF[i]];swap(FF, nxFF);b = F[b];};while(FF != Id){ans.push({ m.c, b });procFF();}}cout << ans.size() << '\n';for(auto [u,v] : ans){cout << u << ' ' << (v+1) << '\n';}}int main(){ios::sync_with_stdio(false); cin.tie(nullptr);testcase();return 0;}