oj.uz

Submission #55516

# Submission time Handle Problem Language Result Execution time Memory
55516 2018-07-07T20:33:37 Z ksun48 Cultivation (JOI17_cultivation) C++14
80 / 100
 2000 ms 45888 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 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 idx(LL a){
	int s = 0;
	int e = xlist.size();
	while(s + 1 < e){
		int m = (s+e) / 2;
		if(a >= xlist[m]){
			s = m;
		} else {
			e = m;
		}
	}
	return s;
}

void tryxfast(int x){
	if(x < 0){
		return;
	}
	vector<int> pos1;
	vector<int> pos2;
	for(int a : xlist){
		pos1.push_back(a - x);
		pos2.push_back(a + 1);
	}
	vector<int> pos(pos1.size() + pos2.size());
	merge(pos1.begin(), pos1.end(), pos2.begin(), pos2.end(), pos.begin());

	vector<int> ups;
	vector<int> downs;
	vector<int> totals;

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


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

int main(){
	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);
	}

	// 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);
		}
	}
	for(int r : trying){
		tryxfast(r);
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In constructor 'maxqueue::maxqueue()':
cultivation.cpp:21:6: warning: 'maxqueue::len' will be initialized after [-Wreorder]
  int len;
      ^~~
cultivation.cpp:18:14: warning:   'std::vector<int> maxqueue::elements' [-Wreorder]
  vector<int> elements;
              ^~~~~~~~
cultivation.cpp:22: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:26: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 'void tryxfast(int)':
cultivation.cpp:76:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:77:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(a + 1 < xlist.size() && (LL)xlist[a+1] <= (LL)pos[i] + (LL)x) a++;
         ~~~~~~^~~~~~~~~~~~~~
cultivation.cpp:78:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(b + 1 < xlist.size() && (LL)xlist[b+1] <= (LL)pos[i] - (LL)1) b++;
         ~~~~~~^~~~~~~~~~~~~~
cultivation.cpp:91:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:92:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j < pos.size() && pos[j] <= pos[i] + r - 1){
         ~~^~~~~~~~~~~~
cultivation.cpp: In function 'int main()':
cultivation.cpp:130:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < xlist.size(); i++){
                 ~~^~~~~~~~~~~~~~
cultivation.cpp:134:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k = 0; k < seeds.size(); k++){
                  ~~^~~~~~~~~~~~~~

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 3 ms 428 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 2 ms 568 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 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 3 ms 428 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 2 ms 568 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 636 KB Output is correct
18 Correct 4 ms 668 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 2 ms 764 KB Output is correct
21 Correct 5 ms 764 KB Output is correct
22 Correct 6 ms 764 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 11 ms 800 KB Output is correct
25 Correct 9 ms 800 KB Output is correct
26 Correct 18 ms 892 KB Output is correct
27 Correct 17 ms 908 KB Output is correct
28 Correct 11 ms 908 KB Output is correct
29 Correct 17 ms 908 KB Output is correct
30 Correct 18 ms 908 KB Output is correct
31 Correct 18 ms 908 KB Output is correct
32 Correct 19 ms 908 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 3 ms 428 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 2 ms 568 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 636 KB Output is correct
18 Correct 4 ms 668 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 2 ms 764 KB Output is correct
21 Correct 5 ms 764 KB Output is correct
22 Correct 6 ms 764 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 11 ms 800 KB Output is correct
25 Correct 9 ms 800 KB Output is correct
26 Correct 18 ms 892 KB Output is correct
27 Correct 17 ms 908 KB Output is correct
28 Correct 11 ms 908 KB Output is correct
29 Correct 17 ms 908 KB Output is correct
30 Correct 18 ms 908 KB Output is correct
31 Correct 18 ms 908 KB Output is correct
32 Correct 19 ms 908 KB Output is correct
33 Correct 5 ms 908 KB Output is correct
34 Correct 10 ms 908 KB Output is correct
35 Correct 15 ms 908 KB Output is correct
36 Correct 15 ms 908 KB Output is correct
37 Correct 14 ms 908 KB Output is correct
38 Correct 16 ms 908 KB Output is correct
39 Correct 18 ms 908 KB Output is correct
40 Correct 17 ms 908 KB Output is correct
41 Correct 10 ms 908 KB Output is correct
42 Correct 12 ms 908 KB Output is correct
43 Correct 16 ms 908 KB Output is correct
44 Correct 19 ms 908 KB Output is correct

Subtask #4
30.0 / 30.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1020 KB Output is correct
2 Correct 9 ms 1148 KB Output is correct
3 Correct 11 ms 1148 KB Output is correct
4 Correct 9 ms 1532 KB Output is correct
5 Correct 9 ms 1532 KB Output is correct
6 Correct 5 ms 1532 KB Output is correct
7 Correct 2 ms 1532 KB Output is correct
8 Correct 9 ms 1532 KB Output is correct
9 Correct 6 ms 1532 KB Output is correct
10 Correct 8 ms 1532 KB Output is correct
11 Correct 14 ms 1532 KB Output is correct
12 Correct 9 ms 1532 KB Output is correct
13 Correct 4 ms 1532 KB Output is correct
14 Correct 6 ms 1532 KB Output is correct
15 Correct 4 ms 1532 KB Output is correct
16 Correct 8 ms 1532 KB Output is correct
17 Correct 7 ms 1532 KB Output is correct
18 Correct 8 ms 1532 KB Output is correct
19 Correct 8 ms 1532 KB Output is correct
20 Correct 12 ms 1532 KB Output is correct
21 Correct 189 ms 7344 KB Output is correct
22 Correct 298 ms 9968 KB Output is correct
23 Correct 281 ms 10120 KB Output is correct
24 Correct 287 ms 10536 KB Output is correct
25 Correct 278 ms 10536 KB Output is correct
26 Correct 88 ms 10536 KB Output is correct
27 Correct 312 ms 34784 KB Output is correct
28 Correct 261 ms 34784 KB Output is correct
29 Correct 275 ms 34784 KB Output is correct
30 Correct 300 ms 34784 KB Output is correct
31 Correct 266 ms 34784 KB Output is correct
32 Correct 235 ms 34784 KB Output is correct
33 Correct 350 ms 38652 KB Output is correct
34 Correct 265 ms 38652 KB Output is correct
35 Correct 294 ms 38652 KB Output is correct
36 Correct 310 ms 38652 KB Output is correct

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 3 ms 428 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 2 ms 568 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 636 KB Output is correct
18 Correct 4 ms 668 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 2 ms 764 KB Output is correct
21 Correct 5 ms 764 KB Output is correct
22 Correct 6 ms 764 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 11 ms 800 KB Output is correct
25 Correct 9 ms 800 KB Output is correct
26 Correct 18 ms 892 KB Output is correct
27 Correct 17 ms 908 KB Output is correct
28 Correct 11 ms 908 KB Output is correct
29 Correct 17 ms 908 KB Output is correct
30 Correct 18 ms 908 KB Output is correct
31 Correct 18 ms 908 KB Output is correct
32 Correct 19 ms 908 KB Output is correct
33 Correct 5 ms 908 KB Output is correct
34 Correct 10 ms 908 KB Output is correct
35 Correct 15 ms 908 KB Output is correct
36 Correct 15 ms 908 KB Output is correct
37 Correct 14 ms 908 KB Output is correct
38 Correct 16 ms 908 KB Output is correct
39 Correct 18 ms 908 KB Output is correct
40 Correct 17 ms 908 KB Output is correct
41 Correct 10 ms 908 KB Output is correct
42 Correct 12 ms 908 KB Output is correct
43 Correct 16 ms 908 KB Output is correct
44 Correct 19 ms 908 KB Output is correct
45 Correct 7 ms 1020 KB Output is correct
46 Correct 9 ms 1148 KB Output is correct
47 Correct 11 ms 1148 KB Output is correct
48 Correct 9 ms 1532 KB Output is correct
49 Correct 9 ms 1532 KB Output is correct
50 Correct 5 ms 1532 KB Output is correct
51 Correct 2 ms 1532 KB Output is correct
52 Correct 9 ms 1532 KB Output is correct
53 Correct 6 ms 1532 KB Output is correct
54 Correct 8 ms 1532 KB Output is correct
55 Correct 14 ms 1532 KB Output is correct
56 Correct 9 ms 1532 KB Output is correct
57 Correct 4 ms 1532 KB Output is correct
58 Correct 6 ms 1532 KB Output is correct
59 Correct 4 ms 1532 KB Output is correct
60 Correct 8 ms 1532 KB Output is correct
61 Correct 7 ms 1532 KB Output is correct
62 Correct 8 ms 1532 KB Output is correct
63 Correct 8 ms 1532 KB Output is correct
64 Correct 12 ms 1532 KB Output is correct
65 Correct 189 ms 7344 KB Output is correct
66 Correct 298 ms 9968 KB Output is correct
67 Correct 281 ms 10120 KB Output is correct
68 Correct 287 ms 10536 KB Output is correct
69 Correct 278 ms 10536 KB Output is correct
70 Correct 88 ms 10536 KB Output is correct
71 Correct 312 ms 34784 KB Output is correct
72 Correct 261 ms 34784 KB Output is correct
73 Correct 275 ms 34784 KB Output is correct
74 Correct 300 ms 34784 KB Output is correct
75 Correct 266 ms 34784 KB Output is correct
76 Correct 235 ms 34784 KB Output is correct
77 Correct 350 ms 38652 KB Output is correct
78 Correct 265 ms 38652 KB Output is correct
79 Correct 294 ms 38652 KB Output is correct
80 Correct 310 ms 38652 KB Output is correct
81 Execution timed out 2063 ms 45888 KB Time limit exceeded
82 Halted 0 ms 0 KB -