oj.uz

Submission #417208

# Submission time Handle Problem Language Result Execution time Memory
417208 2021-06-03T13:11:04 Z shenxy Event Hopping 2 (JOI21_event2) C++11
7 / 100
 71 ms 8728 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
int dptable[100000];
vector<ii> events;
int dp(int i) {
	if (i == events.size()) return 0;
	if (dptable[i] != -1) return dptable[i];
	return dptable[i] = max(dp(i + 1), dp(lower_bound(events.begin(), events.end(), ii(events[i].second, 0)) - events.begin()) + 1);
}
int main() {
	int N, K;
	scanf("%d %d", &N, &K);
	int L[N], R[N];
	for (int i = 0; i < N; ++i) scanf("%d %d", &L[i], &R[i]);
	if (N <= 3000) {
		vector<int> ans;
		bool can_use[N];
		fill_n(can_use, N, true);
		for (int i = 0; i < N; ++i) {
			if (!can_use[i]) continue;
			events.clear();
			events.push_back(ii(L[i], R[i]));
			for (int j = i + 1; j < N; ++j) {
				if (can_use[j] && (R[i] <= L[j] || R[j] <= L[i])) events.push_back(ii(L[j], R[j]));
			}
			sort(events.begin(), events.end());
			fill_n(dptable, events.size(), -1);
			if (dp(0) + ans.size() >= K) {
				ans.push_back(i + 1);
				for (int j = i + 1; j < N; ++j) {
					if (L[j] < R[i] && L[i] < R[j]) can_use[j] = false;
				}
			}
		}
		for (int i = 0; i < K; ++i) printf("%d\n", ans[i]);
	} else {
		for (int i = 0; i < N; ++i) events.push_back(ii(L[i], R[i]));
		fill_n(dptable, events.size(), -1);
		if (dp(0) >= K) {
			int cur = 0, ptr = 0;
			while (cur < K) {
				while (cur + dp(lower_bound(events.begin(), events.end(), ii(events[ptr].second, 0)) - events.begin()) + 1 < K) ++ptr;
				printf("%d\n", ptr + 1);
				ptr = lower_bound(events.begin(), events.end(), ii(events[ptr].second, 0)) - events.begin(), ++cur;
			}
		} else printf("-1");
	}
	return 0;
}

Compilation message

event2.cpp: In function 'int dp(int)':
event2.cpp:9:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  if (i == events.size()) return 0;
      |      ~~^~~~~~~~~~~~~~~~
event2.cpp: In function 'int main()':
event2.cpp:31:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |    if (dp(0) + ans.size() >= K) {
      |        ~~~~~~~~~~~~~~~~~~~^~~~
event2.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  scanf("%d %d", &N, &K);
      |  ~~~~~^~~~~~~~~~~~~~~~~
event2.cpp:17:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |  for (int i = 0; i < N; ++i) scanf("%d %d", &L[i], &R[i]);
      |                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.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 0 ms 204 KB Output is correct
4 Correct 60 ms 8728 KB Output is correct
5 Correct 59 ms 8592 KB Output is correct
6 Correct 59 ms 8596 KB Output is correct
7 Correct 58 ms 8500 KB Output is correct
8 Correct 61 ms 8700 KB Output is correct
9 Correct 58 ms 8588 KB Output is correct
10 Correct 61 ms 8632 KB Output is correct
11 Correct 56 ms 8568 KB Output is correct
12 Correct 52 ms 6164 KB Output is correct
13 Correct 52 ms 6152 KB Output is correct
14 Correct 52 ms 6200 KB Output is correct
15 Correct 50 ms 6164 KB Output is correct
16 Correct 40 ms 3096 KB Output is correct
17 Correct 41 ms 3096 KB Output is correct
18 Correct 39 ms 3080 KB Output is correct
19 Correct 37 ms 2368 KB Output is correct
20 Correct 38 ms 2328 KB Output is correct
21 Correct 38 ms 2324 KB Output is correct
22 Correct 39 ms 2328 KB Output is correct
23 Correct 45 ms 2336 KB Output is correct
24 Correct 38 ms 2336 KB Output is correct
25 Correct 47 ms 2708 KB Output is correct
26 Correct 40 ms 2616 KB Output is correct
27 Correct 40 ms 2708 KB Output is correct
28 Correct 40 ms 8060 KB Output is correct
29 Correct 39 ms 5816 KB Output is correct
30 Correct 36 ms 2996 KB Output is correct
31 Correct 37 ms 2436 KB Output is correct
32 Correct 39 ms 2368 KB Output is correct
33 Correct 40 ms 2708 KB Output is correct
34 Correct 46 ms 6036 KB Output is correct
35 Correct 45 ms 6004 KB Output is correct
36 Correct 41 ms 5936 KB Output is correct
37 Correct 50 ms 5744 KB Output is correct
38 Correct 49 ms 5696 KB Output is correct
39 Correct 48 ms 5688 KB Output is correct
40 Correct 48 ms 5716 KB Output is correct
41 Correct 47 ms 5688 KB Output is correct
42 Correct 37 ms 2588 KB Output is correct
43 Correct 71 ms 2940 KB Output is correct
44 Correct 47 ms 2968 KB Output is correct
45 Correct 61 ms 2836 KB Output is correct
46 Correct 47 ms 2840 KB Output is correct

Subtask #2
0 / 1.0

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

Subtask #3
0 / 31.0

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

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 0 ms 204 KB Output is correct
4 Correct 60 ms 8728 KB Output is correct
5 Correct 59 ms 8592 KB Output is correct
6 Correct 59 ms 8596 KB Output is correct
7 Correct 58 ms 8500 KB Output is correct
8 Correct 61 ms 8700 KB Output is correct
9 Correct 58 ms 8588 KB Output is correct
10 Correct 61 ms 8632 KB Output is correct
11 Correct 56 ms 8568 KB Output is correct
12 Correct 52 ms 6164 KB Output is correct
13 Correct 52 ms 6152 KB Output is correct
14 Correct 52 ms 6200 KB Output is correct
15 Correct 50 ms 6164 KB Output is correct
16 Correct 40 ms 3096 KB Output is correct
17 Correct 41 ms 3096 KB Output is correct
18 Correct 39 ms 3080 KB Output is correct
19 Correct 37 ms 2368 KB Output is correct
20 Correct 38 ms 2328 KB Output is correct
21 Correct 38 ms 2324 KB Output is correct
22 Correct 39 ms 2328 KB Output is correct
23 Correct 45 ms 2336 KB Output is correct
24 Correct 38 ms 2336 KB Output is correct
25 Correct 47 ms 2708 KB Output is correct
26 Correct 40 ms 2616 KB Output is correct
27 Correct 40 ms 2708 KB Output is correct
28 Correct 40 ms 8060 KB Output is correct
29 Correct 39 ms 5816 KB Output is correct
30 Correct 36 ms 2996 KB Output is correct
31 Correct 37 ms 2436 KB Output is correct
32 Correct 39 ms 2368 KB Output is correct
33 Correct 40 ms 2708 KB Output is correct
34 Correct 46 ms 6036 KB Output is correct
35 Correct 45 ms 6004 KB Output is correct
36 Correct 41 ms 5936 KB Output is correct
37 Correct 50 ms 5744 KB Output is correct
38 Correct 49 ms 5696 KB Output is correct
39 Correct 48 ms 5688 KB Output is correct
40 Correct 48 ms 5716 KB Output is correct
41 Correct 47 ms 5688 KB Output is correct
42 Correct 37 ms 2588 KB Output is correct
43 Correct 71 ms 2940 KB Output is correct
44 Correct 47 ms 2968 KB Output is correct
45 Correct 61 ms 2836 KB Output is correct
46 Correct 47 ms 2840 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Runtime error 1 ms 332 KB Execution killed with signal 11
49 Halted 0 ms 0 KB -