답안 #55290 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55290	2018-07-06T22:05:43 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	60 / 100	2000 ms	1156 KB

cultivation

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

LL r, c, n;
vector<pair<LL,LL> > seeds;
const LL INF = 2100100100;
LL best = INF;
set<LL> tried;
void tryxfast(LL x){
	if(x < 0 || tried.find(x) != tried.end()){
		return;
	}
	tried.insert(x);

	map<LL, vector<pair<LL, LL> > > events;
	for(pair<LL,LL> z : seeds){
		events[z.first].push_back({0, z.second}); // ins
		events[z.first + x + 1].push_back({1, z.second}); // del
	}

	vector<LL> pos;
	vector<LL> ups;
	vector<LL> downs;
	vector<LL> totals;

	multiset<LL> grass;
	grass.insert(-1);
	grass.insert(c);
	multiset<LL> diffs;
	diffs.insert(-(c+1));
	for(auto tt : events){
		for(pair<LL,LL> event : tt.second){
			LL a = event.second;
			if(event.first == 0){
				grass.insert(a);
			}
			LL a1 = *(--grass.find(a));
			LL a2 = *(++grass.find(a));
			if(event.first == 0){
				diffs.erase(diffs.find(a1-a2));
				diffs.insert(a1-a);
				diffs.insert(a-a2);
			} else if(event.first == 1){
				diffs.erase(diffs.find(a1-a));
				diffs.erase(diffs.find(a-a2));
				diffs.insert(a1-a2);
			}
			if(event.first == 1){
				grass.erase(grass.find(a));
			}
		}
		pos.push_back(tt.first);
		totals.push_back( -*diffs.begin() );
		ups.push_back( *(++grass.begin()) - 0 );
		downs.push_back( c-1 - *(--(--grass.end())) );
	}
	// two pointers: 
	LL j = 0;
	multiset<LL> upset;
	multiset<LL> downset;
	multiset<LL> totalset;
	for(LL 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++;
		}
		LL total = -*totalset.begin();
		if(total < c+1){
			best = min(best, max(-*upset.begin() + -*downset.begin(), total - 1) + 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(LL i = 0; i < n; i++){
		LL s, e;
		cin >> s >> e;
		s--; e--;
		seeds.push_back({s,e});
	}
	sort(seeds.begin(), seeds.end());
	for(LL i = 0; i < n; i++){
		for(LL 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 function 'void tryxfast(LL)':
cultivation.cpp:63:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(LL i = 0; i < pos.size(); i++){
                ~~^~~~~~~~~~~~
cultivation.cpp:64: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

#	결과	실행 시간	메모리	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	492 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	616 KB	Output is correct
10	Correct	2 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	2 ms	636 KB	Output is correct
16	Correct	2 ms	636 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	492 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	616 KB	Output is correct
10	Correct	2 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	2 ms	636 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	3 ms	636 KB	Output is correct
21	Correct	10 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	32 ms	764 KB	Output is correct
25	Correct	22 ms	764 KB	Output is correct
26	Correct	38 ms	764 KB	Output is correct
27	Correct	37 ms	764 KB	Output is correct
28	Correct	25 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	39 ms	764 KB	Output is correct
32	Correct	38 ms	764 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	492 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	616 KB	Output is correct
10	Correct	2 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	2 ms	636 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	3 ms	636 KB	Output is correct
21	Correct	10 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	32 ms	764 KB	Output is correct
25	Correct	22 ms	764 KB	Output is correct
26	Correct	38 ms	764 KB	Output is correct
27	Correct	37 ms	764 KB	Output is correct
28	Correct	25 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	39 ms	764 KB	Output is correct
32	Correct	38 ms	764 KB	Output is correct
33	Correct	6 ms	764 KB	Output is correct
34	Correct	35 ms	764 KB	Output is correct
35	Correct	39 ms	764 KB	Output is correct
36	Correct	48 ms	764 KB	Output is correct
37	Correct	36 ms	764 KB	Output is correct
38	Correct	45 ms	764 KB	Output is correct
39	Correct	40 ms	764 KB	Output is correct
40	Correct	45 ms	764 KB	Output is correct
41	Correct	28 ms	764 KB	Output is correct
42	Correct	35 ms	764 KB	Output is correct
43	Correct	42 ms	764 KB	Output is correct
44	Correct	51 ms	764 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	764 KB	Output is correct
2	Correct	44 ms	764 KB	Output is correct
3	Correct	52 ms	764 KB	Output is correct
4	Correct	45 ms	764 KB	Output is correct
5	Correct	50 ms	764 KB	Output is correct
6	Correct	19 ms	764 KB	Output is correct
7	Correct	6 ms	764 KB	Output is correct
8	Correct	43 ms	764 KB	Output is correct
9	Correct	23 ms	784 KB	Output is correct
10	Correct	46 ms	784 KB	Output is correct
11	Correct	48 ms	784 KB	Output is correct
12	Correct	48 ms	784 KB	Output is correct
13	Correct	9 ms	784 KB	Output is correct
14	Correct	24 ms	784 KB	Output is correct
15	Correct	12 ms	784 KB	Output is correct
16	Correct	47 ms	784 KB	Output is correct
17	Correct	55 ms	784 KB	Output is correct
18	Correct	21 ms	784 KB	Output is correct
19	Correct	47 ms	784 KB	Output is correct
20	Correct	46 ms	784 KB	Output is correct

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	764 KB	Output is correct
2	Correct	44 ms	764 KB	Output is correct
3	Correct	52 ms	764 KB	Output is correct
4	Correct	45 ms	764 KB	Output is correct
5	Correct	50 ms	764 KB	Output is correct
6	Correct	19 ms	764 KB	Output is correct
7	Correct	6 ms	764 KB	Output is correct
8	Correct	43 ms	764 KB	Output is correct
9	Correct	23 ms	784 KB	Output is correct
10	Correct	46 ms	784 KB	Output is correct
11	Correct	48 ms	784 KB	Output is correct
12	Correct	48 ms	784 KB	Output is correct
13	Correct	9 ms	784 KB	Output is correct
14	Correct	24 ms	784 KB	Output is correct
15	Correct	12 ms	784 KB	Output is correct
16	Correct	47 ms	784 KB	Output is correct
17	Correct	55 ms	784 KB	Output is correct
18	Correct	21 ms	784 KB	Output is correct
19	Correct	47 ms	784 KB	Output is correct
20	Correct	46 ms	784 KB	Output is correct
21	Execution timed out	2071 ms	1156 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

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	492 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	616 KB	Output is correct
10	Correct	2 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	2 ms	636 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	3 ms	636 KB	Output is correct
21	Correct	10 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	32 ms	764 KB	Output is correct
25	Correct	22 ms	764 KB	Output is correct
26	Correct	38 ms	764 KB	Output is correct
27	Correct	37 ms	764 KB	Output is correct
28	Correct	25 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	39 ms	764 KB	Output is correct
32	Correct	38 ms	764 KB	Output is correct
33	Correct	6 ms	764 KB	Output is correct
34	Correct	35 ms	764 KB	Output is correct
35	Correct	39 ms	764 KB	Output is correct
36	Correct	48 ms	764 KB	Output is correct
37	Correct	36 ms	764 KB	Output is correct
38	Correct	45 ms	764 KB	Output is correct
39	Correct	40 ms	764 KB	Output is correct
40	Correct	45 ms	764 KB	Output is correct
41	Correct	28 ms	764 KB	Output is correct
42	Correct	35 ms	764 KB	Output is correct
43	Correct	42 ms	764 KB	Output is correct
44	Correct	51 ms	764 KB	Output is correct
45	Correct	20 ms	764 KB	Output is correct
46	Correct	44 ms	764 KB	Output is correct
47	Correct	52 ms	764 KB	Output is correct
48	Correct	45 ms	764 KB	Output is correct
49	Correct	50 ms	764 KB	Output is correct
50	Correct	19 ms	764 KB	Output is correct
51	Correct	6 ms	764 KB	Output is correct
52	Correct	43 ms	764 KB	Output is correct
53	Correct	23 ms	784 KB	Output is correct
54	Correct	46 ms	784 KB	Output is correct
55	Correct	48 ms	784 KB	Output is correct
56	Correct	48 ms	784 KB	Output is correct
57	Correct	9 ms	784 KB	Output is correct
58	Correct	24 ms	784 KB	Output is correct
59	Correct	12 ms	784 KB	Output is correct
60	Correct	47 ms	784 KB	Output is correct
61	Correct	55 ms	784 KB	Output is correct
62	Correct	21 ms	784 KB	Output is correct
63	Correct	47 ms	784 KB	Output is correct
64	Correct	46 ms	784 KB	Output is correct
65	Execution timed out	2071 ms	1156 KB	Time limit exceeded
66	Halted	0 ms	0 KB	-

답안 #55290

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