oj.uz

Submission #995291

# Submission time Handle Problem Language Result Execution time Memory
995291 2024-06-08T19:15:50 Z jcelin Cultivation (JOI17_cultivation) C++14
0 / 100
 1 ms 460 KB 
#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define PB push_back
#define PPB pop_back
#define all(x) (x).begin(), (x).end()

typedef vector<int> vi; 
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;

const int MAXN = 47;
const int logo = 21;
const int off = 1 << logo;
const int trsz = off << 1;
const int mod = 1e9 + 7;
const int inf = mod;

bool mat[MAXN][MAXN], m[MAXN][MAXN];
int n, r, c;


void rig(){
	for(int i=1; i<=r; i++){
		for(int j=c; j; j--) m[i][j] |= m[i][j - 1];
	}
}

void lef(){
	for(int i=1; i<=r; i++){
		for(int j=1; j<=c; j++) m[i][j] |= m[i][j + 1];
	}
	
}

void down(){
	for(int i=r; i; i--){
		for(int j=1; j<=c; j++) m[i][j] |= m[i - 1][j];
	}
}

void up(){
	for(int i=1; i<=r; i++){
		for(int j=1; j<=c; j++) m[i][j] |= m[i + 1][j];
	}
}

bool check(int a, int b, int e, int f){
	for(int i=1; i<=r; i++) for(int j=1; j<=c; j++) m[i][j] = mat[i][j];
	
	for(int i=0; i<a; i++) lef();
	for(int i=0; i<b; i++) rig();
	for(int i=0; i<e; i++) up();
	for(int i=0; i<f; i++) down();
	
	
	int num=0;
	for(int i=1; i<=r; i++){
		for(int j=1; j<=c; j++){
			num += !m[i][j];
		}
	}
	
	return num == 0;
}

void solve(){
	cin >> r >> c >> n;
	for(int i=1; i<=n; i++){
		int x, y;
		cin >> x >> y;
		mat[x][y] = 1; 
	}
	
	int ans = inf;
	for(int i=0; i<=r; i++){
		for(int j=0; j<=r; j++){
			for(int k=0; k<=c; k++){
				for(int l=0; l<=c; l++){
					if(check(i, j, k, l)) ans = min(ans, i + j + k + l);
				}
			}
		}
	}
	cout << ans << "\n";
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int tt = 1;
	//cin >> t;
	while(tt--) solve();
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 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 Incorrect 0 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -