답안 #55509 :: oj.uz

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

cultivation

#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")

#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++){
		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:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
cultivation.cpp: In constructor 'maxqueue::maxqueue()':
cultivation.cpp:27:6: warning: 'maxqueue::len' will be initialized after [-Wreorder]
  int len;
      ^~~
cultivation.cpp:24:14: warning:   'std::vector<int> maxqueue::elements' [-Wreorder]
  vector<int> elements;
              ^~~~~~~~
cultivation.cpp:28: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:32: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:80: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){
         ~~^~~~~~~~~~~~
cultivation.cpp: In function 'int main()':
cultivation.cpp:133:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < xlist.size(); i++){
                 ~~^~~~~~~~~~~~~~
cultivation.cpp:137:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k = 0; k < seeds.size(); k++){
                   ~~^~~~~~~~~~~~~~
cultivation.cpp:143: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	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	432 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	608 KB	Output is correct
8	Correct	2 ms	608 KB	Output is correct
9	Correct	3 ms	608 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct
11	Correct	3 ms	692 KB	Output is correct
12	Correct	2 ms	692 KB	Output is correct
13	Correct	3 ms	692 KB	Output is correct
14	Correct	2 ms	692 KB	Output is correct
15	Correct	3 ms	692 KB	Output is correct
16	Correct	2 ms	692 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
30.0 / 30.0

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

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	992 KB	Output is correct
2	Correct	14 ms	1260 KB	Output is correct
3	Correct	9 ms	1260 KB	Output is correct
4	Correct	10 ms	1388 KB	Output is correct
5	Correct	9 ms	1388 KB	Output is correct
6	Correct	6 ms	1388 KB	Output is correct
7	Correct	4 ms	1388 KB	Output is correct
8	Correct	9 ms	1388 KB	Output is correct
9	Correct	7 ms	1388 KB	Output is correct
10	Correct	10 ms	1388 KB	Output is correct
11	Correct	10 ms	1388 KB	Output is correct
12	Correct	10 ms	1388 KB	Output is correct
13	Correct	3 ms	1388 KB	Output is correct
14	Correct	6 ms	1388 KB	Output is correct
15	Correct	4 ms	1388 KB	Output is correct
16	Correct	8 ms	1388 KB	Output is correct
17	Correct	8 ms	1388 KB	Output is correct
18	Correct	6 ms	1388 KB	Output is correct
19	Correct	8 ms	1388 KB	Output is correct
20	Correct	11 ms	1388 KB	Output is correct
21	Correct	207 ms	6524 KB	Output is correct
22	Correct	329 ms	10032 KB	Output is correct
23	Correct	360 ms	10092 KB	Output is correct
24	Correct	355 ms	10092 KB	Output is correct
25	Correct	382 ms	10092 KB	Output is correct
26	Correct	125 ms	10092 KB	Output is correct
27	Correct	473 ms	24624 KB	Output is correct
28	Correct	454 ms	24624 KB	Output is correct
29	Correct	428 ms	24624 KB	Output is correct
30	Correct	330 ms	24624 KB	Output is correct
31	Correct	350 ms	24624 KB	Output is correct
32	Correct	317 ms	24624 KB	Output is correct
33	Correct	406 ms	24624 KB	Output is correct
34	Correct	380 ms	24624 KB	Output is correct
35	Correct	472 ms	24624 KB	Output is correct
36	Correct	365 ms	24624 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	432 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	608 KB	Output is correct
8	Correct	2 ms	608 KB	Output is correct
9	Correct	3 ms	608 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct
11	Correct	3 ms	692 KB	Output is correct
12	Correct	2 ms	692 KB	Output is correct
13	Correct	3 ms	692 KB	Output is correct
14	Correct	2 ms	692 KB	Output is correct
15	Correct	3 ms	692 KB	Output is correct
16	Correct	2 ms	692 KB	Output is correct
17	Correct	2 ms	692 KB	Output is correct
18	Correct	4 ms	740 KB	Output is correct
19	Correct	3 ms	740 KB	Output is correct
20	Correct	4 ms	740 KB	Output is correct
21	Correct	5 ms	788 KB	Output is correct
22	Correct	5 ms	788 KB	Output is correct
23	Correct	3 ms	788 KB	Output is correct
24	Correct	8 ms	788 KB	Output is correct
25	Correct	7 ms	788 KB	Output is correct
26	Correct	11 ms	868 KB	Output is correct
27	Correct	10 ms	868 KB	Output is correct
28	Correct	8 ms	868 KB	Output is correct
29	Correct	11 ms	868 KB	Output is correct
30	Correct	12 ms	868 KB	Output is correct
31	Correct	10 ms	868 KB	Output is correct
32	Correct	11 ms	868 KB	Output is correct
33	Correct	4 ms	868 KB	Output is correct
34	Correct	7 ms	876 KB	Output is correct
35	Correct	11 ms	876 KB	Output is correct
36	Correct	11 ms	876 KB	Output is correct
37	Correct	11 ms	876 KB	Output is correct
38	Correct	13 ms	880 KB	Output is correct
39	Correct	12 ms	880 KB	Output is correct
40	Correct	12 ms	880 KB	Output is correct
41	Correct	7 ms	880 KB	Output is correct
42	Correct	9 ms	880 KB	Output is correct
43	Correct	11 ms	880 KB	Output is correct
44	Correct	12 ms	880 KB	Output is correct
45	Correct	5 ms	992 KB	Output is correct
46	Correct	14 ms	1260 KB	Output is correct
47	Correct	9 ms	1260 KB	Output is correct
48	Correct	10 ms	1388 KB	Output is correct
49	Correct	9 ms	1388 KB	Output is correct
50	Correct	6 ms	1388 KB	Output is correct
51	Correct	4 ms	1388 KB	Output is correct
52	Correct	9 ms	1388 KB	Output is correct
53	Correct	7 ms	1388 KB	Output is correct
54	Correct	10 ms	1388 KB	Output is correct
55	Correct	10 ms	1388 KB	Output is correct
56	Correct	10 ms	1388 KB	Output is correct
57	Correct	3 ms	1388 KB	Output is correct
58	Correct	6 ms	1388 KB	Output is correct
59	Correct	4 ms	1388 KB	Output is correct
60	Correct	8 ms	1388 KB	Output is correct
61	Correct	8 ms	1388 KB	Output is correct
62	Correct	6 ms	1388 KB	Output is correct
63	Correct	8 ms	1388 KB	Output is correct
64	Correct	11 ms	1388 KB	Output is correct
65	Correct	207 ms	6524 KB	Output is correct
66	Correct	329 ms	10032 KB	Output is correct
67	Correct	360 ms	10092 KB	Output is correct
68	Correct	355 ms	10092 KB	Output is correct
69	Correct	382 ms	10092 KB	Output is correct
70	Correct	125 ms	10092 KB	Output is correct
71	Correct	473 ms	24624 KB	Output is correct
72	Correct	454 ms	24624 KB	Output is correct
73	Correct	428 ms	24624 KB	Output is correct
74	Correct	330 ms	24624 KB	Output is correct
75	Correct	350 ms	24624 KB	Output is correct
76	Correct	317 ms	24624 KB	Output is correct
77	Correct	406 ms	24624 KB	Output is correct
78	Correct	380 ms	24624 KB	Output is correct
79	Correct	472 ms	24624 KB	Output is correct
80	Correct	365 ms	24624 KB	Output is correct
81	Execution timed out	2069 ms	25640 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #55509

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