提出 #53601590

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 1e6 + 5;

void solve() {
    ll n;
    cin >> n;
    vector<array<ll, 3>> v(n + 1);
    for (ll i = 1; i <= n; i++) {
        for (ll j = 0; j < 2; j++)
            cin >> v[i][j];
        v[i][2] = i;
    }
    sort(v.begin() + 1, v.end(), greater());
    vl ans;
    ans.push_back(v[1][2]);
    for (ll i = 2, mx = v[1][1]; i <= n; i++) {
        auto [a, c, j] = v[i];
        if (c < mx)
            ans.push_back(j);
        mx = min(mx, c);
    }
    cout << ans.size() << endl;
    sort(ans.begin(), ans.end());
    for (ll x : ans)
        cout << x << " ";
    cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

提出情報

ジャッジ結果