Submission #59875

# Submission time Handle Problem Language Result Execution time Memory
59875 2018-07-23T08:25:46 Z koosaga(#1721) Cultivation (JOI17_cultivation) C++11
30 / 100
659 ms 1216 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int MAXN = 305;

int n, r, c;
pi a[MAXN];

struct sweep{
	int pos, val, mode;
	bool operator<(const sweep &s)const{
		return pi(pos, -mode) < pi(s.pos, -s.mode);
	}
};

lint Do(int i, int j){
	vector<sweep> sw;
	for(int k=0; k<n; k++){
		int le = max(1, a[k].first - i);
		int ri = min(r, a[k].first + j);
		int v = a[k].second;
		sw.push_back({le, v, +1});
		sw.push_back({ri + 1, v, -1});
	}
	vector<int> v = {1, r + 1};
	for(int i=0; i<sw.size(); i++){ 
		v.push_back(sw[i].pos);
	}
	sort(sw.begin(), sw.end());
	sort(v.begin(), v.end());
	v.resize(unique(v.begin(), v.end()) - v.begin());
	multiset<int> s;
	int ptr = 0;
	int lv = 0, rv = 0, sum = 0;
	for(int i=0; i+1<v.size(); i++){
		while(ptr < sw.size() && sw[ptr].pos == v[i]){
			if(sw[ptr].mode == 1) s.insert(sw[ptr].val);
			else s.erase(s.find(sw[ptr].val));
			ptr++;
		}
		if(s.size() == 0) return 1e18;
		lv = max(lv, *s.begin() - 1);
		rv = max(rv, c - *s.rbegin());
		auto it = s.begin();
		while(next(it) != s.end()){
			auto in = next(it);
			sum = max(*in - *it - 1, sum);
			it = in;
		}
	}
	return (1ll * max(lv + rv, sum)) + i + j;
}

lint solve(){
	lint ans = 1e18;
	sort(a, a+n);
	vector<int> ev;
	for(int i=0; i<n; i++){
		ev.push_back(a[i].first - 1);
	}
	sort(ev.begin(), ev.end());
	ev.resize(unique(ev.begin(), ev.end()) - ev.begin());
	for(auto &l : ev){
		vector<int> v;
		for(int j=0; j<n; j++){
			for(int k=j; k<n; k++){
				if(a[k].first - a[j].first >= l) v.push_back(a[k].first - a[j].first - l);
			}
			v.push_back(r - a[j].first);
		}
		sort(v.begin(), v.end());
		v.resize(unique(v.begin(), v.end()) - v.begin());
		for(auto &j : v){
			ans = min(ans, Do(l, j));
		}
	}
	return ans;
}

int main(){
	cin >> r >> c >> n;
	for(int i=0; i<n; i++){
		cin >> a[i].first >> a[i].second;
	}
	lint ans = solve();
	for(int i=0; i<n; i++) a[i].first = r + 1 - a[i].first;
	ans = min(ans, solve());
	cout << ans << endl;
}

Compilation message

cultivation.cpp: In function 'lint Do(int, int)':
cultivation.cpp:28:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<sw.size(); i++){
               ~^~~~~~~~~~
cultivation.cpp:37:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i+1<v.size(); i++){
               ~~~^~~~~~~~~
cultivation.cpp:38:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ptr < sw.size() && sw[ptr].pos == v[i]){
         ~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 396 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 3 ms 556 KB Output is correct
16 Correct 3 ms 556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 396 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 3 ms 556 KB Output is correct
16 Correct 3 ms 556 KB Output is correct
17 Correct 4 ms 556 KB Output is correct
18 Correct 36 ms 596 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 48 ms 596 KB Output is correct
22 Correct 213 ms 768 KB Output is correct
23 Correct 9 ms 768 KB Output is correct
24 Correct 378 ms 800 KB Output is correct
25 Correct 231 ms 800 KB Output is correct
26 Correct 521 ms 1120 KB Output is correct
27 Correct 586 ms 1216 KB Output is correct
28 Correct 323 ms 1216 KB Output is correct
29 Correct 553 ms 1216 KB Output is correct
30 Correct 573 ms 1216 KB Output is correct
31 Correct 560 ms 1216 KB Output is correct
32 Correct 548 ms 1216 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 396 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 3 ms 556 KB Output is correct
16 Correct 3 ms 556 KB Output is correct
17 Correct 4 ms 556 KB Output is correct
18 Correct 36 ms 596 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 48 ms 596 KB Output is correct
22 Correct 213 ms 768 KB Output is correct
23 Correct 9 ms 768 KB Output is correct
24 Correct 378 ms 800 KB Output is correct
25 Correct 231 ms 800 KB Output is correct
26 Correct 521 ms 1120 KB Output is correct
27 Correct 586 ms 1216 KB Output is correct
28 Correct 323 ms 1216 KB Output is correct
29 Correct 553 ms 1216 KB Output is correct
30 Correct 573 ms 1216 KB Output is correct
31 Correct 560 ms 1216 KB Output is correct
32 Correct 548 ms 1216 KB Output is correct
33 Correct 8 ms 1216 KB Output is correct
34 Correct 539 ms 1216 KB Output is correct
35 Correct 610 ms 1216 KB Output is correct
36 Correct 598 ms 1216 KB Output is correct
37 Correct 478 ms 1216 KB Output is correct
38 Correct 575 ms 1216 KB Output is correct
39 Correct 636 ms 1216 KB Output is correct
40 Correct 659 ms 1216 KB Output is correct
41 Correct 208 ms 1216 KB Output is correct
42 Correct 421 ms 1216 KB Output is correct
43 Correct 551 ms 1216 KB Output is correct
44 Correct 633 ms 1216 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 1216 KB Output is correct
2 Correct 47 ms 1216 KB Output is correct
3 Correct 61 ms 1216 KB Output is correct
4 Correct 52 ms 1216 KB Output is correct
5 Correct 47 ms 1216 KB Output is correct
6 Incorrect 42 ms 1216 KB Output isn't correct
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 17 ms 1216 KB Output is correct
2 Correct 47 ms 1216 KB Output is correct
3 Correct 61 ms 1216 KB Output is correct
4 Correct 52 ms 1216 KB Output is correct
5 Correct 47 ms 1216 KB Output is correct
6 Incorrect 42 ms 1216 KB Output isn't correct
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 396 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 3 ms 556 KB Output is correct
16 Correct 3 ms 556 KB Output is correct
17 Correct 4 ms 556 KB Output is correct
18 Correct 36 ms 596 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 48 ms 596 KB Output is correct
22 Correct 213 ms 768 KB Output is correct
23 Correct 9 ms 768 KB Output is correct
24 Correct 378 ms 800 KB Output is correct
25 Correct 231 ms 800 KB Output is correct
26 Correct 521 ms 1120 KB Output is correct
27 Correct 586 ms 1216 KB Output is correct
28 Correct 323 ms 1216 KB Output is correct
29 Correct 553 ms 1216 KB Output is correct
30 Correct 573 ms 1216 KB Output is correct
31 Correct 560 ms 1216 KB Output is correct
32 Correct 548 ms 1216 KB Output is correct
33 Correct 8 ms 1216 KB Output is correct
34 Correct 539 ms 1216 KB Output is correct
35 Correct 610 ms 1216 KB Output is correct
36 Correct 598 ms 1216 KB Output is correct
37 Correct 478 ms 1216 KB Output is correct
38 Correct 575 ms 1216 KB Output is correct
39 Correct 636 ms 1216 KB Output is correct
40 Correct 659 ms 1216 KB Output is correct
41 Correct 208 ms 1216 KB Output is correct
42 Correct 421 ms 1216 KB Output is correct
43 Correct 551 ms 1216 KB Output is correct
44 Correct 633 ms 1216 KB Output is correct
45 Correct 17 ms 1216 KB Output is correct
46 Correct 47 ms 1216 KB Output is correct
47 Correct 61 ms 1216 KB Output is correct
48 Correct 52 ms 1216 KB Output is correct
49 Correct 47 ms 1216 KB Output is correct
50 Incorrect 42 ms 1216 KB Output isn't correct
51 Halted 0 ms 0 KB -