Submission #55288

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
55288	2018-07-06T22:00:11 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	30 / 100	56 ms	868 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(a2-a1));
				diffs.insert(a-a1);
				diffs.insert(a2-a);
			} else if(event.first == 1){
				diffs.erase(diffs.find(a-a1));
				diffs.erase(diffs.find(a2-a));
				diffs.insert(a2-a1);
			}
			if(event.first == 1){
				grass.erase(grass.find(a));
			}
		}
		pos.push_back(tt.first);
		totals.push_back( *(--diffs.end()) );
		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.end());
		if(total < c+1){
			best = min(best, max(*(--upset.end()) + *(--downset.end()), 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	3 ms	532 KB	Output is correct
6	Correct	3 ms	532 KB	Output is correct
7	Correct	3 ms	532 KB	Output is correct
8	Correct	4 ms	532 KB	Output is correct
9	Correct	2 ms	532 KB	Output is correct
10	Correct	3 ms	532 KB	Output is correct
11	Correct	2 ms	532 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	596 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	3 ms	532 KB	Output is correct
6	Correct	3 ms	532 KB	Output is correct
7	Correct	3 ms	532 KB	Output is correct
8	Correct	4 ms	532 KB	Output is correct
9	Correct	2 ms	532 KB	Output is correct
10	Correct	3 ms	532 KB	Output is correct
11	Correct	2 ms	532 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	596 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	9 ms	620 KB	Output is correct
19	Correct	7 ms	620 KB	Output is correct
20	Correct	3 ms	700 KB	Output is correct
21	Correct	9 ms	700 KB	Output is correct
22	Correct	17 ms	724 KB	Output is correct
23	Correct	3 ms	724 KB	Output is correct
24	Correct	25 ms	724 KB	Output is correct
25	Correct	21 ms	724 KB	Output is correct
26	Correct	36 ms	724 KB	Output is correct
27	Correct	34 ms	868 KB	Output is correct
28	Correct	25 ms	868 KB	Output is correct
29	Correct	33 ms	868 KB	Output is correct
30	Correct	35 ms	868 KB	Output is correct
31	Correct	37 ms	868 KB	Output is correct
32	Correct	35 ms	868 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	3 ms	532 KB	Output is correct
6	Correct	3 ms	532 KB	Output is correct
7	Correct	3 ms	532 KB	Output is correct
8	Correct	4 ms	532 KB	Output is correct
9	Correct	2 ms	532 KB	Output is correct
10	Correct	3 ms	532 KB	Output is correct
11	Correct	2 ms	532 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	596 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	9 ms	620 KB	Output is correct
19	Correct	7 ms	620 KB	Output is correct
20	Correct	3 ms	700 KB	Output is correct
21	Correct	9 ms	700 KB	Output is correct
22	Correct	17 ms	724 KB	Output is correct
23	Correct	3 ms	724 KB	Output is correct
24	Correct	25 ms	724 KB	Output is correct
25	Correct	21 ms	724 KB	Output is correct
26	Correct	36 ms	724 KB	Output is correct
27	Correct	34 ms	868 KB	Output is correct
28	Correct	25 ms	868 KB	Output is correct
29	Correct	33 ms	868 KB	Output is correct
30	Correct	35 ms	868 KB	Output is correct
31	Correct	37 ms	868 KB	Output is correct
32	Correct	35 ms	868 KB	Output is correct
33	Correct	4 ms	868 KB	Output is correct
34	Correct	30 ms	868 KB	Output is correct
35	Correct	43 ms	868 KB	Output is correct
36	Correct	45 ms	868 KB	Output is correct
37	Correct	38 ms	868 KB	Output is correct
38	Correct	52 ms	868 KB	Output is correct
39	Correct	56 ms	868 KB	Output is correct
40	Correct	41 ms	868 KB	Output is correct
41	Correct	32 ms	868 KB	Output is correct
42	Correct	33 ms	868 KB	Output is correct
43	Correct	39 ms	868 KB	Output is correct
44	Correct	41 ms	868 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	868 KB	Output is correct
2	Correct	33 ms	868 KB	Output is correct
3	Correct	35 ms	868 KB	Output is correct
4	Correct	32 ms	868 KB	Output is correct
5	Correct	32 ms	868 KB	Output is correct
6	Correct	20 ms	868 KB	Output is correct
7	Correct	4 ms	868 KB	Output is correct
8	Correct	31 ms	868 KB	Output is correct
9	Correct	18 ms	868 KB	Output is correct
10	Incorrect	37 ms	868 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	868 KB	Output is correct
2	Correct	33 ms	868 KB	Output is correct
3	Correct	35 ms	868 KB	Output is correct
4	Correct	32 ms	868 KB	Output is correct
5	Correct	32 ms	868 KB	Output is correct
6	Correct	20 ms	868 KB	Output is correct
7	Correct	4 ms	868 KB	Output is correct
8	Correct	31 ms	868 KB	Output is correct
9	Correct	18 ms	868 KB	Output is correct
10	Incorrect	37 ms	868 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	3 ms	532 KB	Output is correct
6	Correct	3 ms	532 KB	Output is correct
7	Correct	3 ms	532 KB	Output is correct
8	Correct	4 ms	532 KB	Output is correct
9	Correct	2 ms	532 KB	Output is correct
10	Correct	3 ms	532 KB	Output is correct
11	Correct	2 ms	532 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	596 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	9 ms	620 KB	Output is correct
19	Correct	7 ms	620 KB	Output is correct
20	Correct	3 ms	700 KB	Output is correct
21	Correct	9 ms	700 KB	Output is correct
22	Correct	17 ms	724 KB	Output is correct
23	Correct	3 ms	724 KB	Output is correct
24	Correct	25 ms	724 KB	Output is correct
25	Correct	21 ms	724 KB	Output is correct
26	Correct	36 ms	724 KB	Output is correct
27	Correct	34 ms	868 KB	Output is correct
28	Correct	25 ms	868 KB	Output is correct
29	Correct	33 ms	868 KB	Output is correct
30	Correct	35 ms	868 KB	Output is correct
31	Correct	37 ms	868 KB	Output is correct
32	Correct	35 ms	868 KB	Output is correct
33	Correct	4 ms	868 KB	Output is correct
34	Correct	30 ms	868 KB	Output is correct
35	Correct	43 ms	868 KB	Output is correct
36	Correct	45 ms	868 KB	Output is correct
37	Correct	38 ms	868 KB	Output is correct
38	Correct	52 ms	868 KB	Output is correct
39	Correct	56 ms	868 KB	Output is correct
40	Correct	41 ms	868 KB	Output is correct
41	Correct	32 ms	868 KB	Output is correct
42	Correct	33 ms	868 KB	Output is correct
43	Correct	39 ms	868 KB	Output is correct
44	Correct	41 ms	868 KB	Output is correct
45	Correct	12 ms	868 KB	Output is correct
46	Correct	33 ms	868 KB	Output is correct
47	Correct	35 ms	868 KB	Output is correct
48	Correct	32 ms	868 KB	Output is correct
49	Correct	32 ms	868 KB	Output is correct
50	Correct	20 ms	868 KB	Output is correct
51	Correct	4 ms	868 KB	Output is correct
52	Correct	31 ms	868 KB	Output is correct
53	Correct	18 ms	868 KB	Output is correct
54	Incorrect	37 ms	868 KB	Output isn't correct
55	Halted	0 ms	0 KB	-

Submission #55288

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 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
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0