Submission #868384

#	Time	Username	Problem	Language	Result	Execution time	Memory
868384		KiaRez	Red-blue table (IZhO19_stones)	C++17	27 / 100	18 ms	1392 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 = 3e5+23, lg = 18;
ll Mod = 1e9+7; //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, x;
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>t;
	while(t--) {
		cin>>n>>m;
		if(n<=m) {
			cout<<(n-1)/2+m<<endl;
			int x = (n-1)/2;
			for(int i=1; i<=n-x; i++) {
				for(int j=1; j<=m; j++) {
					cout<<'-';
				}
				cout<<endl;
			}
			for(int i=1; i<=x; i++) {
				for(int j=1; j<=m; j++) {
					cout<<"+";
				}
				cout<<endl;
			}
		} else {
			cout<<(m-1)/2+n<<endl;
			int x = (m-1)/2;
			for(int i=1; i<=n; i++) {
				for(int j=1; j<=x; j++) {
					cout<<'-';
				}
				for(int j=1; j<=m-x; j++){
					cout<<'+';
				}
				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