oj.uz

답안 #498547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498547 2021-12-25T12:33:02 Z The_Samurai Red-blue table (IZhO19_stones) C++
27 / 100
 30 ms 1232 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
void solve() {
	int n, m, ans, x = 1;
	
	cin >> n >> m;
	if (n == 1) {
		cout << m << '\n';
		for (int i = 0; i < m; i++) {
			cout << '-';
		}
		cout << '\n';
		return;
	}
	if (n == 2) {
		if (m == 1) {
			cout << "2\n";
			cout << "+\n+\n";
			return;
		}
		cout << m << '\n';
		for (int i = 0; i < m; i++) {
			cout << '-';
		}
		cout << '\n';
		for (int i = 0; i < m; i++) {
			cout << '-';
		}
		cout << '\n';
		return;
	}
	if (n == 3) {
		if (m == 1) {
			cout << "3\n";
			cout << "+\n+\n+\n";
			return;
		}
		cout << m + 1 << '\n';
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < m; j++) {
				cout << '-';
			}
			cout << '\n';
		}
		for (int i = 0; i < m; i++) {
			cout << '+';
		}
		cout << '\n';
		return;
	}
	if (m <= 2) {
		cout << n << '\n';
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << '+';
			}
			cout << '\n';
		}
		return;
	}
	if (m == 3) {
		cout << n + 1 << '\n';
		for (int i = 0; i < n; i++) {
			cout << "++-\n";
		}
		cout << '\n';
		return;
	}
	if (n == 4 && m == 4) {
		cout << "5\n";
		cout << "++++\n----\n----\n----\n";
		return;
	}
	if (n == m) {
		int x = 0;
		if (n % 2 == 0) {
			x = 1;
		}
		cout << n + (n / 2 - x) << '\n';
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m / 2 + m % 2 + x; j++) {
				cout << '+';
			}
			for (int j = m / 2 + m % 2 + x; j < m; j++) {
				cout << '-';
			}
			cout << '\n';
		}
		return;
	}
}
 
int main() {
	int t;
	
	cin >> t;
	while (t--) {
		solve();
	}
}

Compilation message

stones.cpp: In function 'void solve()':
stones.cpp:6:12: warning: unused variable 'ans' [-Wunused-variable]
    6 |  int n, m, ans, x = 1;
      |            ^~~
stones.cpp:6:17: warning: unused variable 'x' [-Wunused-variable]
    6 |  int n, m, ans, x = 1;
      |                 ^

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 204 KB Wrong answer

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 1232 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 204 KB Wrong answer