Submission #57465466

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
constexpr ll INF = 1e9 + 7;
constexpr ll mod = 1e9 + 7;
constexpr ld eps = 1e-9;
const ld PI = acos(-1);

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<array<ll, 3>> a(n);
    for (ll i = 0; i < n; ++i) {
        cin >> a[i][0] >> a[i][1];
        a[i][2] = i;
    }
    sort(a.begin(), a.end());
    vector<ll> ans;
    vector<ll> s;
    for(auto &[x,y,i] : a){
        while(s.size() && s.back() > y)s.pop_back(),ans.pop_back();
        s.push_back(y);
        ans.push_back(i);
    }
    cout << ans.size() << "\n";
    sort(ans.begin(),ans.end());
    for(auto x : ans)cout << x + 1 << " ";
}

Submission Info

Judge Result