제출 #1131918

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

stones

#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;
		int ans = 0, n1 = n, m1 = m;
		if(n1 < m1) swap(n1,m1);
		int y = (n1*m1)-(n1*((m1/2)+1));
		ans = (n1 + (y/((n1/2)+1)));
		if(n >= m){
			a.assign(n, vector <char> (m,'+'));
			vector <int> vis(n,0), v;
			int x = 0;
			for(int j = 0; j < m; j++){
				int cnt = (n/2 + 1);
				v.clear();
				while(cnt--){
					v.push_back(x);
					// cout << x << " ";
					x++;
					x %= n;
				}
				// cout << '\n';
				bool tr = 0;
				// cout << (int)v.size() << ' ';
				for(int i = 0; i < (int)v.size(); i++){
					vis[v[i]]++;
					// cout << i << " ";
					if(vis[v[i]] > (m-(m/2 + 1))){
						tr = 1;
						break;
					}
				}
				// cout << "\n";
				if(tr == 1){
					break;
				}
				for(int i = 0; i < (int)v.size(); i++){
					a[v[i]][j] = '-';
				}
			}
		}
		else {
			a.assign(n, vector <char> (m,'-'));
			vector <int> vis(m,0), v;
			int x = 0;
			for(int j = 0; j < n; j++){
				int cnt = (m/2 + 1);
				v.clear();
				while(cnt--){
					v.push_back(x);
					x++;
					x %= m;
				}
				bool tr = 0;
				for(auto i : v){
					vis[i]++;
					if(vis[i] > (n-(n/2 + 1))){
						tr = 1;
						break;
					}
				}
				if(tr == 1) break;
				for(auto i : v){
					a[j][i] = '+';
				}
			}
		}
		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: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31