Submission #69082091

---

Source Code Expand

/*
Author : Mikira
9/6/2025 8:52:19 PM
*/

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

typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<LL, LL> PLL;
typedef pair<LL, LL> pll;
typedef long double ld;

#define rep(i, a, b) for(int i = a; i < int(b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define popf pop_front
#define pf push_front
#define popb pop_back
#define pb push_back
#define fi first
#define se second

const double EPS = 1e-9;
const int INFMEM = 63;

// Do dir^1 to get reverse direction
const int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const char dch[4] = {'R', 'L', 'D', 'U'};

// Do (dir + 2)%4 to get reverse direction
// const int dx[8] = {-1,0,1,0,-1,1,1,-1};
// const int dy[8] = {0,1,0,-1,1,1,-1,-1};
// const char dch[4] = {'U','R','D','L'};
const double PI = 3.141592653589793;

inline void fasterios() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
}
#define endl '\n'
const int MOD = 1000000007;
// const int MOD = 998244353;
struct Arrow {
  int fi;
  int se;
  int idx;
  int maks;
  int mini;
  bool direction;
  bool operator==(const Arrow &other) const {
    return idx == other.idx;
  }
};
int main() {
  fasterios();
  LL n; cin >> n;
  vector <Arrow> arr(n);
  rep(i, 0, n) {
    cin >> arr[i].fi >> arr[i].se;
    arr[i].idx = i;
    arr[i].direction = arr[i].fi < arr[i].se;
    arr[i].maks = max(arr[i].fi, arr[i].se);
    arr[i].mini = min(arr[i].fi, arr[i].se);
  }
  sort(all(arr), [&](const Arrow & a, const Arrow & b) {
    return a.mini < b.mini;
  });
  int idx = 0;
  vector <int> ans;
  while (idx < n) {
    // head is idx
    int furthest = -1;
    vector <Arrow> process;
    for (; idx < n; idx++) {
      if(furthest == - 1 || arr[idx].mini <= furthest) {
        furthest = arr[idx].maks;
        process.pb(arr[idx]);
      } else {
        break;
      }
    }
    bool can = true;
    trav(cur, process) {
      if(cur.direction != process.front().direction) can = false;
    }
    if(!can) {
      cout << "No" << endl;
      return 0;
    }
    sort(all(process), [&](const Arrow & a, const Arrow & b) {
      return make_pair(a.fi, a.se) < make_pair(b.fi, b.se);
    });
    vector <Arrow> processBack = process;
    sort(all(process), [&](const Arrow & a, const Arrow & b) {
      return make_pair(a.se, a.fi) < make_pair(b.se, b.fi);
    });
    if(process == processBack) {
      if(process.front().direction) {
        reverse(all(process));
        reverse(all(processBack));
      }
      trav(cur, process) {
        ans.pb(cur.idx);
      }
    } else {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  trav(cur, ans) cout << cur + 1 << " ";
  cout << endl;
}

Submission Info

Judge Result