제출 #1156298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156298		Jawad_Akbar_JJ	Red-blue table (IZhO19_stones)	C++20	100 / 100	128 ms	2224 KiB

stones

#include <iostream>
#include <set>
#include <vector>

using namespace std;
char a[1005][1005];

int solve(int n, int m, int p = 0, int sw = 0){
	set<pair<int,int>> s;
	for (int i=0;i<n;i++)
		s.insert({m, i});

	for (int i=0;i<n;i++)
		for (int j=0;j<m;j++)
			a[i][j] = '+';
	
	int Ans = n, d = n / 2 + 1;
	for (int j=0;j<m;j++){
		vector<pair<int,int>> vec;
		for (int i=0;i<d;i++)
			if (((*rbegin(s)).first - 1) * 2 > m)
				vec.push_back(*rbegin(s)), s.erase(prev(end(s)));
		if (vec.size() < d)
			break;
		Ans++;
		for (auto [nm, i] : vec)
			a[i][j] = '-', s.insert({nm - 1, i});
	}
	if (p == 0) return Ans;

	cout<<Ans<<'\n';
	if (sw){
		for (int j=0;j<m;j++){
			for (int i=0;i<n;i++)
				a[i][j] = '+' + '-' - a[i][j], cout<<a[i][j];
			cout<<'\n';
		}
		return Ans;
	}

	for (int i=0;i<n;i++){
		for (int j=0;j<m;j++)
			cout<<a[i][j];
		cout<<'\n';
	}
	return Ans;
}

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

		if (solve(n, m) > solve(m, n))
			solve(n, m, 1, 0);
		else
			solve(m, n, 1, 1);
	}
}

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