oj.uz

Submission #55302

# Submission time Handle Problem Language Result Execution time Memory
55302 2018-07-06T23:06:02 Z ksun48 Cultivation (JOI17_cultivation) C++14
60 / 100
 2000 ms 1308 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 curidx;
	int len;
	maxqueue() : s(0), curidx(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){
	if(m->indices[m->s] == m->curidx){
		m->s++;
	}
	m->curidx++;
}

void tryxfast(int x){
	if(x < 0 || tried.find(x) != tried.end()){
		return;
	}
	tried.insert(x);
	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
	}

	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 : 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);
		}
		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));
		}
		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);
		pop(downset);
		pop(totalset);
	}
	delete upset;
	delete downset;
	delete totalset;
	/*// two pointers: 
	int j = 0;
	multiset<int> upset;
	multiset<int> downset;
	multiset<int> totalset;
	for(int i = 0; i < pos.size(); i++){
		while(j < pos.size() && pos[j] <= pos[i] + r - 1){
			upset.insert(-ups[j]);
			downset.insert(-downs[j]);
			totalset.insert(-totals[j]);
			j++;
		}
		int total = -*totalset.begin();
		if(total < c+1){
			LL need = max((LL)-*upset.begin() + (LL)-*downset.begin(), (LL)total - 1);
			best = (int)min((LL)best, need + x);
		}
		upset.erase(upset.find(-ups[i]));
		downset.erase(downset.find(-downs[i]));
		totalset.erase(totalset.find(-totals[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({s,e});
	}
	sort(seeds.begin(), seeds.end());
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			tryxfast(seeds[i].first + r-1 - seeds[j].first);
			tryxfast(seeds[i].first -   1 - seeds[j].first);
		}
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In constructor 'maxqueue::maxqueue()':
cultivation.cpp:16: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:17:2: warning:   when initialized here [-Wreorder]
  maxqueue() : s(0), curidx(0), len(0), elements(0), indices(0) {}
  ^~~~~~~~
cultivation.cpp: In function 'void insert(maxqueue*, int)':
cultivation.cpp:21: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:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:97:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:98: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 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 3 ms 620 KB Output is correct
15 Correct 2 ms 620 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 3 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 3 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 3 ms 636 KB Output is correct
18 Correct 7 ms 636 KB Output is correct
19 Correct 6 ms 636 KB Output is correct
20 Correct 2 ms 636 KB Output is correct
21 Correct 7 ms 636 KB Output is correct
22 Correct 18 ms 636 KB Output is correct
23 Correct 4 ms 636 KB Output is correct
24 Correct 25 ms 636 KB Output is correct
25 Correct 20 ms 640 KB Output is correct
26 Correct 36 ms 640 KB Output is correct
27 Correct 50 ms 640 KB Output is correct
28 Correct 27 ms 764 KB Output is correct
29 Correct 34 ms 764 KB Output is correct
30 Correct 35 ms 764 KB Output is correct
31 Correct 35 ms 764 KB Output is correct
32 Correct 36 ms 764 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 3 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 3 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 3 ms 636 KB Output is correct
18 Correct 7 ms 636 KB Output is correct
19 Correct 6 ms 636 KB Output is correct
20 Correct 2 ms 636 KB Output is correct
21 Correct 7 ms 636 KB Output is correct
22 Correct 18 ms 636 KB Output is correct
23 Correct 4 ms 636 KB Output is correct
24 Correct 25 ms 636 KB Output is correct
25 Correct 20 ms 640 KB Output is correct
26 Correct 36 ms 640 KB Output is correct
27 Correct 50 ms 640 KB Output is correct
28 Correct 27 ms 764 KB Output is correct
29 Correct 34 ms 764 KB Output is correct
30 Correct 35 ms 764 KB Output is correct
31 Correct 35 ms 764 KB Output is correct
32 Correct 36 ms 764 KB Output is correct
33 Correct 5 ms 764 KB Output is correct
34 Correct 28 ms 764 KB Output is correct
35 Correct 41 ms 764 KB Output is correct
36 Correct 42 ms 764 KB Output is correct
37 Correct 35 ms 764 KB Output is correct
38 Correct 43 ms 764 KB Output is correct
39 Correct 42 ms 764 KB Output is correct
40 Correct 49 ms 764 KB Output is correct
41 Correct 25 ms 764 KB Output is correct
42 Correct 33 ms 764 KB Output is correct
43 Correct 39 ms 764 KB Output is correct
44 Correct 35 ms 764 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 764 KB Output is correct
2 Correct 29 ms 764 KB Output is correct
3 Correct 32 ms 764 KB Output is correct
4 Correct 30 ms 764 KB Output is correct
5 Correct 32 ms 764 KB Output is correct
6 Correct 13 ms 764 KB Output is correct
7 Correct 5 ms 764 KB Output is correct
8 Correct 33 ms 764 KB Output is correct
9 Correct 21 ms 764 KB Output is correct
10 Correct 34 ms 764 KB Output is correct
11 Correct 43 ms 764 KB Output is correct
12 Correct 33 ms 764 KB Output is correct
13 Correct 11 ms 764 KB Output is correct
14 Correct 17 ms 764 KB Output is correct
15 Correct 10 ms 764 KB Output is correct
16 Correct 33 ms 764 KB Output is correct
17 Correct 34 ms 764 KB Output is correct
18 Correct 16 ms 764 KB Output is correct
19 Correct 34 ms 764 KB Output is correct
20 Correct 32 ms 764 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 764 KB Output is correct
2 Correct 29 ms 764 KB Output is correct
3 Correct 32 ms 764 KB Output is correct
4 Correct 30 ms 764 KB Output is correct
5 Correct 32 ms 764 KB Output is correct
6 Correct 13 ms 764 KB Output is correct
7 Correct 5 ms 764 KB Output is correct
8 Correct 33 ms 764 KB Output is correct
9 Correct 21 ms 764 KB Output is correct
10 Correct 34 ms 764 KB Output is correct
11 Correct 43 ms 764 KB Output is correct
12 Correct 33 ms 764 KB Output is correct
13 Correct 11 ms 764 KB Output is correct
14 Correct 17 ms 764 KB Output is correct
15 Correct 10 ms 764 KB Output is correct
16 Correct 33 ms 764 KB Output is correct
17 Correct 34 ms 764 KB Output is correct
18 Correct 16 ms 764 KB Output is correct
19 Correct 34 ms 764 KB Output is correct
20 Correct 32 ms 764 KB Output is correct
21 Correct 1846 ms 1244 KB Output is correct
22 Execution timed out 2071 ms 1308 KB Time limit exceeded
23 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 3 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 3 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 3 ms 636 KB Output is correct
18 Correct 7 ms 636 KB Output is correct
19 Correct 6 ms 636 KB Output is correct
20 Correct 2 ms 636 KB Output is correct
21 Correct 7 ms 636 KB Output is correct
22 Correct 18 ms 636 KB Output is correct
23 Correct 4 ms 636 KB Output is correct
24 Correct 25 ms 636 KB Output is correct
25 Correct 20 ms 640 KB Output is correct
26 Correct 36 ms 640 KB Output is correct
27 Correct 50 ms 640 KB Output is correct
28 Correct 27 ms 764 KB Output is correct
29 Correct 34 ms 764 KB Output is correct
30 Correct 35 ms 764 KB Output is correct
31 Correct 35 ms 764 KB Output is correct
32 Correct 36 ms 764 KB Output is correct
33 Correct 5 ms 764 KB Output is correct
34 Correct 28 ms 764 KB Output is correct
35 Correct 41 ms 764 KB Output is correct
36 Correct 42 ms 764 KB Output is correct
37 Correct 35 ms 764 KB Output is correct
38 Correct 43 ms 764 KB Output is correct
39 Correct 42 ms 764 KB Output is correct
40 Correct 49 ms 764 KB Output is correct
41 Correct 25 ms 764 KB Output is correct
42 Correct 33 ms 764 KB Output is correct
43 Correct 39 ms 764 KB Output is correct
44 Correct 35 ms 764 KB Output is correct
45 Correct 14 ms 764 KB Output is correct
46 Correct 29 ms 764 KB Output is correct
47 Correct 32 ms 764 KB Output is correct
48 Correct 30 ms 764 KB Output is correct
49 Correct 32 ms 764 KB Output is correct
50 Correct 13 ms 764 KB Output is correct
51 Correct 5 ms 764 KB Output is correct
52 Correct 33 ms 764 KB Output is correct
53 Correct 21 ms 764 KB Output is correct
54 Correct 34 ms 764 KB Output is correct
55 Correct 43 ms 764 KB Output is correct
56 Correct 33 ms 764 KB Output is correct
57 Correct 11 ms 764 KB Output is correct
58 Correct 17 ms 764 KB Output is correct
59 Correct 10 ms 764 KB Output is correct
60 Correct 33 ms 764 KB Output is correct
61 Correct 34 ms 764 KB Output is correct
62 Correct 16 ms 764 KB Output is correct
63 Correct 34 ms 764 KB Output is correct
64 Correct 32 ms 764 KB Output is correct
65 Correct 1846 ms 1244 KB Output is correct
66 Execution timed out 2071 ms 1308 KB Time limit exceeded
67 Halted 0 ms 0 KB -