oj.uz

답안 #434480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434480 2021-06-21T11:01:53 Z dutch Red-blue table (IZhO19_stones) C++17
38 / 100
 44 ms 2032 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, m;
bool g[1000][1000];

int fill(int x){
	for(int i=0; i<n; ++i) fill(g[i], g[i]+m, 0);
	int req = m/2, ver = n/2;
	while(req <= m-req) ++req;
	while(ver <= n-ver) ++ver;
	req -= m-x;
	for(int j=0; j<x; ++j)
		for(int i=0; i<n; ++i)
			g[i][j] = (j < req) ? n-i <= ver : i < ver;

	int curr = x;
	for(int i=0; i<n; ++i){
		int s = 0;
		for(int j=0; j<x; ++j) s += !g[i][j];
		curr += s >= req;
	}
	return curr;
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int T; cin >> T;
	while(T--){
		cin >> n >> m;
		array<int, 2> mx = {-1, -1};
		for(int x=max(0LL, m-4); x<=m; ++x){
			mx = max(mx, {fill(x), x});
		}
		fill(mx[1]);
		cout << mx[0] << '\n';
		for(int i=0; i<n; ++i){
			for(int j=0; j<m; ++j)
				cout << (g[i][j] ? '-' : '+');
			cout << '\n';
		}
	}
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Incorrect 3 ms 332 KB Wrong answer in test 38 5: 40 < 41

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 1348 KB Output is correct
2 Correct 40 ms 1848 KB Output is correct
3 Correct 38 ms 2032 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 44 ms 1340 KB Wrong answer in test 6 6: 8 < 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Incorrect 3 ms 332 KB Wrong answer in test 38 5: 40 < 41