提出 #69444359

---

ソースコード 拡げる

// To scale the heights, one must embrace the fall.
#include <bits/stdc++.h>
#define fi first
#define se second
#define int long long
#define pb emplace_back
#define F(i, a, b) for (int i = (a); i <= (b); ++i)
#define dF(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 200005, M = (N << 1), inf = 1e16, mod = 1e9 + 7;
int n;
struct seg {
    int l, r, f, id;
    bool operator < (const seg& x) const {
        return l < x.l;
    }
} a[N];
vector<int> ans;
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    F(i, 1, n) {
        cin >> a[i].l >> a[i].r;
        if (a[i].l > a[i].r) {
            swap(a[i].l, a[i].r);
            a[i].f = 1;
        }
        a[i].id = i;
    }
    sort(a + 1, a + n + 1);
    F(i, 2, n) {
        if (a[i - 1].f == a[i].f) {
            if (a[i - 1].r > a[i].r)
                cout << "No", exit(0);
        } else if (a[i - 1].r >= a[i].l) {
            cout << "No", exit(0);
        }
    }
    for (int i = 2, j = 1; i <= n + 1; i++) {
        if (i > n || a[i].f != a[j].f) {
            if (a[j].f == 1) {
                F(k, j, i - 1) {
                    ans.push_back(a[k].id);
                }
            } else {
                dF(k, i - 1, j) {
                    ans.push_back(a[k].id);
                }
            }
            j = i;
        }
    }
    cout << "Yes\n";
    for (int i : ans) cout << i << ' ';
    return 0;
}

提出情報

ジャッジ結果