oj.uz

Submission #1093917

# Submission time Handle Problem Language Result Execution time Memory
1093917 2024-09-28T05:06:19 Z Muhammet Red-blue table (IZhO19_stones) C++17
0 / 100
 18 ms 1512 KB 
#include <bits/stdc++.h>

using namespace std;

vector <vector <char>> a;

int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int T;
	cin >> T;
	while(T--){
		int n, m;
		cin >> n >> m;
		a.assign(n, vector <char> (m,'+'));
		if(n+(((m+1)/2)-1) <= m+(n-(n/2)+1)){
			int n1 = (n/2)+1;
			for(int j = 0; j < m; j++){
				for(int i = 0; i < n1; i++){
					a[i][j] = '-';
				}
			}
		}
		else {
			int m1 = ((m+1)/2)-1;
			for(int i = 0; i < n; i++){
				for(int j = 0; j < m1; j++){
					a[i][j] = '-';
				}
			}
		}
		int ans = 0;
		for(int i = 0; i < n; i++){
			int a1 = 0, b1 = 0;
			for(int j = 0; j < m; j++){
				if(a[i][j] == '+') a1++;
				else b1++;
			}
			ans += (a1 > b1);
		}
		for(int j = 0; j < m; j++){
			int a1 = 0, b1 = 0;
			for(int i = 0; i < n; i++){
				if(a[i][j] == '+') a1++;
				else b1++;
			}
			ans += (b1 > a1);
		}
		cout << ans << '\n';
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
				cout << a[i][j];
			}
			cout << '\n';
		}
	}
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer in test 2 1: 1 < 2
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong answer in test 2 1: 1 < 2
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer in test 2 1: 1 < 2
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1512 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1372 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong answer in test 2 1: 1 < 2
3 Halted 0 ms 0 KB -