oj.uz

Submission #398092

# Submission time Handle Problem Language Result Execution time Memory
398092 2021-05-03T16:29:45 Z 12tqian Event Hopping 2 (JOI21_event2) C++17
100 / 100
 595 ms 33608 KB 
#include <bits/stdc++.h>

using namespace std;

#define f1r(i, a, b) for (int i = a; i < b; ++i)
#define f0r(i, a) f1r(i, 0, a)
#define each(t, a) for (auto& t : a)

#define mp make_pair
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template <class T> int get_pos(vector<T>& v, T x) {
    return lower_bound(all(v), x) - v.begin();
}

const int INF = 1e9;

struct SegmentTree {
    vpi st;
    int sz;
    int ty = 0;
    int nil;

    pi comb(pi x, pi y) {
        if (ty == 0) return min(x, y);
        return max(x, y);
    }

    void pull(int i) {
        st[i] = comb(st[2 * i], st[2 * i + 1]);
    }

    void init(int n, int t) {
        ty = t;
        if (ty == 0) {
            nil = INF;
        } else {
            nil = -INF;
        }
        sz = 1;
        while (sz < n) sz <<= 1;
        st.assign(2 * sz, mp(nil, 0));
        f0r(i, sz) st[i + sz].s = i;
        for (int i = sz - 1; i >= 1; i--) pull(i);
    }

    void upd(int p, int x, int i = 1, int l = 0, int r = -1) {
        if (r == -1) r += sz;
        if (p < l || r < p) return;
        if (l == r) { 
            st[i] = comb(st[i], {x, p});
            return;
        }
        int m = (l + r) >> 1;
        upd(p, x, 2 * i, l, m);
        upd(p, x, 2 * i + 1, m + 1, r);
        pull(i);
    }

    pi query(int lo, int hi, int i = 1, int l = 0, int r = -1) {
        if (r == -1) r += sz;
        if (hi < l || r < lo) return {nil, nil};
        else if (lo <= l && r <= hi) return st[i];
        int m = (l + r) >> 1;
        return comb(query(lo, hi, 2 * i, l, m), query(lo, hi, 2 * i + 1, m + 1, r));
    }
};

struct IntervalUnion {
    set<pi> ivals;

    void insert(pi x) {
        ivals.insert(x);
    }

    bool bad(pi x) {
        auto it = ivals.lower_bound({x.f, -INF});
        if (it != ivals.end()) { // first thing with left coord at least x.f
            if (it->f < x.s) return true;   
        }
        if (it == ivals.begin()) return false; // there's nothing before
        it = prev(it);
        if (it->s > x.f) return true;
        return false;
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int n, k; cin >> n >> k;
    
    vpi v(n);
    f0r(i, n) cin >> v[i].f >> v[i].s;
    
    vi pts;
    each(p, v) pts.pb(p.f), pts.pb(p.s);
    sort(all(pts));
    pts.erase(unique(all(pts)), pts.end());
    
    each(p, v) p.f = get_pos(pts, p.f), p.s = get_pos(pts, p.s);
    
    map<pi, int> conv; // this is not unique possibly, but that doesn't matter
    f0r(i, n) conv[v[i]] = i;
    
    vi ord(n);
    iota(all(ord), 0);
    sort(all(ord), [&](int x, int y) {
        return v[x].f < v[y].f;
    });
    
    int d = 1;
    while ((1 << d) < n) ++d;
    
    vector<vi> L, R;
    vector<vector<bool>> LB, RB; // determines whether you hit the deadend
    L = R = vector<vi>(d, vi(n));
    LB = RB = vector<vector<bool>>(d, vector<bool>(n));
    
    int sz = sz(pts);
    
    SegmentTree seg;
    seg.init(sz, 0); // min segtree
    
    for (int i = n - 1; i >= 0; i--) {
        int id = ord[i];
        int l = v[id].f;
        int r = v[id].s;
        auto res = seg.query(r, sz - 1);
        if (res.f != seg.nil) {
            R[0][id] = conv[{res.s, res.f}];
            RB[0][id] = true;
        } else {
            R[0][id] = id;
        }
        seg.upd(l, r);
    }

    sort(all(ord), [&](int x, int y) {
        return v[x].s < v[y].s;
    });
    
    seg.init(sz, 1);
    
    f0r(i, n) {
        int id = ord[i];
        int l = v[id].f;
        int r = v[id].s;
        auto res = seg.query(0, l);
        if (res.f != seg.nil) {
            L[0][id] = conv[{res.f, res.s}];
            LB[0][id] = true;
        } else {
            L[0][id] = id;
        }
        seg.upd(r, l);
    }
    
    f1r(j, 1, d) {
        f0r(i, n) {
            L[j][i] = L[j - 1][L[j - 1][i]];
            R[j][i] = R[j - 1][R[j - 1][i]];
            LB[j][i] = LB[j - 1][L[j - 1][i]] & LB[j - 1][i];
            RB[j][i] = RB[j - 1][R[j - 1][i]] & RB[j - 1][i];
        }
    }
    
    vi ans;
    
    IntervalUnion IU;
    
    auto compute = [&](int x, int y) -> int { // assumes nonoverlapping
        int amt = 0;
        if (x == -1 && y == -1) {
            amt = 0;
        } else if (x == -1) { // that means null left
            int cur = y;
            for (int i = d - 1; i >= 0; i--) {
                if (!LB[i][cur]) continue;
                cur = L[i][cur];
                amt += (1 << i);
            }
        } else if (y == -1) {
            int cur = x;
            for (int i = d - 1; i >= 0; i--) {
                if (!RB[i][cur]) continue;
                cur = R[i][cur];
                amt += (1 << i);
            }
        } else {
            if (v[x] > v[y]) swap(x, y);
            int cur = x;
            for (int i = d - 1; i >= 0; i--) {
                if (!RB[i][cur]) continue;
                auto g = R[i][cur];
                if (v[g].s <= v[y].f) {
                    amt += (1 << i);
                    cur = g;
                }
            }
        }
        return amt;
    };
    
    int cur = 0;
    
    f0r(i, n) {
        auto& p = v[i];
        if (IU.bad(p)) continue;
        auto it = IU.ivals.upper_bound(p);
        int aft = -1;
        if (it != IU.ivals.end()) aft = conv[*it];
        int bef = -1;
        if (it != IU.ivals.begin()) bef = conv[*prev(it)];
        int now = compute(bef, aft); 
        int future = compute(bef, i) + compute(i, aft) + 1;
        if (cur - now + future >= k) {
            cur = cur - now + future;
            IU.insert(p);
            ans.pb(i);
        }
    }

    if (sz(ans) >= k) {
        f0r(i, k) cout << ans[i] + 1 << '\n';
    } else {
        cout << -1 << '\n';
    }
    return 0;
}

/**
 * store at left coordinate right coordinate, find minimum right coordinate
 */

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 362 ms 32116 KB Output is correct
5 Correct 366 ms 33464 KB Output is correct
6 Correct 364 ms 33604 KB Output is correct
7 Correct 365 ms 33608 KB Output is correct
8 Correct 366 ms 33576 KB Output is correct
9 Correct 373 ms 33568 KB Output is correct
10 Correct 366 ms 33468 KB Output is correct
11 Correct 375 ms 33472 KB Output is correct
12 Correct 334 ms 31552 KB Output is correct
13 Correct 338 ms 31684 KB Output is correct
14 Correct 346 ms 31420 KB Output is correct
15 Correct 329 ms 31412 KB Output is correct
16 Correct 284 ms 28984 KB Output is correct
17 Correct 289 ms 28896 KB Output is correct
18 Correct 308 ms 28968 KB Output is correct
19 Correct 292 ms 28332 KB Output is correct
20 Correct 288 ms 28352 KB Output is correct
21 Correct 286 ms 28348 KB Output is correct
22 Correct 292 ms 28220 KB Output is correct
23 Correct 298 ms 28224 KB Output is correct
24 Correct 291 ms 28348 KB Output is correct
25 Correct 313 ms 28396 KB Output is correct
26 Correct 317 ms 28340 KB Output is correct
27 Correct 305 ms 28224 KB Output is correct
28 Correct 293 ms 28228 KB Output is correct
29 Correct 285 ms 28336 KB Output is correct
30 Correct 294 ms 28220 KB Output is correct
31 Correct 294 ms 28284 KB Output is correct
32 Correct 304 ms 28224 KB Output is correct
33 Correct 326 ms 28344 KB Output is correct
34 Correct 337 ms 31408 KB Output is correct
35 Correct 328 ms 31480 KB Output is correct
36 Correct 330 ms 31344 KB Output is correct
37 Correct 319 ms 31040 KB Output is correct
38 Correct 318 ms 31036 KB Output is correct
39 Correct 312 ms 31028 KB Output is correct
40 Correct 317 ms 31032 KB Output is correct
41 Correct 314 ms 30992 KB Output is correct
42 Correct 304 ms 28328 KB Output is correct
43 Correct 348 ms 30916 KB Output is correct
44 Correct 332 ms 30836 KB Output is correct
45 Correct 335 ms 30772 KB Output is correct
46 Correct 330 ms 30796 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 8 ms 972 KB Output is correct
29 Correct 11 ms 972 KB Output is correct
30 Correct 8 ms 972 KB Output is correct
31 Correct 8 ms 972 KB Output is correct
32 Correct 8 ms 972 KB Output is correct
33 Correct 8 ms 968 KB Output is correct
34 Correct 8 ms 972 KB Output is correct
35 Correct 10 ms 1228 KB Output is correct
36 Correct 10 ms 1148 KB Output is correct
37 Correct 10 ms 1100 KB Output is correct
38 Correct 8 ms 972 KB Output is correct
39 Correct 10 ms 1196 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 10 ms 1204 KB Output is correct
42 Correct 8 ms 1040 KB Output is correct
43 Correct 10 ms 1100 KB Output is correct
44 Correct 9 ms 1100 KB Output is correct
45 Correct 8 ms 1100 KB Output is correct
46 Correct 8 ms 972 KB Output is correct
47 Correct 8 ms 972 KB Output is correct
48 Correct 8 ms 972 KB Output is correct
49 Correct 8 ms 972 KB Output is correct
50 Correct 8 ms 972 KB Output is correct
51 Correct 8 ms 972 KB Output is correct
52 Correct 8 ms 964 KB Output is correct
53 Correct 8 ms 972 KB Output is correct
54 Correct 8 ms 972 KB Output is correct
55 Correct 8 ms 1124 KB Output is correct
56 Correct 8 ms 1100 KB Output is correct
57 Correct 8 ms 1100 KB Output is correct
58 Correct 8 ms 1100 KB Output is correct
59 Correct 8 ms 1088 KB Output is correct
60 Correct 8 ms 1100 KB Output is correct
61 Correct 8 ms 1100 KB Output is correct
62 Correct 8 ms 1140 KB Output is correct
63 Correct 8 ms 1100 KB Output is correct
64 Correct 7 ms 972 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 362 ms 32116 KB Output is correct
5 Correct 366 ms 33464 KB Output is correct
6 Correct 364 ms 33604 KB Output is correct
7 Correct 365 ms 33608 KB Output is correct
8 Correct 366 ms 33576 KB Output is correct
9 Correct 373 ms 33568 KB Output is correct
10 Correct 366 ms 33468 KB Output is correct
11 Correct 375 ms 33472 KB Output is correct
12 Correct 334 ms 31552 KB Output is correct
13 Correct 338 ms 31684 KB Output is correct
14 Correct 346 ms 31420 KB Output is correct
15 Correct 329 ms 31412 KB Output is correct
16 Correct 284 ms 28984 KB Output is correct
17 Correct 289 ms 28896 KB Output is correct
18 Correct 308 ms 28968 KB Output is correct
19 Correct 292 ms 28332 KB Output is correct
20 Correct 288 ms 28352 KB Output is correct
21 Correct 286 ms 28348 KB Output is correct
22 Correct 292 ms 28220 KB Output is correct
23 Correct 298 ms 28224 KB Output is correct
24 Correct 291 ms 28348 KB Output is correct
25 Correct 313 ms 28396 KB Output is correct
26 Correct 317 ms 28340 KB Output is correct
27 Correct 305 ms 28224 KB Output is correct
28 Correct 293 ms 28228 KB Output is correct
29 Correct 285 ms 28336 KB Output is correct
30 Correct 294 ms 28220 KB Output is correct
31 Correct 294 ms 28284 KB Output is correct
32 Correct 304 ms 28224 KB Output is correct
33 Correct 326 ms 28344 KB Output is correct
34 Correct 337 ms 31408 KB Output is correct
35 Correct 328 ms 31480 KB Output is correct
36 Correct 330 ms 31344 KB Output is correct
37 Correct 319 ms 31040 KB Output is correct
38 Correct 318 ms 31036 KB Output is correct
39 Correct 312 ms 31028 KB Output is correct
40 Correct 317 ms 31032 KB Output is correct
41 Correct 314 ms 30992 KB Output is correct
42 Correct 304 ms 28328 KB Output is correct
43 Correct 348 ms 30916 KB Output is correct
44 Correct 332 ms 30836 KB Output is correct
45 Correct 335 ms 30772 KB Output is correct
46 Correct 330 ms 30796 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 208 KB Output is correct
53 Correct 1 ms 316 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 320 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 1 ms 204 KB Output is correct
74 Correct 8 ms 972 KB Output is correct
75 Correct 11 ms 972 KB Output is correct
76 Correct 8 ms 972 KB Output is correct
77 Correct 8 ms 972 KB Output is correct
78 Correct 8 ms 972 KB Output is correct
79 Correct 8 ms 968 KB Output is correct
80 Correct 8 ms 972 KB Output is correct
81 Correct 10 ms 1228 KB Output is correct
82 Correct 10 ms 1148 KB Output is correct
83 Correct 10 ms 1100 KB Output is correct
84 Correct 8 ms 972 KB Output is correct
85 Correct 10 ms 1196 KB Output is correct
86 Correct 10 ms 1100 KB Output is correct
87 Correct 10 ms 1204 KB Output is correct
88 Correct 8 ms 1040 KB Output is correct
89 Correct 10 ms 1100 KB Output is correct
90 Correct 9 ms 1100 KB Output is correct
91 Correct 8 ms 1100 KB Output is correct
92 Correct 8 ms 972 KB Output is correct
93 Correct 8 ms 972 KB Output is correct
94 Correct 8 ms 972 KB Output is correct
95 Correct 8 ms 972 KB Output is correct
96 Correct 8 ms 972 KB Output is correct
97 Correct 8 ms 972 KB Output is correct
98 Correct 8 ms 964 KB Output is correct
99 Correct 8 ms 972 KB Output is correct
100 Correct 8 ms 972 KB Output is correct
101 Correct 8 ms 1124 KB Output is correct
102 Correct 8 ms 1100 KB Output is correct
103 Correct 8 ms 1100 KB Output is correct
104 Correct 8 ms 1100 KB Output is correct
105 Correct 8 ms 1088 KB Output is correct
106 Correct 8 ms 1100 KB Output is correct
107 Correct 8 ms 1100 KB Output is correct
108 Correct 8 ms 1140 KB Output is correct
109 Correct 8 ms 1100 KB Output is correct
110 Correct 7 ms 972 KB Output is correct
111 Correct 392 ms 28356 KB Output is correct
112 Correct 385 ms 28320 KB Output is correct
113 Correct 375 ms 28352 KB Output is correct
114 Correct 394 ms 28476 KB Output is correct
115 Correct 386 ms 28352 KB Output is correct
116 Correct 402 ms 28472 KB Output is correct
117 Correct 402 ms 28276 KB Output is correct
118 Correct 595 ms 33572 KB Output is correct
119 Correct 574 ms 33520 KB Output is correct
120 Correct 481 ms 31372 KB Output is correct
121 Correct 386 ms 28328 KB Output is correct
122 Correct 483 ms 31620 KB Output is correct
123 Correct 486 ms 31404 KB Output is correct
124 Correct 473 ms 31336 KB Output is correct
125 Correct 402 ms 28328 KB Output is correct
126 Correct 390 ms 28968 KB Output is correct
127 Correct 377 ms 28864 KB Output is correct
128 Correct 379 ms 28864 KB Output is correct
129 Correct 371 ms 28400 KB Output is correct
130 Correct 359 ms 28352 KB Output is correct
131 Correct 360 ms 28348 KB Output is correct
132 Correct 357 ms 28460 KB Output is correct
133 Correct 370 ms 28232 KB Output is correct
134 Correct 359 ms 28360 KB Output is correct
135 Correct 349 ms 28272 KB Output is correct
136 Correct 356 ms 28444 KB Output is correct
137 Correct 376 ms 28340 KB Output is correct
138 Correct 358 ms 28288 KB Output is correct
139 Correct 386 ms 28284 KB Output is correct
140 Correct 361 ms 28336 KB Output is correct
141 Correct 367 ms 28340 KB Output is correct
142 Correct 369 ms 31912 KB Output is correct
143 Correct 365 ms 31936 KB Output is correct
144 Correct 370 ms 31928 KB Output is correct
145 Correct 354 ms 31808 KB Output is correct
146 Correct 356 ms 31768 KB Output is correct
147 Correct 351 ms 31796 KB Output is correct
148 Correct 350 ms 31796 KB Output is correct
149 Correct 391 ms 31804 KB Output is correct
150 Correct 362 ms 31784 KB Output is correct
151 Correct 342 ms 31692 KB Output is correct
152 Correct 272 ms 26224 KB Output is correct
153 Correct 354 ms 31876 KB Output is correct
154 Correct 371 ms 31800 KB Output is correct
155 Correct 385 ms 31876 KB Output is correct
156 Correct 366 ms 31760 KB Output is correct
157 Correct 357 ms 31812 KB Output is correct
158 Correct 364 ms 31816 KB Output is correct
159 Correct 349 ms 31784 KB Output is correct
160 Correct 271 ms 26288 KB Output is correct
161 Correct 508 ms 31220 KB Output is correct
162 Correct 538 ms 31016 KB Output is correct
163 Correct 472 ms 31120 KB Output is correct
164 Correct 483 ms 31040 KB Output is correct
165 Correct 481 ms 31008 KB Output is correct
166 Correct 272 ms 28332 KB Output is correct
167 Correct 312 ms 30980 KB Output is correct
168 Correct 322 ms 30912 KB Output is correct
169 Correct 306 ms 30704 KB Output is correct
170 Correct 306 ms 30632 KB Output is correct
171 Correct 326 ms 30420 KB Output is correct
172 Correct 319 ms 31044 KB Output is correct
173 Correct 491 ms 29168 KB Output is correct
174 Correct 511 ms 28992 KB Output is correct
175 Correct 494 ms 28988 KB Output is correct
176 Correct 449 ms 28616 KB Output is correct