oj.uz

Submission #386405

# Submission time Handle Problem Language Result Execution time Memory
386405 2021-04-06T14:00:48 Z haojiandan Event Hopping 2 (JOI21_event2) C++14
100 / 100
 547 ms 37740 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 330 ms 37356 KB Output is correct
5 Correct 256 ms 36332 KB Output is correct
6 Correct 247 ms 35692 KB Output is correct
7 Correct 234 ms 34028 KB Output is correct
8 Correct 313 ms 37144 KB Output is correct
9 Correct 268 ms 36364 KB Output is correct
10 Correct 269 ms 35692 KB Output is correct
11 Correct 255 ms 34144 KB Output is correct
12 Correct 243 ms 33516 KB Output is correct
13 Correct 205 ms 33004 KB Output is correct
14 Correct 197 ms 32492 KB Output is correct
15 Correct 177 ms 31212 KB Output is correct
16 Correct 138 ms 29036 KB Output is correct
17 Correct 144 ms 28780 KB Output is correct
18 Correct 132 ms 28012 KB Output is correct
19 Correct 123 ms 27884 KB Output is correct
20 Correct 125 ms 27884 KB Output is correct
21 Correct 145 ms 27884 KB Output is correct
22 Correct 123 ms 27756 KB Output is correct
23 Correct 149 ms 27756 KB Output is correct
24 Correct 119 ms 27756 KB Output is correct
25 Correct 138 ms 27500 KB Output is correct
26 Correct 139 ms 27576 KB Output is correct
27 Correct 142 ms 27632 KB Output is correct
28 Correct 59 ms 21612 KB Output is correct
29 Correct 62 ms 21588 KB Output is correct
30 Correct 69 ms 21612 KB Output is correct
31 Correct 65 ms 21612 KB Output is correct
32 Correct 71 ms 21612 KB Output is correct
33 Correct 86 ms 21608 KB Output is correct
34 Correct 172 ms 28780 KB Output is correct
35 Correct 119 ms 26476 KB Output is correct
36 Correct 103 ms 24044 KB Output is correct
37 Correct 207 ms 32696 KB Output is correct
38 Correct 196 ms 32236 KB Output is correct
39 Correct 194 ms 31824 KB Output is correct
40 Correct 196 ms 31304 KB Output is correct
41 Correct 183 ms 30956 KB Output is correct
42 Correct 103 ms 21612 KB Output is correct
43 Correct 271 ms 32552 KB Output is correct
44 Correct 230 ms 32364 KB Output is correct
45 Correct 245 ms 32236 KB Output is correct
46 Correct 223 ms 31980 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 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 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 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 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 512 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 364 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 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 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 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 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 512 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 364 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 4 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 7 ms 1516 KB Output is correct
37 Correct 7 ms 1388 KB Output is correct
38 Correct 3 ms 1004 KB Output is correct
39 Correct 7 ms 1516 KB Output is correct
40 Correct 9 ms 1388 KB Output is correct
41 Correct 7 ms 1388 KB Output is correct
42 Correct 2 ms 1004 KB Output is correct
43 Correct 6 ms 1388 KB Output is correct
44 Correct 6 ms 1280 KB Output is correct
45 Correct 5 ms 1260 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 4 ms 1260 KB Output is correct
50 Correct 2 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 1516 KB Output is correct
56 Correct 7 ms 1516 KB Output is correct
57 Correct 7 ms 1516 KB Output is correct
58 Correct 6 ms 1516 KB Output is correct
59 Correct 6 ms 1516 KB Output is correct
60 Correct 6 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 5 ms 1388 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 330 ms 37356 KB Output is correct
5 Correct 256 ms 36332 KB Output is correct
6 Correct 247 ms 35692 KB Output is correct
7 Correct 234 ms 34028 KB Output is correct
8 Correct 313 ms 37144 KB Output is correct
9 Correct 268 ms 36364 KB Output is correct
10 Correct 269 ms 35692 KB Output is correct
11 Correct 255 ms 34144 KB Output is correct
12 Correct 243 ms 33516 KB Output is correct
13 Correct 205 ms 33004 KB Output is correct
14 Correct 197 ms 32492 KB Output is correct
15 Correct 177 ms 31212 KB Output is correct
16 Correct 138 ms 29036 KB Output is correct
17 Correct 144 ms 28780 KB Output is correct
18 Correct 132 ms 28012 KB Output is correct
19 Correct 123 ms 27884 KB Output is correct
20 Correct 125 ms 27884 KB Output is correct
21 Correct 145 ms 27884 KB Output is correct
22 Correct 123 ms 27756 KB Output is correct
23 Correct 149 ms 27756 KB Output is correct
24 Correct 119 ms 27756 KB Output is correct
25 Correct 138 ms 27500 KB Output is correct
26 Correct 139 ms 27576 KB Output is correct
27 Correct 142 ms 27632 KB Output is correct
28 Correct 59 ms 21612 KB Output is correct
29 Correct 62 ms 21588 KB Output is correct
30 Correct 69 ms 21612 KB Output is correct
31 Correct 65 ms 21612 KB Output is correct
32 Correct 71 ms 21612 KB Output is correct
33 Correct 86 ms 21608 KB Output is correct
34 Correct 172 ms 28780 KB Output is correct
35 Correct 119 ms 26476 KB Output is correct
36 Correct 103 ms 24044 KB Output is correct
37 Correct 207 ms 32696 KB Output is correct
38 Correct 196 ms 32236 KB Output is correct
39 Correct 194 ms 31824 KB Output is correct
40 Correct 196 ms 31304 KB Output is correct
41 Correct 183 ms 30956 KB Output is correct
42 Correct 103 ms 21612 KB Output is correct
43 Correct 271 ms 32552 KB Output is correct
44 Correct 230 ms 32364 KB Output is correct
45 Correct 245 ms 32236 KB Output is correct
46 Correct 223 ms 31980 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 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 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 2 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 2 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 2 ms 364 KB Output is correct
62 Correct 2 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 2 ms 364 KB Output is correct
65 Correct 2 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 512 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 364 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 4 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 7 ms 1516 KB Output is correct
83 Correct 7 ms 1388 KB Output is correct
84 Correct 3 ms 1004 KB Output is correct
85 Correct 7 ms 1516 KB Output is correct
86 Correct 9 ms 1388 KB Output is correct
87 Correct 7 ms 1388 KB Output is correct
88 Correct 2 ms 1004 KB Output is correct
89 Correct 6 ms 1388 KB Output is correct
90 Correct 6 ms 1280 KB Output is correct
91 Correct 5 ms 1260 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 4 ms 1260 KB Output is correct
96 Correct 2 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 1516 KB Output is correct
102 Correct 7 ms 1516 KB Output is correct
103 Correct 7 ms 1516 KB Output is correct
104 Correct 6 ms 1516 KB Output is correct
105 Correct 6 ms 1516 KB Output is correct
106 Correct 6 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 5 ms 1388 KB Output is correct
110 Correct 2 ms 1004 KB Output is correct
111 Correct 196 ms 27648 KB Output is correct
112 Correct 194 ms 27756 KB Output is correct
113 Correct 196 ms 27756 KB Output is correct
114 Correct 187 ms 27756 KB Output is correct
115 Correct 186 ms 27756 KB Output is correct
116 Correct 81 ms 21612 KB Output is correct
117 Correct 77 ms 21612 KB Output is correct
118 Correct 547 ms 37100 KB Output is correct
119 Correct 455 ms 36332 KB Output is correct
120 Correct 325 ms 32492 KB Output is correct
121 Correct 77 ms 21612 KB Output is correct
122 Correct 392 ms 33516 KB Output is correct
123 Correct 361 ms 33132 KB Output is correct
124 Correct 316 ms 32364 KB Output is correct
125 Correct 90 ms 21612 KB Output is correct
126 Correct 257 ms 29164 KB Output is correct
127 Correct 238 ms 28908 KB Output is correct
128 Correct 236 ms 28820 KB Output is correct
129 Correct 83 ms 21740 KB Output is correct
130 Correct 220 ms 28012 KB Output is correct
131 Correct 226 ms 27884 KB Output is correct
132 Correct 190 ms 27884 KB Output is correct
133 Correct 74 ms 21612 KB Output is correct
134 Correct 223 ms 27776 KB Output is correct
135 Correct 189 ms 27884 KB Output is correct
136 Correct 181 ms 27756 KB Output is correct
137 Correct 74 ms 21612 KB Output is correct
138 Correct 182 ms 27500 KB Output is correct
139 Correct 174 ms 27372 KB Output is correct
140 Correct 102 ms 27244 KB Output is correct
141 Correct 84 ms 21612 KB Output is correct
142 Correct 284 ms 37612 KB Output is correct
143 Correct 273 ms 37612 KB Output is correct
144 Correct 307 ms 37740 KB Output is correct
145 Correct 274 ms 37484 KB Output is correct
146 Correct 287 ms 37356 KB Output is correct
147 Correct 264 ms 36844 KB Output is correct
148 Correct 272 ms 36588 KB Output is correct
149 Correct 253 ms 36204 KB Output is correct
150 Correct 262 ms 35948 KB Output is correct
151 Correct 229 ms 34284 KB Output is correct
152 Correct 58 ms 21612 KB Output is correct
153 Correct 273 ms 37612 KB Output is correct
154 Correct 262 ms 37228 KB Output is correct
155 Correct 262 ms 36972 KB Output is correct
156 Correct 255 ms 36716 KB Output is correct
157 Correct 266 ms 36332 KB Output is correct
158 Correct 257 ms 35948 KB Output is correct
159 Correct 229 ms 34500 KB Output is correct
160 Correct 59 ms 21612 KB Output is correct
161 Correct 354 ms 32620 KB Output is correct
162 Correct 328 ms 32620 KB Output is correct
163 Correct 323 ms 32236 KB Output is correct
164 Correct 303 ms 31980 KB Output is correct
165 Correct 293 ms 31852 KB Output is correct
166 Correct 70 ms 21612 KB Output is correct
167 Correct 208 ms 32748 KB Output is correct
168 Correct 209 ms 32364 KB Output is correct
169 Correct 211 ms 32236 KB Output is correct
170 Correct 197 ms 32108 KB Output is correct
171 Correct 191 ms 32620 KB Output is correct
172 Correct 193 ms 32620 KB Output is correct
173 Correct 386 ms 32620 KB Output is correct
174 Correct 405 ms 32620 KB Output is correct
175 Correct 394 ms 32748 KB Output is correct
176 Correct 349 ms 31596 KB Output is correct