제출 #788580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788580		TheOpChicken	Red-blue table (IZhO19_stones)	C++17	0 / 100	43 ms	1300 KiB

stones

#include <bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin >> t;
	while(t--){
		int n, m;
		cin >> n >> m;

		int opt = 0, can = -1;
		for (int i = 0; i <= n; i++){
			int total = (n-i)*m + i*(m - (m/2+1)), need = n/2 + 1;
			int new_can = min(total/need, m);
			if (new_can+i > opt+can) opt = i, can = new_can;
		}

		vector<int> count(m, 0);

		cout << can + opt << endl;
		for (int i = 0; i < n; i++){
			int row_need = m/2 + 1;
			for (int j = 0; j < m; j++){
				if (i >= opt) cout << '-';
				else{
					if (row_need == m - j || count[j] == n/2 + 1){
						cout << '+';
						row_need--;
					}
					else{
						cout << '-';
						count[j]++;
					}
				}
			}

			cout << endl;
		}
	}
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31