oj.uz

Submission #879958

# Submission time Handle Problem Language Result Execution time Memory
879958 2023-11-28T11:55:34 Z eitanelb Cultivation (JOI17_cultivation) C++14
60 / 100
 2000 ms 604 KB 
#include<iostream>
#include<vector>
#include<string>
#include<fstream>
using namespace std;
#include<vector>
#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define x first
#define y second

/*
for down - just real distances from down (optional also for left) -> O(n)
for up - just real distances, or such that together it's distance between two -> O(n)+O(n^2)
after I have up and down - O(n^2) //optional - O(nlogu), with segmentree sparse/coordination, then O(n^4 logU)

then O(n^5), or if r<=40 -> O(40*40*40*n)
which is 60 points
*/
int deb = 0;
int Time_To_Fool_The_Lab(int r, int c, int n, vector<int> X, vector<int> Y) {
	set<int> st_down,st_up, st_sum;
	for (int i = 0; i < n; i++) {
		st_down.insert(X[i] - 1);
	}
	for (int i = 0; i < n; i++) {
		st_up.insert(r - X[i]);
		for (int j = 0; j < n; j++) if (X[i] > X[j]) st_sum.insert(X[i] - X[j]-1);
	}

	vector<pi> v(n); for (int i = 0; i < n; i++) v[i] = { Y[i],X[i] };
	sort(v.begin(), v.end());
	for (int i = 0; i < n; i++) swap(v[i].x, v[i].y);
	int res = 2e9;
	for (int down : st_down) {
		set<int> nst_up = st_up;
		for (int k : st_sum) if(k-down>=0) nst_up.insert(k - down);
		for (int up : nst_up) {
			set<int> intres;
			intres.insert(1); intres.insert(r);
			for (int i = 0; i < n; i++) {
				if (X[i] - down - 1 > 0) intres.insert(X[i] - down - 1);
				if (X[i] + up + 1 <= r) intres.insert(X[i] + up + 1);
			}
			int mn=0;
			int mnla=0, mnfa=0;
			for (int l : intres) {
				int frst = 0;
				int mnf = 0, mnsum = 0;
				for (int i = 0; i < n; i++) {
					if (v[i].x + up < l || v[i].x - down > l) continue;
					if (frst == 0) mnf = v[i].y - 1;
					mnsum = max(mnsum, v[i].y - frst - 1);
					frst = v[i].y;
				}
				int mnl = c - frst;
				mn = max(mn, mnsum);
				mnla = max(mnla, mnl);
				mnfa = max(mnfa, mnf);
			}
			if (mnla == c) continue;
			mn = max(mn, mnla + mnfa);
			if (mn > 2e9 - up - down) continue;
			res = min(res, mn + down + up);
		}
	}
	return res;
}






int run = 1;
int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	if (run == 1) {
		int R, C, N;
		cin >> R >> C >> N;
		vector<int> X(N), Y(N);
		for (int i = 0; i < N; i++) {
			cin >> X[i] >> Y[i];
		}

		int res = Time_To_Fool_The_Lab(R, C, N, X, Y);

		cout << res << endl;
	}
	if (run == 2) {
		vector<int> sizes = {0, 16, 16, 12, 20, 5 };
		string name = "01-01";
		for(int j=5;j<6;j++){
			name[1] = '0' + j;
			for (int i = 1; i < sizes[j]; i++) {
				name[3] = '0' + i / 10; name[4] = '0' + i % 10;
				ifstream fin(name + ".in"), fout(name + ".out");
				int R, C, N;
				fin >> R >> C >> N;
				vector<int> X(N), Y(N);
				for (int i = 0; i < N; i++) {
					fin >> X[i] >> Y[i];
				}

				int nres, res = Time_To_Fool_The_Lab(R, C, N, X, Y);

				fout >> nres;
				if (nres != res) {
					cout << "subtask " << j << "test" << i << endl;
					cout << R << ' ' << C << endl << N << endl;
					for (int i = 0; i < N; i++) {
						cout << X[i] << ' ' << Y[i] << endl;
					}
					cout << res << ' ' << nres << endl;
					break;
				}
			}
		}
	}
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 16 ms 464 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 29 ms 472 KB Output is correct
25 Correct 22 ms 348 KB Output is correct
26 Correct 44 ms 444 KB Output is correct
27 Correct 44 ms 452 KB Output is correct
28 Correct 27 ms 348 KB Output is correct
29 Correct 43 ms 448 KB Output is correct
30 Correct 53 ms 464 KB Output is correct
31 Correct 45 ms 348 KB Output is correct
32 Correct 44 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 16 ms 464 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 29 ms 472 KB Output is correct
25 Correct 22 ms 348 KB Output is correct
26 Correct 44 ms 444 KB Output is correct
27 Correct 44 ms 452 KB Output is correct
28 Correct 27 ms 348 KB Output is correct
29 Correct 43 ms 448 KB Output is correct
30 Correct 53 ms 464 KB Output is correct
31 Correct 45 ms 348 KB Output is correct
32 Correct 44 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 36 ms 448 KB Output is correct
35 Correct 48 ms 348 KB Output is correct
36 Correct 47 ms 472 KB Output is correct
37 Correct 37 ms 452 KB Output is correct
38 Correct 48 ms 348 KB Output is correct
39 Correct 49 ms 348 KB Output is correct
40 Correct 47 ms 348 KB Output is correct
41 Correct 12 ms 348 KB Output is correct
42 Correct 32 ms 600 KB Output is correct
43 Correct 48 ms 348 KB Output is correct
44 Correct 51 ms 348 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 10 ms 492 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 11 ms 484 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 492 KB Output is correct
17 Correct 13 ms 600 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 10 ms 488 KB Output is correct
20 Correct 8 ms 348 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 10 ms 492 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 11 ms 484 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 492 KB Output is correct
17 Correct 13 ms 600 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 10 ms 488 KB Output is correct
20 Correct 8 ms 348 KB Output is correct
21 Execution timed out 2048 ms 604 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 16 ms 464 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 29 ms 472 KB Output is correct
25 Correct 22 ms 348 KB Output is correct
26 Correct 44 ms 444 KB Output is correct
27 Correct 44 ms 452 KB Output is correct
28 Correct 27 ms 348 KB Output is correct
29 Correct 43 ms 448 KB Output is correct
30 Correct 53 ms 464 KB Output is correct
31 Correct 45 ms 348 KB Output is correct
32 Correct 44 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 36 ms 448 KB Output is correct
35 Correct 48 ms 348 KB Output is correct
36 Correct 47 ms 472 KB Output is correct
37 Correct 37 ms 452 KB Output is correct
38 Correct 48 ms 348 KB Output is correct
39 Correct 49 ms 348 KB Output is correct
40 Correct 47 ms 348 KB Output is correct
41 Correct 12 ms 348 KB Output is correct
42 Correct 32 ms 600 KB Output is correct
43 Correct 48 ms 348 KB Output is correct
44 Correct 51 ms 348 KB Output is correct
45 Correct 2 ms 344 KB Output is correct
46 Correct 9 ms 348 KB Output is correct
47 Correct 10 ms 492 KB Output is correct
48 Correct 10 ms 348 KB Output is correct
49 Correct 10 ms 348 KB Output is correct
50 Correct 6 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 5 ms 348 KB Output is correct
53 Correct 7 ms 348 KB Output is correct
54 Correct 11 ms 484 KB Output is correct
55 Correct 12 ms 348 KB Output is correct
56 Correct 10 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 4 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 14 ms 492 KB Output is correct
61 Correct 13 ms 600 KB Output is correct
62 Correct 2 ms 348 KB Output is correct
63 Correct 10 ms 488 KB Output is correct
64 Correct 8 ms 348 KB Output is correct
65 Execution timed out 2048 ms 604 KB Time limit exceeded
66 Halted 0 ms 0 KB -