oj.uz

Submission #386403

# Submission time Handle Problem Language Result Execution time Memory
386403 2021-04-06T13:58:20 Z haojiandan Event Hopping 2 (JOI21_event2) C++14
100 / 100
 558 ms 39660 KB 
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
	t=0; char ch=getchar(); int f=1;
	while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
	do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int INF=(1e9)+10;
const int maxn=(1e5)+10;
int n,m;
struct node { int l,r; } d[maxn],e[maxn];
bool cmpr(node A,node B) {
	if (A.r==B.r) return A.l>B.l;
	return A.r<B.r;
}
int nxt[maxn],fa[maxn][20],Lmx[maxn][20],lg[maxn];
int now,old;
set<int> s1,s2;
set<int>::iterator it;
int queryLmx(int l,int r) {
	int j=lg[r-l+1];
	return max(Lmx[l][j],Lmx[r-(1<<j)+1][j]);
}
int ans[maxn],top,TMP[maxn];
int query(int L,int R) {
	int ed=upper_bound(TMP+1,TMP+n+1,R)-TMP-1;
	int l=1,r=ed,mid,res=0;
	while (l<=r) {
		mid=(l+r)>>1;
		if (queryLmx(1,mid)>=L) res=mid,r=mid-1;
		else l=mid+1;
	}
	if (res==0) return 0;
	int x=res,cnt=1;
	for (int i=19;i>=0;i--) {
	//	printf("x=%d,i=%d,fa=%d\n",x,i,fa[x][i]);
		if (fa[x][i]<=ed) cnt+=(1<<i),x=fa[x][i];
	}
	return cnt;
	
}
int lsh[maxn*2],N;
namespace BIT {
	ll tr[maxn*8];
	int lazy[maxn*8],sz[maxn*8];
	void build(int l,int r,int root) {
		sz[root]=r-l+1;
		if (l==r) return;
		int mid=(l+r)>>1; build(l,mid,root<<1),build(mid+1,r,root<<1|1);
	}
	void puttag(int root,int delta) {
		tr[root]+=(ll)delta*sz[root]; lazy[root]+=delta;
	}
	void pushdown(int root) {
		if (lazy[root]) puttag(root<<1,lazy[root]),puttag(root<<1|1,lazy[root]),lazy[root]=0;
	}
	void add(int L,int R,int l,int r,int root) {
		if (L<=l&&r<=R) { puttag(root,1); return; }
		int mid=(l+r)>>1; pushdown(root);
		if (L<=mid) add(L,R,l,mid,root<<1);
		if (mid<R) add(L,R,mid+1,r,root<<1|1);
		tr[root]=tr[root<<1]+tr[root<<1|1];
	}
	ll query(int L,int R,int l,int r,int root) {
		if (L<=l&&r<=R) return tr[root];
		int mid=(l+r)>>1; pushdown(root); ll sum=0;
		if (L<=mid) sum=query(L,R,l,mid,root<<1);
		if (mid<R) sum+=query(L,R,mid+1,r,root<<1|1);
		return sum;
	}
};
int main() {
	//freopen("4.in","r",stdin);
	read(n),read(m);
	for (int i=1;i<=n;i++) {
		read(d[i].l),read(d[i].r),e[i]=d[i];
		lsh[++N]=d[i].l,lsh[++N]=d[i].r-1;
	}
	sort(lsh+1,lsh+N+1),N=unique(lsh+1,lsh+N+1)-lsh-1;
	sort(d+1,d+n+1,cmpr);
	nxt[n]=nxt[n+1]=n+1;
	for (int i=1;i<=n;i++) Lmx[i][0]=d[i].l;
	for (int i=2;i<=n;i++) lg[i]=lg[i>>1]+1;
	for (int i=1;i<=19;i++) for (int j=1;j+(1<<i)-1<=n;j++)
		Lmx[j][i]=max(Lmx[j][i-1],Lmx[j+(1<<i-1)][i-1]);
	int l,r,res,mid,x,y;
	for (int i=1;i<=n;i++) TMP[i]=d[i].r;
	for (int i=n-1;i>=1;i--) {
		res=n+1,l=i+1,r=n;
		while (l<=r) {
			mid=(l+r)>>1;
			if (queryLmx(i+1,mid)>=d[i].r) res=mid,r=mid-1;
			else l=mid+1;
		}
		nxt[i]=res;
	}
	BIT::build(1,N,1);
	/*for (int i=1;i<=n;i++) {
		printf("[%d,%d],%d\n",d[i].l,d[i].r,nxt[i]);
	}*/
	for (int i=1;i<=n+1;i++) fa[i][0]=nxt[i];
	for (int i=1;i<=19;i++) for (int j=1;j<=n+1;j++) fa[j][i]=fa[fa[j][i-1]][i-1];
	now=query(0,INF);
	//printf("%d\n",now);
	//exit(0);
	if (now<m) { puts("-1"); return 0; }
	// s1 : l
	// s2 : r
	s1.insert(INF),s2.insert(0);
	int A,B;
	for (int i=1;i<=n;i++) {
		A=lower_bound(lsh+1,lsh+N+1,e[i].l)-lsh,B=lower_bound(lsh+1,lsh+N+1,e[i].r-1)-lsh;
		//printf("[%d,%d]\n",A,B);
		it=s2.upper_bound(e[i].l); it--;
		x=(*it);
		it=s1.lower_bound(e[i].r);
		y=(*it);
		if (x>y||BIT::query(A,B,1,N,1)) continue;
		old=now;
		now-=query(x,y);
		now+=query(x,e[i].l)+query(e[i].r,y)+1;
		//printf("? i=%d , %d %d %d %d, %d\n",i,x,e[i].l,e[i].r,y,now);
		if (now>=m) {
			ans[++top]=i,s1.insert(e[i].l),s2.insert(e[i].r);
			BIT::add(A,B,1,N,1);
		}
		else now=old;
		if (top>=m) break;
	}
	for (int i=1;i<=m;i++) printf("%d\n",ans[i]);
	return 0;
}
/*
  0. Enough array size? Enough array size? Enough array size? Integer overflow?
  
  1. Think TWICE, Code ONCE!
  Are there any counterexamples to your algo?
    
  2. Be careful about the BOUNDARIES!
  N=1? P=1? Something about 0?
    
  3. Do not make STUPID MISTAKES!
  Time complexity? Memory usage? Precision error?
*/

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:86:40: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   86 |   Lmx[j][i]=max(Lmx[j][i-1],Lmx[j+(1<<i-1)][i-1]);
      |                                       ~^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 288 ms 39020 KB Output is correct
5 Correct 267 ms 38388 KB Output is correct
6 Correct 248 ms 37484 KB Output is correct
7 Correct 247 ms 35952 KB Output is correct
8 Correct 284 ms 39148 KB Output is correct
9 Correct 256 ms 38380 KB Output is correct
10 Correct 265 ms 37612 KB Output is correct
11 Correct 231 ms 35948 KB Output is correct
12 Correct 240 ms 35564 KB Output is correct
13 Correct 221 ms 34924 KB Output is correct
14 Correct 209 ms 34412 KB Output is correct
15 Correct 193 ms 33132 KB Output is correct
16 Correct 151 ms 30972 KB Output is correct
17 Correct 159 ms 30840 KB Output is correct
18 Correct 136 ms 29984 KB Output is correct
19 Correct 133 ms 29932 KB Output is correct
20 Correct 130 ms 29764 KB Output is correct
21 Correct 131 ms 29932 KB Output is correct
22 Correct 128 ms 29676 KB Output is correct
23 Correct 129 ms 29736 KB Output is correct
24 Correct 134 ms 29612 KB Output is correct
25 Correct 134 ms 29504 KB Output is correct
26 Correct 128 ms 29420 KB Output is correct
27 Correct 138 ms 29592 KB Output is correct
28 Correct 70 ms 23536 KB Output is correct
29 Correct 73 ms 23532 KB Output is correct
30 Correct 62 ms 23532 KB Output is correct
31 Correct 82 ms 23532 KB Output is correct
32 Correct 69 ms 23532 KB Output is correct
33 Correct 82 ms 23532 KB Output is correct
34 Correct 154 ms 30828 KB Output is correct
35 Correct 117 ms 28296 KB Output is correct
36 Correct 93 ms 25964 KB Output is correct
37 Correct 204 ms 34540 KB Output is correct
38 Correct 203 ms 34156 KB Output is correct
39 Correct 191 ms 33900 KB Output is correct
40 Correct 192 ms 33260 KB Output is correct
41 Correct 184 ms 32876 KB Output is correct
42 Correct 88 ms 23532 KB Output is correct
43 Correct 230 ms 34540 KB Output is correct
44 Correct 215 ms 34412 KB Output is correct
45 Correct 204 ms 34284 KB Output is correct
46 Correct 210 ms 33900 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 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 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 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 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 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 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 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 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 5 ms 1260 KB Output is correct
29 Correct 4 ms 1260 KB Output is correct
30 Correct 5 ms 1260 KB Output is correct
31 Correct 4 ms 1260 KB Output is correct
32 Correct 4 ms 1260 KB Output is correct
33 Correct 3 ms 1004 KB Output is correct
34 Correct 3 ms 1004 KB Output is correct
35 Correct 8 ms 1516 KB Output is correct
36 Correct 8 ms 1516 KB Output is correct
37 Correct 8 ms 1516 KB Output is correct
38 Correct 3 ms 1004 KB Output is correct
39 Correct 9 ms 1516 KB Output is correct
40 Correct 10 ms 1516 KB Output is correct
41 Correct 7 ms 1516 KB Output is correct
42 Correct 3 ms 1004 KB Output is correct
43 Correct 6 ms 1388 KB Output is correct
44 Correct 6 ms 1388 KB Output is correct
45 Correct 5 ms 1388 KB Output is correct
46 Correct 3 ms 1004 KB Output is correct
47 Correct 5 ms 1260 KB Output is correct
48 Correct 5 ms 1260 KB Output is correct
49 Correct 5 ms 1260 KB Output is correct
50 Correct 3 ms 1004 KB Output is correct
51 Correct 5 ms 1260 KB Output is correct
52 Correct 4 ms 1260 KB Output is correct
53 Correct 4 ms 1260 KB Output is correct
54 Correct 3 ms 1004 KB Output is correct
55 Correct 7 ms 1644 KB Output is correct
56 Correct 7 ms 1644 KB Output is correct
57 Correct 7 ms 1644 KB Output is correct
58 Correct 7 ms 1516 KB Output is correct
59 Correct 7 ms 1516 KB Output is correct
60 Correct 7 ms 1516 KB Output is correct
61 Correct 6 ms 1516 KB Output is correct
62 Correct 6 ms 1516 KB Output is correct
63 Correct 6 ms 1516 KB Output is correct
64 Correct 2 ms 1004 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 288 ms 39020 KB Output is correct
5 Correct 267 ms 38388 KB Output is correct
6 Correct 248 ms 37484 KB Output is correct
7 Correct 247 ms 35952 KB Output is correct
8 Correct 284 ms 39148 KB Output is correct
9 Correct 256 ms 38380 KB Output is correct
10 Correct 265 ms 37612 KB Output is correct
11 Correct 231 ms 35948 KB Output is correct
12 Correct 240 ms 35564 KB Output is correct
13 Correct 221 ms 34924 KB Output is correct
14 Correct 209 ms 34412 KB Output is correct
15 Correct 193 ms 33132 KB Output is correct
16 Correct 151 ms 30972 KB Output is correct
17 Correct 159 ms 30840 KB Output is correct
18 Correct 136 ms 29984 KB Output is correct
19 Correct 133 ms 29932 KB Output is correct
20 Correct 130 ms 29764 KB Output is correct
21 Correct 131 ms 29932 KB Output is correct
22 Correct 128 ms 29676 KB Output is correct
23 Correct 129 ms 29736 KB Output is correct
24 Correct 134 ms 29612 KB Output is correct
25 Correct 134 ms 29504 KB Output is correct
26 Correct 128 ms 29420 KB Output is correct
27 Correct 138 ms 29592 KB Output is correct
28 Correct 70 ms 23536 KB Output is correct
29 Correct 73 ms 23532 KB Output is correct
30 Correct 62 ms 23532 KB Output is correct
31 Correct 82 ms 23532 KB Output is correct
32 Correct 69 ms 23532 KB Output is correct
33 Correct 82 ms 23532 KB Output is correct
34 Correct 154 ms 30828 KB Output is correct
35 Correct 117 ms 28296 KB Output is correct
36 Correct 93 ms 25964 KB Output is correct
37 Correct 204 ms 34540 KB Output is correct
38 Correct 203 ms 34156 KB Output is correct
39 Correct 191 ms 33900 KB Output is correct
40 Correct 192 ms 33260 KB Output is correct
41 Correct 184 ms 32876 KB Output is correct
42 Correct 88 ms 23532 KB Output is correct
43 Correct 230 ms 34540 KB Output is correct
44 Correct 215 ms 34412 KB Output is correct
45 Correct 204 ms 34284 KB Output is correct
46 Correct 210 ms 33900 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 2 ms 364 KB Output is correct
50 Correct 2 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 2 ms 364 KB Output is correct
54 Correct 2 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 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 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 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 384 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 5 ms 1260 KB Output is correct
75 Correct 4 ms 1260 KB Output is correct
76 Correct 5 ms 1260 KB Output is correct
77 Correct 4 ms 1260 KB Output is correct
78 Correct 4 ms 1260 KB Output is correct
79 Correct 3 ms 1004 KB Output is correct
80 Correct 3 ms 1004 KB Output is correct
81 Correct 8 ms 1516 KB Output is correct
82 Correct 8 ms 1516 KB Output is correct
83 Correct 8 ms 1516 KB Output is correct
84 Correct 3 ms 1004 KB Output is correct
85 Correct 9 ms 1516 KB Output is correct
86 Correct 10 ms 1516 KB Output is correct
87 Correct 7 ms 1516 KB Output is correct
88 Correct 3 ms 1004 KB Output is correct
89 Correct 6 ms 1388 KB Output is correct
90 Correct 6 ms 1388 KB Output is correct
91 Correct 5 ms 1388 KB Output is correct
92 Correct 3 ms 1004 KB Output is correct
93 Correct 5 ms 1260 KB Output is correct
94 Correct 5 ms 1260 KB Output is correct
95 Correct 5 ms 1260 KB Output is correct
96 Correct 3 ms 1004 KB Output is correct
97 Correct 5 ms 1260 KB Output is correct
98 Correct 4 ms 1260 KB Output is correct
99 Correct 4 ms 1260 KB Output is correct
100 Correct 3 ms 1004 KB Output is correct
101 Correct 7 ms 1644 KB Output is correct
102 Correct 7 ms 1644 KB Output is correct
103 Correct 7 ms 1644 KB Output is correct
104 Correct 7 ms 1516 KB Output is correct
105 Correct 7 ms 1516 KB Output is correct
106 Correct 7 ms 1516 KB Output is correct
107 Correct 6 ms 1516 KB Output is correct
108 Correct 6 ms 1516 KB Output is correct
109 Correct 6 ms 1516 KB Output is correct
110 Correct 2 ms 1004 KB Output is correct
111 Correct 202 ms 29580 KB Output is correct
112 Correct 190 ms 29556 KB Output is correct
113 Correct 199 ms 29528 KB Output is correct
114 Correct 191 ms 29684 KB Output is correct
115 Correct 188 ms 29676 KB Output is correct
116 Correct 80 ms 23468 KB Output is correct
117 Correct 78 ms 23660 KB Output is correct
118 Correct 558 ms 39148 KB Output is correct
119 Correct 467 ms 38252 KB Output is correct
120 Correct 313 ms 34284 KB Output is correct
121 Correct 78 ms 23532 KB Output is correct
122 Correct 403 ms 35564 KB Output is correct
123 Correct 383 ms 35060 KB Output is correct
124 Correct 328 ms 34292 KB Output is correct
125 Correct 75 ms 23532 KB Output is correct
126 Correct 255 ms 30956 KB Output is correct
127 Correct 245 ms 30828 KB Output is correct
128 Correct 225 ms 30700 KB Output is correct
129 Correct 79 ms 23532 KB Output is correct
130 Correct 228 ms 29932 KB Output is correct
131 Correct 202 ms 30060 KB Output is correct
132 Correct 199 ms 29804 KB Output is correct
133 Correct 77 ms 23532 KB Output is correct
134 Correct 227 ms 29676 KB Output is correct
135 Correct 194 ms 29676 KB Output is correct
136 Correct 172 ms 29676 KB Output is correct
137 Correct 79 ms 23532 KB Output is correct
138 Correct 188 ms 29420 KB Output is correct
139 Correct 192 ms 29420 KB Output is correct
140 Correct 103 ms 29240 KB Output is correct
141 Correct 79 ms 23532 KB Output is correct
142 Correct 270 ms 39552 KB Output is correct
143 Correct 277 ms 39532 KB Output is correct
144 Correct 276 ms 39660 KB Output is correct
145 Correct 272 ms 39472 KB Output is correct
146 Correct 264 ms 39276 KB Output is correct
147 Correct 261 ms 38764 KB Output is correct
148 Correct 258 ms 38508 KB Output is correct
149 Correct 255 ms 38176 KB Output is correct
150 Correct 251 ms 37996 KB Output is correct
151 Correct 221 ms 36460 KB Output is correct
152 Correct 63 ms 23532 KB Output is correct
153 Correct 278 ms 39484 KB Output is correct
154 Correct 263 ms 39148 KB Output is correct
155 Correct 268 ms 39020 KB Output is correct
156 Correct 262 ms 38508 KB Output is correct
157 Correct 252 ms 38252 KB Output is correct
158 Correct 255 ms 38124 KB Output is correct
159 Correct 242 ms 36332 KB Output is correct
160 Correct 57 ms 23532 KB Output is correct
161 Correct 349 ms 34668 KB Output is correct
162 Correct 329 ms 34412 KB Output is correct
163 Correct 327 ms 34156 KB Output is correct
164 Correct 289 ms 34028 KB Output is correct
165 Correct 283 ms 33860 KB Output is correct
166 Correct 74 ms 23532 KB Output is correct
167 Correct 212 ms 34668 KB Output is correct
168 Correct 212 ms 34412 KB Output is correct
169 Correct 227 ms 34028 KB Output is correct
170 Correct 205 ms 34016 KB Output is correct
171 Correct 187 ms 33900 KB Output is correct
172 Correct 201 ms 34668 KB Output is correct
173 Correct 391 ms 34668 KB Output is correct
174 Correct 409 ms 34796 KB Output is correct
175 Correct 395 ms 34540 KB Output is correct
176 Correct 303 ms 33516 KB Output is correct