oj.uz

Submission #560820

# Submission time Handle Problem Language Result Execution time Memory
560820 2022-05-12T03:37:56 Z amunduzbaev Cultivation (JOI17_cultivation) C++17
0 / 100
 3 ms 596 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int R, C; cin>>R>>C;
	int n; cin>>n;
	vector<int> x(n), y(n), p(n);
	for(int i=0;i<n;i++){
		cin>>x[i]>>y[i];
		p[i] = i;
	}
	
	sort(p.begin(), p.end(), [&](int i, int j){
		return (y[p[i]] < y[p[j]]);
	});
	
	int res = R + C;
	auto check = [&](int a, int c){
		vector<vector<int>> row(R + 1);
		for(auto i : p){
			//~ x[i] - a, x[i] + c 
			int l = max(1ll, x[i] - a), r = min(R, x[i] + c);
			for(int j=l;j<=r;j++) row[j].push_back(y[i]);
		}
		
		int A = 0, B = 0, D = 0;
		for(int i=1;i<=R;i++){
			if(row[i].empty()) return;
			//~ sort(row[i].begin(), row[i].end());
			for(int j=1;j<(int)row[i].size();j++){
				D = max(D, row[i][j] - row[i][j-1] - 1);
			}
			
			A = max(A, row[i][0] - 1);
			B = max(B, C - row[i].back());
		}
		
		res = min(res, a + c + max(A + B, D));
	};
	
	for(int a=0;a<R;a++){
		for(int c=0;a+c<R;c++){
			check(a, c);
		}
	}
	
	cout<<res<<"\n";
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 232 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 232 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 232 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 232 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -