oj.uz

Submission #575275

# Submission time Handle Problem Language Result Execution time Memory
575275 2022-06-10T05:26:02 Z balbit Event Hopping 2 (JOI21_event2) C++14
100 / 100
 430 ms 76804 KB 
#include <bits/stdc++.h>
using namespace std;
//#undef BALBIT
#define ll long long
#define pii pair<int, int>
#define f first
#define s second

#define REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define FOR(i,a,b) for (int i = a; i<b; ++i)

#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)
#define pb push_back
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)

#endif // BALBIT

const int maxn = 2e5+5;


pii v[maxn];

struct seg{
    int l, r, cnt;
    bool operator > (seg o)  { // bigger is better
        return cnt != o.cnt? cnt > o.cnt : l > o.l;
    }
};

vector<int> here[maxn];
vector<seg> S[maxn*4];
vector<seg> S2[maxn*4];


pair<int, int> dp[maxn];

void build(int o = 1, int l = 0, int r = maxn-1) {
    if (l == r) {
        sort(ALL(here[l]));
        if (SZ(here[l])) {
            S[o].pb({here[l].back(), l, 1});
            S2[o].pb({l,l,0});
        }else{
            S[o].pb({l, l, 0}); // not entirely sure
        }
        return;
    }
    int mid = (l+r)/2;
    build(o*2,l,mid); build(o*2+1, mid+1, r);

    int big = 0;

    FOR(i,l,r+1) {
        dp[i] = {0, l};
        if (i > l) MX(dp[i], dp[i-1]);
        for (int lp : here[i]) {
            if (lp < l) {
                MX(dp[i], make_pair(1,lp));
            }else{
                pii go = dp[lp]; ++go.f;
                MX(dp[i], go);
            }
        }
        MX(big, dp[i].f);
    }

    FOR(i,l,r+1) {
        if (dp[i].f == big) {
            if (SZ(S[o]) == 0 || dp[i].s > S[o].back().l) {
                S[o].pb({dp[i].s, i, big});
            }
        }else if (dp[i].f == big-1) {
            if (SZ(S2[o]) == 0 || dp[i].s > S2[o].back().l) {
                S2[o].pb({dp[i].s, i, big-1});
            }
        }
    }

//    if (SZ(S[o]) > 1) {
//        bug(o, l,r);
//        for (auto c : S[o]) {
//            bug(c.l, c.r, c.cnt);
//        }
//    }
}

seg now = {maxn+1, maxn+1, 0};

void QU(int L, int R, int o=1, int l=0, int r = maxn-1) {
    if (l > R || r < L) return;
    if (l >= L && r <= R) {
        bug(l,r,SZ(S[o]));
        bug(S[o][0].r);
        bug(now.l, now.cnt);
        // important!
        int x = now.l;
        if (x < S[o][0].r) {
            // two choices
            bug("up");
            seg oldnow = now;
            seg now1 = S[o].back(); now1.cnt += now.cnt-1;

            if (now1 > now) now = now1;
            if (SZ(S2[o]) && x >= S2[o][0].r) {
                int bl = 0, br = SZ(S2[o]);
                while (bl != br) {
                    int bmd = (bl + br) / 2;
                    if (S2[o][bmd].r <= x) {
                        // ok!
                        bl = bmd + 1;
                    }else{
                        br = bmd;
                    }
                }
                --bl;
                seg now1 = S2[o][bl]; now1.cnt += oldnow.cnt;
                if (now1 > now) now = now1;
            }
        }else{
            int bl = 0, br = SZ(S[o]);
            while (bl != br) {
                int bmd = (bl + br) / 2;
                if (S[o][bmd].r <= x) {
                    // ok!
                    bl = bmd + 1;
                }else{
                    br = bmd;
                }
            }
            --bl;
            seg now1 = S[o][bl]; now1.cnt += now.cnt;
            if (now1 > now) now = now1;
        }
        bug(now.l, now.cnt);
        return;
    }
    int mid = (l+r)/2;
    QU(L,R,o*2+1,mid+1,r);
    QU(L,R,o*2,l,mid);
}

int yom(int l, int r) {
    now = {maxn+1, maxn+1, 0};
    QU(l,r);
    if (l == 3 && r == 6) {
        bug(now.l, now.cnt);
    }
    if (now.l < l-1) return now.cnt-1;
    return now.cnt;
}

int curcnt = 0;

set<pii> st;

int tryrem(int x) {
    auto it = st.lower_bound(v[x]);
    if (it != st.end() && v[x].s > it->f) return -maxn;
    if (it != st.begin() && v[x].f < prev(it)->s) {
        return -maxn;
    }
    int rngL = it==st.begin()?0 : (prev(it) -> s + 1);
    int rngR = it==st.end()  ?maxn-1 : it -> f;
    bug(v[x].f, v[x].s, rngL, rngR);
    int yoink =  curcnt - yom(rngL, rngR) + yom(rngL, v[x].f) + yom(v[x].s+1, rngR);
    bug(yom(rngL, rngR));
    bug(yom(rngL, v[x].f));
    bug(yom(v[x].s+1, rngR));
    return yoink;
}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);

    bug(1,2);

    int n,k; cin>>n>>k;

    vector<int> xpos;

    REP(i,n) {
        cin>>v[i].f>>v[i].s;
        xpos.pb(v[i].f); xpos.pb(v[i].s);
    }
    sort(ALL(xpos));
    xpos.resize(unique(ALL(xpos)) - xpos.begin());

    REP(i, n) {
        pii &p = v[i];
        p.f = lower_bound(ALL(xpos), p.f) - xpos.begin();
        p.s = lower_bound(ALL(xpos), p.s) - xpos.begin();
        bug(p.f, p.s);
        here[p.s].pb(p.f);
    }
    build();
    curcnt = S[1][0].cnt;

//    bug(yom(3,6));



    #ifdef BALBIT
    for (int i = 0; i<SZ(xpos); ++i) {
        for (int j = i; j<SZ(xpos); ++j) {
            bug(i,j,yom(i,j));
        }
    }
    #endif

//    k = max(0, curcnt - 0);
    bug(k);

    bug(curcnt);
    if (curcnt < k) {
        cout<<-1<<endl; return 0;
    }

    vector<int> took;
    for (int i = 0; i<n; ++i) {
        int tr = tryrem(i);
        bug(i, tr);
        if (tr + 1 + SZ(took) >= k) {
            // ok!
            took.pb(i);
            bug(i);
            curcnt = tr;
            st.insert(v[i]);
        }else{

        }
    }

    if (k <= SZ(took)) {
        REP(i,k) cout<<took[i]+1<<endl;
    }else{
        cout<<-1<<endl;
    }


}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 56652 KB Output is correct
2 Correct 76 ms 56632 KB Output is correct
3 Correct 74 ms 56744 KB Output is correct
4 Correct 316 ms 74696 KB Output is correct
5 Correct 310 ms 74712 KB Output is correct
6 Correct 315 ms 74776 KB Output is correct
7 Correct 286 ms 74536 KB Output is correct
8 Correct 316 ms 74832 KB Output is correct
9 Correct 303 ms 74872 KB Output is correct
10 Correct 308 ms 74968 KB Output is correct
11 Correct 287 ms 74924 KB Output is correct
12 Correct 263 ms 71968 KB Output is correct
13 Correct 263 ms 73628 KB Output is correct
14 Correct 261 ms 73668 KB Output is correct
15 Correct 259 ms 73800 KB Output is correct
16 Correct 198 ms 71292 KB Output is correct
17 Correct 199 ms 71240 KB Output is correct
18 Correct 194 ms 71188 KB Output is correct
19 Correct 174 ms 70604 KB Output is correct
20 Correct 172 ms 70612 KB Output is correct
21 Correct 177 ms 70712 KB Output is correct
22 Correct 180 ms 70216 KB Output is correct
23 Correct 177 ms 70192 KB Output is correct
24 Correct 182 ms 70180 KB Output is correct
25 Correct 177 ms 69864 KB Output is correct
26 Correct 172 ms 69796 KB Output is correct
27 Correct 172 ms 69792 KB Output is correct
28 Correct 150 ms 71488 KB Output is correct
29 Correct 153 ms 70412 KB Output is correct
30 Correct 165 ms 70556 KB Output is correct
31 Correct 167 ms 70488 KB Output is correct
32 Correct 174 ms 70140 KB Output is correct
33 Correct 170 ms 69772 KB Output is correct
34 Correct 246 ms 73560 KB Output is correct
35 Correct 230 ms 73436 KB Output is correct
36 Correct 215 ms 73448 KB Output is correct
37 Correct 236 ms 72820 KB Output is correct
38 Correct 233 ms 72880 KB Output is correct
39 Correct 233 ms 72864 KB Output is correct
40 Correct 241 ms 73028 KB Output is correct
41 Correct 223 ms 72840 KB Output is correct
42 Correct 152 ms 70008 KB Output is correct
43 Correct 253 ms 72908 KB Output is correct
44 Correct 239 ms 72648 KB Output is correct
45 Correct 234 ms 72548 KB Output is correct
46 Correct 242 ms 72480 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 56660 KB Output is correct
2 Correct 72 ms 56568 KB Output is correct
3 Correct 71 ms 56664 KB Output is correct
4 Correct 69 ms 56652 KB Output is correct
5 Correct 74 ms 56648 KB Output is correct
6 Correct 73 ms 56652 KB Output is correct
7 Correct 69 ms 56572 KB Output is correct
8 Correct 69 ms 56624 KB Output is correct
9 Correct 70 ms 56560 KB Output is correct
10 Correct 71 ms 56608 KB Output is correct
11 Correct 70 ms 56652 KB Output is correct
12 Correct 73 ms 56656 KB Output is correct
13 Correct 69 ms 56612 KB Output is correct
14 Correct 70 ms 56580 KB Output is correct
15 Correct 71 ms 56576 KB Output is correct
16 Correct 72 ms 56652 KB Output is correct
17 Correct 72 ms 56648 KB Output is correct
18 Correct 71 ms 56696 KB Output is correct
19 Correct 69 ms 56568 KB Output is correct
20 Correct 69 ms 56652 KB Output is correct
21 Correct 75 ms 56668 KB Output is correct
22 Correct 71 ms 56676 KB Output is correct
23 Correct 72 ms 56592 KB Output is correct
24 Correct 70 ms 56676 KB Output is correct
25 Correct 78 ms 56652 KB Output is correct
26 Correct 70 ms 56592 KB Output is correct
27 Correct 69 ms 56656 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 56660 KB Output is correct
2 Correct 72 ms 56568 KB Output is correct
3 Correct 71 ms 56664 KB Output is correct
4 Correct 69 ms 56652 KB Output is correct
5 Correct 74 ms 56648 KB Output is correct
6 Correct 73 ms 56652 KB Output is correct
7 Correct 69 ms 56572 KB Output is correct
8 Correct 69 ms 56624 KB Output is correct
9 Correct 70 ms 56560 KB Output is correct
10 Correct 71 ms 56608 KB Output is correct
11 Correct 70 ms 56652 KB Output is correct
12 Correct 73 ms 56656 KB Output is correct
13 Correct 69 ms 56612 KB Output is correct
14 Correct 70 ms 56580 KB Output is correct
15 Correct 71 ms 56576 KB Output is correct
16 Correct 72 ms 56652 KB Output is correct
17 Correct 72 ms 56648 KB Output is correct
18 Correct 71 ms 56696 KB Output is correct
19 Correct 69 ms 56568 KB Output is correct
20 Correct 69 ms 56652 KB Output is correct
21 Correct 75 ms 56668 KB Output is correct
22 Correct 71 ms 56676 KB Output is correct
23 Correct 72 ms 56592 KB Output is correct
24 Correct 70 ms 56676 KB Output is correct
25 Correct 78 ms 56652 KB Output is correct
26 Correct 70 ms 56592 KB Output is correct
27 Correct 69 ms 56656 KB Output is correct
28 Correct 76 ms 56908 KB Output is correct
29 Correct 75 ms 56916 KB Output is correct
30 Correct 75 ms 56984 KB Output is correct
31 Correct 74 ms 56908 KB Output is correct
32 Correct 73 ms 56908 KB Output is correct
33 Correct 76 ms 56964 KB Output is correct
34 Correct 77 ms 56912 KB Output is correct
35 Correct 78 ms 57212 KB Output is correct
36 Correct 78 ms 57164 KB Output is correct
37 Correct 80 ms 57080 KB Output is correct
38 Correct 74 ms 56952 KB Output is correct
39 Correct 78 ms 57164 KB Output is correct
40 Correct 79 ms 57156 KB Output is correct
41 Correct 77 ms 57120 KB Output is correct
42 Correct 74 ms 56940 KB Output is correct
43 Correct 75 ms 57076 KB Output is correct
44 Correct 75 ms 57036 KB Output is correct
45 Correct 78 ms 57068 KB Output is correct
46 Correct 74 ms 57164 KB Output is correct
47 Correct 75 ms 57020 KB Output is correct
48 Correct 73 ms 56924 KB Output is correct
49 Correct 72 ms 57036 KB Output is correct
50 Correct 72 ms 57036 KB Output is correct
51 Correct 80 ms 56940 KB Output is correct
52 Correct 74 ms 57004 KB Output is correct
53 Correct 74 ms 56908 KB Output is correct
54 Correct 73 ms 56968 KB Output is correct
55 Correct 79 ms 57124 KB Output is correct
56 Correct 79 ms 57160 KB Output is correct
57 Correct 78 ms 57216 KB Output is correct
58 Correct 80 ms 57060 KB Output is correct
59 Correct 78 ms 57072 KB Output is correct
60 Correct 77 ms 57132 KB Output is correct
61 Correct 79 ms 57140 KB Output is correct
62 Correct 88 ms 57152 KB Output is correct
63 Correct 80 ms 57076 KB Output is correct
64 Correct 74 ms 56992 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 56652 KB Output is correct
2 Correct 76 ms 56632 KB Output is correct
3 Correct 74 ms 56744 KB Output is correct
4 Correct 316 ms 74696 KB Output is correct
5 Correct 310 ms 74712 KB Output is correct
6 Correct 315 ms 74776 KB Output is correct
7 Correct 286 ms 74536 KB Output is correct
8 Correct 316 ms 74832 KB Output is correct
9 Correct 303 ms 74872 KB Output is correct
10 Correct 308 ms 74968 KB Output is correct
11 Correct 287 ms 74924 KB Output is correct
12 Correct 263 ms 71968 KB Output is correct
13 Correct 263 ms 73628 KB Output is correct
14 Correct 261 ms 73668 KB Output is correct
15 Correct 259 ms 73800 KB Output is correct
16 Correct 198 ms 71292 KB Output is correct
17 Correct 199 ms 71240 KB Output is correct
18 Correct 194 ms 71188 KB Output is correct
19 Correct 174 ms 70604 KB Output is correct
20 Correct 172 ms 70612 KB Output is correct
21 Correct 177 ms 70712 KB Output is correct
22 Correct 180 ms 70216 KB Output is correct
23 Correct 177 ms 70192 KB Output is correct
24 Correct 182 ms 70180 KB Output is correct
25 Correct 177 ms 69864 KB Output is correct
26 Correct 172 ms 69796 KB Output is correct
27 Correct 172 ms 69792 KB Output is correct
28 Correct 150 ms 71488 KB Output is correct
29 Correct 153 ms 70412 KB Output is correct
30 Correct 165 ms 70556 KB Output is correct
31 Correct 167 ms 70488 KB Output is correct
32 Correct 174 ms 70140 KB Output is correct
33 Correct 170 ms 69772 KB Output is correct
34 Correct 246 ms 73560 KB Output is correct
35 Correct 230 ms 73436 KB Output is correct
36 Correct 215 ms 73448 KB Output is correct
37 Correct 236 ms 72820 KB Output is correct
38 Correct 233 ms 72880 KB Output is correct
39 Correct 233 ms 72864 KB Output is correct
40 Correct 241 ms 73028 KB Output is correct
41 Correct 223 ms 72840 KB Output is correct
42 Correct 152 ms 70008 KB Output is correct
43 Correct 253 ms 72908 KB Output is correct
44 Correct 239 ms 72648 KB Output is correct
45 Correct 234 ms 72548 KB Output is correct
46 Correct 242 ms 72480 KB Output is correct
47 Correct 68 ms 56660 KB Output is correct
48 Correct 72 ms 56568 KB Output is correct
49 Correct 71 ms 56664 KB Output is correct
50 Correct 69 ms 56652 KB Output is correct
51 Correct 74 ms 56648 KB Output is correct
52 Correct 73 ms 56652 KB Output is correct
53 Correct 69 ms 56572 KB Output is correct
54 Correct 69 ms 56624 KB Output is correct
55 Correct 70 ms 56560 KB Output is correct
56 Correct 71 ms 56608 KB Output is correct
57 Correct 70 ms 56652 KB Output is correct
58 Correct 73 ms 56656 KB Output is correct
59 Correct 69 ms 56612 KB Output is correct
60 Correct 70 ms 56580 KB Output is correct
61 Correct 71 ms 56576 KB Output is correct
62 Correct 72 ms 56652 KB Output is correct
63 Correct 72 ms 56648 KB Output is correct
64 Correct 71 ms 56696 KB Output is correct
65 Correct 69 ms 56568 KB Output is correct
66 Correct 69 ms 56652 KB Output is correct
67 Correct 75 ms 56668 KB Output is correct
68 Correct 71 ms 56676 KB Output is correct
69 Correct 72 ms 56592 KB Output is correct
70 Correct 70 ms 56676 KB Output is correct
71 Correct 78 ms 56652 KB Output is correct
72 Correct 70 ms 56592 KB Output is correct
73 Correct 69 ms 56656 KB Output is correct
74 Correct 76 ms 56908 KB Output is correct
75 Correct 75 ms 56916 KB Output is correct
76 Correct 75 ms 56984 KB Output is correct
77 Correct 74 ms 56908 KB Output is correct
78 Correct 73 ms 56908 KB Output is correct
79 Correct 76 ms 56964 KB Output is correct
80 Correct 77 ms 56912 KB Output is correct
81 Correct 78 ms 57212 KB Output is correct
82 Correct 78 ms 57164 KB Output is correct
83 Correct 80 ms 57080 KB Output is correct
84 Correct 74 ms 56952 KB Output is correct
85 Correct 78 ms 57164 KB Output is correct
86 Correct 79 ms 57156 KB Output is correct
87 Correct 77 ms 57120 KB Output is correct
88 Correct 74 ms 56940 KB Output is correct
89 Correct 75 ms 57076 KB Output is correct
90 Correct 75 ms 57036 KB Output is correct
91 Correct 78 ms 57068 KB Output is correct
92 Correct 74 ms 57164 KB Output is correct
93 Correct 75 ms 57020 KB Output is correct
94 Correct 73 ms 56924 KB Output is correct
95 Correct 72 ms 57036 KB Output is correct
96 Correct 72 ms 57036 KB Output is correct
97 Correct 80 ms 56940 KB Output is correct
98 Correct 74 ms 57004 KB Output is correct
99 Correct 74 ms 56908 KB Output is correct
100 Correct 73 ms 56968 KB Output is correct
101 Correct 79 ms 57124 KB Output is correct
102 Correct 79 ms 57160 KB Output is correct
103 Correct 78 ms 57216 KB Output is correct
104 Correct 80 ms 57060 KB Output is correct
105 Correct 78 ms 57072 KB Output is correct
106 Correct 77 ms 57132 KB Output is correct
107 Correct 79 ms 57140 KB Output is correct
108 Correct 88 ms 57152 KB Output is correct
109 Correct 80 ms 57076 KB Output is correct
110 Correct 74 ms 56992 KB Output is correct
111 Correct 190 ms 69188 KB Output is correct
112 Correct 203 ms 69240 KB Output is correct
113 Correct 201 ms 69192 KB Output is correct
114 Correct 187 ms 69236 KB Output is correct
115 Correct 186 ms 69268 KB Output is correct
116 Correct 184 ms 69124 KB Output is correct
117 Correct 185 ms 69136 KB Output is correct
118 Correct 419 ms 76804 KB Output is correct
119 Correct 430 ms 76628 KB Output is correct
120 Correct 347 ms 73688 KB Output is correct
121 Correct 201 ms 70504 KB Output is correct
122 Correct 366 ms 73816 KB Output is correct
123 Correct 356 ms 73512 KB Output is correct
124 Correct 352 ms 73572 KB Output is correct
125 Correct 202 ms 70396 KB Output is correct
126 Correct 275 ms 71316 KB Output is correct
127 Correct 257 ms 71300 KB Output is correct
128 Correct 243 ms 71104 KB Output is correct
129 Correct 197 ms 70512 KB Output is correct
130 Correct 256 ms 70656 KB Output is correct
131 Correct 229 ms 70616 KB Output is correct
132 Correct 214 ms 70644 KB Output is correct
133 Correct 219 ms 70516 KB Output is correct
134 Correct 232 ms 70216 KB Output is correct
135 Correct 222 ms 70124 KB Output is correct
136 Correct 212 ms 70288 KB Output is correct
137 Correct 196 ms 70212 KB Output is correct
138 Correct 212 ms 69792 KB Output is correct
139 Correct 212 ms 69872 KB Output is correct
140 Correct 200 ms 69824 KB Output is correct
141 Correct 195 ms 69872 KB Output is correct
142 Correct 339 ms 75168 KB Output is correct
143 Correct 318 ms 75184 KB Output is correct
144 Correct 320 ms 75340 KB Output is correct
145 Correct 312 ms 75152 KB Output is correct
146 Correct 313 ms 75168 KB Output is correct
147 Correct 305 ms 75096 KB Output is correct
148 Correct 315 ms 75064 KB Output is correct
149 Correct 303 ms 75124 KB Output is correct
150 Correct 315 ms 75240 KB Output is correct
151 Correct 349 ms 74992 KB Output is correct
152 Correct 141 ms 69484 KB Output is correct
153 Correct 315 ms 75240 KB Output is correct
154 Correct 314 ms 75188 KB Output is correct
155 Correct 306 ms 75192 KB Output is correct
156 Correct 307 ms 75168 KB Output is correct
157 Correct 301 ms 75112 KB Output is correct
158 Correct 305 ms 75108 KB Output is correct
159 Correct 293 ms 75052 KB Output is correct
160 Correct 142 ms 69624 KB Output is correct
161 Correct 305 ms 72316 KB Output is correct
162 Correct 322 ms 72360 KB Output is correct
163 Correct 305 ms 72332 KB Output is correct
164 Correct 294 ms 72260 KB Output is correct
165 Correct 311 ms 72352 KB Output is correct
166 Correct 157 ms 70008 KB Output is correct
167 Correct 247 ms 72852 KB Output is correct
168 Correct 242 ms 72648 KB Output is correct
169 Correct 246 ms 72520 KB Output is correct
170 Correct 235 ms 72600 KB Output is correct
171 Correct 234 ms 72236 KB Output is correct
172 Correct 241 ms 72960 KB Output is correct
173 Correct 317 ms 71312 KB Output is correct
174 Correct 320 ms 71344 KB Output is correct
175 Correct 317 ms 71256 KB Output is correct
176 Correct 277 ms 70820 KB Output is correct