oj.uz

Submission #59824

# Submission time Handle Problem Language Result Execution time Memory
59824 2018-07-23T07:35:28 Z 김세빈(#1725) Cultivation (JOI17_cultivation) C++11
30 / 100
 757 ms 1636 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pll;

pll P[333];
ll K[666][666];
vector <int> L, R;
ll n, h, w, ans = 1e18;

ll check(ll l, ll r)
{
	ll x, y, d, i, j, s, e, t, prev;
	
	vector <ll> X, Y;
	
	for(i=1; i<=n; i++){
		x = P[i].first - l;
		X.push_back(x);
		x = P[i].first + r + 1;
		X.push_back(x);
		Y.push_back(P[i].second);
	}
	
	X.push_back(1); Y.push_back(1);
	X.push_back(h); Y.push_back(w);
	
	sort(X.begin(), X.end());
	X.erase(unique(X.begin(), X.end()), X.end());
	
	sort(Y.begin(), Y.end());
	Y.erase(unique(Y.begin(), Y.end()), Y.end());
	
	for(i=1; i<=X.size(); i++){
		for(j=1; j<=Y.size(); j++){
			K[i][j] = 0;
		}
	}
	
	for(i=1; i<=n; i++){
		s = lower_bound(X.begin(), X.end(), P[i].first - l) - X.begin() + 1;
		e = lower_bound(X.begin(), X.end(), P[i].first + r + 1) - X.begin() + 1;
		y = lower_bound(Y.begin(), Y.end(), P[i].second) - Y.begin() + 1;
		for(j=s; j<e; j++) K[j][y] = i;
	}
	
	s = lower_bound(X.begin(), X.end(), 1) - X.begin() + 1;
	e = lower_bound(X.begin(), X.end(), h) - X.begin() + 1;
	
	x = y = d = 0;
	
	for(i=s; i<=e; i++){
		prev = -1;
		for(j=1; j<=Y.size(); j++){
			if(K[i][j]){
				t = K[i][j];
				if(prev == -1) x = max(x, P[t].second - 1);
				else d = max(d, P[t].second - P[prev].second - 1);
				prev = t;
			}
		}
		if(prev == -1) return 1e18;
		y = max(y, w - P[prev].second);
	}
	
	return x + y + max(0ll, d - x - y);
}

int main()
{
	ll i, j, k;
	
	scanf("%lld%lld%lld", &h, &w, &n);
	for(i=1; i<=n; i++){
		scanf("%lld%lld", &P[i].first, &P[i].second);
	}
	
	sort(P + 1, P + n + 1);
	
	for(i=1; i<=n; i++){
		L.push_back(P[i].first - 1);
		for(j=1; j<i; j++){
			if(P[i].first != P[j].first) L.push_back(P[i].first - P[j].first - 1);
		}
		
		R.push_back(h - P[i].first);
		for(j=n; j>i; j--){
			if(P[i].first != P[j].first) R.push_back(P[j].first - P[i].first - 1);
		}
	}
	
	sort(L.begin(), L.end());
	L.erase(unique(L.begin(), L.end()), L.end());
	
	sort(R.begin(), R.end());
	R.erase(unique(R.begin(), R.end()), R.end());
	
	for(i=0; i<L.size(); i++){
		for(j=0; j<R.size(); j++){
			k = check(L[i], R[j]) + L[i] + R[j];
			ans = min(ans, k);
		}
	}
	
	printf("%lld\n", ans);
	
	return 0;
}

Compilation message

cultivation.cpp: In function 'll check(ll, ll)':
cultivation.cpp:36:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=1; i<=X.size(); i++){
           ~^~~~~~~~~~
cultivation.cpp:37:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=1; j<=Y.size(); j++){
            ~^~~~~~~~~~
cultivation.cpp:56:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=1; j<=Y.size(); j++){
            ~^~~~~~~~~~
cultivation.cpp: In function 'int main()':
cultivation.cpp:100:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0; i<L.size(); i++){
           ~^~~~~~~~~
cultivation.cpp:101:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0; j<R.size(); j++){
            ~^~~~~~~~~
cultivation.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld", &h, &w, &n);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &P[i].first, &P[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 3 ms 560 KB Output is correct
9 Correct 3 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 3 ms 624 KB Output is correct
12 Correct 3 ms 624 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 3 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 3 ms 560 KB Output is correct
9 Correct 3 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 3 ms 624 KB Output is correct
12 Correct 3 ms 624 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 3 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 14 ms 748 KB Output is correct
19 Correct 10 ms 748 KB Output is correct
20 Correct 3 ms 748 KB Output is correct
21 Correct 20 ms 872 KB Output is correct
22 Correct 54 ms 1128 KB Output is correct
23 Correct 4 ms 1128 KB Output is correct
24 Correct 83 ms 1260 KB Output is correct
25 Correct 75 ms 1260 KB Output is correct
26 Correct 129 ms 1384 KB Output is correct
27 Correct 127 ms 1384 KB Output is correct
28 Correct 74 ms 1388 KB Output is correct
29 Correct 113 ms 1388 KB Output is correct
30 Correct 117 ms 1388 KB Output is correct
31 Correct 118 ms 1388 KB Output is correct
32 Correct 133 ms 1444 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 3 ms 560 KB Output is correct
9 Correct 3 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 3 ms 624 KB Output is correct
12 Correct 3 ms 624 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 3 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 14 ms 748 KB Output is correct
19 Correct 10 ms 748 KB Output is correct
20 Correct 3 ms 748 KB Output is correct
21 Correct 20 ms 872 KB Output is correct
22 Correct 54 ms 1128 KB Output is correct
23 Correct 4 ms 1128 KB Output is correct
24 Correct 83 ms 1260 KB Output is correct
25 Correct 75 ms 1260 KB Output is correct
26 Correct 129 ms 1384 KB Output is correct
27 Correct 127 ms 1384 KB Output is correct
28 Correct 74 ms 1388 KB Output is correct
29 Correct 113 ms 1388 KB Output is correct
30 Correct 117 ms 1388 KB Output is correct
31 Correct 118 ms 1388 KB Output is correct
32 Correct 133 ms 1444 KB Output is correct
33 Correct 7 ms 1444 KB Output is correct
34 Correct 196 ms 1512 KB Output is correct
35 Correct 172 ms 1512 KB Output is correct
36 Correct 202 ms 1512 KB Output is correct
37 Correct 142 ms 1512 KB Output is correct
38 Correct 234 ms 1512 KB Output is correct
39 Correct 231 ms 1512 KB Output is correct
40 Correct 242 ms 1512 KB Output is correct
41 Correct 138 ms 1512 KB Output is correct
42 Correct 166 ms 1512 KB Output is correct
43 Correct 231 ms 1512 KB Output is correct
44 Correct 206 ms 1636 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 1636 KB Output is correct
2 Correct 576 ms 1636 KB Output is correct
3 Correct 610 ms 1636 KB Output is correct
4 Correct 757 ms 1636 KB Output is correct
5 Correct 662 ms 1636 KB Output is correct
6 Correct 151 ms 1636 KB Output is correct
7 Correct 8 ms 1636 KB Output is correct
8 Correct 618 ms 1636 KB Output is correct
9 Correct 198 ms 1636 KB Output is correct
10 Incorrect 656 ms 1636 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 1636 KB Output is correct
2 Correct 576 ms 1636 KB Output is correct
3 Correct 610 ms 1636 KB Output is correct
4 Correct 757 ms 1636 KB Output is correct
5 Correct 662 ms 1636 KB Output is correct
6 Correct 151 ms 1636 KB Output is correct
7 Correct 8 ms 1636 KB Output is correct
8 Correct 618 ms 1636 KB Output is correct
9 Correct 198 ms 1636 KB Output is correct
10 Incorrect 656 ms 1636 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 3 ms 560 KB Output is correct
9 Correct 3 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 3 ms 624 KB Output is correct
12 Correct 3 ms 624 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 3 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 14 ms 748 KB Output is correct
19 Correct 10 ms 748 KB Output is correct
20 Correct 3 ms 748 KB Output is correct
21 Correct 20 ms 872 KB Output is correct
22 Correct 54 ms 1128 KB Output is correct
23 Correct 4 ms 1128 KB Output is correct
24 Correct 83 ms 1260 KB Output is correct
25 Correct 75 ms 1260 KB Output is correct
26 Correct 129 ms 1384 KB Output is correct
27 Correct 127 ms 1384 KB Output is correct
28 Correct 74 ms 1388 KB Output is correct
29 Correct 113 ms 1388 KB Output is correct
30 Correct 117 ms 1388 KB Output is correct
31 Correct 118 ms 1388 KB Output is correct
32 Correct 133 ms 1444 KB Output is correct
33 Correct 7 ms 1444 KB Output is correct
34 Correct 196 ms 1512 KB Output is correct
35 Correct 172 ms 1512 KB Output is correct
36 Correct 202 ms 1512 KB Output is correct
37 Correct 142 ms 1512 KB Output is correct
38 Correct 234 ms 1512 KB Output is correct
39 Correct 231 ms 1512 KB Output is correct
40 Correct 242 ms 1512 KB Output is correct
41 Correct 138 ms 1512 KB Output is correct
42 Correct 166 ms 1512 KB Output is correct
43 Correct 231 ms 1512 KB Output is correct
44 Correct 206 ms 1636 KB Output is correct
45 Correct 109 ms 1636 KB Output is correct
46 Correct 576 ms 1636 KB Output is correct
47 Correct 610 ms 1636 KB Output is correct
48 Correct 757 ms 1636 KB Output is correct
49 Correct 662 ms 1636 KB Output is correct
50 Correct 151 ms 1636 KB Output is correct
51 Correct 8 ms 1636 KB Output is correct
52 Correct 618 ms 1636 KB Output is correct
53 Correct 198 ms 1636 KB Output is correct
54 Incorrect 656 ms 1636 KB Output isn't correct
55 Halted 0 ms 0 KB -