【开源社区openEuler实践】 E. Inverse Topological Sort

题目

题解：

#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
#define pii pair<int, int>
#define ld long double
const int maxn = 2e5 + 5, inf = 1e9, maxm = 4e4 + 5, base = 337;
const int N = 2e5;
// const int mod = 1e9 + 7;
const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;
int n, m;

void solve(){
    ll res = 0;
    int k, q;
    cin >> n;
    vector<int> a(n + 1), b(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= n; i++){
        cin >> b[i];
    }
    stack<int> stk;
    vector<vector<int>> G(n + 1);
    vector<int> ind(n + 1, 0);
    vector<pii> ans;
    for(int i = 1; i <= n; i++){
        while(!stk.empty() && a[stk.top()] < a[i]){
            stk.pop();
        }
        if(!stk.empty()){
            G[a[stk.top()]].pb(a[i]);
            ans.pb({a[stk.top()], a[i]});
            ind[a[i]]++;
        }
        stk.push(i);
    }
    while(!stk.empty()) stk.pop();
    for(int i = 1; i <= n; i++){
        while(!stk.empty() && b[stk.top()] > b[i]){
            stk.pop();
        }
        if(!stk.empty()){
            G[b[stk.top()]].pb(b[i]);
            ans.pb({b[stk.top()], b[i]});
            ind[b[i]]++;
        }
        stk.push(i);
    }
    auto tuopu = [&](auto pq) -> vector<int> {
        vector<int> tmp = ind;
        vector<int> ans{0};
        for(int i = 1; i <= n; i++){
            if(ind[i] == 0){
                pq.push(i);
            }
        }
        while(!pq.empty()){
            int u = pq.top();
            pq.pop();
            ans.pb(u);
            for(auto v : G[u]){
                if(--ind[v] == 0){
                    pq.push(v);
                }
            }
        }
        ind = tmp;
        return ans;
    };
    priority_queue<int> pq;
    vector<int> B = tuopu(pq);
    priority_queue<int, vector<int>, greater<int>> pq2;
    vector<int> A = tuopu(pq2);
    if(A == a && B == b){
        cout << "Yes\n";
        cout << ans.size() << '\n';
        for(auto [x, y] : ans){
            cout << x << ' ' << y << '\n';
        }
    }
    else{
        cout << "No\n";
    }
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(9);

    int T = 1;
    // cin >> T;
    while (T--){
        solve();
    }
    return 0;
}