oj.uz

Submission #55622

# Submission time Handle Problem Language Result Execution time Memory
55622 2018-07-08T08:14:36 Z ksun48 Cultivation (JOI17_cultivation) C++14
100 / 100
 1272 ms 180312 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int r, c, n;
vector<pair<int,int> > seeds;
const int INF = 2100100100;
int best = INF;
set<int> tried;

vector<int> xlist;
int len;

int up[400][400];
int down[400][400];
int total[400][400];

struct maxqueue {
	vector<int> elements;
	vector<int> indices;
	int s;
	int len;
	maxqueue() : s(0), len(0), elements(0), indices(0) {}
};

void insert(maxqueue* m, int f){
	while(m->elements.size() > 0 && m->elements.size() > m->s && m->elements[m->elements.size()-1] <= f){
		m->elements.pop_back();
		m->indices.pop_back();
	}
	m->elements.push_back(f);
	m->indices.push_back(m->len);
	m->len++;
}
int get(maxqueue* m){
	return m->elements[m->s];
}
void pop(maxqueue *m, int idx){
	if(m->indices[m->s] == idx){
		m->s++;
	}
}

int ups[700];
int downs[700];
int totals[700];
int pos1[700];
int pos2[700];
int pos[700];

int lastc = 0;

void tryxfast(int x){
	if(x < 0 || (x+1) <= (r-1)/n || (LL)x >= (LL)best - (LL)lastc){
		return;
	}
	for(int i = 0; i < len; i++){
		pos1[i] = xlist[i] - x;
		pos2[i] = xlist[i] + 1;
	}
	merge(pos1, pos1 + len, pos2, pos2 + len, pos);

	int sz = len * 2;

	int a = 0;
	int b = 0;
	for(int i = 0; i < sz; i++){
		while(a + 1 < len && xlist[a+1] - x <= pos[i]) a++;
		while(b + 1 < len && xlist[b+1] + 1 <= pos[i]) b++;
		// a >= b
		ups[i] = up[a][b];
		downs[i] = down[a][b];
		totals[i] = total[a][b];
	}

	// two pointers: 
	int j = 0;
	maxqueue* upset    = new maxqueue();
	maxqueue* downset  = new maxqueue();
	maxqueue* totalset = new maxqueue();
	LL bestneed = best + 1;
	for(int i = 0; i < sz; i++){
		while(j < sz && pos[j] <= pos[i] + r - 1){
			insert(upset, ups[j]);
			insert(downset, downs[j]);
			insert(totalset, totals[j]);
			j++;
		}
		if(j == sz) break;
		int total = get(totalset);
		if(total < c+1){
			LL need = max((LL)get(upset) + (LL)get(downset), (LL)total - 1);
			bestneed = min(bestneed, need);
		}
		pop(upset, i);
		pop(downset, i);
		pop(totalset, i);
	}
	lastc = bestneed;
	best = min((LL)best, bestneed + (LL)x);
}

int main(){
	double st = clock();
	cin.sync_with_stdio(0); cin.tie(0);
	cin >> r >> c >> n;
	for(int i = 0; i < n; i++){
		int s, e;
		cin >> s >> e;
		s--; e--;
		seeds.push_back({e,s});
	}
	sort(seeds.begin(), seeds.end());
	set<int> xset;
	for(int i = 0; i < n; i++){
		swap(seeds[i].first, seeds[i].second);
		xset.insert(seeds[i].first);
	}
	xlist.push_back(-1);
	for(int x : xset){
		xlist.push_back(x);
	}
	len = xlist.size();

	// now n^2 log n
	for(int i = 0; i < xlist.size(); i++){
		vector<int> ins[xlist.size() + 1];
		vector<int> del[xlist.size() + 1];

		for(int k = 0; k < seeds.size(); k++){
			int p = seeds[k].first;
			if(p <= xlist[i]){
				ins[0].push_back(seeds[k].second);
				int jdel = lower_bound(xlist.begin(), xlist.end(), p) - xlist.begin();
				del[jdel].push_back(seeds[k].second);
			}
		}

		multiset<int> grass;
		grass.insert(-1);
		grass.insert(c);
		multiset<int> diffs;
		diffs.insert(-(c+1));
		for(int j = 0; j <= i; j++){
			for(int a : del[j]){
				int a1 = *(--grass.find(a));
				int a2 = *(++grass.find(a));
				diffs.erase(diffs.find(a1-a));
				diffs.erase(diffs.find(a-a2));
				diffs.insert(a1-a2);
				grass.erase(grass.find(a));
			}
			for(int a : ins[j]){
				grass.insert(a);
				int a1 = *(--grass.find(a));
				int a2 = *(++grass.find(a));
				diffs.erase(diffs.find(a1-a2));
				diffs.insert(a1-a);
				diffs.insert(a-a2);
			}
			total[i][j] = -*diffs.begin();
			up[i][j] = *(++grass.begin()) - 0;
			down[i][j] = c-1 - *(--(--grass.end()));
		}
	}

	set<int> trying;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			trying.insert(-(seeds[i].first + r-1 - seeds[j].first));
			trying.insert(-(seeds[i].first -   1 - seeds[j].first));
		}
	}
	vector<int> tries;
	for(int r : trying){
		tries.push_back(-r);
	}
	for(int j = 50000; j < 60000 && j < tries.size(); j++){
		lastc = 0;
		tryxfast(tries[tries.size()-1-j]);
	}
	for(int j = 80000; j < 100000 && j < tries.size(); j++){
		lastc = 0;
		tryxfast(tries[tries.size()-1-j]);
	}
	lastc = 0;
	for(int r : tries){
		if(clock() > st + 1.95 * CLOCKS_PER_SEC) break;
		tryxfast(r);
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In constructor 'maxqueue::maxqueue()':
cultivation.cpp:22:6: warning: 'maxqueue::len' will be initialized after [-Wreorder]
  int len;
      ^~~
cultivation.cpp:19:14: warning:   'std::vector<int> maxqueue::elements' [-Wreorder]
  vector<int> elements;
              ^~~~~~~~
cultivation.cpp:23:2: warning:   when initialized here [-Wreorder]
  maxqueue() : s(0), len(0), elements(0), indices(0) {}
  ^~~~~~~~
cultivation.cpp: In function 'void insert(maxqueue*, int)':
cultivation.cpp:27:53: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(m->elements.size() > 0 && m->elements.size() > m->s && m->elements[m->elements.size()-1] <= f){
                                  ~~~~~~~~~~~~~~~~~~~^~~~~~
cultivation.cpp: In function 'int main()':
cultivation.cpp:126:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < xlist.size(); i++){
                 ~~^~~~~~~~~~~~~~
cultivation.cpp:130:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k = 0; k < seeds.size(); k++){
                  ~~^~~~~~~~~~~~~~
cultivation.cpp:178:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 50000; j < 60000 && j < tries.size(); j++){
                                  ~~^~~~~~~~~~~~~~
cultivation.cpp:182:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 80000; j < 100000 && j < tries.size(); j++){
                                   ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 3 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 3 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 3 ms 748 KB Output is correct
18 Correct 4 ms 764 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 764 KB Output is correct
21 Correct 4 ms 764 KB Output is correct
22 Correct 6 ms 892 KB Output is correct
23 Correct 3 ms 892 KB Output is correct
24 Correct 11 ms 892 KB Output is correct
25 Correct 9 ms 892 KB Output is correct
26 Correct 21 ms 892 KB Output is correct
27 Correct 17 ms 892 KB Output is correct
28 Correct 12 ms 892 KB Output is correct
29 Correct 16 ms 892 KB Output is correct
30 Correct 17 ms 892 KB Output is correct
31 Correct 18 ms 896 KB Output is correct
32 Correct 17 ms 896 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 3 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 3 ms 748 KB Output is correct
18 Correct 4 ms 764 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 764 KB Output is correct
21 Correct 4 ms 764 KB Output is correct
22 Correct 6 ms 892 KB Output is correct
23 Correct 3 ms 892 KB Output is correct
24 Correct 11 ms 892 KB Output is correct
25 Correct 9 ms 892 KB Output is correct
26 Correct 21 ms 892 KB Output is correct
27 Correct 17 ms 892 KB Output is correct
28 Correct 12 ms 892 KB Output is correct
29 Correct 16 ms 892 KB Output is correct
30 Correct 17 ms 892 KB Output is correct
31 Correct 18 ms 896 KB Output is correct
32 Correct 17 ms 896 KB Output is correct
33 Correct 6 ms 896 KB Output is correct
34 Correct 11 ms 896 KB Output is correct
35 Correct 17 ms 896 KB Output is correct
36 Correct 17 ms 896 KB Output is correct
37 Correct 15 ms 896 KB Output is correct
38 Correct 17 ms 896 KB Output is correct
39 Correct 18 ms 896 KB Output is correct
40 Correct 18 ms 896 KB Output is correct
41 Correct 11 ms 896 KB Output is correct
42 Correct 15 ms 896 KB Output is correct
43 Correct 20 ms 896 KB Output is correct
44 Correct 21 ms 1004 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1004 KB Output is correct
2 Correct 5 ms 1020 KB Output is correct
3 Correct 9 ms 1148 KB Output is correct
4 Correct 6 ms 1148 KB Output is correct
5 Correct 7 ms 1148 KB Output is correct
6 Correct 5 ms 1148 KB Output is correct
7 Correct 2 ms 1148 KB Output is correct
8 Correct 6 ms 1148 KB Output is correct
9 Correct 4 ms 1148 KB Output is correct
10 Correct 6 ms 1148 KB Output is correct
11 Correct 6 ms 1148 KB Output is correct
12 Correct 7 ms 1148 KB Output is correct
13 Correct 3 ms 1148 KB Output is correct
14 Correct 6 ms 1148 KB Output is correct
15 Correct 4 ms 1148 KB Output is correct
16 Correct 6 ms 1148 KB Output is correct
17 Correct 5 ms 1148 KB Output is correct
18 Correct 4 ms 1148 KB Output is correct
19 Correct 6 ms 1148 KB Output is correct
20 Correct 6 ms 1148 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1004 KB Output is correct
2 Correct 5 ms 1020 KB Output is correct
3 Correct 9 ms 1148 KB Output is correct
4 Correct 6 ms 1148 KB Output is correct
5 Correct 7 ms 1148 KB Output is correct
6 Correct 5 ms 1148 KB Output is correct
7 Correct 2 ms 1148 KB Output is correct
8 Correct 6 ms 1148 KB Output is correct
9 Correct 4 ms 1148 KB Output is correct
10 Correct 6 ms 1148 KB Output is correct
11 Correct 6 ms 1148 KB Output is correct
12 Correct 7 ms 1148 KB Output is correct
13 Correct 3 ms 1148 KB Output is correct
14 Correct 6 ms 1148 KB Output is correct
15 Correct 4 ms 1148 KB Output is correct
16 Correct 6 ms 1148 KB Output is correct
17 Correct 5 ms 1148 KB Output is correct
18 Correct 4 ms 1148 KB Output is correct
19 Correct 6 ms 1148 KB Output is correct
20 Correct 6 ms 1148 KB Output is correct
21 Correct 98 ms 6592 KB Output is correct
22 Correct 152 ms 8188 KB Output is correct
23 Correct 93 ms 8188 KB Output is correct
24 Correct 79 ms 8188 KB Output is correct
25 Correct 163 ms 8188 KB Output is correct
26 Correct 35 ms 8188 KB Output is correct
27 Correct 26 ms 8188 KB Output is correct
28 Correct 145 ms 8188 KB Output is correct
29 Correct 89 ms 8188 KB Output is correct
30 Correct 126 ms 8188 KB Output is correct
31 Correct 156 ms 8664 KB Output is correct
32 Correct 135 ms 8664 KB Output is correct
33 Correct 28 ms 8664 KB Output is correct
34 Correct 127 ms 8664 KB Output is correct
35 Correct 117 ms 8744 KB Output is correct
36 Correct 66 ms 8744 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 3 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 3 ms 748 KB Output is correct
18 Correct 4 ms 764 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 764 KB Output is correct
21 Correct 4 ms 764 KB Output is correct
22 Correct 6 ms 892 KB Output is correct
23 Correct 3 ms 892 KB Output is correct
24 Correct 11 ms 892 KB Output is correct
25 Correct 9 ms 892 KB Output is correct
26 Correct 21 ms 892 KB Output is correct
27 Correct 17 ms 892 KB Output is correct
28 Correct 12 ms 892 KB Output is correct
29 Correct 16 ms 892 KB Output is correct
30 Correct 17 ms 892 KB Output is correct
31 Correct 18 ms 896 KB Output is correct
32 Correct 17 ms 896 KB Output is correct
33 Correct 6 ms 896 KB Output is correct
34 Correct 11 ms 896 KB Output is correct
35 Correct 17 ms 896 KB Output is correct
36 Correct 17 ms 896 KB Output is correct
37 Correct 15 ms 896 KB Output is correct
38 Correct 17 ms 896 KB Output is correct
39 Correct 18 ms 896 KB Output is correct
40 Correct 18 ms 896 KB Output is correct
41 Correct 11 ms 896 KB Output is correct
42 Correct 15 ms 896 KB Output is correct
43 Correct 20 ms 896 KB Output is correct
44 Correct 21 ms 1004 KB Output is correct
45 Correct 4 ms 1004 KB Output is correct
46 Correct 5 ms 1020 KB Output is correct
47 Correct 9 ms 1148 KB Output is correct
48 Correct 6 ms 1148 KB Output is correct
49 Correct 7 ms 1148 KB Output is correct
50 Correct 5 ms 1148 KB Output is correct
51 Correct 2 ms 1148 KB Output is correct
52 Correct 6 ms 1148 KB Output is correct
53 Correct 4 ms 1148 KB Output is correct
54 Correct 6 ms 1148 KB Output is correct
55 Correct 6 ms 1148 KB Output is correct
56 Correct 7 ms 1148 KB Output is correct
57 Correct 3 ms 1148 KB Output is correct
58 Correct 6 ms 1148 KB Output is correct
59 Correct 4 ms 1148 KB Output is correct
60 Correct 6 ms 1148 KB Output is correct
61 Correct 5 ms 1148 KB Output is correct
62 Correct 4 ms 1148 KB Output is correct
63 Correct 6 ms 1148 KB Output is correct
64 Correct 6 ms 1148 KB Output is correct
65 Correct 98 ms 6592 KB Output is correct
66 Correct 152 ms 8188 KB Output is correct
67 Correct 93 ms 8188 KB Output is correct
68 Correct 79 ms 8188 KB Output is correct
69 Correct 163 ms 8188 KB Output is correct
70 Correct 35 ms 8188 KB Output is correct
71 Correct 26 ms 8188 KB Output is correct
72 Correct 145 ms 8188 KB Output is correct
73 Correct 89 ms 8188 KB Output is correct
74 Correct 126 ms 8188 KB Output is correct
75 Correct 156 ms 8664 KB Output is correct
76 Correct 135 ms 8664 KB Output is correct
77 Correct 28 ms 8664 KB Output is correct
78 Correct 127 ms 8664 KB Output is correct
79 Correct 117 ms 8744 KB Output is correct
80 Correct 66 ms 8744 KB Output is correct
81 Correct 627 ms 19208 KB Output is correct
82 Correct 555 ms 19208 KB Output is correct
83 Correct 423 ms 19208 KB Output is correct
84 Correct 885 ms 138744 KB Output is correct
85 Correct 515 ms 138744 KB Output is correct
86 Correct 568 ms 138744 KB Output is correct
87 Correct 450 ms 138744 KB Output is correct
88 Correct 1272 ms 138744 KB Output is correct
89 Correct 1044 ms 138744 KB Output is correct
90 Correct 956 ms 138744 KB Output is correct
91 Correct 729 ms 138744 KB Output is correct
92 Correct 670 ms 138744 KB Output is correct
93 Correct 1142 ms 138744 KB Output is correct
94 Correct 1262 ms 180312 KB Output is correct
95 Correct 569 ms 180312 KB Output is correct
96 Correct 824 ms 180312 KB Output is correct
97 Correct 1212 ms 180312 KB Output is correct
98 Correct 8 ms 180312 KB Output is correct