제출 #870646

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

stones

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 1e6+23, lg = 21;
ll Mod = 998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int t, n, m, a[1005][1005];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>t;
	while(t--) {
		cin>>n>>m;
		int cnt=0, x=0, ans=0, nm=0;
		if(n < m) {
			swap(n,m);nm=1;
		}
		for(int i=0; i<n; i++) fill(a[i], a[i]+m, 1);
		ans = n;

		for(int i=0; i<(m-1)/2; i++) {
			for(int j=0; j<n; j++) {
				a[j][x] = -1;
				cnt++;
				if(cnt > n/2+1) {
					x++;
					cnt=0; ans++;
				}
			}
		}

		cout<<ans<<endl;
		if(nm == 0) {
			for(int i=0; i<n; i++) {
				for(int j=0; j<m; j++) {
					cout<<(a[i][j]<0 ? '-' : '+');
				}
				cout<<endl;
			}
		} else {
			for(int i=0; i<m; i++) {
				for(int j=0; j<n; j++) {
					cout<<(a[j][i]>0 ? '-' : '+');
				}
				cout<<endl;
			}
		}
	}

	return 0;
}

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