제출 #1126731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1126731		koukirocks	Red-blue table (IZhO19_stones)	C++20	0 / 100	19 ms	1348 KiB

stones

#include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0);cin.tie(0)

using namespace std;
template<typename T>
using vvector = vector<vector<T>>;

void solve() {
    int n,m;
    cin>>n>>m;
    if (min(n,m)==1) {
        if (n==1) {
            cout<<m<<"\n";
            for (int j=1;j<=m;j++) cout<<"-\n";
        } else {
            cout<<n<<"\n";
            for (int i=1;i<=n;i++) cout<<"+";
            cout<<"\n";
        }
    } else if (min(n,m)==2) {
        if (n==2) {
            cout<<m<<"\n";
            for (int i=1;i<=n;i++) {
                for (int j=1;j<=m;j++) cout<<"-";
               cout<<"\n";
            }
        } else {
            cout<<n<<"\n";
            for (int i=1;i<=n;i++) {
                for (int j=1;j<=m;j++) cout<<"+";
               cout<<"\n";
            }
        }
    } else {
        cout<<(n+m-4+(n&1)+(m&1))<<"\n";
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=m;j++) {
                if (i>m-2+(m&1)) cout<<"+";
                else if (j>n-2+(n&1)) cout<<"-";
                else cout<<((i+j)&1?'-':'+');
            }
            cout<<"\n";
        }
    }
}

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

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