답안 #55308 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55308	2018-07-06T23:27:50 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	60 / 100	1816 ms	1396 KB

cultivation

#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
	}

	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())) );
	}
	if(n <= 25 || r <= 40){
		// 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:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:95:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < pos.size(); i++){
                  ~~^~~~~~~~~~~~
cultivation.cpp:96:12: 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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	584 KB	Output is correct
5	Correct	3 ms	584 KB	Output is correct
6	Correct	2 ms	612 KB	Output is correct
7	Correct	3 ms	612 KB	Output is correct
8	Correct	3 ms	612 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	2 ms	712 KB	Output is correct
15	Correct	3 ms	712 KB	Output is correct
16	Correct	3 ms	712 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	584 KB	Output is correct
5	Correct	3 ms	584 KB	Output is correct
6	Correct	2 ms	612 KB	Output is correct
7	Correct	3 ms	612 KB	Output is correct
8	Correct	3 ms	612 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	2 ms	712 KB	Output is correct
15	Correct	3 ms	712 KB	Output is correct
16	Correct	3 ms	712 KB	Output is correct
17	Correct	3 ms	712 KB	Output is correct
18	Correct	8 ms	712 KB	Output is correct
19	Correct	6 ms	736 KB	Output is correct
20	Correct	3 ms	736 KB	Output is correct
21	Correct	7 ms	736 KB	Output is correct
22	Correct	17 ms	736 KB	Output is correct
23	Correct	4 ms	736 KB	Output is correct
24	Correct	24 ms	736 KB	Output is correct
25	Correct	19 ms	736 KB	Output is correct
26	Correct	36 ms	736 KB	Output is correct
27	Correct	39 ms	736 KB	Output is correct
28	Correct	25 ms	736 KB	Output is correct
29	Correct	33 ms	736 KB	Output is correct
30	Correct	35 ms	736 KB	Output is correct
31	Correct	37 ms	736 KB	Output is correct
32	Correct	38 ms	736 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	584 KB	Output is correct
5	Correct	3 ms	584 KB	Output is correct
6	Correct	2 ms	612 KB	Output is correct
7	Correct	3 ms	612 KB	Output is correct
8	Correct	3 ms	612 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	2 ms	712 KB	Output is correct
15	Correct	3 ms	712 KB	Output is correct
16	Correct	3 ms	712 KB	Output is correct
17	Correct	3 ms	712 KB	Output is correct
18	Correct	8 ms	712 KB	Output is correct
19	Correct	6 ms	736 KB	Output is correct
20	Correct	3 ms	736 KB	Output is correct
21	Correct	7 ms	736 KB	Output is correct
22	Correct	17 ms	736 KB	Output is correct
23	Correct	4 ms	736 KB	Output is correct
24	Correct	24 ms	736 KB	Output is correct
25	Correct	19 ms	736 KB	Output is correct
26	Correct	36 ms	736 KB	Output is correct
27	Correct	39 ms	736 KB	Output is correct
28	Correct	25 ms	736 KB	Output is correct
29	Correct	33 ms	736 KB	Output is correct
30	Correct	35 ms	736 KB	Output is correct
31	Correct	37 ms	736 KB	Output is correct
32	Correct	38 ms	736 KB	Output is correct
33	Correct	5 ms	736 KB	Output is correct
34	Correct	27 ms	736 KB	Output is correct
35	Correct	36 ms	736 KB	Output is correct
36	Correct	36 ms	736 KB	Output is correct
37	Correct	35 ms	736 KB	Output is correct
38	Correct	40 ms	736 KB	Output is correct
39	Correct	35 ms	736 KB	Output is correct
40	Correct	37 ms	736 KB	Output is correct
41	Correct	28 ms	736 KB	Output is correct
42	Correct	33 ms	736 KB	Output is correct
43	Correct	34 ms	736 KB	Output is correct
44	Correct	35 ms	736 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	736 KB	Output is correct
2	Correct	23 ms	736 KB	Output is correct
3	Correct	28 ms	736 KB	Output is correct
4	Correct	28 ms	736 KB	Output is correct
5	Correct	26 ms	736 KB	Output is correct
6	Correct	12 ms	736 KB	Output is correct
7	Correct	5 ms	736 KB	Output is correct
8	Correct	27 ms	736 KB	Output is correct
9	Correct	16 ms	792 KB	Output is correct
10	Correct	32 ms	792 KB	Output is correct
11	Correct	28 ms	792 KB	Output is correct
12	Correct	26 ms	792 KB	Output is correct
13	Correct	7 ms	792 KB	Output is correct
14	Correct	13 ms	792 KB	Output is correct
15	Correct	14 ms	792 KB	Output is correct
16	Correct	30 ms	792 KB	Output is correct
17	Correct	29 ms	792 KB	Output is correct
18	Correct	14 ms	792 KB	Output is correct
19	Correct	30 ms	792 KB	Output is correct
20	Correct	29 ms	792 KB	Output is correct

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	736 KB	Output is correct
2	Correct	23 ms	736 KB	Output is correct
3	Correct	28 ms	736 KB	Output is correct
4	Correct	28 ms	736 KB	Output is correct
5	Correct	26 ms	736 KB	Output is correct
6	Correct	12 ms	736 KB	Output is correct
7	Correct	5 ms	736 KB	Output is correct
8	Correct	27 ms	736 KB	Output is correct
9	Correct	16 ms	792 KB	Output is correct
10	Correct	32 ms	792 KB	Output is correct
11	Correct	28 ms	792 KB	Output is correct
12	Correct	26 ms	792 KB	Output is correct
13	Correct	7 ms	792 KB	Output is correct
14	Correct	13 ms	792 KB	Output is correct
15	Correct	14 ms	792 KB	Output is correct
16	Correct	30 ms	792 KB	Output is correct
17	Correct	29 ms	792 KB	Output is correct
18	Correct	14 ms	792 KB	Output is correct
19	Correct	30 ms	792 KB	Output is correct
20	Correct	29 ms	792 KB	Output is correct
21	Incorrect	1816 ms	1396 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	584 KB	Output is correct
5	Correct	3 ms	584 KB	Output is correct
6	Correct	2 ms	612 KB	Output is correct
7	Correct	3 ms	612 KB	Output is correct
8	Correct	3 ms	612 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	2 ms	712 KB	Output is correct
15	Correct	3 ms	712 KB	Output is correct
16	Correct	3 ms	712 KB	Output is correct
17	Correct	3 ms	712 KB	Output is correct
18	Correct	8 ms	712 KB	Output is correct
19	Correct	6 ms	736 KB	Output is correct
20	Correct	3 ms	736 KB	Output is correct
21	Correct	7 ms	736 KB	Output is correct
22	Correct	17 ms	736 KB	Output is correct
23	Correct	4 ms	736 KB	Output is correct
24	Correct	24 ms	736 KB	Output is correct
25	Correct	19 ms	736 KB	Output is correct
26	Correct	36 ms	736 KB	Output is correct
27	Correct	39 ms	736 KB	Output is correct
28	Correct	25 ms	736 KB	Output is correct
29	Correct	33 ms	736 KB	Output is correct
30	Correct	35 ms	736 KB	Output is correct
31	Correct	37 ms	736 KB	Output is correct
32	Correct	38 ms	736 KB	Output is correct
33	Correct	5 ms	736 KB	Output is correct
34	Correct	27 ms	736 KB	Output is correct
35	Correct	36 ms	736 KB	Output is correct
36	Correct	36 ms	736 KB	Output is correct
37	Correct	35 ms	736 KB	Output is correct
38	Correct	40 ms	736 KB	Output is correct
39	Correct	35 ms	736 KB	Output is correct
40	Correct	37 ms	736 KB	Output is correct
41	Correct	28 ms	736 KB	Output is correct
42	Correct	33 ms	736 KB	Output is correct
43	Correct	34 ms	736 KB	Output is correct
44	Correct	35 ms	736 KB	Output is correct
45	Correct	10 ms	736 KB	Output is correct
46	Correct	23 ms	736 KB	Output is correct
47	Correct	28 ms	736 KB	Output is correct
48	Correct	28 ms	736 KB	Output is correct
49	Correct	26 ms	736 KB	Output is correct
50	Correct	12 ms	736 KB	Output is correct
51	Correct	5 ms	736 KB	Output is correct
52	Correct	27 ms	736 KB	Output is correct
53	Correct	16 ms	792 KB	Output is correct
54	Correct	32 ms	792 KB	Output is correct
55	Correct	28 ms	792 KB	Output is correct
56	Correct	26 ms	792 KB	Output is correct
57	Correct	7 ms	792 KB	Output is correct
58	Correct	13 ms	792 KB	Output is correct
59	Correct	14 ms	792 KB	Output is correct
60	Correct	30 ms	792 KB	Output is correct
61	Correct	29 ms	792 KB	Output is correct
62	Correct	14 ms	792 KB	Output is correct
63	Correct	30 ms	792 KB	Output is correct
64	Correct	29 ms	792 KB	Output is correct
65	Incorrect	1816 ms	1396 KB	Output isn't correct
66	Halted	0 ms	0 KB	-

답안 #55308

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 30.0 / 30.0

Subtask #5 0 / 20.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
30.0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0