oj.uz

Submission #55273

# Submission time Handle Problem Language Result Execution time Memory
55273 2018-07-06T21:11:56 Z ksun48 Cultivation (JOI17_cultivation) C++14
60 / 100
 2000 ms 1044 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;;

LL r, c, n;
vector<pair<LL,LL> > seeds;
const LL INF = 2100100100;
LL best = INF;
set<pair<LL,LL> > tried;
void tryxwithstart(LL x, LL startx){
	if(x < 0 || tried.find({x,startx}) != tried.end()){
		return;
	}
	LL endx = startx + r - 1;
	// insert z.second at time z.first
	// delete at time z.first + x + 1


	map<LL, vector<pair<LL, LL> > > events;
	for(pair<LL,LL> z : seeds){
		if(z.first + x < startx || z.first > endx) continue;
		events[max(z.first, startx)].push_back({0, z.second}); // ins
		events[min(z.first + x, endx) + 1].push_back({1, z.second}); // del
	}

	LL maxup = 0;
	LL maxdown = 0;
	LL maxtot = 0;

	multiset<LL> grass;
	grass.insert(-1);
	grass.insert(c);
	multiset<LL> diffs;
	diffs.insert(c+1);
	for(auto x : events){
		for(pair<LL,LL> event : x.second){
			LL a = event.second;
			if(event.first == 0){
				grass.insert(a);
			}
			LL a1 = *(--grass.find(a));
			LL a2 = *(++grass.find(a));
			if(event.first == 0){
				diffs.erase(diffs.find(a2-a1));
				diffs.insert(a-a1);
				diffs.insert(a2-a);
			} else if(event.first == 1){
				diffs.erase(diffs.find(a-a1));
				diffs.erase(diffs.find(a2-a));
				diffs.insert(a2-a1);
			}
			if(event.first == 1){
				grass.erase(grass.find(a));
			}
		}
		if(x.first > endx){
			break;
		}
		maxtot = max(maxtot, *(--diffs.end()) );
		maxup = max(maxup, *(++grass.begin()) - 0);
		maxdown = max(maxdown, c-1 - *(--(--grass.end())) );
	}
	if(maxtot == c + 1){
		return;
	}
	best = min(best, max(maxup + maxdown, maxtot - 1) + x);
}
void tryx(LL x){
	vector<LL> stuff[r + x];
	for(pair<LL,LL> z : seeds){
		for(LL j = 0; j <= x; j++){
			stuff[j + z.first].push_back(z.second);
		}
	}
	vector<LL> up(r+x, 0);
	vector<LL> down(r+x, 0);
	vector<LL> tot(r+x, 0);
	for(LL j = 0; j < r+x; j++){
		vector<LL> grass = stuff[j];
		sort(grass.begin(), grass.end());
		if(grass.size() == 0){
			up[j] = down[j] = tot[j] = INF;
		} else {
			up[j] = grass[0] - 0;
			down[j] = c-1 - grass[grass.size()-1];
			for(LL i = 0; i + 1 < grass.size(); i++){
				tot[j] = max(tot[j], grass[i+1] - grass[i] - 1);
			}
		}
	}
	for(LL j = 0; j <= x; j++){
		LL maxup = 0;
		LL maxdown = 0;
		LL maxtot = 0;
		for(LL i = j; i < j + r; i++){
			maxup = max(maxup, up[i]);
			maxdown = max(maxdown, down[i]);
			maxtot = max(maxtot, tot[i]);
		}
		best = min(best, max(maxup + maxdown, maxtot) + x);
	}
}
int main(){	
	cin >> r >> c >> n;
	for(LL i = 0; i < n; i++){
		LL s, e;
		cin >> s >> e;
		s--; e--;
		seeds.push_back({s,e});
	}
	sort(seeds.begin(), seeds.end());
	if(r <= 40){
		for(LL j = 0; j <= 2*r; j++){
			tryx(j);
		}
	} else {	
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				tryxwithstart(seeds[i].first + r-1 - seeds[j].first, seeds[i].first);
			}
			for(int j = 0; j < n; j++){
				for(int k = 0; k < n; k++){
					tryxwithstart(seeds[j].first - 1 - seeds[k].first, seeds[i].first);
				}
			}
		}		
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In function 'void tryx(LL)':
cultivation.cpp:86:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(LL i = 0; i + 1 < grass.size(); i++){
                  ~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 0 ms 688 KB Output is correct
10 Correct 2 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 2 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 2 ms 688 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 688 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 0 ms 688 KB Output is correct
10 Correct 2 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 2 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 2 ms 688 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 688 KB Output is correct
17 Correct 3 ms 688 KB Output is correct
18 Correct 6 ms 688 KB Output is correct
19 Correct 5 ms 688 KB Output is correct
20 Correct 2 ms 688 KB Output is correct
21 Correct 7 ms 688 KB Output is correct
22 Correct 19 ms 692 KB Output is correct
23 Correct 10 ms 692 KB Output is correct
24 Correct 34 ms 792 KB Output is correct
25 Correct 27 ms 792 KB Output is correct
26 Correct 61 ms 940 KB Output is correct
27 Correct 48 ms 940 KB Output is correct
28 Correct 31 ms 940 KB Output is correct
29 Correct 43 ms 984 KB Output is correct
30 Correct 63 ms 984 KB Output is correct
31 Correct 52 ms 984 KB Output is correct
32 Correct 64 ms 984 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 0 ms 688 KB Output is correct
10 Correct 2 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 2 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 2 ms 688 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 688 KB Output is correct
17 Correct 3 ms 688 KB Output is correct
18 Correct 6 ms 688 KB Output is correct
19 Correct 5 ms 688 KB Output is correct
20 Correct 2 ms 688 KB Output is correct
21 Correct 7 ms 688 KB Output is correct
22 Correct 19 ms 692 KB Output is correct
23 Correct 10 ms 692 KB Output is correct
24 Correct 34 ms 792 KB Output is correct
25 Correct 27 ms 792 KB Output is correct
26 Correct 61 ms 940 KB Output is correct
27 Correct 48 ms 940 KB Output is correct
28 Correct 31 ms 940 KB Output is correct
29 Correct 43 ms 984 KB Output is correct
30 Correct 63 ms 984 KB Output is correct
31 Correct 52 ms 984 KB Output is correct
32 Correct 64 ms 984 KB Output is correct
33 Correct 4 ms 984 KB Output is correct
34 Correct 27 ms 984 KB Output is correct
35 Correct 134 ms 984 KB Output is correct
36 Correct 62 ms 984 KB Output is correct
37 Correct 39 ms 984 KB Output is correct
38 Correct 55 ms 984 KB Output is correct
39 Correct 52 ms 984 KB Output is correct
40 Correct 62 ms 1028 KB Output is correct
41 Correct 33 ms 1044 KB Output is correct
42 Correct 42 ms 1044 KB Output is correct
43 Correct 47 ms 1044 KB Output is correct
44 Correct 50 ms 1044 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1044 KB Output is correct
2 Correct 121 ms 1044 KB Output is correct
3 Correct 150 ms 1044 KB Output is correct
4 Correct 139 ms 1044 KB Output is correct
5 Correct 143 ms 1044 KB Output is correct
6 Correct 138 ms 1044 KB Output is correct
7 Correct 107 ms 1044 KB Output is correct
8 Correct 157 ms 1044 KB Output is correct
9 Correct 100 ms 1044 KB Output is correct
10 Correct 128 ms 1044 KB Output is correct
11 Correct 141 ms 1044 KB Output is correct
12 Correct 131 ms 1044 KB Output is correct
13 Correct 86 ms 1044 KB Output is correct
14 Correct 120 ms 1044 KB Output is correct
15 Correct 157 ms 1044 KB Output is correct
16 Correct 124 ms 1044 KB Output is correct
17 Correct 126 ms 1044 KB Output is correct
18 Correct 147 ms 1044 KB Output is correct
19 Correct 159 ms 1044 KB Output is correct
20 Correct 124 ms 1044 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1044 KB Output is correct
2 Correct 121 ms 1044 KB Output is correct
3 Correct 150 ms 1044 KB Output is correct
4 Correct 139 ms 1044 KB Output is correct
5 Correct 143 ms 1044 KB Output is correct
6 Correct 138 ms 1044 KB Output is correct
7 Correct 107 ms 1044 KB Output is correct
8 Correct 157 ms 1044 KB Output is correct
9 Correct 100 ms 1044 KB Output is correct
10 Correct 128 ms 1044 KB Output is correct
11 Correct 141 ms 1044 KB Output is correct
12 Correct 131 ms 1044 KB Output is correct
13 Correct 86 ms 1044 KB Output is correct
14 Correct 120 ms 1044 KB Output is correct
15 Correct 157 ms 1044 KB Output is correct
16 Correct 124 ms 1044 KB Output is correct
17 Correct 126 ms 1044 KB Output is correct
18 Correct 147 ms 1044 KB Output is correct
19 Correct 159 ms 1044 KB Output is correct
20 Correct 124 ms 1044 KB Output is correct
21 Execution timed out 2020 ms 1044 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 0 ms 688 KB Output is correct
10 Correct 2 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 2 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 2 ms 688 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 688 KB Output is correct
17 Correct 3 ms 688 KB Output is correct
18 Correct 6 ms 688 KB Output is correct
19 Correct 5 ms 688 KB Output is correct
20 Correct 2 ms 688 KB Output is correct
21 Correct 7 ms 688 KB Output is correct
22 Correct 19 ms 692 KB Output is correct
23 Correct 10 ms 692 KB Output is correct
24 Correct 34 ms 792 KB Output is correct
25 Correct 27 ms 792 KB Output is correct
26 Correct 61 ms 940 KB Output is correct
27 Correct 48 ms 940 KB Output is correct
28 Correct 31 ms 940 KB Output is correct
29 Correct 43 ms 984 KB Output is correct
30 Correct 63 ms 984 KB Output is correct
31 Correct 52 ms 984 KB Output is correct
32 Correct 64 ms 984 KB Output is correct
33 Correct 4 ms 984 KB Output is correct
34 Correct 27 ms 984 KB Output is correct
35 Correct 134 ms 984 KB Output is correct
36 Correct 62 ms 984 KB Output is correct
37 Correct 39 ms 984 KB Output is correct
38 Correct 55 ms 984 KB Output is correct
39 Correct 52 ms 984 KB Output is correct
40 Correct 62 ms 1028 KB Output is correct
41 Correct 33 ms 1044 KB Output is correct
42 Correct 42 ms 1044 KB Output is correct
43 Correct 47 ms 1044 KB Output is correct
44 Correct 50 ms 1044 KB Output is correct
45 Correct 31 ms 1044 KB Output is correct
46 Correct 121 ms 1044 KB Output is correct
47 Correct 150 ms 1044 KB Output is correct
48 Correct 139 ms 1044 KB Output is correct
49 Correct 143 ms 1044 KB Output is correct
50 Correct 138 ms 1044 KB Output is correct
51 Correct 107 ms 1044 KB Output is correct
52 Correct 157 ms 1044 KB Output is correct
53 Correct 100 ms 1044 KB Output is correct
54 Correct 128 ms 1044 KB Output is correct
55 Correct 141 ms 1044 KB Output is correct
56 Correct 131 ms 1044 KB Output is correct
57 Correct 86 ms 1044 KB Output is correct
58 Correct 120 ms 1044 KB Output is correct
59 Correct 157 ms 1044 KB Output is correct
60 Correct 124 ms 1044 KB Output is correct
61 Correct 126 ms 1044 KB Output is correct
62 Correct 147 ms 1044 KB Output is correct
63 Correct 159 ms 1044 KB Output is correct
64 Correct 124 ms 1044 KB Output is correct
65 Execution timed out 2020 ms 1044 KB Time limit exceeded
66 Halted 0 ms 0 KB -