oj.uz

답안 #417210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417210 2021-06-03T13:12:10 Z shenxy Event Hopping 2 (JOI21_event2) C++11
39 / 100
 586 ms 524292 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;
				}
			}
		}
		if (ans.size() >= K) {
			for (int i = 0; i < K; ++i) printf("%d\n", ans[i]);
		} else printf("-1");
	} 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:38:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |   if (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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 60 ms 8996 KB Output is correct
5 Correct 59 ms 8964 KB Output is correct
6 Correct 61 ms 8856 KB Output is correct
7 Correct 56 ms 8836 KB Output is correct
8 Correct 60 ms 8888 KB Output is correct
9 Correct 60 ms 8884 KB Output is correct
10 Correct 58 ms 8852 KB Output is correct
11 Correct 55 ms 8824 KB Output is correct
12 Correct 52 ms 6456 KB Output is correct
13 Correct 52 ms 6296 KB Output is correct
14 Correct 52 ms 6424 KB Output is correct
15 Correct 49 ms 6200 KB Output is correct
16 Correct 41 ms 3220 KB Output is correct
17 Correct 39 ms 3220 KB Output is correct
18 Correct 40 ms 3220 KB Output is correct
19 Correct 38 ms 2584 KB Output is correct
20 Correct 38 ms 2488 KB Output is correct
21 Correct 37 ms 2564 KB Output is correct
22 Correct 39 ms 2460 KB Output is correct
23 Correct 41 ms 2488 KB Output is correct
24 Correct 39 ms 2460 KB Output is correct
25 Correct 40 ms 2744 KB Output is correct
26 Correct 40 ms 2744 KB Output is correct
27 Correct 40 ms 2840 KB Output is correct
28 Correct 39 ms 8212 KB Output is correct
29 Correct 39 ms 6036 KB Output is correct
30 Correct 38 ms 3092 KB Output is correct
31 Correct 39 ms 2452 KB Output is correct
32 Correct 38 ms 2488 KB Output is correct
33 Correct 43 ms 2828 KB Output is correct
34 Correct 47 ms 6164 KB Output is correct
35 Correct 45 ms 6148 KB Output is correct
36 Correct 42 ms 6072 KB Output is correct
37 Correct 50 ms 5864 KB Output is correct
38 Correct 50 ms 5780 KB Output is correct
39 Correct 49 ms 5848 KB Output is correct
40 Correct 51 ms 5764 KB Output is correct
41 Correct 48 ms 5776 KB Output is correct
42 Correct 37 ms 2712 KB Output is correct
43 Correct 48 ms 3016 KB Output is correct
44 Correct 47 ms 3092 KB Output is correct
45 Correct 46 ms 3000 KB Output is correct
46 Correct 47 ms 2960 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 292 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 288 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 292 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 288 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 15 ms 436 KB Output is correct
29 Correct 11 ms 400 KB Output is correct
30 Correct 5 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 211 ms 424 KB Output is correct
34 Correct 199 ms 424 KB Output is correct
35 Correct 555 ms 600 KB Output is correct
36 Correct 548 ms 604 KB Output is correct
37 Correct 448 ms 576 KB Output is correct
38 Correct 565 ms 588 KB Output is correct
39 Correct 453 ms 588 KB Output is correct
40 Correct 446 ms 672 KB Output is correct
41 Correct 452 ms 568 KB Output is correct
42 Correct 562 ms 588 KB Output is correct
43 Correct 196 ms 492 KB Output is correct
44 Correct 143 ms 460 KB Output is correct
45 Correct 136 ms 460 KB Output is correct
46 Correct 586 ms 484 KB Output is correct
47 Correct 80 ms 332 KB Output is correct
48 Correct 33 ms 436 KB Output is correct
49 Correct 19 ms 332 KB Output is correct
50 Correct 572 ms 428 KB Output is correct
51 Correct 71 ms 420 KB Output is correct
52 Correct 32 ms 332 KB Output is correct
53 Correct 3 ms 332 KB Output is correct
54 Correct 496 ms 424 KB Output is correct
55 Correct 340 ms 588 KB Output is correct
56 Correct 345 ms 708 KB Output is correct
57 Correct 342 ms 604 KB Output is correct
58 Correct 346 ms 616 KB Output is correct
59 Correct 342 ms 620 KB Output is correct
60 Correct 349 ms 620 KB Output is correct
61 Correct 346 ms 596 KB Output is correct
62 Correct 347 ms 708 KB Output is correct
63 Correct 344 ms 612 KB Output is correct
64 Correct 341 ms 588 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 60 ms 8996 KB Output is correct
5 Correct 59 ms 8964 KB Output is correct
6 Correct 61 ms 8856 KB Output is correct
7 Correct 56 ms 8836 KB Output is correct
8 Correct 60 ms 8888 KB Output is correct
9 Correct 60 ms 8884 KB Output is correct
10 Correct 58 ms 8852 KB Output is correct
11 Correct 55 ms 8824 KB Output is correct
12 Correct 52 ms 6456 KB Output is correct
13 Correct 52 ms 6296 KB Output is correct
14 Correct 52 ms 6424 KB Output is correct
15 Correct 49 ms 6200 KB Output is correct
16 Correct 41 ms 3220 KB Output is correct
17 Correct 39 ms 3220 KB Output is correct
18 Correct 40 ms 3220 KB Output is correct
19 Correct 38 ms 2584 KB Output is correct
20 Correct 38 ms 2488 KB Output is correct
21 Correct 37 ms 2564 KB Output is correct
22 Correct 39 ms 2460 KB Output is correct
23 Correct 41 ms 2488 KB Output is correct
24 Correct 39 ms 2460 KB Output is correct
25 Correct 40 ms 2744 KB Output is correct
26 Correct 40 ms 2744 KB Output is correct
27 Correct 40 ms 2840 KB Output is correct
28 Correct 39 ms 8212 KB Output is correct
29 Correct 39 ms 6036 KB Output is correct
30 Correct 38 ms 3092 KB Output is correct
31 Correct 39 ms 2452 KB Output is correct
32 Correct 38 ms 2488 KB Output is correct
33 Correct 43 ms 2828 KB Output is correct
34 Correct 47 ms 6164 KB Output is correct
35 Correct 45 ms 6148 KB Output is correct
36 Correct 42 ms 6072 KB Output is correct
37 Correct 50 ms 5864 KB Output is correct
38 Correct 50 ms 5780 KB Output is correct
39 Correct 49 ms 5848 KB Output is correct
40 Correct 51 ms 5764 KB Output is correct
41 Correct 48 ms 5776 KB Output is correct
42 Correct 37 ms 2712 KB Output is correct
43 Correct 48 ms 3016 KB Output is correct
44 Correct 47 ms 3092 KB Output is correct
45 Correct 46 ms 3000 KB Output is correct
46 Correct 47 ms 2960 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 0 ms 292 KB Output is correct
51 Correct 1 ms 284 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 288 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 1 ms 284 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 0 ms 288 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 0 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 0 ms 204 KB Output is correct
74 Correct 15 ms 436 KB Output is correct
75 Correct 11 ms 400 KB Output is correct
76 Correct 5 ms 332 KB Output is correct
77 Correct 2 ms 332 KB Output is correct
78 Correct 2 ms 332 KB Output is correct
79 Correct 211 ms 424 KB Output is correct
80 Correct 199 ms 424 KB Output is correct
81 Correct 555 ms 600 KB Output is correct
82 Correct 548 ms 604 KB Output is correct
83 Correct 448 ms 576 KB Output is correct
84 Correct 565 ms 588 KB Output is correct
85 Correct 453 ms 588 KB Output is correct
86 Correct 446 ms 672 KB Output is correct
87 Correct 452 ms 568 KB Output is correct
88 Correct 562 ms 588 KB Output is correct
89 Correct 196 ms 492 KB Output is correct
90 Correct 143 ms 460 KB Output is correct
91 Correct 136 ms 460 KB Output is correct
92 Correct 586 ms 484 KB Output is correct
93 Correct 80 ms 332 KB Output is correct
94 Correct 33 ms 436 KB Output is correct
95 Correct 19 ms 332 KB Output is correct
96 Correct 572 ms 428 KB Output is correct
97 Correct 71 ms 420 KB Output is correct
98 Correct 32 ms 332 KB Output is correct
99 Correct 3 ms 332 KB Output is correct
100 Correct 496 ms 424 KB Output is correct
101 Correct 340 ms 588 KB Output is correct
102 Correct 345 ms 708 KB Output is correct
103 Correct 342 ms 604 KB Output is correct
104 Correct 346 ms 616 KB Output is correct
105 Correct 342 ms 620 KB Output is correct
106 Correct 349 ms 620 KB Output is correct
107 Correct 346 ms 596 KB Output is correct
108 Correct 347 ms 708 KB Output is correct
109 Correct 344 ms 612 KB Output is correct
110 Correct 341 ms 588 KB Output is correct
111 Runtime error 475 ms 524292 KB Execution killed with signal 9
112 Halted 0 ms 0 KB -