oj.uz

Submission #966817

# Submission time Handle Problem Language Result Execution time Memory
966817 2024-04-20T12:13:13 Z Trisanu_Das Event Hopping 2 (JOI21_event2) C++17
32 / 100
 110 ms 1372 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=6e3+5;
const int inf=1e9;
int n, k;
int l[mxn], r[mxn];
 
 
bool blocked[mxn] = {};
vector<int> ord;
vector<int> en[mxn];
 
int ans[mxn] = {};
 
int get() {
	int dp[mxn] = {};
	for(int i = 1; i < mxn; i++) {
		dp[i] = dp[i - 1];
		for(int j : en[i]) if(!blocked[j]) dp[i] = max(dp[i], dp[l[j]] + 1);
	} 
    return dp[mxn - 1];
}

 
int main() {
	cin >> n >> k;
	vector<int> v;
	for(int i = 1; i <= n; i++) {
		cin >> l[i] >> r[i];
		v.push_back(l[i]);
		v.push_back(r[i]);
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()), v.end());
	for(int i = 1; i <= n; i++) {
		l[i] = lower_bound(v.begin(), v.end(), l[i]) - v.begin() + 1;
		r[i] = lower_bound(v.begin(), v.end(), r[i]) - v.begin() + 1;
		en[r[i]].push_back(i);
	}
	int needed = k;
	for(int i = 1; i <= n; i++) {
		if(blocked[i]) continue;
		if(needed <= 0) break;
		bool pb[n + 1];
		for(int j = 1; j <= n; j++) pb[j] = blocked[j];
		blocked[i] = 1;
		for(int j = 1; j <= n; j++) if(!(r[j] <= l[i] || l[j] >= r[i])) blocked[j] = 1;
		if(get() >= needed - 1) {
			ans[i] = 1;
			needed--;
			continue;
        }else for(int j = 1; j <= n; j++) blocked[j] = pb[j];
	}
	if(needed) cout << -1 << '\n';
	else for(int i = 1; i <= n; i++) if(ans[i]) cout << i << '\n';
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Runtime error 5 ms 1372 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 616 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 608 KB Output is correct
27 Correct 1 ms 608 KB Output is correct
28 Correct 9 ms 1016 KB Output is correct
29 Correct 9 ms 604 KB Output is correct
30 Correct 6 ms 760 KB Output is correct
31 Correct 4 ms 600 KB Output is correct
32 Correct 3 ms 604 KB Output is correct
33 Correct 101 ms 796 KB Output is correct
34 Correct 110 ms 800 KB Output is correct
35 Correct 66 ms 608 KB Output is correct
36 Correct 84 ms 856 KB Output is correct
37 Correct 46 ms 600 KB Output is correct
38 Correct 77 ms 800 KB Output is correct
39 Correct 70 ms 808 KB Output is correct
40 Correct 54 ms 816 KB Output is correct
41 Correct 46 ms 816 KB Output is correct
42 Correct 76 ms 856 KB Output is correct
43 Correct 32 ms 852 KB Output is correct
44 Correct 26 ms 600 KB Output is correct
45 Correct 21 ms 604 KB Output is correct
46 Correct 74 ms 604 KB Output is correct
47 Correct 17 ms 604 KB Output is correct
48 Correct 12 ms 604 KB Output is correct
49 Correct 7 ms 604 KB Output is correct
50 Correct 80 ms 796 KB Output is correct
51 Correct 26 ms 604 KB Output is correct
52 Correct 17 ms 604 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 106 ms 604 KB Output is correct
55 Correct 51 ms 808 KB Output is correct
56 Correct 50 ms 824 KB Output is correct
57 Correct 50 ms 604 KB Output is correct
58 Correct 49 ms 600 KB Output is correct
59 Correct 57 ms 824 KB Output is correct
60 Correct 50 ms 604 KB Output is correct
61 Correct 48 ms 816 KB Output is correct
62 Correct 47 ms 600 KB Output is correct
63 Correct 52 ms 804 KB Output is correct
64 Correct 70 ms 604 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Runtime error 5 ms 1372 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -