oj.uz

Submission #1071883

# Submission time Handle Problem Language Result Execution time Memory
1071883 2024-08-23T12:06:11 Z mickey080929 Cultivation (JOI17_cultivation) C++17
80 / 100
 2000 ms 4824 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
 
const ll inf = 2e18;
 
ll R, C;
ll N;
 
ll mxl[310][310], mxr[310][310], mxsum[310][310];

ll solve(vector<pll> &p, ll H) {
	vector<pll> upd;
	upd.reserve(N * 2);
	ll j = 0;
	for (ll i=0; i<N; i++) {
		while (j < N && p[j].first + H <= p[i].first) {
			upd.push_back({p[j].first + H, -p[j].second});
			j ++;
		}
		upd.push_back(p[i]);
	}
	while (j < N) {
		upd.push_back({p[j].first + H, -p[j].second});
		j ++;
	}
	vector<array<ll,4>> save;
	ll idx1 = 0, idx2 = -1;
	for (ll i=0; i<N*2; i++) {
		if (upd[i].second > 0) idx2 ++;
		if (i + 1 != N*2 && upd[i].first == upd[i+1].first) continue;
		while (idx1 < N && p[idx1].first + H <= upd[i].first) idx1 ++;
		if (idx1 > idx2) {
			save.push_back({upd[i].first, inf, inf, inf});
			continue;
		}
		save.push_back({upd[i].first, mxsum[idx1][idx2], mxl[idx1][idx2], mxr[idx1][idx2]});
	}
	ll ans = inf;
	deque<ll> dq[3];
	for (ll i=(ll)save.size()-1; i>=0; i--) {
		for (ll j=0; j<3; j++) {
			while (!dq[j].empty() && save[dq[j].back()][j+1] <= save[i][j+1]) {
				dq[j].pop_back();
			}
			while (!dq[j].empty() && save[dq[j].front()][0] > save[i][0] + R - 1) {
				dq[j].pop_front();
			}
			dq[j].push_back(i);
		}
		ans = min(ans, max(save[dq[0].front()][1], save[dq[1].front()][2] + save[dq[2].front()][3]));
	}
	return ans;
}
 
int main() {
    ios_base :: sync_with_stdio(false); cin.tie(NULL);
    cin >> R >> C;
    cin >> N;
    vector<pll> p(N);
    for (ll i=0; i<N; i++) {
    	cin >> p[i].first >> p[i].second;
    }
    sort(p.begin(), p.end());
    for (ll i=0; i<N; i++) {
    	vector<ll> cur;
    	for (ll j=i; j<N; j++) {
    		if (cur.empty() || cur.back() < p[j].second) {
    			cur.push_back(p[j].second);
    		}
    		else {
    			for (ll k=0; k<cur.size(); k++) {
    				if (cur[k] >= p[j].second) {
    					cur.insert(cur.begin() + k, p[j].second);
    					break;
    				}
    			}
    		}
    		ll l = cur[0] - 1, r = C - cur.back();
			ll sum = l + r;
			for (ll k=0; k+1<cur.size(); k++) {
				sum = max(sum, cur[k+1] - cur[k] - 1);
			}
			mxl[i][j] = l; mxr[i][j] = r;
			mxsum[i][j] = sum;
    	}
    }
    vector<ll> cand, U, D;
    for (ll i=0; i<N; i++) {
    	U.push_back(p[i].first - 1);
    	D.push_back(R - p[i].first);
    	for (ll j=i+1; j<N; j++) {
    		cand.push_back(abs(p[i].first - p[j].first));
    	}
    }
    for (auto &u : U) {
    	for (auto &d : D) {
    		cand.push_back(u + d + 1);
    	}
    }
    sort(cand.begin(), cand.end());
    cand.erase(unique(cand.begin(), cand.end()), cand.end());
    ll ans = inf;
    for (auto &H : cand) {
   		if (H == 0) continue;
    	ans = min(ans, H - 1 + solve(p, H));
    }
    cout << ans << '\n';
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:79:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |        for (ll k=0; k<cur.size(); k++) {
      |                     ~^~~~~~~~~~~
cultivation.cpp:88:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |    for (ll k=0; k+1<cur.size(); k++) {
      |                 ~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 7 ms 2528 KB Output is correct
25 Correct 3 ms 3300 KB Output is correct
26 Correct 16 ms 4724 KB Output is correct
27 Correct 15 ms 4820 KB Output is correct
28 Correct 4 ms 3296 KB Output is correct
29 Correct 12 ms 4736 KB Output is correct
30 Correct 10 ms 4824 KB Output is correct
31 Correct 10 ms 4824 KB Output is correct
32 Correct 9 ms 4820 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 7 ms 2528 KB Output is correct
25 Correct 3 ms 3300 KB Output is correct
26 Correct 16 ms 4724 KB Output is correct
27 Correct 15 ms 4820 KB Output is correct
28 Correct 4 ms 3296 KB Output is correct
29 Correct 12 ms 4736 KB Output is correct
30 Correct 10 ms 4824 KB Output is correct
31 Correct 10 ms 4824 KB Output is correct
32 Correct 9 ms 4820 KB Output is correct
33 Correct 8 ms 4824 KB Output is correct
34 Correct 7 ms 4824 KB Output is correct
35 Correct 15 ms 4824 KB Output is correct
36 Correct 10 ms 4820 KB Output is correct
37 Correct 10 ms 4636 KB Output is correct
38 Correct 9 ms 4724 KB Output is correct
39 Correct 10 ms 4820 KB Output is correct
40 Correct 10 ms 4824 KB Output is correct
41 Correct 12 ms 4824 KB Output is correct
42 Correct 9 ms 4732 KB Output is correct
43 Correct 9 ms 4820 KB Output is correct
44 Correct 10 ms 4820 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 2392 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 3 ms 2392 KB Output is correct
21 Correct 51 ms 1372 KB Output is correct
22 Correct 106 ms 1428 KB Output is correct
23 Correct 88 ms 1372 KB Output is correct
24 Correct 115 ms 1372 KB Output is correct
25 Correct 113 ms 2908 KB Output is correct
26 Correct 45 ms 1372 KB Output is correct
27 Correct 101 ms 1372 KB Output is correct
28 Correct 91 ms 1372 KB Output is correct
29 Correct 113 ms 1372 KB Output is correct
30 Correct 85 ms 1372 KB Output is correct
31 Correct 119 ms 1368 KB Output is correct
32 Correct 86 ms 1372 KB Output is correct
33 Correct 108 ms 1372 KB Output is correct
34 Correct 106 ms 1372 KB Output is correct
35 Correct 91 ms 1424 KB Output is correct
36 Correct 96 ms 1372 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 7 ms 2528 KB Output is correct
25 Correct 3 ms 3300 KB Output is correct
26 Correct 16 ms 4724 KB Output is correct
27 Correct 15 ms 4820 KB Output is correct
28 Correct 4 ms 3296 KB Output is correct
29 Correct 12 ms 4736 KB Output is correct
30 Correct 10 ms 4824 KB Output is correct
31 Correct 10 ms 4824 KB Output is correct
32 Correct 9 ms 4820 KB Output is correct
33 Correct 8 ms 4824 KB Output is correct
34 Correct 7 ms 4824 KB Output is correct
35 Correct 15 ms 4824 KB Output is correct
36 Correct 10 ms 4820 KB Output is correct
37 Correct 10 ms 4636 KB Output is correct
38 Correct 9 ms 4724 KB Output is correct
39 Correct 10 ms 4820 KB Output is correct
40 Correct 10 ms 4824 KB Output is correct
41 Correct 12 ms 4824 KB Output is correct
42 Correct 9 ms 4732 KB Output is correct
43 Correct 9 ms 4820 KB Output is correct
44 Correct 10 ms 4820 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 3 ms 600 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 3 ms 632 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 0 ms 604 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 3 ms 760 KB Output is correct
55 Correct 2 ms 2396 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 1 ms 456 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 3 ms 464 KB Output is correct
61 Correct 2 ms 604 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 3 ms 2392 KB Output is correct
65 Correct 51 ms 1372 KB Output is correct
66 Correct 106 ms 1428 KB Output is correct
67 Correct 88 ms 1372 KB Output is correct
68 Correct 115 ms 1372 KB Output is correct
69 Correct 113 ms 2908 KB Output is correct
70 Correct 45 ms 1372 KB Output is correct
71 Correct 101 ms 1372 KB Output is correct
72 Correct 91 ms 1372 KB Output is correct
73 Correct 113 ms 1372 KB Output is correct
74 Correct 85 ms 1372 KB Output is correct
75 Correct 119 ms 1368 KB Output is correct
76 Correct 86 ms 1372 KB Output is correct
77 Correct 108 ms 1372 KB Output is correct
78 Correct 106 ms 1372 KB Output is correct
79 Correct 91 ms 1424 KB Output is correct
80 Correct 96 ms 1372 KB Output is correct
81 Correct 1099 ms 3032 KB Output is correct
82 Correct 1115 ms 3032 KB Output is correct
83 Correct 1214 ms 3292 KB Output is correct
84 Correct 1617 ms 3288 KB Output is correct
85 Execution timed out 2072 ms 4824 KB Time limit exceeded
86 Halted 0 ms 0 KB -