oj.uz

답안 #398706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398706 2021-05-04T18:10:42 Z ChrisT Event Hopping 2 (JOI21_event2) C++17
100 / 100
 231 ms 25964 KB 
#include <bits/stdc++.h>
using namespace std;
const int MN = 2e5 + 5, MOD = 1e9 + 7, LOG = 17;
int dp[MN], bit[MN], to[MN], p[MN][LOG];
vector<int> withDp[MN];
void update (int i, int v) {
	for (;i<MN;i+=i&-i)
		bit[i] = max(bit[i],v);
}
int query (int i) {
	int ret = 0;
	for (;i>0;i^=i&-i)
		ret = max(ret,bit[i]);
	return ret;
}
vector<int> xs;
int getx (int x) {return lower_bound(xs.begin(),xs.end(),x) - xs.begin() + 1;}
int main () {
	int n,k; scanf ("%d %d",&n,&k);
	vector<array<int,3>> segs(n+1);
	vector<array<int,2>> og(n+1);
	for (int i = 1; i <= n; i++) {
		auto &[l,r,idx] = segs[i];
		idx = i;
		scanf ("%d %d",&l,&r); og[i] = {l,r};
		xs.push_back(l); xs.push_back(r);
	}
	xs.push_back(0); xs.push_back(MOD);
	segs.push_back({0,0,n+1}); segs.push_back({MOD,MOD,n+2});
	n += 2;
	sort(xs.begin(),xs.end()); xs.erase(unique(xs.begin(),xs.end()),xs.end());
	sort(segs.begin()+1,segs.end());
	for (int i = 1; i <= n; i++) {
		auto &[l,r,idx] = segs[i];
		l = getx(l); r = getx(r); to[idx] = i;
		dp[i] = query(l) + 1;
		update(r,dp[i]);
		withDp[dp[i]].push_back(i);
	}
	int mx = *max_element(dp+1,dp+1+n);
	if (mx - 2 < k) return !printf ("-1\n");
	auto get = [&] (int v, int x) { //l[i] >= x
		int low = 0, high = (int)withDp[v].size() - 1, mid, ans = -1;
		while (low <= high) {
			mid = (low + high) / 2;
			if (segs[withDp[v][mid]][0] >= x) high = (ans = mid) - 1;
			else low = mid + 1;
		}
		return ~ans ? withDp[v][ans] : 0;
	};
	for (int v = mx-1; v >= 1; v--) {
		int mn = 1e9;
		for (int j = (int)withDp[v].size() - 1; j >= 0; j--) {
			int i = withDp[v][j];
			mn = min(mn,segs[i][1]);
			p[i][0] = get(v+1,mn);
			for (int j = 1; j < LOG; j++)
				p[i][j] = p[p[i][j-1]][j-1];
		}
	}
	auto pathLength = [&] (int bef, int j) {
		int i = lower_bound(segs.begin()+1,segs.end(),array<int,3>{segs[bef][1],-MOD,-MOD}) - segs.begin();
		if (dp[i] == dp[j]) return 2;
		int ret = dp[j] - dp[i];
		for (int k = 0; k < LOG; k++) 
			if (ret >> k & 1) 
				i = p[i][k];
		return ret + 1 + (i > 0 && i <= j);
	};
	set<int> have = {1,n};
	int cur = dp[n] - 2;
	for (int j = 1; j <= n-2 && (int)have.size() < k + 2; j++) {
		int i = to[j];
		auto it = have.lower_bound(i);
		int lst = *prev(it), nxt = *it;
		if (segs[lst][1] > segs[i][0] || segs[i][1] > segs[nxt][0]) continue;
		int oldGet = pathLength(lst,nxt);
		int newGet = pathLength(lst,i) + pathLength(i,nxt) - 1;
		if (cur - oldGet + newGet >= k) { //success
			printf ("%d\n",j);
			have.insert(i);
			cur += newGet - oldGet;
		}
	}
	return 0;
}

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:19:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |  int n,k; scanf ("%d %d",&n,&k);
      |           ~~~~~~^~~~~~~~~~~~~~~
event2.cpp:25:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |   scanf ("%d %d",&l,&r); og[i] = {l,r};
      |   ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4980 KB Output is correct
3 Correct 3 ms 4980 KB Output is correct
4 Correct 158 ms 25784 KB Output is correct
5 Correct 154 ms 25404 KB Output is correct
6 Correct 149 ms 25124 KB Output is correct
7 Correct 142 ms 24740 KB Output is correct
8 Correct 157 ms 25708 KB Output is correct
9 Correct 155 ms 25376 KB Output is correct
10 Correct 149 ms 25244 KB Output is correct
11 Correct 145 ms 24864 KB Output is correct
12 Correct 131 ms 22688 KB Output is correct
13 Correct 128 ms 22564 KB Output is correct
14 Correct 128 ms 22368 KB Output is correct
15 Correct 123 ms 22128 KB Output is correct
16 Correct 98 ms 19284 KB Output is correct
17 Correct 95 ms 19168 KB Output is correct
18 Correct 92 ms 19108 KB Output is correct
19 Correct 87 ms 18544 KB Output is correct
20 Correct 85 ms 18464 KB Output is correct
21 Correct 84 ms 18548 KB Output is correct
22 Correct 87 ms 18564 KB Output is correct
23 Correct 84 ms 18468 KB Output is correct
24 Correct 84 ms 18544 KB Output is correct
25 Correct 88 ms 18376 KB Output is correct
26 Correct 89 ms 18340 KB Output is correct
27 Correct 88 ms 18376 KB Output is correct
28 Correct 68 ms 14132 KB Output is correct
29 Correct 67 ms 13052 KB Output is correct
30 Correct 66 ms 11908 KB Output is correct
31 Correct 67 ms 11732 KB Output is correct
32 Correct 71 ms 11944 KB Output is correct
33 Correct 74 ms 11688 KB Output is correct
34 Correct 109 ms 21536 KB Output is correct
35 Correct 102 ms 20940 KB Output is correct
36 Correct 90 ms 20184 KB Output is correct
37 Correct 127 ms 22124 KB Output is correct
38 Correct 123 ms 21924 KB Output is correct
39 Correct 124 ms 21836 KB Output is correct
40 Correct 120 ms 21696 KB Output is correct
41 Correct 121 ms 21728 KB Output is correct
42 Correct 77 ms 12852 KB Output is correct
43 Correct 139 ms 21908 KB Output is correct
44 Correct 135 ms 21872 KB Output is correct
45 Correct 131 ms 21792 KB Output is correct
46 Correct 132 ms 21584 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5116 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 5008 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5008 KB Output is correct
23 Correct 3 ms 5004 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5116 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 5008 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5008 KB Output is correct
23 Correct 3 ms 5004 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 6 ms 5452 KB Output is correct
29 Correct 6 ms 5452 KB Output is correct
30 Correct 6 ms 5452 KB Output is correct
31 Correct 6 ms 5452 KB Output is correct
32 Correct 6 ms 5388 KB Output is correct
33 Correct 6 ms 5196 KB Output is correct
34 Correct 6 ms 5196 KB Output is correct
35 Correct 8 ms 5584 KB Output is correct
36 Correct 8 ms 5580 KB Output is correct
37 Correct 9 ms 5580 KB Output is correct
38 Correct 6 ms 5196 KB Output is correct
39 Correct 8 ms 5580 KB Output is correct
40 Correct 8 ms 5520 KB Output is correct
41 Correct 8 ms 5524 KB Output is correct
42 Correct 6 ms 5196 KB Output is correct
43 Correct 7 ms 5452 KB Output is correct
44 Correct 8 ms 5452 KB Output is correct
45 Correct 7 ms 5452 KB Output is correct
46 Correct 5 ms 5196 KB Output is correct
47 Correct 6 ms 5444 KB Output is correct
48 Correct 6 ms 5452 KB Output is correct
49 Correct 6 ms 5452 KB Output is correct
50 Correct 6 ms 5264 KB Output is correct
51 Correct 7 ms 5452 KB Output is correct
52 Correct 6 ms 5452 KB Output is correct
53 Correct 6 ms 5452 KB Output is correct
54 Correct 5 ms 5272 KB Output is correct
55 Correct 7 ms 5596 KB Output is correct
56 Correct 8 ms 5572 KB Output is correct
57 Correct 9 ms 5580 KB Output is correct
58 Correct 7 ms 5580 KB Output is correct
59 Correct 7 ms 5580 KB Output is correct
60 Correct 7 ms 5580 KB Output is correct
61 Correct 7 ms 5660 KB Output is correct
62 Correct 8 ms 5652 KB Output is correct
63 Correct 7 ms 5580 KB Output is correct
64 Correct 5 ms 5324 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4980 KB Output is correct
3 Correct 3 ms 4980 KB Output is correct
4 Correct 158 ms 25784 KB Output is correct
5 Correct 154 ms 25404 KB Output is correct
6 Correct 149 ms 25124 KB Output is correct
7 Correct 142 ms 24740 KB Output is correct
8 Correct 157 ms 25708 KB Output is correct
9 Correct 155 ms 25376 KB Output is correct
10 Correct 149 ms 25244 KB Output is correct
11 Correct 145 ms 24864 KB Output is correct
12 Correct 131 ms 22688 KB Output is correct
13 Correct 128 ms 22564 KB Output is correct
14 Correct 128 ms 22368 KB Output is correct
15 Correct 123 ms 22128 KB Output is correct
16 Correct 98 ms 19284 KB Output is correct
17 Correct 95 ms 19168 KB Output is correct
18 Correct 92 ms 19108 KB Output is correct
19 Correct 87 ms 18544 KB Output is correct
20 Correct 85 ms 18464 KB Output is correct
21 Correct 84 ms 18548 KB Output is correct
22 Correct 87 ms 18564 KB Output is correct
23 Correct 84 ms 18468 KB Output is correct
24 Correct 84 ms 18544 KB Output is correct
25 Correct 88 ms 18376 KB Output is correct
26 Correct 89 ms 18340 KB Output is correct
27 Correct 88 ms 18376 KB Output is correct
28 Correct 68 ms 14132 KB Output is correct
29 Correct 67 ms 13052 KB Output is correct
30 Correct 66 ms 11908 KB Output is correct
31 Correct 67 ms 11732 KB Output is correct
32 Correct 71 ms 11944 KB Output is correct
33 Correct 74 ms 11688 KB Output is correct
34 Correct 109 ms 21536 KB Output is correct
35 Correct 102 ms 20940 KB Output is correct
36 Correct 90 ms 20184 KB Output is correct
37 Correct 127 ms 22124 KB Output is correct
38 Correct 123 ms 21924 KB Output is correct
39 Correct 124 ms 21836 KB Output is correct
40 Correct 120 ms 21696 KB Output is correct
41 Correct 121 ms 21728 KB Output is correct
42 Correct 77 ms 12852 KB Output is correct
43 Correct 139 ms 21908 KB Output is correct
44 Correct 135 ms 21872 KB Output is correct
45 Correct 131 ms 21792 KB Output is correct
46 Correct 132 ms 21584 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 3 ms 4940 KB Output is correct
49 Correct 3 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 4 ms 5116 KB Output is correct
53 Correct 3 ms 4940 KB Output is correct
54 Correct 3 ms 4940 KB Output is correct
55 Correct 4 ms 4940 KB Output is correct
56 Correct 3 ms 4940 KB Output is correct
57 Correct 3 ms 4940 KB Output is correct
58 Correct 3 ms 4940 KB Output is correct
59 Correct 3 ms 4940 KB Output is correct
60 Correct 3 ms 4940 KB Output is correct
61 Correct 4 ms 4940 KB Output is correct
62 Correct 3 ms 4940 KB Output is correct
63 Correct 3 ms 5008 KB Output is correct
64 Correct 3 ms 4940 KB Output is correct
65 Correct 3 ms 4940 KB Output is correct
66 Correct 3 ms 4940 KB Output is correct
67 Correct 3 ms 4940 KB Output is correct
68 Correct 3 ms 5008 KB Output is correct
69 Correct 3 ms 5004 KB Output is correct
70 Correct 3 ms 4940 KB Output is correct
71 Correct 3 ms 4940 KB Output is correct
72 Correct 3 ms 4940 KB Output is correct
73 Correct 3 ms 4940 KB Output is correct
74 Correct 6 ms 5452 KB Output is correct
75 Correct 6 ms 5452 KB Output is correct
76 Correct 6 ms 5452 KB Output is correct
77 Correct 6 ms 5452 KB Output is correct
78 Correct 6 ms 5388 KB Output is correct
79 Correct 6 ms 5196 KB Output is correct
80 Correct 6 ms 5196 KB Output is correct
81 Correct 8 ms 5584 KB Output is correct
82 Correct 8 ms 5580 KB Output is correct
83 Correct 9 ms 5580 KB Output is correct
84 Correct 6 ms 5196 KB Output is correct
85 Correct 8 ms 5580 KB Output is correct
86 Correct 8 ms 5520 KB Output is correct
87 Correct 8 ms 5524 KB Output is correct
88 Correct 6 ms 5196 KB Output is correct
89 Correct 7 ms 5452 KB Output is correct
90 Correct 8 ms 5452 KB Output is correct
91 Correct 7 ms 5452 KB Output is correct
92 Correct 5 ms 5196 KB Output is correct
93 Correct 6 ms 5444 KB Output is correct
94 Correct 6 ms 5452 KB Output is correct
95 Correct 6 ms 5452 KB Output is correct
96 Correct 6 ms 5264 KB Output is correct
97 Correct 7 ms 5452 KB Output is correct
98 Correct 6 ms 5452 KB Output is correct
99 Correct 6 ms 5452 KB Output is correct
100 Correct 5 ms 5272 KB Output is correct
101 Correct 7 ms 5596 KB Output is correct
102 Correct 8 ms 5572 KB Output is correct
103 Correct 9 ms 5580 KB Output is correct
104 Correct 7 ms 5580 KB Output is correct
105 Correct 7 ms 5580 KB Output is correct
106 Correct 7 ms 5580 KB Output is correct
107 Correct 7 ms 5660 KB Output is correct
108 Correct 8 ms 5652 KB Output is correct
109 Correct 7 ms 5580 KB Output is correct
110 Correct 5 ms 5324 KB Output is correct
111 Correct 112 ms 18420 KB Output is correct
112 Correct 119 ms 18464 KB Output is correct
113 Correct 116 ms 18460 KB Output is correct
114 Correct 109 ms 18468 KB Output is correct
115 Correct 104 ms 18384 KB Output is correct
116 Correct 93 ms 11700 KB Output is correct
117 Correct 92 ms 11804 KB Output is correct
118 Correct 231 ms 25640 KB Output is correct
119 Correct 213 ms 25212 KB Output is correct
120 Correct 180 ms 22112 KB Output is correct
121 Correct 91 ms 13012 KB Output is correct
122 Correct 188 ms 22680 KB Output is correct
123 Correct 184 ms 22436 KB Output is correct
124 Correct 191 ms 22048 KB Output is correct
125 Correct 95 ms 12996 KB Output is correct
126 Correct 141 ms 19272 KB Output is correct
127 Correct 131 ms 19184 KB Output is correct
128 Correct 124 ms 19144 KB Output is correct
129 Correct 85 ms 11916 KB Output is correct
130 Correct 121 ms 18528 KB Output is correct
131 Correct 112 ms 18464 KB Output is correct
132 Correct 111 ms 18496 KB Output is correct
133 Correct 88 ms 11760 KB Output is correct
134 Correct 112 ms 18468 KB Output is correct
135 Correct 109 ms 18500 KB Output is correct
136 Correct 106 ms 18592 KB Output is correct
137 Correct 83 ms 11904 KB Output is correct
138 Correct 108 ms 18396 KB Output is correct
139 Correct 104 ms 18340 KB Output is correct
140 Correct 102 ms 18308 KB Output is correct
141 Correct 85 ms 11764 KB Output is correct
142 Correct 166 ms 25888 KB Output is correct
143 Correct 167 ms 25928 KB Output is correct
144 Correct 171 ms 25888 KB Output is correct
145 Correct 151 ms 25816 KB Output is correct
146 Correct 151 ms 25760 KB Output is correct
147 Correct 151 ms 25584 KB Output is correct
148 Correct 145 ms 25504 KB Output is correct
149 Correct 146 ms 25464 KB Output is correct
150 Correct 141 ms 25276 KB Output is correct
151 Correct 137 ms 24760 KB Output is correct
152 Correct 65 ms 13984 KB Output is correct
153 Correct 153 ms 25964 KB Output is correct
154 Correct 154 ms 25888 KB Output is correct
155 Correct 147 ms 25684 KB Output is correct
156 Correct 146 ms 25616 KB Output is correct
157 Correct 144 ms 25424 KB Output is correct
158 Correct 143 ms 25380 KB Output is correct
159 Correct 137 ms 24820 KB Output is correct
160 Correct 68 ms 14004 KB Output is correct
161 Correct 176 ms 21892 KB Output is correct
162 Correct 170 ms 21812 KB Output is correct
163 Correct 160 ms 21652 KB Output is correct
164 Correct 158 ms 21596 KB Output is correct
165 Correct 155 ms 21496 KB Output is correct
166 Correct 75 ms 12756 KB Output is correct
167 Correct 132 ms 21908 KB Output is correct
168 Correct 129 ms 21844 KB Output is correct
169 Correct 131 ms 21892 KB Output is correct
170 Correct 128 ms 21636 KB Output is correct
171 Correct 122 ms 21356 KB Output is correct
172 Correct 123 ms 22128 KB Output is correct
173 Correct 186 ms 21720 KB Output is correct
174 Correct 179 ms 21664 KB Output is correct
175 Correct 179 ms 21748 KB Output is correct
176 Correct 158 ms 21148 KB Output is correct