답안 #55508 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55508	2018-07-07T20:08:58 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	80 / 100	2000 ms	25612 KB

cultivation

#pragma GCC optimize("Ofast")
#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;

	for(int i = 0; i < pos.size(); i++){
		// use -pos[i]-x, x-pos[i]+1 for start and end
		// where start and end column is relative to your column
		// replace this with lookup of up, down totals for each 
		int a = idx((LL)pos[i]+x);
		int b = idx((LL)pos[i]-1);
		// 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);
	}

	for(int i = 0; i < xlist.size(); i++){
		for(int j = 0; j <= i; j++){
			vector<int> stuff;
			int tot = 0;
			for(int k = 0; k < seeds.size(); k++){
				int p = seeds[k].first;
				if(p <= xlist[i] && p > xlist[j]){
					stuff.push_back(seeds[k].second);
				}
			}
			for(int i = 0; i + 1 < stuff.size(); i++){
				tot = max(tot, stuff[i+1] - stuff[i]);
			}
			if(stuff.size() == 0){
				total[i][j] = up[i][j] = down[i][j] = c+1;
			} else {
				up[i][j] = stuff[0] - 0;
				down[i][j] = c-1 - stuff[stuff.size()-1];
				total[i][j] = tot;
			}
		}
	}

	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:22:6: warning: 'maxqueue::len' will be initialized after [-Wreorder]
  int len;
      ^~~
cultivation.cpp:19:14: warning:   'std::vector<int> maxqueue::elements' [-Wreorder]
  vector<int> elements;
              ^~~~~~~~
cultivation.cpp:23: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:27: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:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:93:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:94: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:131:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < xlist.size(); i++){
                 ~~^~~~~~~~~~~~~~
cultivation.cpp:135:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k = 0; k < seeds.size(); k++){
                   ~~^~~~~~~~~~~~~~
cultivation.cpp:141:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i + 1 < stuff.size(); i++){
                   ~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	416 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	588 KB	Output is correct
6	Correct	2 ms	588 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	2 ms	588 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	2 ms	752 KB	Output is correct
12	Correct	3 ms	752 KB	Output is correct
13	Correct	3 ms	752 KB	Output is correct
14	Correct	3 ms	752 KB	Output is correct
15	Correct	2 ms	752 KB	Output is correct
16	Correct	2 ms	752 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	416 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	588 KB	Output is correct
6	Correct	2 ms	588 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	2 ms	588 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	2 ms	752 KB	Output is correct
12	Correct	3 ms	752 KB	Output is correct
13	Correct	3 ms	752 KB	Output is correct
14	Correct	3 ms	752 KB	Output is correct
15	Correct	2 ms	752 KB	Output is correct
16	Correct	2 ms	752 KB	Output is correct
17	Correct	2 ms	752 KB	Output is correct
18	Correct	3 ms	764 KB	Output is correct
19	Correct	4 ms	764 KB	Output is correct
20	Correct	4 ms	764 KB	Output is correct
21	Correct	3 ms	764 KB	Output is correct
22	Correct	5 ms	764 KB	Output is correct
23	Correct	2 ms	764 KB	Output is correct
24	Correct	7 ms	764 KB	Output is correct
25	Correct	6 ms	772 KB	Output is correct
26	Correct	9 ms	772 KB	Output is correct
27	Correct	14 ms	772 KB	Output is correct
28	Correct	8 ms	772 KB	Output is correct
29	Correct	9 ms	776 KB	Output is correct
30	Correct	10 ms	776 KB	Output is correct
31	Correct	10 ms	776 KB	Output is correct
32	Correct	11 ms	892 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
30.0 / 30.0

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

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	892 KB	Output is correct
2	Correct	8 ms	1148 KB	Output is correct
3	Correct	9 ms	1148 KB	Output is correct
4	Correct	15 ms	1276 KB	Output is correct
5	Correct	40 ms	1276 KB	Output is correct
6	Correct	9 ms	1276 KB	Output is correct
7	Correct	2 ms	1276 KB	Output is correct
8	Correct	9 ms	1276 KB	Output is correct
9	Correct	6 ms	1276 KB	Output is correct
10	Correct	8 ms	1276 KB	Output is correct
11	Correct	12 ms	1276 KB	Output is correct
12	Correct	10 ms	1276 KB	Output is correct
13	Correct	4 ms	1276 KB	Output is correct
14	Correct	5 ms	1276 KB	Output is correct
15	Correct	5 ms	1276 KB	Output is correct
16	Correct	9 ms	1276 KB	Output is correct
17	Correct	10 ms	1276 KB	Output is correct
18	Correct	6 ms	1276 KB	Output is correct
19	Correct	8 ms	1276 KB	Output is correct
20	Correct	10 ms	1276 KB	Output is correct
21	Correct	201 ms	6416 KB	Output is correct
22	Correct	339 ms	9880 KB	Output is correct
23	Correct	410 ms	10128 KB	Output is correct
24	Correct	340 ms	10128 KB	Output is correct
25	Correct	334 ms	10128 KB	Output is correct
26	Correct	110 ms	10128 KB	Output is correct
27	Correct	423 ms	24560 KB	Output is correct
28	Correct	323 ms	24560 KB	Output is correct
29	Correct	325 ms	24560 KB	Output is correct
30	Correct	356 ms	24560 KB	Output is correct
31	Correct	379 ms	24560 KB	Output is correct
32	Correct	390 ms	24560 KB	Output is correct
33	Correct	383 ms	24560 KB	Output is correct
34	Correct	400 ms	24560 KB	Output is correct
35	Correct	368 ms	24560 KB	Output is correct
36	Correct	442 ms	24560 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	416 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	588 KB	Output is correct
6	Correct	2 ms	588 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	2 ms	588 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	2 ms	752 KB	Output is correct
12	Correct	3 ms	752 KB	Output is correct
13	Correct	3 ms	752 KB	Output is correct
14	Correct	3 ms	752 KB	Output is correct
15	Correct	2 ms	752 KB	Output is correct
16	Correct	2 ms	752 KB	Output is correct
17	Correct	2 ms	752 KB	Output is correct
18	Correct	3 ms	764 KB	Output is correct
19	Correct	4 ms	764 KB	Output is correct
20	Correct	4 ms	764 KB	Output is correct
21	Correct	3 ms	764 KB	Output is correct
22	Correct	5 ms	764 KB	Output is correct
23	Correct	2 ms	764 KB	Output is correct
24	Correct	7 ms	764 KB	Output is correct
25	Correct	6 ms	772 KB	Output is correct
26	Correct	9 ms	772 KB	Output is correct
27	Correct	14 ms	772 KB	Output is correct
28	Correct	8 ms	772 KB	Output is correct
29	Correct	9 ms	776 KB	Output is correct
30	Correct	10 ms	776 KB	Output is correct
31	Correct	10 ms	776 KB	Output is correct
32	Correct	11 ms	892 KB	Output is correct
33	Correct	4 ms	892 KB	Output is correct
34	Correct	7 ms	892 KB	Output is correct
35	Correct	12 ms	892 KB	Output is correct
36	Correct	11 ms	892 KB	Output is correct
37	Correct	10 ms	892 KB	Output is correct
38	Correct	12 ms	892 KB	Output is correct
39	Correct	11 ms	892 KB	Output is correct
40	Correct	13 ms	892 KB	Output is correct
41	Correct	6 ms	892 KB	Output is correct
42	Correct	8 ms	892 KB	Output is correct
43	Correct	38 ms	892 KB	Output is correct
44	Correct	11 ms	892 KB	Output is correct
45	Correct	5 ms	892 KB	Output is correct
46	Correct	8 ms	1148 KB	Output is correct
47	Correct	9 ms	1148 KB	Output is correct
48	Correct	15 ms	1276 KB	Output is correct
49	Correct	40 ms	1276 KB	Output is correct
50	Correct	9 ms	1276 KB	Output is correct
51	Correct	2 ms	1276 KB	Output is correct
52	Correct	9 ms	1276 KB	Output is correct
53	Correct	6 ms	1276 KB	Output is correct
54	Correct	8 ms	1276 KB	Output is correct
55	Correct	12 ms	1276 KB	Output is correct
56	Correct	10 ms	1276 KB	Output is correct
57	Correct	4 ms	1276 KB	Output is correct
58	Correct	5 ms	1276 KB	Output is correct
59	Correct	5 ms	1276 KB	Output is correct
60	Correct	9 ms	1276 KB	Output is correct
61	Correct	10 ms	1276 KB	Output is correct
62	Correct	6 ms	1276 KB	Output is correct
63	Correct	8 ms	1276 KB	Output is correct
64	Correct	10 ms	1276 KB	Output is correct
65	Correct	201 ms	6416 KB	Output is correct
66	Correct	339 ms	9880 KB	Output is correct
67	Correct	410 ms	10128 KB	Output is correct
68	Correct	340 ms	10128 KB	Output is correct
69	Correct	334 ms	10128 KB	Output is correct
70	Correct	110 ms	10128 KB	Output is correct
71	Correct	423 ms	24560 KB	Output is correct
72	Correct	323 ms	24560 KB	Output is correct
73	Correct	325 ms	24560 KB	Output is correct
74	Correct	356 ms	24560 KB	Output is correct
75	Correct	379 ms	24560 KB	Output is correct
76	Correct	390 ms	24560 KB	Output is correct
77	Correct	383 ms	24560 KB	Output is correct
78	Correct	400 ms	24560 KB	Output is correct
79	Correct	368 ms	24560 KB	Output is correct
80	Correct	442 ms	24560 KB	Output is correct
81	Execution timed out	2058 ms	25612 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #55508

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