oj.uz

답안 #1071164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071164 2024-08-23T05:30:34 Z 정민찬(#11138) Cultivation (JOI17_cultivation) C++17
15 / 100
 2000 ms 496 KB 
#include <bits/stdc++.h>

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 solve(vector<pll> p, ll H) {
	vector<pll> upd;
	ll j = 0;
	for (ll i=0; i<p.size(); i++) {
		while (j < p.size() && 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 < p.size()) {
		upd.push_back({p[j].first + H, -p[j].second});
		j ++;
	}
	vector<ll> cur;
	vector<array<ll,4>> save;
	for (ll i=0; i<upd.size(); i++) {
		if (upd[i].second > 0) {
			cur.push_back(upd[i].second);
			sort(cur.begin(), cur.end());
		}
		else {
			for (ll j=0; j<cur.size(); j++) {
				if (cur[j] == -upd[i].second) {
					cur.erase(cur.begin() + j);
					break;
				}
			}
		}
		if (i + 1 != upd.size() && upd[i].first == upd[i+1].first) continue;
		if (cur.empty()) {
			save.push_back({upd[i].first, inf, inf, inf});
			continue;
		}
		ll l = cur[0] - 1, r = C - cur.back();
		ll sum = l + r;
		for (ll j=0; j+1<cur.size(); j++) {
			sum = max(sum, cur[j+1] - cur[j] - 1);
		}
		save.push_back({upd[i].first, sum, l, r});
	}
	ll ans = inf;
	for (ll i=0; i<save.size(); i++) {
		ll l = save[i][2], r = save[i][3];
		ll sum = save[i][1];
		for (ll j=i+1; j<save.size(); j++) {
			if (save[j][0] > save[i][0] + R - 1) break;
			l = max(l, save[j][2]);
			r = max(r, save[j][3]);
			sum = max(sum, save[j][1]);
		}
		ans = min(ans, max(l+r, sum));
	}
	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());
    ll ans = inf;
    for (ll i=1; i<=R; i++) {
    	ans = min(ans, i - 1 + solve(p, i));
    }
    cout << ans << '\n';
}

Compilation message

cultivation.cpp: In function 'll solve(std::vector<std::pair<long long int, long long int> >, ll)':
cultivation.cpp:16:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for (ll i=0; i<p.size(); i++) {
      |               ~^~~~~~~~~
cultivation.cpp:17:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   while (j < p.size() && p[j].first + H <= p[i].first) {
      |          ~~^~~~~~~~~~
cultivation.cpp:23:11: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  while (j < p.size()) {
      |         ~~^~~~~~~~~~
cultivation.cpp:29:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (ll i=0; i<upd.size(); i++) {
      |               ~^~~~~~~~~~~
cultivation.cpp:35:18: 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]
   35 |    for (ll j=0; j<cur.size(); j++) {
      |                 ~^~~~~~~~~~~
cultivation.cpp:42:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   if (i + 1 != upd.size() && upd[i].first == upd[i+1].first) continue;
      |       ~~~~~~^~~~~~~~~~~~~
cultivation.cpp:49:19: 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]
   49 |   for (ll j=0; j+1<cur.size(); j++) {
      |                ~~~^~~~~~~~~~~
cultivation.cpp:55:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::array<long long int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for (ll i=0; i<save.size(); i++) {
      |               ~^~~~~~~~~~~~
cultivation.cpp:58:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::array<long long int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for (ll j=i+1; j<save.size(); j++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 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 348 KB Output is correct
12 Correct 0 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 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 348 KB Output is correct
12 Correct 0 ms 348 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 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 16 ms 496 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 19 ms 496 KB Output is correct
30 Correct 15 ms 348 KB Output is correct
31 Correct 15 ms 348 KB Output is correct
32 Correct 16 ms 492 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 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 348 KB Output is correct
12 Correct 0 ms 348 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 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 16 ms 496 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 19 ms 496 KB Output is correct
30 Correct 15 ms 348 KB Output is correct
31 Correct 15 ms 348 KB Output is correct
32 Correct 16 ms 492 KB Output is correct
33 Incorrect 1 ms 344 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2086 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2086 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 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 348 KB Output is correct
12 Correct 0 ms 348 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 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 16 ms 496 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 19 ms 496 KB Output is correct
30 Correct 15 ms 348 KB Output is correct
31 Correct 15 ms 348 KB Output is correct
32 Correct 16 ms 492 KB Output is correct
33 Incorrect 1 ms 344 KB Output isn't correct
34 Halted 0 ms 0 KB -