oj.uz

Submission #417062

# Submission time Handle Problem Language Result Execution time Memory
417062 2021-06-03T11:17:43 Z jamezzz Event Hopping 2 (JOI21_event2) C++14
32 / 100
 448 ms 2508 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
typedef pair<int,int> ii;

int n,k,l,r;
vector<ii> v,t;
multiset<ii> s;

int val[100005],sfx[100005];

void sorted(){
	int st=-1;
	for(int i=n-1;i>=0;--i){
		int pos=lower_bound(v.begin()+i+1,v.end(),
								ii(v[i].se,0))-v.begin();
		val[i]=sfx[pos]+1;
		if(val[i]>=k)st=i;
		sfx[i]=max(sfx[i+1],val[i]);
	}
	if(st==-1)pf("%d\n",-1),exit(0);
	for(int i=0;i<k;++i){
		pf("%d\n",st+1);
		int pos=lower_bound(v.begin()+st+1,v.end(),
								ii(v[st].se,0))-v.begin();
		for(int j=pos;j<n;++j){
			if(val[st]==val[j]+1){ st=j;break; }
		}
	}
	exit(0);
}

int num(int x){
	t.clear();
	for(int i=x;i<n;++i)t.pb(v[i]);
	sort(all(t),[&](ii &a,ii &b){return a.se<b.se;});
	int curr=-1,cnt=0;
	for(int i=0;i<sz(t);++i){
		if(t[i].fi<curr)continue;
		auto it=s.lower_bound(ii(t[i].fi,0));
		if(it!=s.end()&&(*it).fi<t[i].se)continue;
		if(it!=s.begin()&&t[i].fi<(*--it).se)continue;
		curr=t[i].se;++cnt;
	}
	return cnt;
}

int main(){
	sf("%d%d",&n,&k);
	for(int i=0;i<n;++i){
		sf("%d%d",&l,&r);
		v.pb(l,r);
	}
	if(n>3000)sorted();
	int cnt=1;
	bool pos=false;
	for(int i=0;i<n;++i){
		
		auto it=s.lower_bound(ii(v[i].fi,0));
		if(it!=s.end()&&(*it).fi<v[i].se)continue;
		if(it!=s.begin()&&v[i].fi<(*--it).se)continue;
		
		s.insert(ii(v[i].fi,v[i].se));
		
		int tot=num(i+1)+cnt;
		if(tot>=k){
			pos=true;
			if(cnt==k)break;
			++cnt;
			continue;
		}
		else s.erase(s.find(v[i]));
	}
	if(!pos)pf("-1\n"),exit(0);
	
	for(int i=0;i<n;++i){
		if(s.count(v[i])){
			pf("%d\n",i+1);
			s.erase(s.find(v[i]));
		}
	}
}

/*
5 4
1 3
2 5
6 8
8 9
10 15

4 3
1 4
3 5
4 9
7 10

10 6
77412002 93858605
244306432 318243514
280338037 358494212
439397354 492065507
485779890 529132783
571714810 632053254
659767854 709114867
718405631 733610573
786950301 815106357
878719468 899999649
*/

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:56:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |  sf("%d%d",&n,&k);
      |    ^
event2.cpp:58:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |   sf("%d%d",&l,&r);
      |     ^

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 41 ms 2484 KB Output is correct
5 Incorrect 41 ms 2508 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 33 ms 464 KB Output is correct
29 Correct 32 ms 332 KB Output is correct
30 Correct 17 ms 460 KB Output is correct
31 Correct 8 ms 444 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 285 ms 440 KB Output is correct
34 Correct 274 ms 460 KB Output is correct
35 Correct 448 ms 460 KB Output is correct
36 Correct 440 ms 460 KB Output is correct
37 Correct 367 ms 460 KB Output is correct
38 Correct 279 ms 452 KB Output is correct
39 Correct 391 ms 468 KB Output is correct
40 Correct 398 ms 604 KB Output is correct
41 Correct 370 ms 452 KB Output is correct
42 Correct 286 ms 568 KB Output is correct
43 Correct 199 ms 444 KB Output is correct
44 Correct 168 ms 460 KB Output is correct
45 Correct 147 ms 444 KB Output is correct
46 Correct 283 ms 452 KB Output is correct
47 Correct 89 ms 440 KB Output is correct
48 Correct 57 ms 332 KB Output is correct
49 Correct 31 ms 464 KB Output is correct
50 Correct 289 ms 368 KB Output is correct
51 Correct 99 ms 332 KB Output is correct
52 Correct 70 ms 460 KB Output is correct
53 Correct 11 ms 460 KB Output is correct
54 Correct 269 ms 460 KB Output is correct
55 Correct 202 ms 460 KB Output is correct
56 Correct 178 ms 460 KB Output is correct
57 Correct 175 ms 628 KB Output is correct
58 Correct 174 ms 572 KB Output is correct
59 Correct 175 ms 452 KB Output is correct
60 Correct 175 ms 460 KB Output is correct
61 Correct 175 ms 460 KB Output is correct
62 Correct 173 ms 452 KB Output is correct
63 Correct 167 ms 452 KB Output is correct
64 Correct 93 ms 440 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 41 ms 2484 KB Output is correct
5 Incorrect 41 ms 2508 KB Output isn't correct
6 Halted 0 ms 0 KB -