oj.uz

Submission #743515

# Submission time Handle Problem Language Result Execution time Memory
743515 2023-05-17T13:09:27 Z GrindMachine Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 15116 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        ll a;
    };

    data neutral = {0};

    data merge(data &left, data &right) {
        data curr;
        curr.a = max(left.a, right.a);
        return curr;
    }

    void create(int i, T v) {
        amax(tr[i].a, v);
    }

    void modify(int i, T v) {
        amax(tr[i].a, v);
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

void solve(int test_case)
{
    ll n, k; cin >> n >> k;
    vector<pll> a(n + 5);
    rep1(i, n) cin >> a[i].ff >> a[i].ss;

    vector<ll> b;
    rep1(i, n) {
        b.pb(a[i].ff);
        b.pb(a[i].ss);
    }

    sort(all(b));
    b.resize(unique(all(b)) - b.begin());
    ll siz = sz(b);

    rep1(i, n) {
        a[i].ff = lower_bound(all(b), a[i].ff) - b.begin();
        a[i].ss = lower_bound(all(b), a[i].ss) - b.begin();
    }

    vector<pll> order;
    rep1(i, n) order.pb({a[i].ff, i});

    sort(all(order));
    vector<bool> rem(n + 5);

    vector<ll> ans;

    rep1(guy, n) {
        if (k == 0) break;
        if (rem[guy]) conts;

        vector<ll> dp_pref(n + 5), dp_suff(n + 5);
        segtree<ll> st(siz + 5);

        rep(id, n) {
            ll i = order[id].ss;
            if (rem[i]) conts;

            auto [l, r] = a[i];
            dp_pref[i] = st.query(0, l).a + 1;
            st.pupd(r, dp_pref[i]);
        }

        st = segtree<ll>(siz + 5);

        rev(id, n - 1, 0) {
            ll i = order[id].ss;
            if (rem[i]) conts;

            auto [l, r] = a[i];
            dp_suff[i] = st.query(r, siz - 1).a + 1;
            st.pupd(l, dp_suff[i]);
        }

        ll mx_pick = dp_pref[guy] + dp_suff[guy] - 1;

        if (mx_pick >= k) {
            ans.pb(guy);
            rem[guy] = 1;
            k--;

            rep1(i, n) {
                if (rem[i]) conts;
                auto [l1, r1] = a[i];
                auto [l2, r2] = a[guy];
                if (!(min(r1, r2) <= max(l1, l2))) {
                    rem[i] = 1;
                }
            }
        }
    }

    if (ans.empty()) {
        cout << -1 << endl;
        return;
    }

    trav(x, ans) cout << x << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Execution timed out 3058 ms 15116 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 46 ms 772 KB Output is correct
29 Correct 29 ms 780 KB Output is correct
30 Correct 17 ms 784 KB Output is correct
31 Correct 5 ms 780 KB Output is correct
32 Correct 4 ms 764 KB Output is correct
33 Correct 1477 ms 912 KB Output is correct
34 Correct 1584 ms 1208 KB Output is correct
35 Correct 767 ms 816 KB Output is correct
36 Correct 749 ms 952 KB Output is correct
37 Correct 598 ms 992 KB Output is correct
38 Correct 1358 ms 836 KB Output is correct
39 Correct 633 ms 892 KB Output is correct
40 Correct 606 ms 876 KB Output is correct
41 Correct 569 ms 872 KB Output is correct
42 Correct 1404 ms 996 KB Output is correct
43 Correct 290 ms 840 KB Output is correct
44 Correct 202 ms 824 KB Output is correct
45 Correct 180 ms 780 KB Output is correct
46 Correct 1398 ms 876 KB Output is correct
47 Correct 127 ms 776 KB Output is correct
48 Correct 54 ms 780 KB Output is correct
49 Correct 28 ms 792 KB Output is correct
50 Correct 1413 ms 828 KB Output is correct
51 Correct 164 ms 780 KB Output is correct
52 Correct 84 ms 780 KB Output is correct
53 Correct 8 ms 780 KB Output is correct
54 Correct 1445 ms 960 KB Output is correct
55 Correct 582 ms 668 KB Output is correct
56 Correct 575 ms 672 KB Output is correct
57 Correct 567 ms 688 KB Output is correct
58 Correct 563 ms 688 KB Output is correct
59 Correct 562 ms 720 KB Output is correct
60 Correct 571 ms 716 KB Output is correct
61 Correct 564 ms 724 KB Output is correct
62 Correct 559 ms 688 KB Output is correct
63 Correct 599 ms 716 KB Output is correct
64 Correct 1150 ms 668 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Execution timed out 3058 ms 15116 KB Time limit exceeded
5 Halted 0 ms 0 KB -