oj.uz

Submission #976141

# Submission time Handle Problem Language Result Execution time Memory
976141 2024-05-06T08:33:56 Z happy_node Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 32356 KB 
#include <bits/stdc++.h>
using namespace std; 

const int MX=4e5+5, inf=1e9;

int N,K;

vector<pair<int,int>> v;
map<int,int> id;
vector<pair<int,int>> cl[MX];

int dp[MX];
bool used[MX];

vector<int> ans;

int M;

set<int> st;

bool ok(int l, int r) {
	auto it=st.lower_bound(l);
	if(it==st.end() || *it>=r) return true;
	return false;
}

int f(int x) {
	vector<pair<int,int>> cur;

	auto [l,r]=v[x];
	if(!ok(l,r)) return -1e9;

	for(int k=l;k<r;k++) st.insert(k);
	cur.push_back({l,r});

	for(int k=1;k<=2*N;k++) {
		for(auto [j,id]:cl[k]) {
			if(ok(j,k)) {
				cur.push_back({j,k});
				for(int z=j;z<k;z++) st.insert(z);
			}
		}
	}

	for(auto [l,r]:cur) {
		for(int k=l;k<r;k++) st.erase(k);
	}

	return cur.size();
}

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin>>N>>K;

	for(int i=0;i<N;i++) {
		int l,r;
		cin>>l>>r;
		v.push_back({l,r});
		id[l]=0;
		id[r]=0;
	}

	int z=1;
	for(auto &[x,y]:id) y=z++;

	for(auto &[l,r]:v) {
		l=id[l];
		r=id[r];
	}
	for(int i=0;i<N;i++) {
		auto [l,r]=v[i];
		cl[r].push_back({l,i});
	}

	for(int i=0;i<N;i++) {
		if(ans.size()==K) break;
		if(f(i)+(int)ans.size()>=K) {
			auto [l,r]=v[i];
			for(int k=l;k<r;k++) st.insert(k);
			ans.push_back(i);
		}
	}

	if(ans.size()<K) {
		cout<<-1<<'\n';
		return 0;
	}
	
	sort(ans.begin(),ans.end());
	for(auto x:ans) {
		cout<<x+1<<" ";
	}
	cout<<'\n';
}

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:78:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |   if(ans.size()==K) break;
      |      ~~~~~~~~~~^~~
event2.cpp:86:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |  if(ans.size()<K) {
      |     ~~~~~~~~~~^~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11608 KB Output is correct
2 Correct 3 ms 11864 KB Output is correct
3 Correct 3 ms 11608 KB Output is correct
4 Execution timed out 3101 ms 32356 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11608 KB Output is correct
2 Correct 3 ms 11612 KB Output is correct
3 Correct 3 ms 11864 KB Output is correct
4 Correct 3 ms 11612 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 3 ms 11640 KB Output is correct
8 Correct 3 ms 11608 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11612 KB Output is correct
11 Correct 3 ms 11612 KB Output is correct
12 Correct 5 ms 11612 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 3 ms 11612 KB Output is correct
15 Correct 3 ms 11612 KB Output is correct
16 Correct 3 ms 11608 KB Output is correct
17 Correct 3 ms 11612 KB Output is correct
18 Correct 3 ms 11608 KB Output is correct
19 Correct 3 ms 11612 KB Output is correct
20 Correct 3 ms 11612 KB Output is correct
21 Correct 3 ms 11612 KB Output is correct
22 Correct 3 ms 11612 KB Output is correct
23 Correct 3 ms 11612 KB Output is correct
24 Correct 3 ms 11612 KB Output is correct
25 Correct 3 ms 11612 KB Output is correct
26 Correct 3 ms 11612 KB Output is correct
27 Correct 3 ms 11612 KB Output is correct
28 Correct 109 ms 12348 KB Output is correct
29 Correct 96 ms 12292 KB Output is correct
30 Correct 47 ms 12124 KB Output is correct
31 Correct 15 ms 12216 KB Output is correct
32 Correct 11 ms 12124 KB Output is correct
33 Correct 1868 ms 12368 KB Output is correct
34 Correct 1814 ms 12356 KB Output is correct
35 Correct 1039 ms 12276 KB Output is correct
36 Correct 987 ms 12368 KB Output is correct
37 Correct 795 ms 12292 KB Output is correct
38 Correct 1265 ms 12372 KB Output is correct
39 Correct 929 ms 12120 KB Output is correct
40 Correct 853 ms 12368 KB Output is correct
41 Correct 795 ms 12372 KB Output is correct
42 Correct 1245 ms 12508 KB Output is correct
43 Correct 530 ms 12120 KB Output is correct
44 Correct 375 ms 12576 KB Output is correct
45 Correct 320 ms 12268 KB Output is correct
46 Correct 1793 ms 12268 KB Output is correct
47 Correct 300 ms 12320 KB Output is correct
48 Correct 144 ms 12328 KB Output is correct
49 Correct 61 ms 12124 KB Output is correct
50 Correct 2077 ms 12324 KB Output is correct
51 Correct 393 ms 12344 KB Output is correct
52 Correct 235 ms 12124 KB Output is correct
53 Correct 27 ms 12276 KB Output is correct
54 Correct 2270 ms 12372 KB Output is correct
55 Correct 835 ms 12140 KB Output is correct
56 Correct 847 ms 12136 KB Output is correct
57 Correct 848 ms 12368 KB Output is correct
58 Correct 845 ms 12400 KB Output is correct
59 Correct 832 ms 12372 KB Output is correct
60 Correct 810 ms 12368 KB Output is correct
61 Correct 802 ms 12144 KB Output is correct
62 Correct 795 ms 12368 KB Output is correct
63 Correct 733 ms 12144 KB Output is correct
64 Correct 1143 ms 12128 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11608 KB Output is correct
2 Correct 3 ms 11864 KB Output is correct
3 Correct 3 ms 11608 KB Output is correct
4 Execution timed out 3101 ms 32356 KB Time limit exceeded
5 Halted 0 ms 0 KB -