oj.uz

Submission #947196

# Submission time Handle Problem Language Result Execution time Memory
947196 2024-03-15T15:49:52 Z gesgha Event Hopping 2 (JOI21_event2) C++17
8 / 100
 103 ms 52244 KB 
#include <bits/stdc++.h>
// #pragma GCC target("popcnt")

#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back

#define all(x) x.begin(), x.end()
#define pw(x) (1LL << (x))
#define sz(x) (int)x.size()

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fbo find_by_order
#define ook order_of_key
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename T>
using ve = vector <T>;

template <typename T>
bool umx (T& a, T b) { return a < b ? a = b, 1 : 0; }

template <typename T>
bool umn (T& a, T b) { return a > b ? a = b, 1 : 0; }

using ll = long long;
using ld = long double;
using pll = pair <ll, ll>;
using pii = pair <int, int>;
using ull = unsigned long long;

const int oo = 1e9 + 100;
const ll OO = 1e18;
const int N = 5e5 + 10;
const int M = 3e3 + 10;
const int mod = 998244353;
const bool TEST = 0;

mt19937_64 rng(228);
void precalc() {}




ll mn[N][20];
ll go[N];

int get(int l, int r) {
    int S = 0;
    for (int i = 19; i >= 0; i--) if (mn[l][i] <= r) {
        S += pw(i);
        l = mn[l][i];
    }
    return S;
}

void slv() {
    int n, k;
    cin >> n >> k;
    ve <array <ll, 3>> ev(n);
    ve <array <ll, 3>> V;
    
    for (int i = 0; i < n; i++) {
        cin >> ev[i][0] >> ev[i][1];
        V.pb({ev[i][0], i, 0});
        V.pb({ev[i][1], i, 1});
    }
    int c = 0;
    {
        sort(all(V));
        ev[V[0][1]][V[0][2]] = c;
        for (int i = 1; i < sz(V); i++) {
            c += bool(V[i][0] != V[i - 1][0]);
            ev[V[i][1]][V[i][2]] = c;
        }   
    }
    
    fill(go, go + 2 * n + 2, 2 * n);
    for (int i = 0; i < n; i++) {
        umn(go[ev[i][0]], ev[i][1]);
    }
    for (int i = 2 * n - 1; i >= 0; i--) umn(go[i], go[i + 1]);
    for (int i = 0; i < 20; i++) mn[2 * n][i] = 2 * n;
    for (int i = 2*n - 1; i >= 0; i--) {
        mn[i][0] = go[i];
        for (int st = 1; st < 20; st++) mn[i][st] = mn[mn[i][st - 1]][st - 1];
    }
    set <pii> Seg;
    int S = get(0, 2 * n - 1);
    if (S < k) {
        cout << "-1\n";
        exit(0);
    }
    ve <int> ans;
    for (int i = 0; i < n; i++) {
        int l = ev[i][0];
        int r = ev[i][1];
        int lt = 0, rt = 2 * n - 1;
        bool ok = 1;
        {
            auto it = Seg.lower_bound({l, -oo});
            if (it != Seg.end()) {
                ok &= ((*it).fi >= r);
                rt = (*it).se;
            }
            if (it != Seg.begin()) {
                --it;
                lt = (*it).se;
                ok &= ((*it).se <= l);
            }
            
        }
        if(!ok) continue;
        int was = get(lt, rt);
        int have = S - was + get(lt, l) + get(r, rt) + 1;
        if (have >= k) {
            S = have;
            Seg.insert({l, r});
            ans.pb(i);
        }
        if (sz(ans) == k) break;
    }
    fe(x, ans) {
        cout << x + 1 << '\n';
    }

}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif
    precalc();
    cout << fixed << setprecision(13);
    int q = 1;
    if (TEST) cin >> q;
    while (q--) slv();
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 95 ms 50792 KB Output is correct
5 Correct 100 ms 52016 KB Output is correct
6 Correct 102 ms 51384 KB Output is correct
7 Correct 96 ms 51464 KB Output is correct
8 Correct 103 ms 52028 KB Output is correct
9 Correct 100 ms 52244 KB Output is correct
10 Correct 91 ms 51756 KB Output is correct
11 Correct 96 ms 51416 KB Output is correct
12 Correct 79 ms 50612 KB Output is correct
13 Correct 76 ms 49816 KB Output is correct
14 Correct 80 ms 50612 KB Output is correct
15 Correct 74 ms 49264 KB Output is correct
16 Correct 52 ms 47220 KB Output is correct
17 Correct 50 ms 47296 KB Output is correct
18 Correct 50 ms 48296 KB Output is correct
19 Correct 48 ms 47296 KB Output is correct
20 Correct 49 ms 47028 KB Output is correct
21 Correct 54 ms 47028 KB Output is correct
22 Correct 49 ms 47884 KB Output is correct
23 Correct 48 ms 47804 KB Output is correct
24 Correct 47 ms 46520 KB Output is correct
25 Correct 50 ms 46784 KB Output is correct
26 Correct 52 ms 46692 KB Output is correct
27 Correct 48 ms 46520 KB Output is correct
28 Correct 54 ms 46780 KB Output is correct
29 Correct 47 ms 46984 KB Output is correct
30 Correct 44 ms 46908 KB Output is correct
31 Correct 51 ms 46592 KB Output is correct
32 Correct 58 ms 47540 KB Output is correct
33 Correct 49 ms 47304 KB Output is correct
34 Correct 70 ms 49400 KB Output is correct
35 Correct 59 ms 47644 KB Output is correct
36 Correct 53 ms 48048 KB Output is correct
37 Correct 80 ms 49456 KB Output is correct
38 Correct 76 ms 50384 KB Output is correct
39 Correct 70 ms 50360 KB Output is correct
40 Correct 75 ms 49952 KB Output is correct
41 Correct 69 ms 49848 KB Output is correct
42 Correct 58 ms 48020 KB Output is correct
43 Correct 87 ms 49844 KB Output is correct
44 Correct 81 ms 50364 KB Output is correct
45 Correct 81 ms 48988 KB Output is correct
46 Correct 86 ms 49332 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2516 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2516 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 4888 KB Output is correct
29 Correct 2 ms 4892 KB Output is correct
30 Incorrect 2 ms 4968 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 95 ms 50792 KB Output is correct
5 Correct 100 ms 52016 KB Output is correct
6 Correct 102 ms 51384 KB Output is correct
7 Correct 96 ms 51464 KB Output is correct
8 Correct 103 ms 52028 KB Output is correct
9 Correct 100 ms 52244 KB Output is correct
10 Correct 91 ms 51756 KB Output is correct
11 Correct 96 ms 51416 KB Output is correct
12 Correct 79 ms 50612 KB Output is correct
13 Correct 76 ms 49816 KB Output is correct
14 Correct 80 ms 50612 KB Output is correct
15 Correct 74 ms 49264 KB Output is correct
16 Correct 52 ms 47220 KB Output is correct
17 Correct 50 ms 47296 KB Output is correct
18 Correct 50 ms 48296 KB Output is correct
19 Correct 48 ms 47296 KB Output is correct
20 Correct 49 ms 47028 KB Output is correct
21 Correct 54 ms 47028 KB Output is correct
22 Correct 49 ms 47884 KB Output is correct
23 Correct 48 ms 47804 KB Output is correct
24 Correct 47 ms 46520 KB Output is correct
25 Correct 50 ms 46784 KB Output is correct
26 Correct 52 ms 46692 KB Output is correct
27 Correct 48 ms 46520 KB Output is correct
28 Correct 54 ms 46780 KB Output is correct
29 Correct 47 ms 46984 KB Output is correct
30 Correct 44 ms 46908 KB Output is correct
31 Correct 51 ms 46592 KB Output is correct
32 Correct 58 ms 47540 KB Output is correct
33 Correct 49 ms 47304 KB Output is correct
34 Correct 70 ms 49400 KB Output is correct
35 Correct 59 ms 47644 KB Output is correct
36 Correct 53 ms 48048 KB Output is correct
37 Correct 80 ms 49456 KB Output is correct
38 Correct 76 ms 50384 KB Output is correct
39 Correct 70 ms 50360 KB Output is correct
40 Correct 75 ms 49952 KB Output is correct
41 Correct 69 ms 49848 KB Output is correct
42 Correct 58 ms 48020 KB Output is correct
43 Correct 87 ms 49844 KB Output is correct
44 Correct 81 ms 50364 KB Output is correct
45 Correct 81 ms 48988 KB Output is correct
46 Correct 86 ms 49332 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 0 ms 2396 KB Output is correct
49 Correct 0 ms 2396 KB Output is correct
50 Correct 0 ms 2396 KB Output is correct
51 Correct 0 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 1 ms 2396 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 1 ms 2396 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2396 KB Output is correct
61 Correct 1 ms 2396 KB Output is correct
62 Correct 1 ms 2392 KB Output is correct
63 Correct 1 ms 2396 KB Output is correct
64 Correct 1 ms 2396 KB Output is correct
65 Correct 0 ms 2516 KB Output is correct
66 Correct 1 ms 2392 KB Output is correct
67 Correct 1 ms 2396 KB Output is correct
68 Correct 1 ms 2396 KB Output is correct
69 Correct 1 ms 2396 KB Output is correct
70 Correct 1 ms 2516 KB Output is correct
71 Correct 1 ms 2396 KB Output is correct
72 Correct 1 ms 2396 KB Output is correct
73 Correct 1 ms 2396 KB Output is correct
74 Correct 2 ms 4888 KB Output is correct
75 Correct 2 ms 4892 KB Output is correct
76 Incorrect 2 ms 4968 KB Output isn't correct
77 Halted 0 ms 0 KB -