Submission #911037

#	Time	Username	Problem	Language	Result	Execution time	Memory
911037		penguin133	Red-blue table (IZhO19_stones)	C++17	100 / 100	51 ms	2388 KiB

stones

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

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(){
	int n, m; cin >> n >> m;
	int ext = (min(n, m) - 1) / 2 * max(n, m);
	int req = (min(n, m) - 1) / 2;
	int ned = max(n, m) / 2 + 1;
	cout << max(n, m) + ext / ned << '\n';
	int cnt[n+1] = {0}, cnt2[m+1] = {0};
	if(n > m){
		char A[n+1][m+1];
		for(int i=1;i<=m;i++){
			vector <pi> tmp;
			for(int j=1;j<=n;j++)if(cnt[j] < req)tmp.push_back({cnt[j], j});
			sort(tmp.begin(), tmp.end());
			for(int j=1;j<=n;j++)A[j][i] = '+';
			for(int j=0;j<min((int)tmp.size(), ned);j++)A[tmp[j].se][i] = '-', cnt[tmp[j].se]++;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)cout << A[i][j];
			cout << '\n';
		}
	}
	else{
		char A[n+1][m+1];
		for(int i=1;i<=n;i++){
			vector <pi> tmp;
			for(int j=1;j<=m;j++)if(cnt2[j] < req)tmp.push_back({cnt2[j], j});
			sort(tmp.begin(), tmp.end());
			for(int j=1;j<=m;j++)A[i][j] = '-';
			for(int j=0;j<min((int)tmp.size(), ned);j++)A[i][tmp[j].se] = '+', cnt2[tmp[j].se]++;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)cout << A[i][j];
			cout << '\n';
		}
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

stones.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main(){
      | ^~~~

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