oj.uz

Submission #417217

# Submission time Handle Problem Language Result Execution time Memory
417217 2021-06-03T13:21:08 Z errorgorn Event Hopping 2 (JOI21_event2) C++17
100 / 100
 1196 ms 28760 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);(s<e?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node{
	int s,e,m;
	int val=0;
	node *l,*r;
	
	node (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		
		if (s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	
	void update(int i,int k){
		if (s==e) val=k;
		else{
			if (i<=m) l->update(i,k);
			else r->update(i,k);
			
			val=max(l->val,r->val);
		}
	}
	
	int query(int i,int j){
		if (s==i && e==j) return val;
		else if (j<=m) return l->query(i,j);
		else if (m<i) return r->query(i,j);
		else return max(l->query(i,m),r->query(m+1,j));
	}
} *root=new node(0,100005);

int n,k;
ii arr[100005];

ii sorted[100005];
int nxt[100005][20];


set<ii> s;
// we need to check if the intercept of all ranges is null
// find the range exactly after the tile
// then check the range exactly before it?

bool in(ii i){
	auto it=s.ub(ii(i.se,-1));
	
	if (it==s.begin()) return false;
	
	return (*prev(it)).se>i.fi;
}

//we just need some way to find the max number of things we can take
//when we only allow taking stuff from a certain range

int calc(int l,int r){
	int lo=-1,hi=n+1,mi;
	
	while (hi-lo>1){
		mi=hi+lo>>1;
		
		if (root->query(0,mi)>=l) hi=mi;
		else lo=mi;
	}
	
	int curr=hi;
	if (sorted[curr].se>r) return 0;
	
	int ans=1;
	rep(x,20,0){
		int temp=nxt[curr][x];
		if (temp==-1) continue;
		if (sorted[temp].se<=r) curr=temp,ans+=(1<<x);
	}
	
	return ans;
}

int main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>k;
	rep(x,0,n) cin>>arr[x].fi>>arr[x].se;
	rep(x,0,n) sorted[x]=arr[x];
	
	sort(sorted,sorted+n,[](ii i,ii j){
		return i.se<j.se;
	});
	sorted[n]=ii(1e9+100,1e9+100);
	
	//rep(x,0,n) cout<<sorted[x].fi<<" "<<sorted[x].se<<endl;
	rep(x,0,n) root->update(x,sorted[x].fi);
	root->update(n,1e9+100);
	
	memset(nxt,-1,sizeof(nxt));
	rep(x,0,n){
		int lo=x,hi=n+1,mi;
		while (hi-lo>1){
			mi=hi+lo>>1;
			
			if (root->query(x+1,mi)>=sorted[x].se) hi=mi;
			else lo=mi;
		}
		
		nxt[x][0]=hi;
	}
	
	rep(x,n,0){
		int curr=nxt[x][0];
		rep(y,0,20){
			if (curr==-1) break;
			curr=nxt[x][y+1]=nxt[curr][y];
		}
	}
	
	//rep(x,0,n) cout<<nxt[x][0]<<" "; cout<<endl;
	
	int curr=calc(0,1e9);
	if (curr<k){
		cout<<"-1"<<endl;
		return 0;
	}
	
	vector<int> ans;
	
	s.insert(ii(0,0));
	s.insert(ii(1e9+1,1e9+1));
	
	rep(x,0,n){
		if (!in(arr[x])){
			auto iter=s.insert(arr[x]).fi;
			int l=(*prev(iter)).se;
			int r=(*next(iter)).fi;
			
			int val=curr-calc(l,r)+calc(l,arr[x].fi)+calc(arr[x].se,r)+1;
			
			//cout<<val<<endl;
			//cout<<l<<" "<<arr[x].fi<<" "<<arr[x].se+1<<" "<<r<<endl;
			
			if (val>=k){
				ans.pub(x);
				curr=val;
			}
			else{
				s.erase(arr[x]);
			}
		}
		
		//for (auto &it:s) cout<<it.fi<<"_"<<it.se<<" "; cout<<endl;
		//cout<<endl;
	}
	
	rep(x,0,k) cout<<ans[x]+1<<endl;
}

Compilation message

event2.cpp: In constructor 'node::node(int, int)':
event2.cpp:29:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |   s=_s,e=_e,m=s+e>>1;
      |               ~^~
event2.cpp: In function 'int calc(int, int)':
event2.cpp:82:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   82 |   mi=hi+lo>>1;
      |      ~~^~~
event2.cpp: In function 'int main()':
event2.cpp:123:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  123 |    mi=hi+lo>>1;
      |       ~~^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 17484 KB Output is correct
2 Correct 14 ms 17468 KB Output is correct
3 Correct 16 ms 17484 KB Output is correct
4 Correct 830 ms 27328 KB Output is correct
5 Correct 824 ms 28160 KB Output is correct
6 Correct 858 ms 27864 KB Output is correct
7 Correct 811 ms 27812 KB Output is correct
8 Correct 828 ms 28056 KB Output is correct
9 Correct 822 ms 28028 KB Output is correct
10 Correct 823 ms 28016 KB Output is correct
11 Correct 830 ms 27892 KB Output is correct
12 Correct 619 ms 25420 KB Output is correct
13 Correct 657 ms 25256 KB Output is correct
14 Correct 604 ms 25232 KB Output is correct
15 Correct 605 ms 25328 KB Output is correct
16 Correct 361 ms 22024 KB Output is correct
17 Correct 338 ms 21992 KB Output is correct
18 Correct 338 ms 22000 KB Output is correct
19 Correct 286 ms 21296 KB Output is correct
20 Correct 277 ms 21168 KB Output is correct
21 Correct 268 ms 21280 KB Output is correct
22 Correct 262 ms 21124 KB Output is correct
23 Correct 272 ms 21284 KB Output is correct
24 Correct 259 ms 21164 KB Output is correct
25 Correct 258 ms 21060 KB Output is correct
26 Correct 270 ms 21052 KB Output is correct
27 Correct 261 ms 21144 KB Output is correct
28 Correct 248 ms 21168 KB Output is correct
29 Correct 256 ms 21064 KB Output is correct
30 Correct 274 ms 21156 KB Output is correct
31 Correct 260 ms 21164 KB Output is correct
32 Correct 251 ms 21168 KB Output is correct
33 Correct 259 ms 21164 KB Output is correct
34 Correct 620 ms 25132 KB Output is correct
35 Correct 678 ms 25112 KB Output is correct
36 Correct 620 ms 24992 KB Output is correct
37 Correct 598 ms 24800 KB Output is correct
38 Correct 577 ms 24724 KB Output is correct
39 Correct 602 ms 24864 KB Output is correct
40 Correct 568 ms 24692 KB Output is correct
41 Correct 568 ms 24640 KB Output is correct
42 Correct 277 ms 21060 KB Output is correct
43 Correct 560 ms 24596 KB Output is correct
44 Correct 574 ms 24512 KB Output is correct
45 Correct 551 ms 24308 KB Output is correct
46 Correct 529 ms 24128 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17484 KB Output is correct
2 Correct 13 ms 17484 KB Output is correct
3 Correct 13 ms 17504 KB Output is correct
4 Correct 12 ms 17512 KB Output is correct
5 Correct 13 ms 17484 KB Output is correct
6 Correct 14 ms 17484 KB Output is correct
7 Correct 14 ms 17548 KB Output is correct
8 Correct 14 ms 17484 KB Output is correct
9 Correct 13 ms 17456 KB Output is correct
10 Correct 17 ms 17484 KB Output is correct
11 Correct 15 ms 17484 KB Output is correct
12 Correct 13 ms 17484 KB Output is correct
13 Correct 13 ms 17484 KB Output is correct
14 Correct 13 ms 17508 KB Output is correct
15 Correct 13 ms 17484 KB Output is correct
16 Correct 13 ms 17492 KB Output is correct
17 Correct 13 ms 17552 KB Output is correct
18 Correct 13 ms 17484 KB Output is correct
19 Correct 13 ms 17472 KB Output is correct
20 Correct 13 ms 17532 KB Output is correct
21 Correct 13 ms 17536 KB Output is correct
22 Correct 16 ms 17492 KB Output is correct
23 Correct 14 ms 17484 KB Output is correct
24 Correct 14 ms 17484 KB Output is correct
25 Correct 18 ms 17468 KB Output is correct
26 Correct 14 ms 17560 KB Output is correct
27 Correct 13 ms 17440 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17484 KB Output is correct
2 Correct 13 ms 17484 KB Output is correct
3 Correct 13 ms 17504 KB Output is correct
4 Correct 12 ms 17512 KB Output is correct
5 Correct 13 ms 17484 KB Output is correct
6 Correct 14 ms 17484 KB Output is correct
7 Correct 14 ms 17548 KB Output is correct
8 Correct 14 ms 17484 KB Output is correct
9 Correct 13 ms 17456 KB Output is correct
10 Correct 17 ms 17484 KB Output is correct
11 Correct 15 ms 17484 KB Output is correct
12 Correct 13 ms 17484 KB Output is correct
13 Correct 13 ms 17484 KB Output is correct
14 Correct 13 ms 17508 KB Output is correct
15 Correct 13 ms 17484 KB Output is correct
16 Correct 13 ms 17492 KB Output is correct
17 Correct 13 ms 17552 KB Output is correct
18 Correct 13 ms 17484 KB Output is correct
19 Correct 13 ms 17472 KB Output is correct
20 Correct 13 ms 17532 KB Output is correct
21 Correct 13 ms 17536 KB Output is correct
22 Correct 16 ms 17492 KB Output is correct
23 Correct 14 ms 17484 KB Output is correct
24 Correct 14 ms 17484 KB Output is correct
25 Correct 18 ms 17468 KB Output is correct
26 Correct 14 ms 17560 KB Output is correct
27 Correct 13 ms 17440 KB Output is correct
28 Correct 17 ms 17612 KB Output is correct
29 Correct 17 ms 17552 KB Output is correct
30 Correct 19 ms 17656 KB Output is correct
31 Correct 19 ms 17612 KB Output is correct
32 Correct 18 ms 17612 KB Output is correct
33 Correct 17 ms 17656 KB Output is correct
34 Correct 18 ms 17612 KB Output is correct
35 Correct 27 ms 17732 KB Output is correct
36 Correct 27 ms 17824 KB Output is correct
37 Correct 32 ms 17776 KB Output is correct
38 Correct 18 ms 17632 KB Output is correct
39 Correct 31 ms 17740 KB Output is correct
40 Correct 32 ms 17724 KB Output is correct
41 Correct 25 ms 17748 KB Output is correct
42 Correct 17 ms 17536 KB Output is correct
43 Correct 26 ms 17716 KB Output is correct
44 Correct 21 ms 17620 KB Output is correct
45 Correct 20 ms 17648 KB Output is correct
46 Correct 17 ms 17632 KB Output is correct
47 Correct 20 ms 17612 KB Output is correct
48 Correct 19 ms 17540 KB Output is correct
49 Correct 18 ms 17580 KB Output is correct
50 Correct 17 ms 17652 KB Output is correct
51 Correct 19 ms 17564 KB Output is correct
52 Correct 19 ms 17544 KB Output is correct
53 Correct 18 ms 17612 KB Output is correct
54 Correct 22 ms 17604 KB Output is correct
55 Correct 26 ms 17800 KB Output is correct
56 Correct 30 ms 17816 KB Output is correct
57 Correct 27 ms 17780 KB Output is correct
58 Correct 25 ms 17740 KB Output is correct
59 Correct 26 ms 17780 KB Output is correct
60 Correct 31 ms 17784 KB Output is correct
61 Correct 25 ms 17848 KB Output is correct
62 Correct 25 ms 17808 KB Output is correct
63 Correct 25 ms 17764 KB Output is correct
64 Correct 18 ms 17648 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 17484 KB Output is correct
2 Correct 14 ms 17468 KB Output is correct
3 Correct 16 ms 17484 KB Output is correct
4 Correct 830 ms 27328 KB Output is correct
5 Correct 824 ms 28160 KB Output is correct
6 Correct 858 ms 27864 KB Output is correct
7 Correct 811 ms 27812 KB Output is correct
8 Correct 828 ms 28056 KB Output is correct
9 Correct 822 ms 28028 KB Output is correct
10 Correct 823 ms 28016 KB Output is correct
11 Correct 830 ms 27892 KB Output is correct
12 Correct 619 ms 25420 KB Output is correct
13 Correct 657 ms 25256 KB Output is correct
14 Correct 604 ms 25232 KB Output is correct
15 Correct 605 ms 25328 KB Output is correct
16 Correct 361 ms 22024 KB Output is correct
17 Correct 338 ms 21992 KB Output is correct
18 Correct 338 ms 22000 KB Output is correct
19 Correct 286 ms 21296 KB Output is correct
20 Correct 277 ms 21168 KB Output is correct
21 Correct 268 ms 21280 KB Output is correct
22 Correct 262 ms 21124 KB Output is correct
23 Correct 272 ms 21284 KB Output is correct
24 Correct 259 ms 21164 KB Output is correct
25 Correct 258 ms 21060 KB Output is correct
26 Correct 270 ms 21052 KB Output is correct
27 Correct 261 ms 21144 KB Output is correct
28 Correct 248 ms 21168 KB Output is correct
29 Correct 256 ms 21064 KB Output is correct
30 Correct 274 ms 21156 KB Output is correct
31 Correct 260 ms 21164 KB Output is correct
32 Correct 251 ms 21168 KB Output is correct
33 Correct 259 ms 21164 KB Output is correct
34 Correct 620 ms 25132 KB Output is correct
35 Correct 678 ms 25112 KB Output is correct
36 Correct 620 ms 24992 KB Output is correct
37 Correct 598 ms 24800 KB Output is correct
38 Correct 577 ms 24724 KB Output is correct
39 Correct 602 ms 24864 KB Output is correct
40 Correct 568 ms 24692 KB Output is correct
41 Correct 568 ms 24640 KB Output is correct
42 Correct 277 ms 21060 KB Output is correct
43 Correct 560 ms 24596 KB Output is correct
44 Correct 574 ms 24512 KB Output is correct
45 Correct 551 ms 24308 KB Output is correct
46 Correct 529 ms 24128 KB Output is correct
47 Correct 12 ms 17484 KB Output is correct
48 Correct 13 ms 17484 KB Output is correct
49 Correct 13 ms 17504 KB Output is correct
50 Correct 12 ms 17512 KB Output is correct
51 Correct 13 ms 17484 KB Output is correct
52 Correct 14 ms 17484 KB Output is correct
53 Correct 14 ms 17548 KB Output is correct
54 Correct 14 ms 17484 KB Output is correct
55 Correct 13 ms 17456 KB Output is correct
56 Correct 17 ms 17484 KB Output is correct
57 Correct 15 ms 17484 KB Output is correct
58 Correct 13 ms 17484 KB Output is correct
59 Correct 13 ms 17484 KB Output is correct
60 Correct 13 ms 17508 KB Output is correct
61 Correct 13 ms 17484 KB Output is correct
62 Correct 13 ms 17492 KB Output is correct
63 Correct 13 ms 17552 KB Output is correct
64 Correct 13 ms 17484 KB Output is correct
65 Correct 13 ms 17472 KB Output is correct
66 Correct 13 ms 17532 KB Output is correct
67 Correct 13 ms 17536 KB Output is correct
68 Correct 16 ms 17492 KB Output is correct
69 Correct 14 ms 17484 KB Output is correct
70 Correct 14 ms 17484 KB Output is correct
71 Correct 18 ms 17468 KB Output is correct
72 Correct 14 ms 17560 KB Output is correct
73 Correct 13 ms 17440 KB Output is correct
74 Correct 17 ms 17612 KB Output is correct
75 Correct 17 ms 17552 KB Output is correct
76 Correct 19 ms 17656 KB Output is correct
77 Correct 19 ms 17612 KB Output is correct
78 Correct 18 ms 17612 KB Output is correct
79 Correct 17 ms 17656 KB Output is correct
80 Correct 18 ms 17612 KB Output is correct
81 Correct 27 ms 17732 KB Output is correct
82 Correct 27 ms 17824 KB Output is correct
83 Correct 32 ms 17776 KB Output is correct
84 Correct 18 ms 17632 KB Output is correct
85 Correct 31 ms 17740 KB Output is correct
86 Correct 32 ms 17724 KB Output is correct
87 Correct 25 ms 17748 KB Output is correct
88 Correct 17 ms 17536 KB Output is correct
89 Correct 26 ms 17716 KB Output is correct
90 Correct 21 ms 17620 KB Output is correct
91 Correct 20 ms 17648 KB Output is correct
92 Correct 17 ms 17632 KB Output is correct
93 Correct 20 ms 17612 KB Output is correct
94 Correct 19 ms 17540 KB Output is correct
95 Correct 18 ms 17580 KB Output is correct
96 Correct 17 ms 17652 KB Output is correct
97 Correct 19 ms 17564 KB Output is correct
98 Correct 19 ms 17544 KB Output is correct
99 Correct 18 ms 17612 KB Output is correct
100 Correct 22 ms 17604 KB Output is correct
101 Correct 26 ms 17800 KB Output is correct
102 Correct 30 ms 17816 KB Output is correct
103 Correct 27 ms 17780 KB Output is correct
104 Correct 25 ms 17740 KB Output is correct
105 Correct 26 ms 17780 KB Output is correct
106 Correct 31 ms 17784 KB Output is correct
107 Correct 25 ms 17848 KB Output is correct
108 Correct 25 ms 17808 KB Output is correct
109 Correct 25 ms 17764 KB Output is correct
110 Correct 18 ms 17648 KB Output is correct
111 Correct 270 ms 21152 KB Output is correct
112 Correct 281 ms 21420 KB Output is correct
113 Correct 265 ms 21424 KB Output is correct
114 Correct 259 ms 21376 KB Output is correct
115 Correct 257 ms 21316 KB Output is correct
116 Correct 272 ms 21420 KB Output is correct
117 Correct 251 ms 21420 KB Output is correct
118 Correct 1196 ms 28132 KB Output is correct
119 Correct 1170 ms 28020 KB Output is correct
120 Correct 821 ms 25260 KB Output is correct
121 Correct 257 ms 21424 KB Output is correct
122 Correct 884 ms 25572 KB Output is correct
123 Correct 822 ms 25324 KB Output is correct
124 Correct 813 ms 25400 KB Output is correct
125 Correct 255 ms 21324 KB Output is correct
126 Correct 518 ms 22512 KB Output is correct
127 Correct 422 ms 22212 KB Output is correct
128 Correct 378 ms 22144 KB Output is correct
129 Correct 258 ms 21420 KB Output is correct
130 Correct 415 ms 21572 KB Output is correct
131 Correct 340 ms 21444 KB Output is correct
132 Correct 307 ms 21428 KB Output is correct
133 Correct 259 ms 21432 KB Output is correct
134 Correct 386 ms 21440 KB Output is correct
135 Correct 319 ms 21532 KB Output is correct
136 Correct 272 ms 21380 KB Output is correct
137 Correct 258 ms 21424 KB Output is correct
138 Correct 297 ms 21444 KB Output is correct
139 Correct 285 ms 21392 KB Output is correct
140 Correct 274 ms 21420 KB Output is correct
141 Correct 254 ms 21336 KB Output is correct
142 Correct 866 ms 28660 KB Output is correct
143 Correct 863 ms 28620 KB Output is correct
144 Correct 859 ms 28616 KB Output is correct
145 Correct 838 ms 28708 KB Output is correct
146 Correct 851 ms 28760 KB Output is correct
147 Correct 851 ms 28532 KB Output is correct
148 Correct 850 ms 28700 KB Output is correct
149 Correct 842 ms 28544 KB Output is correct
150 Correct 855 ms 28484 KB Output is correct
151 Correct 848 ms 28556 KB Output is correct
152 Correct 247 ms 21464 KB Output is correct
153 Correct 843 ms 28576 KB Output is correct
154 Correct 850 ms 28652 KB Output is correct
155 Correct 840 ms 28712 KB Output is correct
156 Correct 852 ms 28540 KB Output is correct
157 Correct 866 ms 28680 KB Output is correct
158 Correct 864 ms 28488 KB Output is correct
159 Correct 919 ms 28440 KB Output is correct
160 Correct 247 ms 21316 KB Output is correct
161 Correct 786 ms 24980 KB Output is correct
162 Correct 774 ms 24956 KB Output is correct
163 Correct 790 ms 24932 KB Output is correct
164 Correct 802 ms 25004 KB Output is correct
165 Correct 764 ms 24888 KB Output is correct
166 Correct 260 ms 21420 KB Output is correct
167 Correct 588 ms 24932 KB Output is correct
168 Correct 581 ms 24788 KB Output is correct
169 Correct 562 ms 24624 KB Output is correct
170 Correct 543 ms 24412 KB Output is correct
171 Correct 571 ms 25116 KB Output is correct
172 Correct 544 ms 25100 KB Output is correct
173 Correct 873 ms 25000 KB Output is correct
174 Correct 872 ms 25112 KB Output is correct
175 Correct 818 ms 24928 KB Output is correct
176 Correct 679 ms 24532 KB Output is correct