#1189499 (C++23) No.3726 Flawless Flow

• 問題: No.3726 Flawless Flow
• ユーザー: shinchan
• 提出日時: 2026-09-19 17:53:18
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 3,720 bytes
• コンパイル時間: 2,113 ms
• コンパイル使用メモリ: 349,844 KB
• 実行使用メモリ: 9,984 KB
• 最終ジャッジ日時: 2026-09-19 17:53:25
• 合計ジャッジ時間: 5,269 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

ファイルパターン	結果
sample	AC * 1
other	AC * 55 WA * 4

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define all(v) (v).begin(),(v).end()
#define pb emplace_back
#define rep(i, n) for(int i=0;i<(n);i++)
#define foa(e, v) for(auto& e : v)
#define dout(a) cout<<fixed<<setprecision(10)<<a<<'\n';
#define Cout(a) cout<<a<<'\n';

using ll = long long;
using ld = long double;
using Int = __int128;
template <class T> using pqr = priority_queue<T, vector<T>, greater<T>>;

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
    bool compare = a < b;
    if(compare) a = b;
    return compare;
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
    bool compare = a > b;
    if(compare) a = b;
    return compare;
}
template <typename T> inline T back(std::set<T> &s) {
    return *s.rbegin();
}
template <typename T> inline T back(std::multiset<T> &s) {
    return *s.rbegin();
}
template <typename T> inline T pop_back(std::set<T> &s) {
    auto it = prev(s.end());
    T val = *it;
    s.erase(it); 
    return val;
}
template <typename T> inline T pop_back(std::multiset<T> &s) {
    auto it = prev(s.end());
    T val = *it;
    s.erase(it); 
    return val;
}

const int dy[8] = {-1, 0, 0, 1, 1, -1, 1, -1};
const int dx[8] = {0, -1, 1, 0, -1, -1, 1, 1};

const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (3LL << 59);
const int inf = 1 << 30;
const char br = '\n';

void solve() {
    int n; cin >> n;
    vector<int> a(n), b(n);
    rep(i, n) {
        cin >> a[i];
        a[i] --;
    }
    rep(i, n) {
        cin >> b[i];
        b[i] --;
    }
    vector<int> inv(n);
    rep(i, n) inv[b[i]] = i;
    vector<int> c(n);
    rep(i, n) c[i] = inv[a[i]];
{
    // vector<int> mapping(n); // = b
    
    
    vector<vector<int>> ans;
    ans.pb(c);
    rep(_, n) {
        vector<int> nx;
        int ma = -1;
        rep(i, n - 1) {
            if(ans.back()[i] > ans.back()[i + 1]) {
                chmax(ma, abs(ans.back()[i] - i));
                chmax(ma, abs(ans.back()[i + 1] - (i + 1)));
            }
        }
        vector<int> pri(n, 0);
        rep(i, n - 1) {
            if(ans.back()[i] > ans.back()[i + 1] and (ma == abs(ans.back()[i] - i) or (ma == abs(ans.back()[i + 1] - (i + 1))))) {
                pri[i] = 1;
            }
        }
        // foa(e, pri) cout << e << " ";
        // cout << endl;
        rep(i, n) {
            if(i < n - 1 and ans.back()[i] > ans.back()[i + 1] and (pri[i] or !pri[i + 1])) {
                nx.pb(ans.back()[i + 1]);
                nx.pb(ans.back()[i]);
                i ++;
            } else nx.pb(ans.back()[i]);
        }
        ans.pb(nx);
    }
    {
        vector<int> ord(n);
        iota(all(ord), 0);
        if(ord == ans.back()) {
            foa(v, ans) {
                foa(e, v) cout << b[e] + 1 << " ";
                cout << endl;
            }
            return;
        }
        // assert(ord == ans.back());
    }
    
}

     
    vector<vector<int>> ans;
    ans.pb(c);
    rep(_, n) {
        vector<int> nx;
        rep(i, n - 1) {
            if(ans.back()[i] > ans.back()[i + 1]) {
                nx.pb(ans.back()[i + 1]);
                nx.pb(ans.back()[i]);
                i ++;
            } else nx.pb(ans.back()[i]);
        }
        if((int)nx.size() < n) nx.pb(ans.back().back());
        ans.pb(nx);
    }
    {
        vector<int> ord(n);
        iota(all(ord), 0);
        if(ord != ans.back()) {
            cout << -1 << endl;
            return;
        }
    }
    foa(v, ans) {
        foa(e, v) cout << b[e] + 1 << " ";
        cout << endl;
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int testcase = 1; 
    // cin >> testcase;
    while(testcase --) solve();

    return 0;
}