oj.uz

Submission #1003273

# Submission time Handle Problem Language Result Execution time Memory
1003273 2024-06-20T08:24:53 Z 12345678 Event Hopping 2 (JOI21_event2) C++17
7 / 100
 47 ms 12496 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, kx=17, inf=2e9;

int n, k, a[nx], b[nx], pa[nx][kx], mx, vl;

struct range
{
    int l, r;
    range(int l, int r): l(l), r(r){}
    bool operator< (const range &o) const
    {
        if (r==o.r) return l<o.l;
        return r<o.r;
    }
};
vector<range> v, cur;

int query(int u, int limit)
{
    int res=0;
    if (limit==inf) limit--;
    for (int i=kx-1; i>=0; i--) if (v[pa[u][i]].r<=limit) res+=(1<<i), u=pa[u][i];
    return res;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    v.push_back(range(0, 0));
    for (int i=1; i<=n; i++) cin>>a[i]>>b[i], v.push_back(range(a[i], b[i])), pa[i][0]=n+1;
    v.push_back(range({inf, inf}));
    sort(v.begin(), v.end());
    int lst=0;
    for (int i=1; i<=n+1; i++)
    {
        mx=max(mx, v[i].l);
        while (lst<=n+1&&v[lst].r<=mx) pa[lst++][0]=i;
    }
    for (int i=1; i<kx; i++) for (int j=0; j<=n+1; j++) pa[j][i]=pa[pa[j][i-1]][i-1];
    /*
    for (int i=0; i<=n+1; i++)
    {
        cout<<"debug "<<i<<' '<<v[i].l<<' '<<v[i].r<<':';
        for (int j=0; j<=2; j++) cout<<pa[i][j]<<' ';
        cout<<'\n';
    }
    */
    vl=query(0, inf);
    if (vl<k) return cout<<-1, 0;
    cur.push_back(range(0, 0));
    for (int i=1; i<=n; i++)
    {
        if (!k) continue;
        auto itr=upper_bound(cur.begin(), cur.end(), range(a[i], b[i]));
        if (itr!=cur.end()&&itr->l<b[i]) continue;
        if (prev(itr)->r>a[i]) continue;
        int tmp=vl, pidx=lower_bound(v.begin(), v.end(), *prev(itr))-v.begin(), cidx=lower_bound(v.begin(), v.end(), range(a[i], b[i]))-v.begin();
        tmp-=query(pidx, (itr==cur.end())?inf:itr->l);
        tmp+=query(pidx, a[i]);
        tmp+=query(cidx, (itr==cur.end())?inf:itr->l);
        //cout<<"vl "<<i<<' '<<tmp<<'\n';
        if (tmp>=k-1)
        {
            k--;
            cur.push_back(range(a[i], b[i]));
            vl=tmp;
            cout<<i<<'\n';
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 46 ms 12316 KB Output is correct
5 Correct 47 ms 12376 KB Output is correct
6 Correct 43 ms 12300 KB Output is correct
7 Correct 46 ms 12324 KB Output is correct
8 Correct 44 ms 12492 KB Output is correct
9 Correct 43 ms 12496 KB Output is correct
10 Correct 42 ms 12492 KB Output is correct
11 Correct 39 ms 12488 KB Output is correct
12 Correct 34 ms 11728 KB Output is correct
13 Correct 34 ms 11724 KB Output is correct
14 Correct 35 ms 11724 KB Output is correct
15 Correct 33 ms 11728 KB Output is correct
16 Correct 25 ms 10792 KB Output is correct
17 Correct 27 ms 10844 KB Output is correct
18 Correct 26 ms 10768 KB Output is correct
19 Correct 24 ms 10712 KB Output is correct
20 Correct 25 ms 10712 KB Output is correct
21 Correct 24 ms 10712 KB Output is correct
22 Correct 24 ms 10568 KB Output is correct
23 Correct 21 ms 10712 KB Output is correct
24 Correct 23 ms 10528 KB Output is correct
25 Correct 24 ms 10712 KB Output is correct
26 Correct 23 ms 10564 KB Output is correct
27 Correct 22 ms 10656 KB Output is correct
28 Correct 18 ms 10708 KB Output is correct
29 Correct 18 ms 10700 KB Output is correct
30 Correct 22 ms 10704 KB Output is correct
31 Correct 19 ms 10712 KB Output is correct
32 Correct 20 ms 10604 KB Output is correct
33 Correct 21 ms 10764 KB Output is correct
34 Correct 29 ms 11460 KB Output is correct
35 Correct 27 ms 10960 KB Output is correct
36 Correct 21 ms 10712 KB Output is correct
37 Correct 32 ms 11724 KB Output is correct
38 Correct 30 ms 11556 KB Output is correct
39 Correct 33 ms 11728 KB Output is correct
40 Correct 32 ms 11524 KB Output is correct
41 Correct 35 ms 11616 KB Output is correct
42 Correct 23 ms 10708 KB Output is correct
43 Correct 32 ms 11736 KB Output is correct
44 Correct 38 ms 11728 KB Output is correct
45 Correct 32 ms 11728 KB Output is correct
46 Correct 35 ms 11700 KB Output is correct

Subtask #2
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 46 ms 12316 KB Output is correct
5 Correct 47 ms 12376 KB Output is correct
6 Correct 43 ms 12300 KB Output is correct
7 Correct 46 ms 12324 KB Output is correct
8 Correct 44 ms 12492 KB Output is correct
9 Correct 43 ms 12496 KB Output is correct
10 Correct 42 ms 12492 KB Output is correct
11 Correct 39 ms 12488 KB Output is correct
12 Correct 34 ms 11728 KB Output is correct
13 Correct 34 ms 11724 KB Output is correct
14 Correct 35 ms 11724 KB Output is correct
15 Correct 33 ms 11728 KB Output is correct
16 Correct 25 ms 10792 KB Output is correct
17 Correct 27 ms 10844 KB Output is correct
18 Correct 26 ms 10768 KB Output is correct
19 Correct 24 ms 10712 KB Output is correct
20 Correct 25 ms 10712 KB Output is correct
21 Correct 24 ms 10712 KB Output is correct
22 Correct 24 ms 10568 KB Output is correct
23 Correct 21 ms 10712 KB Output is correct
24 Correct 23 ms 10528 KB Output is correct
25 Correct 24 ms 10712 KB Output is correct
26 Correct 23 ms 10564 KB Output is correct
27 Correct 22 ms 10656 KB Output is correct
28 Correct 18 ms 10708 KB Output is correct
29 Correct 18 ms 10700 KB Output is correct
30 Correct 22 ms 10704 KB Output is correct
31 Correct 19 ms 10712 KB Output is correct
32 Correct 20 ms 10604 KB Output is correct
33 Correct 21 ms 10764 KB Output is correct
34 Correct 29 ms 11460 KB Output is correct
35 Correct 27 ms 10960 KB Output is correct
36 Correct 21 ms 10712 KB Output is correct
37 Correct 32 ms 11724 KB Output is correct
38 Correct 30 ms 11556 KB Output is correct
39 Correct 33 ms 11728 KB Output is correct
40 Correct 32 ms 11524 KB Output is correct
41 Correct 35 ms 11616 KB Output is correct
42 Correct 23 ms 10708 KB Output is correct
43 Correct 32 ms 11736 KB Output is correct
44 Correct 38 ms 11728 KB Output is correct
45 Correct 32 ms 11728 KB Output is correct
46 Correct 35 ms 11700 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Incorrect 0 ms 348 KB Output isn't correct
54 Halted 0 ms 0 KB -