Submission #1231068

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231068		lioow	Red-blue table (IZhO19_stones)	C++20	15 / 100	28 ms	1608 KiB

stones

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"YES"<<endl
#define cn cout<<"NO"<<endl
#define ca cout<<"Alice"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p3 pair<int,pair<int,int>>
#define p2
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define lb long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
//const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
	if(e==0) return 1;
	int tmp=expo(b,e/2);
	if(e%2) return mul(tmp,mul(tmp,b));
	else return mul(tmp,tmp);
}
const int maxn=3e5+5;
const int N=1e6;

void solve(){
	int n,m;cin>>n>>m;
	char c[n+2][m+2];
	
	if(n<=2){
		cout<<m<<endl;
		repp(i,1,n){
			repp(i,1,m) cout<<"-";
			cout<<endl;
		}
		cout<<endl;
	} else if(m<=2){
		cout<<n<<endl;
		repp(i,1,n){
			repp(j,1,m) cout<<"+"<<endl;
		}
		cout<<endl;
	} else {
		if(n<=m){
			repp(i,1,n){
				repp(j,1,m) c[i][j]='+';
			}
			int brp=m/2+1;
			int bat=n-(n/2+1);
			vector<int>cnt(m+2,0);
			queue<int>q;
			repp(i,1,m) q.push(i);
			repp(i,1,n){
				int nw=brp;
				while(nw>0 && !q.empty()){
					nw--;
					int x=q.front();q.pop();
					c[i][x]='-';
					cnt[x]++;
					if(cnt[x]<bat){
						q.push(x);
					}
				}
			}
		} else {
			repp(i,1,n) repp(j,1,m) c[i][j]='-';
			int brp=n/2+1;
			int bat=m-(m/2+1);
			vector<int>cnt(n+2,0);
			queue<int>q;
			repp(i,1,n) q.push(i);
			repp(i,1,m){
				int nw=brp;
				while(nw>0 && !q.empty()){
					nw--;
					int x=q.front();q.pop();
					c[x][i]='+';
					cnt[x]++;
					if(cnt[x]<brp){
						q.push(x);
					}
				}
			}
		}
		repp(i,1,n){
			repp(j,1,m){
				if(c[i][j]=='+') c[i][j]='-';
				else c[i][j]='+'; 
			}
		}
		int ans=0;
		repp(i,1,n){
			int ah=0;
			repp(j,1,m){
				if(c[i][j]=='+') ah++;
			}
			if(ah>m-ah) ans++;
		}
		repp(j,1,m){
			int ah=0;
			repp(i,1,n) if(c[i][j]=='-') ah++;
			if(ah>n-ah) ans++;
		}
		cout<<ans<<endl;
		repp(i,1,n){
			repp(j,1,m) cout<<c[i][j];
			cout<<endl;
		}
	}
}

signed main(){
	liow;
	int tc=1;
	cin>>tc;
	while(tc--){
		solve();
	}
}

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