답안 #386558

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
386558	2021-04-06T19:35:20 Z	PurpleCrayon	Event Hopping 2 (JOI21_event2)	C++17	100 / 100	654 ms	143284 KB

event2

#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) int(v.size())
typedef long long ll;
const int MAXN = 1e5+10, INF = 1e9+10, MAXL = 20;


struct T {
    int tl, tr;
    T *l=nullptr, *r=nullptr;
    int mx = -1;

    T(int _tl, int _tr): tl(_tl), tr(_tr) {}
    void extend(){
        if (l||r||tl==tr) return;
        int tm=(tl+tr)/2;
        l = new T(tl, tm), r = new T(tm+1, tr);
    }
    void upd(int pos, int nv) {
        if (pos < tl || pos > tr) return;
        if (tl == tr){ mx = max(mx, nv); return; }
        extend();
        l->upd(pos, nv), r->upd(pos, nv);
        mx = max(l->mx, r->mx);
    }
    int qry(int ql, int qr){
        if (qr < tl || ql > tr) return -1;
        if (ql <= tl && tr <= qr) return mx;
        extend();
        return max(l->qry(ql, qr), r->qry(ql, qr));
    }
} *t;


int n, k, bst[MAXN], p[MAXN], anc[MAXN][MAXL];
ar<int, 3> a[MAXN], b[MAXN];

bool it(int w, int x, int y, int z){ return !(z <= w || y >= x); }
int solve(vector<ar<int, 3>> v) { //run greedy
    int c=-1, ans=0;
    for (auto& r : v)
        if (r[0] >= c)
            ans++, c = r[1];
    return ans;
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        ar<int, 3> _a; cin >> _a[0] >> _a[1], _a[2] = i;
        a[i] = _a;
        b[i] = _a;
    }

    sort(a, a+n, [&](auto i, auto j){ return i[1] < j[1]; });
    {
        vector<ar<int, 3>> v;
        for (int i = 0; i < n; i++) v.push_back(a[i]);
        if (solve(v) < k){
            cout << -1 << '\n';
            return 0;
        }
    }


    memset(p, -1, sizeof(p));
    sort(a, a+n);
    iota(bst, bst+n, 0);

    for (int i = n-1; i >= 0; i--){
        int j = lower_bound(a, a+n, ar<int, 3>{a[i][1], -1, -1}) - a;
        if (j < n) p[a[i][2]] = a[bst[j]][2];
        if (i < n-1 && a[bst[i+1]][1] < a[i][1])
            bst[i] = bst[i+1];
    }

    for (int i = 0; i < n; i++) {
        anc[i][0] = p[i];
    }

    for (int j = 1; j < MAXL; j++) for (int i = 0; i < n; i++)
        anc[i][j] = (anc[i][j-1] == -1 ? -1 : anc[anc[i][j-1]][j-1]);

    auto qry = [&](int l, int r) -> int {
        //return the answer using only coords l <= i <= r
        
        int c = lower_bound(a, a+n, ar<int, 3>{l, -1, -1}) - a;
        if (c >= n) return 0;

        c = a[bst[c]][2];

        int ans=1;
        auto good = [&](int i) -> bool {
            return l <= b[i][0] && b[i][1] <= r;
        };
        if (!good(c)) return 0;

        for (int j = MAXL-1; j >= 0; j--) {
            if (anc[c][j] != -1 && good(anc[c][j]))
                ans += 1<<j, c = anc[c][j];
        }
        return ans;
    };

    set<int> loc{0, INF};

    int loss = qry(0, INF)-k;

    t = new T(0, INF+1);
    vector<int> ans;
    for (int i = 0; i < n; i++) {
        if (sz(ans) >= k) break;

        int cl = b[i][0], cr = b[i][1];
        bool bad=*loc.upper_bound(cl) < cr || t->qry(0, cl) >= cr;
        if (bad) continue;


        int pl = *prev(loc.upper_bound(cl)), pr = *loc.lower_bound(cr);
        int pans = qry(pl, pr);
        int cans = 1+qry(pl, cl)+qry(cr, pr);
        assert(cans <= pans);
        
        if (cans >= pans-loss){
            ans.push_back(i);
            loc.insert(cl), loc.insert(cr);
            loss -= pans-cans;

            t->upd(cl, cr);
        }
    }

    assert(sz(ans) == k);
    for (int i : ans)
        cout << i+1 << '\n';
}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	748 KB	Output is correct
2	Correct	1 ms	748 KB	Output is correct
3	Correct	1 ms	748 KB	Output is correct
4	Correct	373 ms	141748 KB	Output is correct
5	Correct	357 ms	135220 KB	Output is correct
6	Correct	339 ms	128564 KB	Output is correct
7	Correct	307 ms	115508 KB	Output is correct
8	Correct	372 ms	141748 KB	Output is correct
9	Correct	359 ms	135220 KB	Output is correct
10	Correct	349 ms	128692 KB	Output is correct
11	Correct	307 ms	115764 KB	Output is correct
12	Correct	273 ms	101672 KB	Output is correct
13	Correct	265 ms	97332 KB	Output is correct
14	Correct	255 ms	92980 KB	Output is correct
15	Correct	243 ms	83892 KB	Output is correct
16	Correct	126 ms	43060 KB	Output is correct
17	Correct	125 ms	42036 KB	Output is correct
18	Correct	116 ms	38836 KB	Output is correct
19	Correct	79 ms	19380 KB	Output is correct
20	Correct	81 ms	22836 KB	Output is correct
21	Correct	88 ms	26804 KB	Output is correct
22	Correct	74 ms	13364 KB	Output is correct
23	Correct	76 ms	17264 KB	Output is correct
24	Correct	81 ms	21940 KB	Output is correct
25	Correct	72 ms	12340 KB	Output is correct
26	Correct	77 ms	15796 KB	Output is correct
27	Correct	82 ms	19892 KB	Output is correct
28	Correct	28 ms	5216 KB	Output is correct
29	Correct	28 ms	5216 KB	Output is correct
30	Correct	28 ms	5216 KB	Output is correct
31	Correct	30 ms	5216 KB	Output is correct
32	Correct	31 ms	5344 KB	Output is correct
33	Correct	37 ms	5180 KB	Output is correct
34	Correct	188 ms	65844 KB	Output is correct
35	Correct	141 ms	47540 KB	Output is correct
36	Correct	100 ms	29364 KB	Output is correct
37	Correct	312 ms	138804 KB	Output is correct
38	Correct	300 ms	133712 KB	Output is correct
39	Correct	293 ms	128436 KB	Output is correct
40	Correct	281 ms	123496 KB	Output is correct
41	Correct	280 ms	118324 KB	Output is correct
42	Correct	32 ms	5216 KB	Output is correct
43	Correct	314 ms	137700 KB	Output is correct
44	Correct	312 ms	137268 KB	Output is correct
45	Correct	305 ms	136884 KB	Output is correct
46	Correct	306 ms	136628 KB	Output is correct

Subtask #2
1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	748 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	748 KB	Output is correct
4	Correct	1 ms	748 KB	Output is correct
5	Correct	1 ms	748 KB	Output is correct
6	Correct	2 ms	748 KB	Output is correct
7	Correct	1 ms	748 KB	Output is correct
8	Correct	1 ms	748 KB	Output is correct
9	Correct	1 ms	748 KB	Output is correct
10	Correct	1 ms	748 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	748 KB	Output is correct
13	Correct	1 ms	748 KB	Output is correct
14	Correct	1 ms	748 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	748 KB	Output is correct
17	Correct	1 ms	748 KB	Output is correct
18	Correct	1 ms	748 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	748 KB	Output is correct
22	Correct	1 ms	748 KB	Output is correct
23	Correct	1 ms	748 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	748 KB	Output is correct
27	Correct	1 ms	748 KB	Output is correct

Subtask #3
31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	748 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	748 KB	Output is correct
4	Correct	1 ms	748 KB	Output is correct
5	Correct	1 ms	748 KB	Output is correct
6	Correct	2 ms	748 KB	Output is correct
7	Correct	1 ms	748 KB	Output is correct
8	Correct	1 ms	748 KB	Output is correct
9	Correct	1 ms	748 KB	Output is correct
10	Correct	1 ms	748 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	748 KB	Output is correct
13	Correct	1 ms	748 KB	Output is correct
14	Correct	1 ms	748 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	748 KB	Output is correct
17	Correct	1 ms	748 KB	Output is correct
18	Correct	1 ms	748 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	748 KB	Output is correct
22	Correct	1 ms	748 KB	Output is correct
23	Correct	1 ms	748 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	748 KB	Output is correct
27	Correct	1 ms	748 KB	Output is correct
28	Correct	4 ms	1516 KB	Output is correct
29	Correct	4 ms	1516 KB	Output is correct
30	Correct	4 ms	1516 KB	Output is correct
31	Correct	5 ms	1536 KB	Output is correct
32	Correct	4 ms	1900 KB	Output is correct
33	Correct	2 ms	492 KB	Output is correct
34	Correct	2 ms	492 KB	Output is correct
35	Correct	15 ms	6508 KB	Output is correct
36	Correct	14 ms	5996 KB	Output is correct
37	Correct	11 ms	4844 KB	Output is correct
38	Correct	2 ms	492 KB	Output is correct
39	Correct	14 ms	5868 KB	Output is correct
40	Correct	13 ms	5356 KB	Output is correct
41	Correct	11 ms	4972 KB	Output is correct
42	Correct	2 ms	492 KB	Output is correct
43	Correct	8 ms	3564 KB	Output is correct
44	Correct	7 ms	3180 KB	Output is correct
45	Correct	6 ms	2796 KB	Output is correct
46	Correct	2 ms	492 KB	Output is correct
47	Correct	5 ms	2156 KB	Output is correct
48	Correct	4 ms	1900 KB	Output is correct
49	Correct	4 ms	1644 KB	Output is correct
50	Correct	2 ms	492 KB	Output is correct
51	Correct	5 ms	2284 KB	Output is correct
52	Correct	4 ms	1900 KB	Output is correct
53	Correct	3 ms	1388 KB	Output is correct
54	Correct	2 ms	492 KB	Output is correct
55	Correct	14 ms	6508 KB	Output is correct
56	Correct	14 ms	6508 KB	Output is correct
57	Correct	13 ms	6380 KB	Output is correct
58	Correct	13 ms	6252 KB	Output is correct
59	Correct	13 ms	6252 KB	Output is correct
60	Correct	13 ms	6124 KB	Output is correct
61	Correct	13 ms	5996 KB	Output is correct
62	Correct	12 ms	5868 KB	Output is correct
63	Correct	11 ms	5356 KB	Output is correct
64	Correct	2 ms	492 KB	Output is correct

Subtask #4
61.0 / 61.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	748 KB	Output is correct
2	Correct	1 ms	748 KB	Output is correct
3	Correct	1 ms	748 KB	Output is correct
4	Correct	373 ms	141748 KB	Output is correct
5	Correct	357 ms	135220 KB	Output is correct
6	Correct	339 ms	128564 KB	Output is correct
7	Correct	307 ms	115508 KB	Output is correct
8	Correct	372 ms	141748 KB	Output is correct
9	Correct	359 ms	135220 KB	Output is correct
10	Correct	349 ms	128692 KB	Output is correct
11	Correct	307 ms	115764 KB	Output is correct
12	Correct	273 ms	101672 KB	Output is correct
13	Correct	265 ms	97332 KB	Output is correct
14	Correct	255 ms	92980 KB	Output is correct
15	Correct	243 ms	83892 KB	Output is correct
16	Correct	126 ms	43060 KB	Output is correct
17	Correct	125 ms	42036 KB	Output is correct
18	Correct	116 ms	38836 KB	Output is correct
19	Correct	79 ms	19380 KB	Output is correct
20	Correct	81 ms	22836 KB	Output is correct
21	Correct	88 ms	26804 KB	Output is correct
22	Correct	74 ms	13364 KB	Output is correct
23	Correct	76 ms	17264 KB	Output is correct
24	Correct	81 ms	21940 KB	Output is correct
25	Correct	72 ms	12340 KB	Output is correct
26	Correct	77 ms	15796 KB	Output is correct
27	Correct	82 ms	19892 KB	Output is correct
28	Correct	28 ms	5216 KB	Output is correct
29	Correct	28 ms	5216 KB	Output is correct
30	Correct	28 ms	5216 KB	Output is correct
31	Correct	30 ms	5216 KB	Output is correct
32	Correct	31 ms	5344 KB	Output is correct
33	Correct	37 ms	5180 KB	Output is correct
34	Correct	188 ms	65844 KB	Output is correct
35	Correct	141 ms	47540 KB	Output is correct
36	Correct	100 ms	29364 KB	Output is correct
37	Correct	312 ms	138804 KB	Output is correct
38	Correct	300 ms	133712 KB	Output is correct
39	Correct	293 ms	128436 KB	Output is correct
40	Correct	281 ms	123496 KB	Output is correct
41	Correct	280 ms	118324 KB	Output is correct
42	Correct	32 ms	5216 KB	Output is correct
43	Correct	314 ms	137700 KB	Output is correct
44	Correct	312 ms	137268 KB	Output is correct
45	Correct	305 ms	136884 KB	Output is correct
46	Correct	306 ms	136628 KB	Output is correct
47	Correct	1 ms	748 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	1 ms	748 KB	Output is correct
50	Correct	1 ms	748 KB	Output is correct
51	Correct	1 ms	748 KB	Output is correct
52	Correct	2 ms	748 KB	Output is correct
53	Correct	1 ms	748 KB	Output is correct
54	Correct	1 ms	748 KB	Output is correct
55	Correct	1 ms	748 KB	Output is correct
56	Correct	1 ms	748 KB	Output is correct
57	Correct	1 ms	364 KB	Output is correct
58	Correct	1 ms	748 KB	Output is correct
59	Correct	1 ms	748 KB	Output is correct
60	Correct	1 ms	748 KB	Output is correct
61	Correct	1 ms	364 KB	Output is correct
62	Correct	1 ms	748 KB	Output is correct
63	Correct	1 ms	748 KB	Output is correct
64	Correct	1 ms	748 KB	Output is correct
65	Correct	1 ms	364 KB	Output is correct
66	Correct	1 ms	364 KB	Output is correct
67	Correct	1 ms	748 KB	Output is correct
68	Correct	1 ms	748 KB	Output is correct
69	Correct	1 ms	748 KB	Output is correct
70	Correct	1 ms	364 KB	Output is correct
71	Correct	1 ms	364 KB	Output is correct
72	Correct	1 ms	748 KB	Output is correct
73	Correct	1 ms	748 KB	Output is correct
74	Correct	4 ms	1516 KB	Output is correct
75	Correct	4 ms	1516 KB	Output is correct
76	Correct	4 ms	1516 KB	Output is correct
77	Correct	5 ms	1536 KB	Output is correct
78	Correct	4 ms	1900 KB	Output is correct
79	Correct	2 ms	492 KB	Output is correct
80	Correct	2 ms	492 KB	Output is correct
81	Correct	15 ms	6508 KB	Output is correct
82	Correct	14 ms	5996 KB	Output is correct
83	Correct	11 ms	4844 KB	Output is correct
84	Correct	2 ms	492 KB	Output is correct
85	Correct	14 ms	5868 KB	Output is correct
86	Correct	13 ms	5356 KB	Output is correct
87	Correct	11 ms	4972 KB	Output is correct
88	Correct	2 ms	492 KB	Output is correct
89	Correct	8 ms	3564 KB	Output is correct
90	Correct	7 ms	3180 KB	Output is correct
91	Correct	6 ms	2796 KB	Output is correct
92	Correct	2 ms	492 KB	Output is correct
93	Correct	5 ms	2156 KB	Output is correct
94	Correct	4 ms	1900 KB	Output is correct
95	Correct	4 ms	1644 KB	Output is correct
96	Correct	2 ms	492 KB	Output is correct
97	Correct	5 ms	2284 KB	Output is correct
98	Correct	4 ms	1900 KB	Output is correct
99	Correct	3 ms	1388 KB	Output is correct
100	Correct	2 ms	492 KB	Output is correct
101	Correct	14 ms	6508 KB	Output is correct
102	Correct	14 ms	6508 KB	Output is correct
103	Correct	13 ms	6380 KB	Output is correct
104	Correct	13 ms	6252 KB	Output is correct
105	Correct	13 ms	6252 KB	Output is correct
106	Correct	13 ms	6124 KB	Output is correct
107	Correct	13 ms	5996 KB	Output is correct
108	Correct	12 ms	5868 KB	Output is correct
109	Correct	11 ms	5356 KB	Output is correct
110	Correct	2 ms	492 KB	Output is correct
111	Correct	91 ms	14172 KB	Output is correct
112	Correct	88 ms	14644 KB	Output is correct
113	Correct	88 ms	14940 KB	Output is correct
114	Correct	106 ms	28468 KB	Output is correct
115	Correct	108 ms	31412 KB	Output is correct
116	Correct	35 ms	5216 KB	Output is correct
117	Correct	37 ms	5216 KB	Output is correct
118	Correct	654 ms	141832 KB	Output is correct
119	Correct	605 ms	129588 KB	Output is correct
120	Correct	372 ms	82868 KB	Output is correct
121	Correct	35 ms	5216 KB	Output is correct
122	Correct	471 ms	102660 KB	Output is correct
123	Correct	429 ms	91444 KB	Output is correct
124	Correct	386 ms	82740 KB	Output is correct
125	Correct	35 ms	5216 KB	Output is correct
126	Correct	241 ms	51508 KB	Output is correct
127	Correct	197 ms	42932 KB	Output is correct
128	Correct	172 ms	36660 KB	Output is correct
129	Correct	36 ms	5216 KB	Output is correct
130	Correct	145 ms	35668 KB	Output is correct
131	Correct	128 ms	28340 KB	Output is correct
132	Correct	108 ms	24772 KB	Output is correct
133	Correct	35 ms	5216 KB	Output is correct
134	Correct	121 ms	33460 KB	Output is correct
135	Correct	98 ms	24116 KB	Output is correct
136	Correct	87 ms	18100 KB	Output is correct
137	Correct	35 ms	5216 KB	Output is correct
138	Correct	93 ms	20020 KB	Output is correct
139	Correct	83 ms	18228 KB	Output is correct
140	Correct	76 ms	12596 KB	Output is correct
141	Correct	35 ms	5216 KB	Output is correct
142	Correct	385 ms	143156 KB	Output is correct
143	Correct	385 ms	143156 KB	Output is correct
144	Correct	387 ms	143284 KB	Output is correct
145	Correct	385 ms	142004 KB	Output is correct
146	Correct	377 ms	139364 KB	Output is correct
147	Correct	370 ms	137012 KB	Output is correct
148	Correct	362 ms	134068 KB	Output is correct
149	Correct	355 ms	131636 KB	Output is correct
150	Correct	347 ms	128948 KB	Output is correct
151	Correct	327 ms	115892 KB	Output is correct
152	Correct	28 ms	5216 KB	Output is correct
153	Correct	392 ms	142516 KB	Output is correct
154	Correct	375 ms	139956 KB	Output is correct
155	Correct	369 ms	137268 KB	Output is correct
156	Correct	363 ms	134804 KB	Output is correct
157	Correct	358 ms	131984 KB	Output is correct
158	Correct	352 ms	129460 KB	Output is correct
159	Correct	326 ms	116432 KB	Output is correct
160	Correct	28 ms	5216 KB	Output is correct
161	Correct	423 ms	86068 KB	Output is correct
162	Correct	388 ms	83380 KB	Output is correct
163	Correct	372 ms	80564 KB	Output is correct
164	Correct	351 ms	77748 KB	Output is correct
165	Correct	337 ms	75060 KB	Output is correct
166	Correct	32 ms	5344 KB	Output is correct
167	Correct	317 ms	136756 KB	Output is correct
168	Correct	318 ms	136372 KB	Output is correct
169	Correct	311 ms	135924 KB	Output is correct
170	Correct	306 ms	135668 KB	Output is correct
171	Correct	163 ms	30644 KB	Output is correct
172	Correct	168 ms	30644 KB	Output is correct
173	Correct	476 ms	100892 KB	Output is correct
174	Correct	468 ms	100276 KB	Output is correct
175	Correct	458 ms	94900 KB	Output is correct
176	Correct	340 ms	71476 KB	Output is correct

답안 #386558

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 1.0 / 1.0

Subtask #3 31.0 / 31.0

Subtask #4 61.0 / 61.0

Subtask #1
7.0 / 7.0

Subtask #2
1.0 / 1.0

Subtask #3
31.0 / 31.0

Subtask #4
61.0 / 61.0