제출 #334368

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

stones

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

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl








const int maxn = 1e3+10;


int n, m;
char g[maxn][maxn];

void solve() {
    cin>>n>>m;
    bool flip = false;
    if (n<m) {
	flip = true;
	swap(n,m);
    }

    for (int i=0; i<n; i++) {
	for (int j=0; j<m; j++) {
	    g[i][j] = '+';
	}
    }

    int col = 0;
    int drop = n/2+1;

    for (int j=0; j<(m-1)/2; j++) {
	for (int i=0; i<n; i++) {
	    g[i][col] = '-';
	    if (--drop == 0) {
		col++;
		drop = n/2+1;
	    }
	}
    }

    cout<<n+col<<"\n";
    for (int i=0; i<n; i++) {
	for (int j=0; j<m; j++) {
	    if (flip) g[i][j]=char('+'+'-'-g[i][j]);
	}
    }

    if (flip) {
	swap(n,m);
	for (int i=0; i<n; i++) {
	    for (int j=0; j<m; j++) {
		cout<<g[j][i];
	    }
	    cout<<"\n";
	}
    } else {
	for (int i=0; i<n; i++) {
	    for (int j=0; j<m; j++) {
		cout<<g[i][j];
	    }
	    cout<<"\n";
	}
    }
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    
    int t;
    cin>>t;
    while (t--) {
	solve();
    }
    
    
    return 0;
}

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