oj.uz

Submission #110488

# Submission time Handle Problem Language Result Execution time Memory
110488 2019-05-10T22:19:05 Z tincamatei Cultivation (JOI17_cultivation) C++14
15 / 100
 2000 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 300;

struct Cell {
	int l, c;
}v[MAX_N];

bool cmp(Cell a, Cell b) {
	return a.l < b.l;
}

struct Range {
	int l, r, dep;
	
	inline bool operator< (const Range &x) const {
		return l < x.l;
	}
};

int dif;
set<Range> ranges;

int expup, expdown, middle;

void insertRange(int l, int r, int dep) {
	set<Range>::iterator it, it2;
	vector<Range> toerase, toadd;

	it = ranges.lower_bound({l, 0, 0});
	if(it != ranges.begin()) {
		it2 = it;
		it2--;

		if(it2->r >= l) {
			if(it2->dep == 0)
				expup = max(expup, dep - it2->dep - 1);
			else
				middle = max(middle, dep - it2->dep - 1);
	
			toerase.push_back(*it2);
			if(it2->l < l)
				toadd.push_back({it2->l, l - 1, it2->dep});
			if(it2->r > r)
				toadd.push_back({r + 1, it2->r, it2->dep});
		}
	}

	while(it != ranges.end() && it->l <= r) {
		toerase.push_back(*it);
		
		if(it->dep == 0)
			expup = max(expup, dep - it->dep - 1);
		else
			middle = max(middle, dep - it->dep - 1);
		
		if(it->r > r)
			toadd.push_back({r + 1, it->r, it->dep});
		it++;
	}

	toadd.push_back({l, r, dep});

	for(auto it: toerase)
		ranges.erase(it);
	for(auto it: toadd)
		ranges.insert(it);
}

long long expand(int n, int r, int c, int expleft, int expright) {
	ranges.clear();
	ranges.insert({1, c, 0});
	
	expup = expdown = middle = 0;
	
	for(int i = 0; i < n; ++i) {
		insertRange(max(1, v[i].c - expleft), min(c, v[i].c + expright), v[i].l);
	}

	for(auto it: ranges)
		if(it.dep == 0) // empty gap
			return 1LL << 35;
		else
			expdown = max(expdown, r - it.dep);

	return expleft + expright + max(middle, expup + expdown);
}

long long getsol(int n, int r, int c) {
	int necleft, necright;
	long long rez = 1LL<<35;

	necleft = necright = 1000000001;

	for(int i = 0; i < n; ++i) {
		necleft = min(necleft, v[i].c - 1);
		necright = min(necright, c - v[i].c);
	}

	for(int expleft = necleft; expleft <= c; ++expleft)
		for(int expright = necright; expright <= c; ++expright)
			rez = min(rez, expand(n, r, c, expleft, expright));

	return rez;
}

int main() {
#ifdef HOME
	FILE *fin = fopen("input.in", "r");
	FILE *fout = fopen("output.out", "w");
#else
	FILE *fin = stdin;
	FILE *fout = stdout;
#endif

	int n, r, c;
	fscanf(fin, "%d%d", &r, &c);
	fscanf(fin, "%d", &n);

	for(int i = 0; i < n; ++i)
		fscanf(fin, "%d%d", &v[i].l, &v[i].c);
	
	sort(v, v + n, cmp);

	fprintf(fout, "%lld", getsol(n, r, c));

	fclose(fin);
	fclose(fout);
	return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:119:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(fin, "%d%d", &r, &c);
  ~~~~~~^~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:120:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(fin, "%d", &n);
  ~~~~~~^~~~~~~~~~~~~~~
cultivation.cpp:123:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(fin, "%d%d", &v[i].l, &v[i].c);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 356 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 356 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 18 ms 384 KB Output is correct
19 Correct 15 ms 384 KB Output is correct
20 Correct 10 ms 256 KB Output is correct
21 Correct 17 ms 256 KB Output is correct
22 Correct 62 ms 256 KB Output is correct
23 Correct 20 ms 256 KB Output is correct
24 Correct 108 ms 376 KB Output is correct
25 Correct 81 ms 364 KB Output is correct
26 Correct 160 ms 364 KB Output is correct
27 Correct 163 ms 364 KB Output is correct
28 Correct 108 ms 376 KB Output is correct
29 Correct 177 ms 368 KB Output is correct
30 Correct 173 ms 360 KB Output is correct
31 Correct 163 ms 376 KB Output is correct
32 Correct 234 ms 368 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 356 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 18 ms 384 KB Output is correct
19 Correct 15 ms 384 KB Output is correct
20 Correct 10 ms 256 KB Output is correct
21 Correct 17 ms 256 KB Output is correct
22 Correct 62 ms 256 KB Output is correct
23 Correct 20 ms 256 KB Output is correct
24 Correct 108 ms 376 KB Output is correct
25 Correct 81 ms 364 KB Output is correct
26 Correct 160 ms 364 KB Output is correct
27 Correct 163 ms 364 KB Output is correct
28 Correct 108 ms 376 KB Output is correct
29 Correct 177 ms 368 KB Output is correct
30 Correct 173 ms 360 KB Output is correct
31 Correct 163 ms 376 KB Output is correct
32 Correct 234 ms 368 KB Output is correct
33 Execution timed out 2044 ms 384 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2059 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2059 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 356 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 18 ms 384 KB Output is correct
19 Correct 15 ms 384 KB Output is correct
20 Correct 10 ms 256 KB Output is correct
21 Correct 17 ms 256 KB Output is correct
22 Correct 62 ms 256 KB Output is correct
23 Correct 20 ms 256 KB Output is correct
24 Correct 108 ms 376 KB Output is correct
25 Correct 81 ms 364 KB Output is correct
26 Correct 160 ms 364 KB Output is correct
27 Correct 163 ms 364 KB Output is correct
28 Correct 108 ms 376 KB Output is correct
29 Correct 177 ms 368 KB Output is correct
30 Correct 173 ms 360 KB Output is correct
31 Correct 163 ms 376 KB Output is correct
32 Correct 234 ms 368 KB Output is correct
33 Execution timed out 2044 ms 384 KB Time limit exceeded
34 Halted 0 ms 0 KB -