oj.uz

Submission #1071420

# Submission time Handle Problem Language Result Execution time Memory
1071420 2024-08-23T07:16:33 Z 정민찬(#11138) Cultivation (JOI17_cultivation) C++17
5 / 100
 5 ms 356 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<array<ll,4>> save;
	multiset<ll> s1, s2;
	for (ll i=0; i<upd.size(); i++) {
		if (upd[i].second > 0) {
			if (!s1.empty()) {
				auto rit = s1.lower_bound(upd[i].second);
				if (rit != s1.begin()) {
					auto lit = prev(rit);
					if (rit != s1.end()) {
						s2.erase(s2.find(*rit - *lit));
					}
					s2.insert(upd[i].second - *lit);
				}
				if (rit != s1.end()) {
					s2.insert(*rit - upd[i].second);
				}
			}
			s1.insert(upd[i].second);
		}
		else {
			s1.erase(s1.find(-upd[i].second));
			if (!s1.empty()) {
				auto rit = s1.lower_bound(-upd[i].second);
				if (rit != s1.begin()) {
					auto lit = prev(rit);
					if (rit != s1.end()) {
						s2.insert(*rit - *lit);
					}
					s2.erase(s2.find(-upd[i].second - *lit));
				}
				if (rit != s1.end()) {
					s2.erase(s2.find(*rit - (-upd[i].second)));
				}
			}
		}
		if (i + 1 != upd.size() && upd[i].first == upd[i+1].first) continue;
		if (s1.empty()) {
			save.push_back({upd[i].first, inf, inf, inf});
			continue;
		}
		ll l = *s1.begin() - 1, r = C - *s1.rbegin();
		ll sum = l + r;
		if (!s2.empty()) sum = *s2.rbegin() - 1;
		save.push_back({upd[i].first, sum, l, r});
	}
	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();
			}
			if (!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());
    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));
    }
    /*for (ll i=1; i<=2*R; i++) {
    	cout << i << ' ' << solve(p, i) << '\n';
    	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:62: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]
   62 |   if (i + 1 != upd.size() && upd[i].first == upd[i+1].first) continue;
      |       ~~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 356 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 356 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 356 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 5 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 5 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 356 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -