oj.uz

답안 #804923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
804923 2023-08-03T11:56:43 Z flappybird Cultivation (JOI17_cultivation) C++14
100 / 100
 1656 ms 3916 KB 
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 660
#define MAXS 20
#define INF 20000000000020
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
ll H, W;
int N;
pll arr[MAX];
ll ans = INF;
int st[MAX * 2], en[MAX * 2];
int U[MAX], D[MAX], UD[MAX];
int A[MAX][MAX], B[MAX][MAX], C[MAX][MAX];
typedef pair<ll, int> pli;
pii up[MAX * 2], down[MAX * 2], su[MAX * 2];
ll ys[MAX * 2];
bool test(ll d) {
	if (d <= 0) return false;
	int i, j;
	int p1, p2;
	p1 = p2 = 1;
	int X = 0;
	while (p1 <= N || p2 <= N) {
		ll x;
		if (p1 > N) x = arr[p2].second + d;
		else if (p2 > N) x = arr[p1].second;
		else x = min(arr[p1].second, arr[p2].second + d);
		st[X] = en[X] = 0;
		U[X] = D[X] = UD[X] = 0;
		ys[X++] = x;
		while (p1 <= N && arr[p1].second == x) p1++, st[X - 1]++;
		while (p2 <= N && arr[p2].second + d == x) p2++, en[X - 1]++;
	}
	int il, ir;
	il = ir = 0;
	for (i = 0; i < X; i++) {
		ir += st[i];
		il += en[i];
		if (il == ir) {
			UD[i] = H * 2 + 10;
			continue;
		}
		U[i] = A[il + 1][ir];
		D[i] = B[il + 1][ir];
		UD[i] = C[il + 1][ir];
	}
	int ul, dl, udl;
	int ur, dr, udr;
	ul = dl = udl = 0;
	ur = dr = udr = 0;
	int mn = H * 2 + 10;
	j = 0;
	for (i = 0; i < X - 1; i++) {
		while (ul != ur && up[ur].first <= U[i]) ur--;
		up[++ur] = pli(U[i], i);
		while (dl != dr && down[dr].first <= D[i]) dr--;
		down[++dr] = pli(D[i], i);
		while (udl != udr && su[udr].first <= UD[i]) udr--;
		su[++udr] = pli(UD[i], i);
		while (j + 1 <= i && ys[i + 1] - ys[j + 1] >= W) j++;
		while (ul != ur && up[ul + 1].second < j) ul++;
		while (dl != dr && down[dl + 1].second < j) dl++;
		while (udl != udr && su[udl + 1].second < j) udl++;
		if (ys[i + 1] - ys[j] >= W) mn = min(mn, max(up[ul + 1].first + down[dl + 1].first, su[udl + 1].first));
	}
	if (mn >= H * 2) return false;
	ans = min(ans, mn + d - 1);
	return true;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> H >> W >> N;
	int i, j, k;
	vector<ll> ls;
	ls.push_back(W);
	for (i = 1; i <= N; i++) cin >> arr[i].first >> arr[i].second;
	for (i = 1; i <= N; i++) {
		for (j = i + 1; j <= N; j++) ls.push_back(W - abs(arr[j].second - arr[i].second));
		for (j = i + 1; j <= N; j++) ls.push_back(abs(arr[j].second - arr[i].second));
		for (j = i + 1; j <= N; j++) ls.push_back(abs(arr[j].second - arr[i].second) + W);
		ls.push_back(arr[i].second);
		ls.push_back(W - arr[i].second + 1);
	}
	sort(arr + 1, arr + N + 1, [&](pii p1, pii p2) {return p1.second < p2.second; });
	for (i = 1; i <= N; i++) {
		vector<int> v;
		A[i][i] = arr[i].first - 1;
		B[i][i] = H - arr[i].first;
		v.push_back(arr[i].first);
		for (j = i + 1; j <= N; j++) {
			v.insert(lower_bound(v.begin(), v.end(), arr[j].first), arr[j].first);
			for (k = 0; k + 1 < v.size(); k++) C[i][j] = max(C[i][j], v[k + 1] - v[k] - 1);
			A[i][j] = v[0] - 1;
			B[i][j] = H - v.back();
		}
	}
	sort(ls.begin(), ls.end());
	ls.erase(unique(ls.begin(), ls.end()), ls.end());
	reverse(ls.begin(), ls.end());
	for (auto v : ls) if (!test(v)) break;
	cout << ans << ln;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:103:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |    for (k = 0; k + 1 < v.size(); k++) C[i][j] = max(C[i][j], v[k + 1] - v[k] - 1);
      |                ~~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 2 ms 1496 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 5 ms 2476 KB Output is correct
25 Correct 3 ms 1876 KB Output is correct
26 Correct 12 ms 3844 KB Output is correct
27 Correct 13 ms 3788 KB Output is correct
28 Correct 5 ms 2512 KB Output is correct
29 Correct 15 ms 3788 KB Output is correct
30 Correct 13 ms 3788 KB Output is correct
31 Correct 12 ms 3788 KB Output is correct
32 Correct 12 ms 3788 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 2 ms 1496 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 5 ms 2476 KB Output is correct
25 Correct 3 ms 1876 KB Output is correct
26 Correct 12 ms 3844 KB Output is correct
27 Correct 13 ms 3788 KB Output is correct
28 Correct 5 ms 2512 KB Output is correct
29 Correct 15 ms 3788 KB Output is correct
30 Correct 13 ms 3788 KB Output is correct
31 Correct 12 ms 3788 KB Output is correct
32 Correct 12 ms 3788 KB Output is correct
33 Correct 1243 ms 3792 KB Output is correct
34 Correct 1453 ms 3916 KB Output is correct
35 Correct 30 ms 3916 KB Output is correct
36 Correct 1404 ms 3880 KB Output is correct
37 Correct 1539 ms 3852 KB Output is correct
38 Correct 1518 ms 3880 KB Output is correct
39 Correct 1173 ms 3788 KB Output is correct
40 Correct 1441 ms 3880 KB Output is correct
41 Correct 908 ms 3880 KB Output is correct
42 Correct 56 ms 3916 KB Output is correct
43 Correct 1416 ms 3856 KB Output is correct
44 Correct 213 ms 3888 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 35 ms 1376 KB Output is correct
22 Correct 57 ms 1364 KB Output is correct
23 Correct 41 ms 1368 KB Output is correct
24 Correct 41 ms 1392 KB Output is correct
25 Correct 58 ms 1364 KB Output is correct
26 Correct 12 ms 1364 KB Output is correct
27 Correct 57 ms 1364 KB Output is correct
28 Correct 58 ms 1364 KB Output is correct
29 Correct 66 ms 1368 KB Output is correct
30 Correct 59 ms 1372 KB Output is correct
31 Correct 82 ms 1376 KB Output is correct
32 Correct 55 ms 1408 KB Output is correct
33 Correct 72 ms 1376 KB Output is correct
34 Correct 40 ms 1344 KB Output is correct
35 Correct 50 ms 1384 KB Output is correct
36 Correct 62 ms 1368 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 2 ms 1496 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 5 ms 2476 KB Output is correct
25 Correct 3 ms 1876 KB Output is correct
26 Correct 12 ms 3844 KB Output is correct
27 Correct 13 ms 3788 KB Output is correct
28 Correct 5 ms 2512 KB Output is correct
29 Correct 15 ms 3788 KB Output is correct
30 Correct 13 ms 3788 KB Output is correct
31 Correct 12 ms 3788 KB Output is correct
32 Correct 12 ms 3788 KB Output is correct
33 Correct 1243 ms 3792 KB Output is correct
34 Correct 1453 ms 3916 KB Output is correct
35 Correct 30 ms 3916 KB Output is correct
36 Correct 1404 ms 3880 KB Output is correct
37 Correct 1539 ms 3852 KB Output is correct
38 Correct 1518 ms 3880 KB Output is correct
39 Correct 1173 ms 3788 KB Output is correct
40 Correct 1441 ms 3880 KB Output is correct
41 Correct 908 ms 3880 KB Output is correct
42 Correct 56 ms 3916 KB Output is correct
43 Correct 1416 ms 3856 KB Output is correct
44 Correct 213 ms 3888 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 2 ms 468 KB Output is correct
53 Correct 2 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 35 ms 1376 KB Output is correct
66 Correct 57 ms 1364 KB Output is correct
67 Correct 41 ms 1368 KB Output is correct
68 Correct 41 ms 1392 KB Output is correct
69 Correct 58 ms 1364 KB Output is correct
70 Correct 12 ms 1364 KB Output is correct
71 Correct 57 ms 1364 KB Output is correct
72 Correct 58 ms 1364 KB Output is correct
73 Correct 66 ms 1368 KB Output is correct
74 Correct 59 ms 1372 KB Output is correct
75 Correct 82 ms 1376 KB Output is correct
76 Correct 55 ms 1408 KB Output is correct
77 Correct 72 ms 1376 KB Output is correct
78 Correct 40 ms 1344 KB Output is correct
79 Correct 50 ms 1384 KB Output is correct
80 Correct 62 ms 1368 KB Output is correct
81 Correct 634 ms 2768 KB Output is correct
82 Correct 623 ms 2768 KB Output is correct
83 Correct 738 ms 3152 KB Output is correct
84 Correct 931 ms 3152 KB Output is correct
85 Correct 1526 ms 3820 KB Output is correct
86 Correct 1528 ms 3804 KB Output is correct
87 Correct 1110 ms 3880 KB Output is correct
88 Correct 1044 ms 3788 KB Output is correct
89 Correct 1176 ms 3820 KB Output is correct
90 Correct 1091 ms 3460 KB Output is correct
91 Correct 1308 ms 3788 KB Output is correct
92 Correct 1499 ms 3880 KB Output is correct
93 Correct 1043 ms 3876 KB Output is correct
94 Correct 1068 ms 3788 KB Output is correct
95 Correct 1656 ms 3916 KB Output is correct
96 Correct 1270 ms 3916 KB Output is correct
97 Correct 805 ms 3788 KB Output is correct
98 Correct 69 ms 3788 KB Output is correct