oj.uz

Submission #55309

# Submission time Handle Problem Language Result Execution time Memory
55309 2018-07-06T23:28:32 Z ksun48 Cultivation (JOI17_cultivation) C++14
45 / 100
 2000 ms 1276 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;

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++;
	}
}

void tryxfast(int x){
	if(x < 0){
		return;
	}
	set<int> times;
	for(pair<int,int> z : seeds){
		times.insert(z.first - x);
		times.insert(z.first + 1);
	}
	vector<int> pos;
	map<int,int> idx;
	for(int t : times){
		idx[t] = pos.size();
		pos.push_back(t);
	}
	vector<int> ins[pos.size()];
	vector<int> del[pos.size()];
	for(pair<int,int> z : seeds){
		ins[idx[z.first - x]].push_back(z.second); // ins
		del[idx[z.first + 1]].push_back(z.second); // del
	}

	for(int i = 0; i < pos.size(); i++){
	vector<int> ups;
	vector<int> downs;
	vector<int> totals;

	multiset<int> grass;
	grass.insert(-1);
	grass.insert(c);
	multiset<int> diffs;
	diffs.insert(-(c+1));
	for(int i = 0; i < pos.size(); i++){
		for(int a : del[i]){
			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[i]){
			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);
		}
		totals.push_back( -*diffs.begin() );
		ups.push_back( *(++grass.begin()) - 0 );
		downs.push_back( c-1 - *(--(--grass.end())) );
	}
	// 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);
	}
	delete upset;
	delete downset;
	delete totalset;
	}
}
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({s,e});
	}
	sort(seeds.begin(), seeds.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:15:6: warning: 'maxqueue::len' will be initialized after [-Wreorder]
  int len;
      ^~~
cultivation.cpp:12:14: warning:   'std::vector<int> maxqueue::elements' [-Wreorder]
  vector<int> elements;
              ^~~~~~~~
cultivation.cpp:16: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:20: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:59:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:95:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:96:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j < pos.size() && pos[j] <= pos[i] + r - 1){
         ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 2 ms 684 KB Output is correct
12 Correct 2 ms 684 KB Output is correct
13 Correct 2 ms 684 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 684 KB Output is correct
16 Correct 2 ms 684 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 2 ms 684 KB Output is correct
12 Correct 2 ms 684 KB Output is correct
13 Correct 2 ms 684 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 684 KB Output is correct
16 Correct 2 ms 684 KB Output is correct
17 Correct 12 ms 684 KB Output is correct
18 Correct 97 ms 684 KB Output is correct
19 Correct 40 ms 684 KB Output is correct
20 Correct 5 ms 684 KB Output is correct
21 Correct 134 ms 684 KB Output is correct
22 Correct 616 ms 764 KB Output is correct
23 Correct 15 ms 764 KB Output is correct
24 Correct 1096 ms 892 KB Output is correct
25 Correct 887 ms 892 KB Output is correct
26 Correct 1658 ms 1020 KB Output is correct
27 Correct 1709 ms 1020 KB Output is correct
28 Correct 1004 ms 1020 KB Output is correct
29 Correct 1386 ms 1020 KB Output is correct
30 Correct 1735 ms 1020 KB Output is correct
31 Correct 1689 ms 1020 KB Output is correct
32 Correct 1568 ms 1020 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 2 ms 684 KB Output is correct
12 Correct 2 ms 684 KB Output is correct
13 Correct 2 ms 684 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 684 KB Output is correct
16 Correct 2 ms 684 KB Output is correct
17 Correct 12 ms 684 KB Output is correct
18 Correct 97 ms 684 KB Output is correct
19 Correct 40 ms 684 KB Output is correct
20 Correct 5 ms 684 KB Output is correct
21 Correct 134 ms 684 KB Output is correct
22 Correct 616 ms 764 KB Output is correct
23 Correct 15 ms 764 KB Output is correct
24 Correct 1096 ms 892 KB Output is correct
25 Correct 887 ms 892 KB Output is correct
26 Correct 1658 ms 1020 KB Output is correct
27 Correct 1709 ms 1020 KB Output is correct
28 Correct 1004 ms 1020 KB Output is correct
29 Correct 1386 ms 1020 KB Output is correct
30 Correct 1735 ms 1020 KB Output is correct
31 Correct 1689 ms 1020 KB Output is correct
32 Correct 1568 ms 1020 KB Output is correct
33 Correct 6 ms 1020 KB Output is correct
34 Correct 1076 ms 1020 KB Output is correct
35 Correct 1943 ms 1020 KB Output is correct
36 Execution timed out 2081 ms 1020 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 1020 KB Output is correct
2 Correct 529 ms 1020 KB Output is correct
3 Correct 640 ms 1020 KB Output is correct
4 Correct 766 ms 1020 KB Output is correct
5 Correct 712 ms 1020 KB Output is correct
6 Correct 219 ms 1020 KB Output is correct
7 Correct 27 ms 1020 KB Output is correct
8 Correct 684 ms 1020 KB Output is correct
9 Correct 285 ms 1020 KB Output is correct
10 Correct 723 ms 1020 KB Output is correct
11 Correct 727 ms 1020 KB Output is correct
12 Correct 664 ms 1020 KB Output is correct
13 Correct 73 ms 1020 KB Output is correct
14 Correct 219 ms 1020 KB Output is correct
15 Correct 142 ms 1020 KB Output is correct
16 Correct 678 ms 1020 KB Output is correct
17 Correct 708 ms 1020 KB Output is correct
18 Correct 277 ms 1020 KB Output is correct
19 Correct 635 ms 1020 KB Output is correct
20 Correct 709 ms 1020 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 1020 KB Output is correct
2 Correct 529 ms 1020 KB Output is correct
3 Correct 640 ms 1020 KB Output is correct
4 Correct 766 ms 1020 KB Output is correct
5 Correct 712 ms 1020 KB Output is correct
6 Correct 219 ms 1020 KB Output is correct
7 Correct 27 ms 1020 KB Output is correct
8 Correct 684 ms 1020 KB Output is correct
9 Correct 285 ms 1020 KB Output is correct
10 Correct 723 ms 1020 KB Output is correct
11 Correct 727 ms 1020 KB Output is correct
12 Correct 664 ms 1020 KB Output is correct
13 Correct 73 ms 1020 KB Output is correct
14 Correct 219 ms 1020 KB Output is correct
15 Correct 142 ms 1020 KB Output is correct
16 Correct 678 ms 1020 KB Output is correct
17 Correct 708 ms 1020 KB Output is correct
18 Correct 277 ms 1020 KB Output is correct
19 Correct 635 ms 1020 KB Output is correct
20 Correct 709 ms 1020 KB Output is correct
21 Execution timed out 2041 ms 1276 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 684 KB Output is correct
11 Correct 2 ms 684 KB Output is correct
12 Correct 2 ms 684 KB Output is correct
13 Correct 2 ms 684 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 684 KB Output is correct
16 Correct 2 ms 684 KB Output is correct
17 Correct 12 ms 684 KB Output is correct
18 Correct 97 ms 684 KB Output is correct
19 Correct 40 ms 684 KB Output is correct
20 Correct 5 ms 684 KB Output is correct
21 Correct 134 ms 684 KB Output is correct
22 Correct 616 ms 764 KB Output is correct
23 Correct 15 ms 764 KB Output is correct
24 Correct 1096 ms 892 KB Output is correct
25 Correct 887 ms 892 KB Output is correct
26 Correct 1658 ms 1020 KB Output is correct
27 Correct 1709 ms 1020 KB Output is correct
28 Correct 1004 ms 1020 KB Output is correct
29 Correct 1386 ms 1020 KB Output is correct
30 Correct 1735 ms 1020 KB Output is correct
31 Correct 1689 ms 1020 KB Output is correct
32 Correct 1568 ms 1020 KB Output is correct
33 Correct 6 ms 1020 KB Output is correct
34 Correct 1076 ms 1020 KB Output is correct
35 Correct 1943 ms 1020 KB Output is correct
36 Execution timed out 2081 ms 1020 KB Time limit exceeded
37 Halted 0 ms 0 KB -