답안 #55520 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55520	2018-07-07T20:38:17 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	80 / 100	2000 ms	56384 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;

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 ups[700];
int downs[700];
int totals[700];


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());

	int sz = pos.size();

	int a = 0;
	int b = 0;
	for(int i = 0; i < sz; i++){
		while(a + 1 < xlist.size() && xlist[a+1] - x <= pos[i]) a++;
		while(b + 1 < xlist.size() && 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();
	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++;
		}
		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:67:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(a + 1 < xlist.size() && xlist[a+1] - x <= pos[i]) a++;
         ~~~~~~^~~~~~~~~~~~~~
cultivation.cpp:68:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(b + 1 < xlist.size() && xlist[b+1] + 1 <= pos[i]) b++;
         ~~~~~~^~~~~~~~~~~~~~
cultivation.cpp: In function 'int main()':
cultivation.cpp:119:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < xlist.size(); i++){
                 ~~^~~~~~~~~~~~~~
cultivation.cpp:123: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

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	2 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	3 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	2 ms	724 KB	Output is correct
11	Correct	3 ms	724 KB	Output is correct
12	Correct	2 ms	724 KB	Output is correct
13	Correct	2 ms	724 KB	Output is correct
14	Correct	2 ms	724 KB	Output is correct
15	Correct	3 ms	724 KB	Output is correct
16	Correct	2 ms	724 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	2 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	3 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	2 ms	724 KB	Output is correct
11	Correct	3 ms	724 KB	Output is correct
12	Correct	2 ms	724 KB	Output is correct
13	Correct	2 ms	724 KB	Output is correct
14	Correct	2 ms	724 KB	Output is correct
15	Correct	3 ms	724 KB	Output is correct
16	Correct	2 ms	724 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Correct	3 ms	740 KB	Output is correct
19	Correct	3 ms	740 KB	Output is correct
20	Correct	2 ms	740 KB	Output is correct
21	Correct	5 ms	740 KB	Output is correct
22	Correct	6 ms	868 KB	Output is correct
23	Correct	2 ms	868 KB	Output is correct
24	Correct	10 ms	876 KB	Output is correct
25	Correct	8 ms	876 KB	Output is correct
26	Correct	19 ms	876 KB	Output is correct
27	Correct	17 ms	876 KB	Output is correct
28	Correct	11 ms	876 KB	Output is correct
29	Correct	16 ms	876 KB	Output is correct
30	Correct	16 ms	876 KB	Output is correct
31	Correct	19 ms	876 KB	Output is correct
32	Correct	16 ms	876 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	2 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	3 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	2 ms	724 KB	Output is correct
11	Correct	3 ms	724 KB	Output is correct
12	Correct	2 ms	724 KB	Output is correct
13	Correct	2 ms	724 KB	Output is correct
14	Correct	2 ms	724 KB	Output is correct
15	Correct	3 ms	724 KB	Output is correct
16	Correct	2 ms	724 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Correct	3 ms	740 KB	Output is correct
19	Correct	3 ms	740 KB	Output is correct
20	Correct	2 ms	740 KB	Output is correct
21	Correct	5 ms	740 KB	Output is correct
22	Correct	6 ms	868 KB	Output is correct
23	Correct	2 ms	868 KB	Output is correct
24	Correct	10 ms	876 KB	Output is correct
25	Correct	8 ms	876 KB	Output is correct
26	Correct	19 ms	876 KB	Output is correct
27	Correct	17 ms	876 KB	Output is correct
28	Correct	11 ms	876 KB	Output is correct
29	Correct	16 ms	876 KB	Output is correct
30	Correct	16 ms	876 KB	Output is correct
31	Correct	19 ms	876 KB	Output is correct
32	Correct	16 ms	876 KB	Output is correct
33	Correct	5 ms	876 KB	Output is correct
34	Correct	11 ms	892 KB	Output is correct
35	Correct	15 ms	892 KB	Output is correct
36	Correct	16 ms	892 KB	Output is correct
37	Correct	15 ms	892 KB	Output is correct
38	Correct	15 ms	892 KB	Output is correct
39	Correct	16 ms	892 KB	Output is correct
40	Correct	16 ms	892 KB	Output is correct
41	Correct	10 ms	892 KB	Output is correct
42	Correct	13 ms	892 KB	Output is correct
43	Correct	19 ms	1020 KB	Output is correct
44	Correct	17 ms	1020 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	1020 KB	Output is correct
2	Correct	7 ms	1148 KB	Output is correct
3	Correct	8 ms	1148 KB	Output is correct
4	Correct	8 ms	1404 KB	Output is correct
5	Correct	8 ms	1404 KB	Output is correct
6	Correct	5 ms	1404 KB	Output is correct
7	Correct	3 ms	1404 KB	Output is correct
8	Correct	11 ms	1404 KB	Output is correct
9	Correct	5 ms	1404 KB	Output is correct
10	Correct	11 ms	1404 KB	Output is correct
11	Correct	11 ms	1404 KB	Output is correct
12	Correct	7 ms	1404 KB	Output is correct
13	Correct	4 ms	1404 KB	Output is correct
14	Correct	6 ms	1404 KB	Output is correct
15	Correct	5 ms	1404 KB	Output is correct
16	Correct	13 ms	1404 KB	Output is correct
17	Correct	8 ms	1404 KB	Output is correct
18	Correct	6 ms	1404 KB	Output is correct
19	Correct	11 ms	1404 KB	Output is correct
20	Correct	11 ms	1532 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	1020 KB	Output is correct
2	Correct	7 ms	1148 KB	Output is correct
3	Correct	8 ms	1148 KB	Output is correct
4	Correct	8 ms	1404 KB	Output is correct
5	Correct	8 ms	1404 KB	Output is correct
6	Correct	5 ms	1404 KB	Output is correct
7	Correct	3 ms	1404 KB	Output is correct
8	Correct	11 ms	1404 KB	Output is correct
9	Correct	5 ms	1404 KB	Output is correct
10	Correct	11 ms	1404 KB	Output is correct
11	Correct	11 ms	1404 KB	Output is correct
12	Correct	7 ms	1404 KB	Output is correct
13	Correct	4 ms	1404 KB	Output is correct
14	Correct	6 ms	1404 KB	Output is correct
15	Correct	5 ms	1404 KB	Output is correct
16	Correct	13 ms	1404 KB	Output is correct
17	Correct	8 ms	1404 KB	Output is correct
18	Correct	6 ms	1404 KB	Output is correct
19	Correct	11 ms	1404 KB	Output is correct
20	Correct	11 ms	1532 KB	Output is correct
21	Correct	134 ms	7180 KB	Output is correct
22	Correct	205 ms	10260 KB	Output is correct
23	Correct	213 ms	10320 KB	Output is correct
24	Correct	198 ms	10372 KB	Output is correct
25	Correct	221 ms	10372 KB	Output is correct
26	Correct	78 ms	10372 KB	Output is correct
27	Correct	222 ms	32892 KB	Output is correct
28	Correct	203 ms	32892 KB	Output is correct
29	Correct	206 ms	32892 KB	Output is correct
30	Correct	210 ms	32892 KB	Output is correct
31	Correct	220 ms	32892 KB	Output is correct
32	Correct	203 ms	32892 KB	Output is correct
33	Correct	214 ms	35500 KB	Output is correct
34	Correct	204 ms	35500 KB	Output is correct
35	Correct	170 ms	35500 KB	Output is correct
36	Correct	194 ms	35500 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	564 KB	Output is correct
5	Correct	2 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	3 ms	616 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	2 ms	724 KB	Output is correct
11	Correct	3 ms	724 KB	Output is correct
12	Correct	2 ms	724 KB	Output is correct
13	Correct	2 ms	724 KB	Output is correct
14	Correct	2 ms	724 KB	Output is correct
15	Correct	3 ms	724 KB	Output is correct
16	Correct	2 ms	724 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Correct	3 ms	740 KB	Output is correct
19	Correct	3 ms	740 KB	Output is correct
20	Correct	2 ms	740 KB	Output is correct
21	Correct	5 ms	740 KB	Output is correct
22	Correct	6 ms	868 KB	Output is correct
23	Correct	2 ms	868 KB	Output is correct
24	Correct	10 ms	876 KB	Output is correct
25	Correct	8 ms	876 KB	Output is correct
26	Correct	19 ms	876 KB	Output is correct
27	Correct	17 ms	876 KB	Output is correct
28	Correct	11 ms	876 KB	Output is correct
29	Correct	16 ms	876 KB	Output is correct
30	Correct	16 ms	876 KB	Output is correct
31	Correct	19 ms	876 KB	Output is correct
32	Correct	16 ms	876 KB	Output is correct
33	Correct	5 ms	876 KB	Output is correct
34	Correct	11 ms	892 KB	Output is correct
35	Correct	15 ms	892 KB	Output is correct
36	Correct	16 ms	892 KB	Output is correct
37	Correct	15 ms	892 KB	Output is correct
38	Correct	15 ms	892 KB	Output is correct
39	Correct	16 ms	892 KB	Output is correct
40	Correct	16 ms	892 KB	Output is correct
41	Correct	10 ms	892 KB	Output is correct
42	Correct	13 ms	892 KB	Output is correct
43	Correct	19 ms	1020 KB	Output is correct
44	Correct	17 ms	1020 KB	Output is correct
45	Correct	7 ms	1020 KB	Output is correct
46	Correct	7 ms	1148 KB	Output is correct
47	Correct	8 ms	1148 KB	Output is correct
48	Correct	8 ms	1404 KB	Output is correct
49	Correct	8 ms	1404 KB	Output is correct
50	Correct	5 ms	1404 KB	Output is correct
51	Correct	3 ms	1404 KB	Output is correct
52	Correct	11 ms	1404 KB	Output is correct
53	Correct	5 ms	1404 KB	Output is correct
54	Correct	11 ms	1404 KB	Output is correct
55	Correct	11 ms	1404 KB	Output is correct
56	Correct	7 ms	1404 KB	Output is correct
57	Correct	4 ms	1404 KB	Output is correct
58	Correct	6 ms	1404 KB	Output is correct
59	Correct	5 ms	1404 KB	Output is correct
60	Correct	13 ms	1404 KB	Output is correct
61	Correct	8 ms	1404 KB	Output is correct
62	Correct	6 ms	1404 KB	Output is correct
63	Correct	11 ms	1404 KB	Output is correct
64	Correct	11 ms	1532 KB	Output is correct
65	Correct	134 ms	7180 KB	Output is correct
66	Correct	205 ms	10260 KB	Output is correct
67	Correct	213 ms	10320 KB	Output is correct
68	Correct	198 ms	10372 KB	Output is correct
69	Correct	221 ms	10372 KB	Output is correct
70	Correct	78 ms	10372 KB	Output is correct
71	Correct	222 ms	32892 KB	Output is correct
72	Correct	203 ms	32892 KB	Output is correct
73	Correct	206 ms	32892 KB	Output is correct
74	Correct	210 ms	32892 KB	Output is correct
75	Correct	220 ms	32892 KB	Output is correct
76	Correct	203 ms	32892 KB	Output is correct
77	Correct	214 ms	35500 KB	Output is correct
78	Correct	204 ms	35500 KB	Output is correct
79	Correct	170 ms	35500 KB	Output is correct
80	Correct	194 ms	35500 KB	Output is correct
81	Correct	1695 ms	56384 KB	Output is correct
82	Correct	1873 ms	56384 KB	Output is correct
83	Execution timed out	2058 ms	56384 KB	Time limit exceeded
84	Halted	0 ms	0 KB	-

답안 #55520

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 20.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
20.0 / 20.0

Subtask #6
0 / 20.0