oj.uz

Submission #417170

# Submission time Handle Problem Language Result Execution time Memory
417170 2021-06-03T12:34:29 Z errorgorn Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 3240 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());

int n,k;
int l[100005],r[100005];
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;
}

vector<ii> range; //to do greedy

int calc(){
	int curr=0;
	int ans=0;
	
	for (auto &it:range){
		if (curr<=it.fi && !in(it)){
			ans++;
			curr=it.se;
		}
	}
	
	return ans;
}

int main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>k;
	rep(x,0,n) cin>>l[x]>>r[x];
	rep(x,0,n) range.pub(ii(l[x],r[x]));
	
	sort(all(range),[](ii i,ii j){
		return i.se<j.se;
	});
	
	if (calc()<k){
		cout<<"-1"<<endl;
		return 0;
	}
	
	vector<int> ans;
	rep(x,0,n){
		if (!in(ii(l[x],r[x]))){
			s.insert(ii(l[x],r[x]));
			
			//for (auto &it:s) cout<<it.fi<<"_"<<it.se<<" "; cout<<endl;
			//cout<<x<<" "<<calc()<<endl;
			
			if (calc()+sz(s)<k){
				s.erase(ii(l[x],r[x]));
			}
			else{
				ans.pub(x);
			}
		}
	}
	
	rep(x,0,k) cout<<ans[x]+1<<endl;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Execution timed out 3093 ms 3240 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 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 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 204 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 332 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 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 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 204 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 332 KB Output is correct
28 Correct 9 ms 352 KB Output is correct
29 Correct 4 ms 460 KB Output is correct
30 Correct 4 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 409 ms 564 KB Output is correct
36 Correct 412 ms 576 KB Output is correct
37 Correct 317 ms 668 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 339 ms 588 KB Output is correct
40 Correct 316 ms 564 KB Output is correct
41 Correct 345 ms 592 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 85 ms 460 KB Output is correct
44 Correct 69 ms 460 KB Output is correct
45 Correct 57 ms 460 KB Output is correct
46 Correct 2 ms 460 KB Output is correct
47 Correct 16 ms 528 KB Output is correct
48 Correct 12 ms 460 KB Output is correct
49 Correct 6 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 11 ms 460 KB Output is correct
52 Correct 10 ms 524 KB Output is correct
53 Correct 3 ms 460 KB Output is correct
54 Correct 2 ms 460 KB Output is correct
55 Correct 442 ms 660 KB Output is correct
56 Correct 454 ms 592 KB Output is correct
57 Correct 412 ms 652 KB Output is correct
58 Correct 420 ms 904 KB Output is correct
59 Correct 434 ms 572 KB Output is correct
60 Correct 435 ms 716 KB Output is correct
61 Correct 434 ms 580 KB Output is correct
62 Correct 431 ms 644 KB Output is correct
63 Correct 424 ms 768 KB Output is correct
64 Correct 2 ms 460 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Execution timed out 3093 ms 3240 KB Time limit exceeded
5 Halted 0 ms 0 KB -