oj.uz

답안 #55282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
55282 2018-07-06T21:51:36 Z ksun48 Cultivation (JOI17_cultivation) C++14
35 / 100
 2000 ms 764 KB 
#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;
	}

	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())) );
	}
	for(int i = 0; i < totals.size(); i++){
		if(totals[i] == c+1){
			totals[i] = INF;
		}
	}
	// two pointers: 
	int j = 0;
	multiset<LL> upset;
	multiset<LL> downset;
	multiset<LL> totalset;
	for(int 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++;
		}
		best = min(best, max(*(--upset.end()) + *(--downset.end()), *(--totalset.end()) - 1) + x);
		upset.erase(upset.find(ups[i]));
		downset.erase(downset.find(downs[i]));
		totalset.erase(totalset.find(totals[i]));
	}
}
void tryx(LL x){
	vector<LL> stuff[r + x];
	for(pair<LL,LL> z : seeds){
		for(LL j = 0; j <= x; j++){
			stuff[j + z.first].push_back(z.second);
		}
	}
	vector<LL> up(r+x, 0);
	vector<LL> down(r+x, 0);
	vector<LL> tot(r+x, 0);
	for(LL j = 0; j < r+x; j++){
		vector<LL> grass = stuff[j];
		sort(grass.begin(), grass.end());
		if(grass.size() == 0){
			up[j] = down[j] = tot[j] = INF;
		} else {
			up[j] = grass[0] - 0;
			down[j] = c-1 - grass[grass.size()-1];
			for(LL i = 0; i + 1 < grass.size(); i++){
				tot[j] = max(tot[j], grass[i+1] - grass[i] - 1);
			}
		}
	}
	for(LL j = 0; j <= x; j++){
		LL maxup = 0;
		LL maxdown = 0;
		LL maxtot = 0;
		for(LL i = j; i < j + r; i++){
			maxup = max(maxup, up[i]);
			maxdown = max(maxdown, down[i]);
			maxtot = max(maxtot, tot[i]);
		}
		best = min(best, max(maxup + maxdown, maxtot) + x);
	}
}
int main(){	
	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());
	/*if(r <= 40){
		for(LL j = 0; j <= 2*r; j++){
			tryx(j);
		}
	} else {
	}*/
	for(int i = 0; i < n; i++){
		for(int 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:57:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < totals.size(); i++){
                 ~~^~~~~~~~~~~~~~~
cultivation.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pos.size(); i++){
                 ~~^~~~~~~~~~~~
cultivation.cpp:68: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 'void tryx(LL)':
cultivation.cpp:98:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(LL i = 0; i + 1 < grass.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 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 6 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 532 KB Output is correct
12 Correct 2 ms 560 KB Output is correct
13 Correct 2 ms 560 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 3 ms 560 KB Output is correct
16 Correct 4 ms 560 KB Output is correct

Subtask #2
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 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 6 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 532 KB Output is correct
12 Correct 2 ms 560 KB Output is correct
13 Correct 2 ms 560 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 3 ms 560 KB Output is correct
16 Correct 4 ms 560 KB Output is correct
17 Correct 17 ms 560 KB Output is correct
18 Correct 705 ms 748 KB Output is correct
19 Correct 55 ms 748 KB Output is correct
20 Correct 12 ms 748 KB Output is correct
21 Correct 292 ms 748 KB Output is correct
22 Execution timed out 2079 ms 748 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
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 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 6 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 532 KB Output is correct
12 Correct 2 ms 560 KB Output is correct
13 Correct 2 ms 560 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 3 ms 560 KB Output is correct
16 Correct 4 ms 560 KB Output is correct
17 Correct 17 ms 560 KB Output is correct
18 Correct 705 ms 748 KB Output is correct
19 Correct 55 ms 748 KB Output is correct
20 Correct 12 ms 748 KB Output is correct
21 Correct 292 ms 748 KB Output is correct
22 Execution timed out 2079 ms 748 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 748 KB Output is correct
2 Correct 46 ms 748 KB Output is correct
3 Correct 143 ms 748 KB Output is correct
4 Correct 48 ms 748 KB Output is correct
5 Correct 52 ms 748 KB Output is correct
6 Correct 49 ms 748 KB Output is correct
7 Correct 32 ms 748 KB Output is correct
8 Correct 45 ms 748 KB Output is correct
9 Correct 42 ms 748 KB Output is correct
10 Correct 49 ms 748 KB Output is correct
11 Correct 52 ms 748 KB Output is correct
12 Correct 52 ms 748 KB Output is correct
13 Correct 26 ms 748 KB Output is correct
14 Correct 39 ms 748 KB Output is correct
15 Correct 41 ms 748 KB Output is correct
16 Correct 62 ms 748 KB Output is correct
17 Correct 54 ms 748 KB Output is correct
18 Correct 48 ms 748 KB Output is correct
19 Correct 51 ms 748 KB Output is correct
20 Correct 41 ms 748 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 748 KB Output is correct
2 Correct 46 ms 748 KB Output is correct
3 Correct 143 ms 748 KB Output is correct
4 Correct 48 ms 748 KB Output is correct
5 Correct 52 ms 748 KB Output is correct
6 Correct 49 ms 748 KB Output is correct
7 Correct 32 ms 748 KB Output is correct
8 Correct 45 ms 748 KB Output is correct
9 Correct 42 ms 748 KB Output is correct
10 Correct 49 ms 748 KB Output is correct
11 Correct 52 ms 748 KB Output is correct
12 Correct 52 ms 748 KB Output is correct
13 Correct 26 ms 748 KB Output is correct
14 Correct 39 ms 748 KB Output is correct
15 Correct 41 ms 748 KB Output is correct
16 Correct 62 ms 748 KB Output is correct
17 Correct 54 ms 748 KB Output is correct
18 Correct 48 ms 748 KB Output is correct
19 Correct 51 ms 748 KB Output is correct
20 Correct 41 ms 748 KB Output is correct
21 Execution timed out 2062 ms 764 KB Time limit exceeded
22 Halted 0 ms 0 KB -

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 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 6 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 532 KB Output is correct
12 Correct 2 ms 560 KB Output is correct
13 Correct 2 ms 560 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 3 ms 560 KB Output is correct
16 Correct 4 ms 560 KB Output is correct
17 Correct 17 ms 560 KB Output is correct
18 Correct 705 ms 748 KB Output is correct
19 Correct 55 ms 748 KB Output is correct
20 Correct 12 ms 748 KB Output is correct
21 Correct 292 ms 748 KB Output is correct
22 Execution timed out 2079 ms 748 KB Time limit exceeded
23 Halted 0 ms 0 KB -